Branch and bound algorithm for solving blocking flowshop scheduling problem with total completion time

Author

Toumi, Salah ; Jarboui, Bassem ; Eddaly, Mansour ; Rebai, Abdelwaheb

Author_Institution

Res. Lab. MODELIS, Fac. of Econ. Sci. & Manage. of Sfax, Sfax, Tunisia

fYear

2013

fDate

6-8 May 2013

Firstpage

746

Lastpage

749

Abstract

This paper addresses to the scheduling of a permutation flowshop scheduling problem with blocking constraints to minimize the total completion time with a branch and bound algorithm. New machine based lower bound was developed for the problem. The experimental results on this criterion have shown the efficiency of the proposed algorithm both in terms of solutions quality and time requirements.

Keywords

flow shop scheduling; 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 completion time minimization; Economics; Electronic mail; Job shop scheduling; Linear programming; Routing; Search problems;

fLanguage

English

Publisher

ieee

Conference_Titel

Control, Decision and Information Technologies (CoDIT), 2013 International Conference on

Conference_Location

Hammamet

Print_ISBN

978-1-4673-5547-6

Type

conf

DOI

10.1109/CoDIT.2013.6689635

Filename

6689635

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=658058