Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T13:57:08.611Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  07 March 2014

Aziz Moukrim
Affiliation:
Universitéde Technologie de Compiègne, Heudiasyc, CNRS UMR 7253 Rue Roger Couttolenc CS 60319 60203 Compiègne Cedex, France.. aziz.moukrim@hds.utc.fr; mehdi.serairi@hds.utc.fr
Djamal Rebaine
Affiliation:
Département d’Informatique et Mathématique, Université du Québec à Chicoutimi, Saguenay, Canada G7H 2B1.; DjamalRebaine@uqac.ca
Mehdi Serairi
Affiliation:
Universitéde Technologie de Compiègne, Heudiasyc, CNRS UMR 7253 Rue Roger Couttolenc CS 60319 60203 Compiègne Cedex, France.. aziz.moukrim@hds.utc.fr; mehdi.serairi@hds.utc.fr

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper we consider the problem of scheduling, on a two-machine flowshop, a set ofunit-time operations subject to time delays with respect to the makespan. This problem isknown to be \hbox{${\cal NP}$}𝒩𝒫-hard in the strong sense. We propose an algorithm basedon a branch and bound enumeration scheme. This algorithm includes the implementation ofnew lower and upper bound procedures, and dominance rules. A computer simulation tomeasure the performance of the algorithm is provided for a wide range of testproblems.

Information

Type
Research Article
Copyright
© EDP Sciences, ROADEF, SMAI, 2014