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 条
[81]   A case study in a two-stage hybrid flow shop with setup time and dedicated machines [J].
Lin, HT ;
Liao, CJ .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2003, 86 (02) :133-143
[82]   Hybrid flow shop scheduling: A survey [J].
Linn, R ;
Zhang, W .
COMPUTERS & INDUSTRIAL ENGINEERING, 1999, 37 (1-2) :57-61
[83]   Scheduling flexible flow shops with sequence-dependent setup effects [J].
Liu, CY ;
Chang, SC .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 2000, 16 (04) :408-419
[84]   Sequence-dependent group scheduling problems in flexible flow shops [J].
Logendran, R ;
deSzoeke, P ;
Barnard, F .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 102 (01) :66-86
[85]   Group scheduling in flexible flow shops [J].
Logendran, R ;
Carson, S ;
Hanson, E .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2005, 96 (02) :143-155
[86]   Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines [J].
Low, C .
COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (08) :2013-2025
[87]   A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines [J].
Low, Chinyao ;
Hsu, Chou-Jung ;
Su, Chwen-Tzeng .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (03) :845-853
[88]   Hybrid branch and bound method with genetic algorithm for flexible flowshop scheduling problem [J].
Morita, H ;
Shio, N .
JSME INTERNATIONAL JOURNAL SERIES C-MECHANICAL SYSTEMS MACHINE ELEMENTS AND MANUFACTURING, 2005, 48 (01) :46-52
[89]   A branch-and-bound algorithm for the hybrid flowshop [J].
Moursli, O ;
Pochet, Y .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2000, 64 (1-3) :113-125
[90]   A COMPARISON OF SEQUENCING RULES FOR A 2-STAGE HYBRID FLOWSHOP [J].
NARASIMHAN, SL ;
MANGIAMELI, PM .
DECISION SCIENCES, 1987, 18 (02) :250-265