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 条
12345