DocumentCode
3152867
Title
Two-machine no-wait flowshop scheduling with availability constraints and release dates
Author
Ben Chihaoui, F. ; Dridi, Najoua ; Hadj-Alouane, Atidel B.
Author_Institution
OASIS, Ecole Nat. d´´Ing. de Tunis, Tunis, Tunisia
fYear
2009
fDate
6-9 July 2009
Firstpage
170
Lastpage
175
Abstract
The two-machine no-wait flowshop problem with availability constraints and release dates is studied in this paper. We work under the assumption that each machine is unavailable during a time interval. The intervals overlap and are known in advance. Two heuristics based on Gilmore-Gomory and Cheng and Liu algorithms are proposed for this problem. An experimental study is conducted to evaluate the performance of the proposed heuristics.
Keywords
flow shop scheduling; minimisation; Gilmore-Gomory-Cheng-Liu algorithm; availability constraint; makespan minimization; release date; two-machine no-wait flowshop scheduling; Availability; Buffer storage; Continuous production; Job shop scheduling; Manufacturing systems; Modems; Parallel machines; Polynomials; Processor scheduling; Robot sensing systems; flow shop; machine availability constraint; no wait; release dates;
fLanguage
English
Publisher
ieee
Conference_Titel
Computers & Industrial Engineering, 2009. CIE 2009. International Conference on
Conference_Location
Troyes
Print_ISBN
978-1-4244-4135-8
Electronic_ISBN
978-1-4244-4136-5
Type
conf
DOI
10.1109/ICCIE.2009.5223750
Filename
5223750
Link To Document