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 条

[31] Minimizing the weighted number of tardy jobs on parallel processors
M'Hallah, R
Bulfin, RL
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 160 (02) : 471 - 484
[32] SCHEDULING WITH BATCHING - MINIMIZING THE WEIGHTED NUMBER OF TARDY JOBS
HOCHBAUM, DS
LANDY, D
[J]. OPERATIONS RESEARCH LETTERS, 1994, 16 (02) : 79 - 86
[33] Scheduling jobs with stochastic processing times or due dates on a server to minimize the number of tardy jobs
Soroush, H. M.
[J]. 2015 3RD INTERNATIONAL CONFERENCE ON MANUFACTURING ENGINEERING AND TECHNOLOGY FOR MANUFACTURING GROWTH (METMG 2015), 2015, : 16 - 21
[34] A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
Shabtay, Dvir
Steiner, George
[J]. JOURNAL OF SCHEDULING, 2011, 14 (05) : 455 - 469
[35] A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
Dvir Shabtay
George Steiner
[J]. Journal of Scheduling, 2011, 14 : 455 - 469
[36] Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
George Steiner
Rui Zhang
[J]. Annals of Operations Research, 2011, 191 : 171 - 181
[37] Minimizing weighted number of early and tardy jobs with a common due window involving location penalty
Yeung, WK
Oguz, C
Cheng, TCE
[J]. ANNALS OF OPERATIONS RESEARCH, 2001, 108 (1-4) : 33 - 54
[38] Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
Steiner, George
Zhang, Rui
[J]. ANNALS OF OPERATIONS RESEARCH, 2011, 191 (01) : 171 - 181
[39] Minimizing Weighted Number of Early and Tardy Jobs with a Common Due Window Involving Location Penalty
W.K. Yeung
Ceyda Oğuz
T.C. Edwin Cheng
[J]. Annals of Operations Research, 2001, 108 : 33 - 54
[40] Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times
Mosheiov, Gur
Oron, Daniel
[J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (07) : 1601 - 1604

← 1 2 3 4 5 →