We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays.
- Authors
Moukrim, Aziz; Rebaine, Djamal; Serairi, Mehdi
- 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.
- Subjects
BRANCH &; bound algorithms; FLOW shops; MACHINE learning; TIME delay systems; PRODUCTION scheduling; COMPUTER simulation
- Publication
RAIRO -- Operations Research, 2014, Vol 48, Issue 2, p235
- ISSN
0399-0559
- Publication type
Article
- DOI
10.1051/ro/2014004