New heuristic for scheduling re-entrant production lines

被引:2
作者
Yalaoui, Naim [1 ,2 ]
Camara, Mema [1 ]
Amodeo, Lionel [1 ]
Yalaoui, Farouk [1 ]
Mahdi, Halim [2 ]
机构
[1] Univ Technol Troyes, Inst Charles Delauney, LOSI, FRE CNRS 2848, 12 Rue Marie Curie, F-10012 Troyes, France
[2] Caillau Co, F-92130 Issy Les Moulineaux, France
来源
CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3 | 2009年
关键词
Scheduling; re-entrant system; hybrid flow shop; heuristics; MINIMIZING MAKESPAN; SEQUENCING PROBLEM; JOB SHOPS; ALGORITHM; MINIMIZATION; FLOWSHOP;
D O I
10.1109/ICCIE.2009.5223776
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Today, the scheduling production problem attracts the academic and industrial researchers. This scheduling problem occurs in different types of workshop. However, our study is on an hybrid flow shop scheduling problem type, where the stages are in series and each one is composed of some identical parallel machines. In this hybrid flow shop, orders must be arranged. Each order is composed of several batches with the same due date and can be treated by any machine. Those of some orders must visit twice the stages, and then some flows are re-entrant. Several heuristics are proposed to solve this scheduling problem; the objective is to minimize the total tardiness of the orders. In these algorithms, the list-scheduling method is used. The numerical tests are applied on randomly generated problems. The results show that the proposed algorithm dominates the existing ones.
引用
收藏
页码:199 / +
页数:3
相关论文
共 21 条
[1]   A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation [J].
Bertel, S ;
Billaut, JC .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 159 (03) :651-662
[2]   Minimizing makespan in reentrant flow-shops using hybrid tabu search [J].
Chen, Jen-Shiang ;
Pan, Jason Chao-Hsien ;
Wu, Chien-Kuang .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2007, 34 (3-4) :353-361
[3]  
CHOI SW, 2005, INT J PROD RES, P2149
[4]  
CHOI SW, INT J ADV MANUF TECH, DOI DOI 10.1007/S00170-008-1656-5
[5]  
Demirkol E., 2000, Journal of Scheduling, V3, P155, DOI 10.1002/(SICI)1099-1425(200005/06)3:3<155::AID-JOS39>3.0.CO
[6]  
2-E
[7]   A heuristic algorithm for two-machine re-entrant shop scheduling [J].
Drobouchevitch, IG ;
Strusevich, VA .
ANNALS OF OPERATIONS RESEARCH, 1999, 86 (0) :417-439
[8]   Reentrant lines scheduling and Lorenz dominance: a comparative study [J].
Dugardin, F. ;
Yalaoui, F. ;
Amodeo, L. .
COMPUTATIONAL INTELLIGENCE IN DECISION AND CONTROL, 2008, 1 :707-712
[9]  
DUGARDIN F, 2008, EUROPEAN J IN PRESS
[10]  
Dugardin F., 2007, ADV ROBOTIC SYSTEM J, P273