Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem

DOI10.1287/opre.25.1.70zbMath0379.90051OpenAlexW1983190495MaRDI QIDQ4158783

Wlodzimierz Szwarc

Publication date: 1977

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

Full work available at URL: https://doi.org/10.1287/opre.25.1.70

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Unnamed Item ⋮ On no-wait and no-idle flow shops with makespan criterion ⋮ Two-stage flowshop scheduling with a common second-stage machine ⋮ Applications of max-plus algebra to flow shop scheduling problems ⋮ Sequency on two and three machines with setup, processing and removal times separated ⋮ Production scheduling with applications in the printing industry

This page was built for publication: Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem