DocumentCode
614748
Title
New lower bounds for the blocking flowshop scheduling problem to minimize the total completion time criterion
Author
Toumi, Salah ; Jarboui, Bassem ; Eddaly, Mansour ; Rebai, Abdelwaheb
Author_Institution
Lab.: MODILS, FSEG, Sfax, Tunisia
fYear
2013
fDate
28-30 April 2013
Firstpage
1
Lastpage
5
Abstract
The paper presents an exact approach for a permutation flowshop scheduling problem with blocking constraint. The objective is to minimize the total completion time of jobs. The solution method is a branch and bound procedure where lower bounds based on problem characteristics are derived. Whithin an experimental performance analysis, this approach is evaluated.
Keywords
constraint theory; flow shop scheduling; minimisation; tree searching; blocking constraint; branch and bound procedure; permutation flowshop scheduling problem; total completion time criterion minimization; Electronic mail; Job shop scheduling; Linear programming; Processor scheduling; Routing; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Modeling, Simulation and Applied Optimization (ICMSAO), 2013 5th International Conference on
Conference_Location
Hammamet
Print_ISBN
978-1-4673-5812-5
Type
conf
DOI
10.1109/ICMSAO.2013.6552573
Filename
6552573
Link To Document