The problem of minimizing weighted number of late jobs to meet strict deadlines and due processing times

被引：0
|
作者：
Gordon, VS [1 ]
Werner, F
Yanushkevich, OA
机构：
[1] Belorussian Natl Acad Sci, Inst Tech Cybernet, Minsk, BELARUS
[2] Univ Magdeburg, D-39106 Magdeburg, Germany
来源：
DOKLADY AKADEMII NAUK BELARUSI | 2000年 / 44卷 / 01期
关键词：
D O I：
暂无
中图分类号：
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
Single machine scheduling for n jobs with nested release and due date intervals is considered. Necessary and sufficient conditions for the existence of a due date feasible schedule are obtained which may be verified in O(n) time. An O(n log n) algorithm for minimizing the weighted number of late jobs with given deadlines for the subset of jobs and oppositely ordered weights and processing times is proposed.
引用
收藏
页码：39 / 42
页数：4
相关论文
共 50 条
12345