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 条

[1] MINIMIZING WEIGHTED COMPLETION TIMES WITH DEADLINES
POSNER, ME
[J]. OPERATIONS RESEARCH, 1985, 33 (03) : 562 - 574
[2] Minimizing the Number of Tardy Jobs with Gammadistributed Processing Times
Li, Haohao
[J]. PROCEEDINGS OF THE 2013 THE INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND SOFTWARE ENGINEERING (ICAISE 2013), 2013, 37 : 161 - 165
[3] Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
Lin, BMT
Cheng, TCE
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 116 (01) : 183 - 193
[4] Minimizing the number of machines for scheduling jobs with equal processing times
Kravchenko, Svetlana A.
Werner, Frank
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 199 (02) : 595 - 600
[5] Minimizing Tardy Jobs in a Single Machine Scheduling Problem with Fuzzy Processing Times and Due Dates
谢源
谢剑英
[J]. Journal of Donghua University(English Edition), 2005, (04) : 5 - 8
[6] Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
Gordon, VS
Werner, F
Yanushkevich, OA
[J]. RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 2001, 35 (01): : 71 - 83
[7] Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times
Gerstl, Enrique
Mosheiov, Gur
[J]. OPTIMIZATION LETTERS, 2024,
[8] Minimizing the number of tardy jobs with stochastically-ordered processing times
Dan Trietsch
Kenneth R. Baker
[J]. Journal of Scheduling, 2008, 11 : 71 - 73
[9] Minimizing the number of tardy jobs with stochastically-ordered processing times
Trietsch, Dan
Baker, Kenneth R.
[J]. JOURNAL OF SCHEDULING, 2008, 11 (01) : 71 - 73
[10] Minimizing total weighted flow time of a set of jobs with interval processing times
Sotskov, Yu. N.
Egorova, N. G.
Lai, T-C
[J]. MATHEMATICAL AND COMPUTER MODELLING, 2009, 50 (3-4) : 556 - 573

← 1 2 3 4 5 →