# A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays

* Corresponding author
Abstract : In this paper we consider the problem of scheduling, on a two-machine flowshop, a set of unit-time operations subject to time delays with respect to the makespan. This problem is known to be \hbox{${\cal NP}$}-hard in the strong sense. We propose an algorithm based on a branch and bound enumeration scheme. This algorithm includes the implementation of new lower and upper bound procedures, and dominance rules. A computer simulation to measure the performance of the algorithm is provided for a wide range of test problems.
Keywords :
Document type :
Journal articles

https://hal.archives-ouvertes.fr/hal-01062809
Contributor : Mehdi Serairi Connect in order to contact the contributor
Submitted on : Wednesday, September 10, 2014 - 3:42:26 PM
Last modification on : Tuesday, November 16, 2021 - 4:31:10 AM

### Citation

Aziz Moukrim, Djamal Rebaine, Mehdi Serairi. A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays. RAIRO - Operations Research, EDP Sciences, 2014, 48 (02), pp.235-254. ⟨10.1051/ro/2014004⟩. ⟨hal-01062809⟩

Record views