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

被引：0
|
作者：
Peter Brucker
Svetlana A. Kravchenko
机构：
[1] Universität Osnabrück,Fachbereich Mathematik/Informatik
[2] United Institute of Informatics Problems,undefined
来源：
Journal of Scheduling | 2008年 / 11卷
关键词：
Scheduling; Parallel machines; Linear programming;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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(n3log 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
页数：8
相关论文
共 50 条
  • [1] Scheduling jobs with equal processing times and time windows on identical parallel machines
    Brucker, Peter
    Kravchenko, Svetlana A.
    [J]. JOURNAL OF SCHEDULING, 2008, 11 (04) : 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 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
  • [5] Scheduling equal-length jobs on identical parallel machines
    Baptiste, P
    [J]. DISCRETE APPLIED MATHEMATICS, 2000, 103 (1-3) : 21 - 32
  • [6] 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
  • [7] 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
  • [8] SCHEDULING JOBS WITH EXPONENTIAL PROCESSING TIMES ON PARALLEL MACHINES
    LEHTONEN, T
    [J]. JOURNAL OF APPLIED PROBABILITY, 1988, 25 (04) : 752 - 762
  • [9] 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
  • [10] Scheduling jobs with sizes and delivery times on identical parallel batch machines
    Li, Yijie
    Li, Shuguang
    [J]. THEORETICAL COMPUTER SCIENCE, 2020, 841 : 1 - 9
12345