Minimising maximum lateness in a two-machine flowshop

M. Haouari, T. Ladhari

Research output: Contribution to journalJournal articlepeer-review

18 Scopus citations

Abstract

The objective of this paper is to develop a branch and bound algorithm for the problem of minimising maximum lateness in a two-machine flow shop, subject to release dates and time lag constraints. The importance of this NP-hard problem is twofold, it arises as a strong relaxation of the classical permutation flow shop problem, and it generalises several well studied two-machine flow shop problems. Computational experiments performed on a large set of randomly generated problems show that our algorithm can solve to optimality large size instances.

Original languageEnglish
Pages (from-to)1100-1106
Number of pages7
JournalJournal of the Operational Research Society
Volume51
Issue number9
DOIs
StatePublished - Sep 2000
Externally publishedYes

Keywords

  • Branch and bound
  • Lateness
  • Permutation flowshop
  • Scheduling

Fingerprint

Dive into the research topics of 'Minimising maximum lateness in a two-machine flowshop'. Together they form a unique fingerprint.

Cite this