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 条

[21] Minimizing the number of late jobs on a single machine under due date uncertainty
Aissi, Hassene
Aloulou, Mohamed Ali
Kovalyov, Mikhail Y.
[J]. JOURNAL OF SCHEDULING, 2011, 14 (04) : 351 - 360
[22] Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times
Drwal, Maciej
Jozefczyk, Jerzy
[J]. ANNALS OF OPERATIONS RESEARCH, 2020, 284 (01) : 263 - 282
[23] On minimizing the weighted number of late jobs in unit execution time open-shops
Baptiste, P
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 149 (02) : 344 - 354
[24] Minimizing the Total Weighted Waiting Times and Instability in a Rescheduling Problem with Dynamic Jobs Weight
Tighazoui, Ayoub
Sauvey, Christophe
Sauer, Nathalie
[J]. APPLIED SCIENCES-BASEL, 2021, 11 (15):
[25] MINIMIZING WEIGHTED NUMBER OF TARDY JOBS AND WEIGHTED EARLINESS TARDINESS PENALTIES ABOUT A COMMON DUE DATE
LEE, CY
DANUSAPUTRO, SL
LIN, CS
[J]. COMPUTERS & OPERATIONS RESEARCH, 1991, 18 (04) : 379 - 389
[26] MINIMIZING THE NUMBER OF LATE JOBS ON UNRELATED MACHINES
DU, JZ
LEUNG, JYT
[J]. OPERATIONS RESEARCH LETTERS, 1991, 10 (03) : 153 - 158
[27] Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
Soroush, H. M.
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (01) : 266 - 287
[28] Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
Aydilek, Asiye
Aydilek, Harun
Allahverdi, Ali
[J]. APPLIED MATHEMATICAL MODELLING, 2017, 45 : 982 - 996
[29] A genetic algorithm for minimizing the weighted number of tardy jobs
Desprez, Caroline
Chu, Chengbin
Chu, Feng
[J]. 2006 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS, 2006, : 1271 - 1276
[30] Minimizing the weighted number of tardy jobs on a single machine
M'Hallah, R
Bulfin, RL
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 145 (01) : 45 - 56

← 1 2 3 4 5 →