Article contents
A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays
Published online by Cambridge University Press: 07 March 2014
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.
- Type
- Research Article
- Information
- RAIRO - Operations Research , Volume 48 , Issue 2: Isco 2012, guest editors Nelson Maculan, A. Ridha Mahjoub, Eduardo Uchoa , April 2014 , pp. 235 - 254
- Copyright
- © EDP Sciences, ROADEF, SMAI, 2014
References
- 9
- Cited by