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

DOI10.1287/OPRE.25.1.70MaRDI QIDQ4158783zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(6)

• Production scheduling with applications in the printing industry
• 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
• scientific article; zbMATH DE number 1437089 (Why is no real title available?)
• On no-wait and no-idle flow shops with makespan criterion

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4158783)