Title :
Branch and bound algorithm for solving blocking flowshop scheduling problem with total tardiness
Author :
Toumi, Salah ; Jarboui, Bassem ; Eddaly, Mansour ; Rebai, Abdelwaheb
Author_Institution :
Res. Lab. MODELIS, Fac. of Econ. Sci. & Manage. of Sfax, Sfax, Tunisia
Abstract :
This paper addresses to the scheduling of a permutation flowshop scheduling problem with blocking constraints to minimize the total tardiness with a branch and bound algorithm. New machine based lower bound was developed for the problem. The experimental results have shown the efficiency of the proposed algorithm both in terms of solutions quality and time requirements.
Keywords :
flow shop scheduling; minimisation; tree searching; blocking constraints; blocking flowshop scheduling problem; branch and bound algorithm; machine based lower bound; permutation flowshop scheduling problem; solutions quality; time requirements; total tardiness minimisation; Approximation algorithms; Economics; Electronic mail; Equations; Processor scheduling; Scheduling; Search problems;
Conference_Titel :
Control, Decision and Information Technologies (CoDIT), 2013 International Conference on
Conference_Location :
Hammamet
Print_ISBN :
978-1-4673-5547-6
DOI :
10.1109/CoDIT.2013.6689637
