A survey of scheduling problems with setup times or costs

被引:889
作者
Allahverdi, Ali [1 ]
Ng, C. T. [2 ]
Cheng, T. C. E. [2 ]
Kovalyov, Mikhail Y. [3 ,4 ]
机构
[1] Kuwait Univ, Dept Ind & Management Syst Engn, Safat, Kuwait
[2] Hong Kong Polytech Univ, Dept Logist, Kowloon, Hong Kong, Peoples R China
[3] Natl Acad Sci Belarus, United Inst Informat Problems, Minsk, BELARUS
[4] Belarusian State Univ, Fac Econ, Minsk 220050, BELARUS
关键词
scheduling; setup time; setup cost; survey (review); single machine; parallel machines; flow shop; job shop; open shop;
D O I
10.1016/j.ejor.2006.06.060
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by [Allahverdi, A., Gupta, J.N.D., Aldowaisan, T., 1999. A review of scheduling research involving setup considerations. OMEGA The International Journal of Management Sciences 27, 219-239], who reviewed the literature since the mid-1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setup times (costs) with an average of more than 40 papers per year being added to the literature. The objective of this paper is to provide an extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers. Given that so many papers have appeared in a short time, there are cases where different researchers addressed the same problem independently, and sometimes by using even the same technique, e.g., genetic algorithm. Throughout the paper we identify such areas where independently developed techniques need to be compared. The paper classifies scheduling problems into those with batching and non-batching considerations, and with sequence-independent and sequence-dependent setup times. It further categorizes the literature according to shop environments, including single-machine, parallel machines, flow shop, no-wait flow shop, flexible flow shop, job shop, open shop, and others. (C) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码:985 / 1032
页数:48
相关论文
共 316 条
[1]   Scheduling two parallel machines with a single server: the general case [J].
Abdekhodaee, AH ;
Wirth, A ;
Gan, HS .
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (04) :994-1009
[2]   Equal processing and equal setup time cases of scheduling parallel machines with a single server [J].
Abdekhodaee, AH ;
Wirth, A ;
Gan, HS .
COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (11) :1867-1889
[3]   Scheduling parallel machines with a single server: some solvable cases and heuristics [J].
Abdekhodaee, AH ;
Wirth, A .
COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (03) :295-315
[4]   A heuristic approach to batching and scheduling a single machine to minimize setup costs [J].
Agnetis, A ;
Alfieri, A ;
Nicosia, G .
COMPUTERS & INDUSTRIAL ENGINEERING, 2004, 46 (04) :793-802
[5]   An agent-based approach for scheduling multiple machines [J].
Akkiraju, R ;
Keskinocak, P ;
Murthy, S ;
Wu, F .
APPLIED INTELLIGENCE, 2001, 14 (02) :135-144
[6]   Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm [J].
Al-Anzi, F. S. ;
Allahverdi, A. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2006, 44 (22) :4701-4712
[7]  
Al-Anzi F. S., 2001, International Journal of Parallel and Distributed Systems & Networks, V4, P94
[8]   A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times [J].
Al-Anzi, Fawaz S. ;
Allahverdi, Ali .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 182 (01) :80-94
[9]  
ALANZI F, 2005, J MATH MODELLING ALG, V4, P435, DOI DOI 10.1007/S10852-005-9027-9
[10]   Cyclic scheduling heuristics for a re-entrant job shop manufacturing environment [J].
Aldakhilallah, KA ;
Ramesh, R .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2001, 39 (12) :2635-2657