Minimizing maximum lateness in a flow shop subject to release dates

DOI10.1057/PALGRAVE.JORS.2602092zbMath1152.90444OpenAlexW2037760454MaRDI QIDQ5292803

Mohamed Haouari, Talel Ladhari

Publication date: 25 June 2007

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

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602092

zbMATH Keywords

release datespermutation flow shopdelivery times

Mathematics Subject Classification ID

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

Related Items (1)

An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times

This page was built for publication: Minimizing maximum lateness in a flow shop subject to release dates