Volume 48, Number 2, April-June 2014Isco 2012, guest editors Nelson Maculan, A. Ridha Mahjoub, Eduardo Uchoa
|Page(s)||235 - 254|
|Published online||07 March 2014|
A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays
1 Universitéde Technologie de Compiègne, Heudiasyc, CNRS UMR 7253 Rue Roger Couttolenc CS 60319 60203 Compiègne Cedex, France.
2 Département d’Informatique et Mathématique, Université du Québec à Chicoutimi, Saguenay, Canada G7H 2B1.
Accepted: 28 November 2013
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 -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.
Mathematics Subject Classification: 9008
Key words: Branch and bound / dominance rule / flowshop / lower and upper bounds / time delays
© EDP Sciences, ROADEF, SMAI, 2014
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.