Minimising Maximum Lateness in a Two-Machine Flowshop

DOI10.2307/254231zbMath1107.90354OpenAlexW4248977542MaRDI QIDQ3156650

Talel Ladhari, Mohamed Haouari

Publication date: 10 January 2005

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/254231

zbMATH Keywords

schedulinglatenessbranch and boundpermutation flowshop

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems ⋮ Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem ⋮ A computational study of the permutation flow shop problem based on a tight lower bound

This page was built for publication: Minimising Maximum Lateness in a Two-Machine Flowshop