Parallel machine problems with equal processing times: a survey

被引：45
|
作者：
Kravchenko, Svetlana A. [2 ]
Werner, Frank [1 ]
机构：
[1] Univ Magdeburg, Fak Math, D-39106 Magdeburg, Germany
[2] United Inst Informat Problems, Minsk 220012, BELARUS
来源：
JOURNAL OF SCHEDULING | 2011年 / 14卷 / 05期
关键词：
Parallel machine problem; Equal processing times; Non-preemptive problems; Preemptive problems; Polynomial algorithms; NP-hard problems; UNIT-LENGTH JOBS; SCHEDULING PROBLEMS; COMPLEXITY; ALGORITHM; RELEASE; NUMBER;
D O I：
10.1007/s10951-011-0231-3
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring an identical execution time. All jobs have to be processed on a set of parallel machines. Preemptions can be either allowed or forbidden. The aim is to construct a feasible schedule such that a given criterion is minimized. In this paper, we survey existing approaches for the problem class considered.
引用
收藏
页码：435 / 444
页数：10
相关论文
共 50 条
  • [11] Minimization of maximum lateness with equal processing times for single machine
    Lazarev, Alexander A.
    Arkhipov, Dmitry I.
    IFAC PAPERSONLINE, 2015, 48 (03): : 806 - 809
  • [12] Parallel machine scheduling with time dependent processing times
    Chen, ZL
    DISCRETE APPLIED MATHEMATICS, 1996, 70 (01) : 81 - 93
  • [13] Parallel machine scheduling models with fuzzy processing times
    Peng, J
    Liu, BD
    INFORMATION SCIENCES, 2004, 166 (1-4) : 49 - 66
  • [14] Parallel-machine scheduling with controllable processing times
    Cheng, TCE
    Chen, ZL
    Li, CL
    IIE TRANSACTIONS, 1996, 28 (02) : 177 - 180
  • [15] Parallel machine scheduling with linearly decreasing processing times
    School of Mathematics and Systems Science, Shenyang Normal Univ., Shenyang 110034, China
    Xi Tong Cheng Yu Dian Zi Ji Shu/Syst Eng Electron, 2008, 7 (1281-1285):
  • [16] Parallel Machine Problems with a Single Server and Release Times
    SHI LingSHI Ling
    Geo-Spatial Information Science, 2005, (02) : 148 - 151
  • [17] Parallel Machine Problems with a Single Server and Release Times
    Ling, Shi
    GEO-SPATIAL INFORMATION SCIENCE, 2005, 8 (02) : 148 - 151
  • [18] Scheduling jobs with equal processing times subject to machine eligibility constraints
    Lee, Kangbok
    Leung, Joseph Y. -T.
    Pinedo, Michael L.
    JOURNAL OF SCHEDULING, 2011, 14 (01) : 27 - 38
  • [19] Scheduling jobs with equal processing times subject to machine eligibility constraints
    Kangbok Lee
    Joseph Y.-T. Leung
    Michael L. Pinedo
    Journal of Scheduling, 2011, 14 : 27 - 38
  • [20] Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties
    Jianping Li
    Runtao Xie
    Junran Lichen
    Guojun Hu
    Pengxiang Pan
    Ping Yang
    Journal of Combinatorial Optimization, 2023, 45
12345