Two-machine flow shop scheduling problems with no-wait jobs

Authors:
J. -L. Bouquard;J. -C. Billaut;M. A. Kubzin;V. A. Strusevich
Affiliations:
Laboratoire d'Informatique, Université de Tours, France;Laboratoire d'Informatique, Université de Tours, France;School of Computing and Mathematical Sciences, University of Greenwich, London SE10 9LS, UK;School of Computing and Mathematical Sciences, University of Greenwich, London SE10 9LS, UK
Venue:
Operations Research Letters
Year:
2005

Citing 1
Cited 0

Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we provide a fairly complete complexity classification of various versions of the two-machine permutation flow shop scheduling problem to minimize the makespan in which some of the jobs have to be processed with no-wait in process. For some version, we offer a fully polynomial-time approximation scheme and a 43-approximation algorithm.