The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times

DOI10.1504/IJOR.2007.012457zbMath1154.90477OpenAlexW2126106523WikidataQ57717978 ScholiaQ57717978MaRDI QIDQ1000165

J. Martínez

Publication date: 5 February 2009

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

Full work available at URL: https://doi.org/10.1504/ijor.2007.012457

zbMATH Keywords

heuristicsoperational researchsetup timesdominance relation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks, A survey of scheduling problems with setup times or costs