Technical Note—Johnson's Three-Machine Flow-Shop Conjecture

DOI10.1287/OPRE.24.3.578MaRDI QIDQ4103318zbMATH OpenOpenAlexWikidataFDO

Authors Fennell Burns, John Rooker

Publication date 1976

Published in Operations Research (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)

Cited in

(4)

• A new constructive heuristic for the flowshop scheduling problem
• On three-machine flow shops with random job processing times
• Non-bottleneck machines in three-machine flow shops
• Applications of max-plus algebra to flow shop scheduling problems

This page was built for publication: Technical Note—Johnson's Three-Machine Flow-Shop Conjecture

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