A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays - Archive ouverte HAL Access content directly
Journal Articles RAIRO - Operations Research Year : 2014

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

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.

Dates and versions

hal-01062809 , version 1 (10-09-2014)

Identifiers

Cite

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, 2014, 48 (02), pp.235-254. ⟨10.1051/ro/2014004⟩. ⟨hal-01062809⟩
86 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More