No-wait flow shop scheduling with large lot sizes

DOI10.1023/A:1018942709213zbMath0889.90082OpenAlexW16805603MaRDI QIDQ1374453

Alessandro Agnetis

Publication date: 22 June 1998

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018942709213

zbMATH Keywords

heuristicsno-wait flow shop\(\varepsilon\)-approximate algorithmno-wait scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Ordinal algorithms for parallel machine scheduling ⋮ Multiplicity and complexity issues in contemporary production scheduling ⋮ On the high multiplicity traveling salesman problem ⋮ Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots ⋮ Bin packing using semi-ordinal data ⋮ A review of TSP based approaches for flowshop scheduling

This page was built for publication: No-wait flow shop scheduling with large lot sizes