Scheduling jobs with equal processing times and time windows on identical parallel machines

被引：31

作者：

Brucker, Peter ^{[2
]}

Kravchenko, Svetlana A. ^{[1
]}

机构：

[1] United Inst Informat Problems, Minsk 220012, BELARUS

[2] Univ Osnabruck, Fachbereich Math Informat, D-49069 Osnabruck, Germany

来源：

JOURNAL OF SCHEDULING | 2008年 / 11卷 / 04期

关键词：

scheduling; parallel machines; linear programming;

D O I：

10.1007/s10951-008-0063-y

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

We present a linear programming approach to the problem of scheduling equal processing time jobs with release dates and deadlines on identical parallel machines. The known algorithm with complexity O(n(3) log log n) of B. Simons schedules all the jobs while minimizing both the maximum completion time and the mean flow time. Our approach permits also to minimize the weighted sum of completion times and total tardiness in polynomial time for the problems without deadlines. The complexity status of these problems was open.

引用

页码：229 / 237

页数：9

共 50 条

[1] Scheduling jobs with equal processing times and time windows on identical parallel machines
Peter Brucker
Svetlana A. Kravchenko
[J]. Journal of Scheduling, 2008, 11 : 229 - 237
[2] Scheduling jobs with equal processing times and a single server on parallel identical machines
Zhang, An
Wang, Hongjun
Chen, Yong
Chen, Guangting
[J]. DISCRETE APPLIED MATHEMATICS, 2016, 213 : 196 - 206
[3] Scheduling identical jobs on uniform parallel machines with random processing times
Dessouky, MI
Marcellus, RL
Zhang, L
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1998, 35 (1-2) : 109 - 112
[4] Scheduling identical jobs on uniform parallel machines with random processing times
Dessouky, Mohamed I.
Marcellus, Richard L.
Zhang, Li
[J]. Computers and Industrial Engineering, 1998, 35 (1-2): : 109 - 112
[5] Scheduling Jobs with Stochastic Processing Time on Parallel Identical Machines
Stec, Richard
Novak, Antonin
Sucha, Premysl
Hanzalek, Zdenek
[J]. PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 5628 - 5634
[6] Scheduling equal-length jobs on identical parallel machines
Baptiste, P
[J]. DISCRETE APPLIED MATHEMATICS, 2000, 103 (1-3) : 21 - 32
[7] Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan
Wang, Jun-Qiang
Leung, Joseph Y. -T.
[J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2014, 156 : 325 - 331
[8] SCHEDULING JOBS WITHIN TIME WINDOWS ON IDENTICAL PARALLEL MACHINES - NEW MODEL AND ALGORITHMS
GABREL, V
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 83 (02) : 320 - 329
[9] SCHEDULING JOBS WITH EXPONENTIAL PROCESSING TIMES ON PARALLEL MACHINES
LEHTONEN, T
[J]. JOURNAL OF APPLIED PROBABILITY, 1988, 25 (04) : 752 - 762
[10] 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

← 1 2 3 4 5 →