Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

被引:314
作者
Ribas, Imma [1 ]
Leisten, Rainer [2 ]
Framinan, Jose M. [3 ]
机构
[1] Univ Politecn Cataluna, ETSEIB, Lab Org Ind, DOE, E-08028 Barcelona, Spain
[2] Univ Duisburg Essen, Fac Engn, D-47048 Duisburg, Germany
[3] Univ Seville, Sch Engn, E-41092 Seville, Spain
关键词
Hybrid flow shop; TABU SEARCH ALGORITHM; COMPLETION-TIME MINIMIZATION; GENETIC ALGORITHM; 2-STAGE FLOWSHOP; PARALLEL MACHINES; MULTIPLE PROCESSORS; SEQUENCING RULES; UNIFORM MACHINES; SETUP TIMES; HEURISTIC ALGORITHMS;
D O I
10.1016/j.cor.2009.11.001
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper, an extensive review of recently published papers on hybrid flow shop (HFS) scheduling problems is presented. The papers are classified first according to the HFS characteristics and production limitations considered in the respective papers. This represents a new approach to the classification of papers in the HFS environment. Second, the papers have been classified according to the solution approach proposed. These two classification categories give a comprehensive overview on the state of the art of the problem and can guide the reader with respect to future research work. (C) 2009 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1439 / 1454
页数:16
相关论文
共 166 条
[31]  
Dauzere-Peres S., 1994, CONNECTED NEIGHBORHO
[32]   Flowshop scheduling with identical jobs and uniform parallel machines [J].
Dessouky, MM ;
Dessouky, MI ;
Verma, SK .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 109 (03) :620-631
[33]   Preemptive Hybrid Flowshop Scheduling problem of interval orders [J].
Djellab, H ;
Djellab, K .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 137 (01) :37-49
[34]   A new approach to solve hybrid flow shop scheduling problems by artificial immune system [J].
Engin, O ;
Döyen, A .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2004, 20 (06) :1083-1095
[35]   Production and delivery scheduling problem with time windows [J].
Garcia, JM ;
Lozano, S .
COMPUTERS & INDUSTRIAL ENGINEERING, 2005, 48 (04) :733-742
[36]  
Graham R. L., 1979, Discrete Optimisation, P287
[37]   Generic simulation model for hybrid flow-shop [J].
Grangeon, N ;
Tanguy, A ;
Tchernev, N .
COMPUTERS & INDUSTRIAL ENGINEERING, 1999, 37 (1-2) :207-210
[38]   A computational study of heuristics for two-stage flexible flowshops [J].
Guinet, A ;
Solomon, MM ;
Kedia, PK ;
Dussauchoy, A .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1996, 34 (05) :1399-1415
[39]   Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time [J].
Guinet, AGP ;
Solomon, MM .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1996, 34 (06) :1643-1654
[40]   Total completion time minimization in a computer system with a server and two parallel processors [J].
Guirchoun, S ;
Martineau, P ;
Billaut, JC .
COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (03) :599-611