The clustered flow-shop problem

DOI10.1007/BF01920301zbMath0652.90061OpenAlexW2087678360MaRDI QIDQ3798472

Wlodzimierz Szwarc

Publication date: 1988

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01920301

zbMATH Keywords

approximate solutionsufficient optimality conditionsminimal completion timeclustered flow-shop problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Clustered flow shop models

Cites Work

• Unnamed Item
• Optimal two- and three-stage production schedules with setup times included
• Permutation flow-shop theory revisited
• TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS

This page was built for publication: The clustered flow-shop problem