Special cases of the flow-shop problem

DOI10.1002/NAV.3800240312zbMath0377.90053OpenAlexW2067332416MaRDI QIDQ4156113

Wlodzimierz Szwarc

Publication date: 1977

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800240312

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Sequencing with restrictions in processing times ⋮ Minimizing Mean Completion Time for Special Flowshop Problems ⋮ Clustered flow shop models ⋮ Production scheduling with applications in the printing industry ⋮ Flowshop/no-idle scheduling to minimize total elapsed time

This page was built for publication: Special cases of the flow-shop problem