Counterexamples to optimal permutation schedules for certain flow shop problems

DOI10.1002/NAV.3800280215MaRDI QIDQ3912339zbMATH OpenOpenAlexWikidataFDO

Authors Milton L. Smith, C. R. Woollam, S. S. Panwalkar

Publication date 1981

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

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

zbMATH Keywords

counterexamplesflow shop problemsminimal makespan permutation sequencenonnegative processing timesnx3 flow shopnxm flow shopoptimal permutation schedules

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited in

(4)

• On three-machine flow shops with random job processing times
• Non-bottleneck machines in three-machine flow shops
• Lot sizing in a no-wait flow shop
• Proportionate flow shop: new complexity results and models with due date assignment

This page was built for publication: Counterexamples to optimal permutation schedules for certain flow shop problems

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