Minimizing the number of machines for scheduling jobs with equal processing times

被引：20
|
作者：
Kravchenko, Svetlana A. [2 ]
Werner, Frank [1 ]
机构：
[1] Otto Von Guericke Univ, Fak Math, D-39106 Magdeburg, Germany
[2] United Inst Informat Problems, Minsk 220012, BELARUS
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2009年 / 199卷 / 02期
关键词：
Parallel machine scheduling; Linear programming;
D O I：
10.1016/j.ejor.2008.10.008
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, we consider a parallel machine environment when all jobs have the same processing time and arbitrary release dates and deadlines of the jobs are given. We suppose that the available number of machines, which can be used simultaneously, may vary over time. The aim is to construct a feasible schedule in such a way that the maximal number of simultaneously used machines is minimal. We give a polynomial algorithm for this problem. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：595 / 600
页数：6
相关论文
共 50 条
  • [1] 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
  • [2] 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
  • [3] 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
  • [4] Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
    Alexander A. Lazarev
    Dmitry I. Arkhipov
    Frank Werner
    [J]. Optimization Letters, 2017, 11 : 165 - 177
  • [5] Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
    Lazarev, Alexander A.
    Arkhipov, Dmitry I.
    Werner, Frank
    [J]. OPTIMIZATION LETTERS, 2017, 11 (01) : 165 - 177
  • [6] 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
  • [7] SCHEDULING JOBS WITH EXPONENTIAL PROCESSING TIMES ON PARALLEL MACHINES
    LEHTONEN, T
    [J]. JOURNAL OF APPLIED PROBABILITY, 1988, 25 (04) : 752 - 762
  • [8] Routing Open Shop with Two Nodes, Unit Processing Times and Equal Number of Jobs and Machines
    Golovachev, Mikhail
    Pyatkin, Artem V.
    [J]. MATHEMATICAL OPTIMIZATION THEORY AND OPERATIONS RESEARCH, 2019, 11548 : 264 - 276
  • [9] Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
    Baptiste, Philippe
    [J]. Journal of Scheduling, 2 (06): : 245 - 252
  • [10] Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
    Leung, Joseph Y. -T.
    Ng, C. T.
    Cheng, T. C. Edwin
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 187 (03) : 1090 - 1099
12345