Minimising maximum lateness in a two-machine flowshop

M Haouari () and T Ladhari
Additional contact information
M Haouari: Ecole Polytechnique de Tunisie, La Marsa
T Ladhari: Institut Supérieur de Gestion de Tunis, Le Bardo

Journal of the Operational Research Society, 2000, vol. 51, issue 9, 1100-1106

Abstract: 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 flowshop, 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 flowshop problem, and it generalises several well studied two-machine flowshop problems. Computational experiments performed on a large set of randomly generated problems show that our algorithm can solve to optimality large size instances.

Keywords: scheduling; permutation flowshop; lateness; branch and bound (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2600065 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:51:y:2000:i:9:d:10.1057_palgrave.jors.2600065

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2600065

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().