On the optimality of static policy in stochastic open shop

DOI10.1016/0167-6377(91)90069-2zbMath0744.90043OpenAlexW1968730515WikidataQ113443621 ScholiaQ113443621MaRDI QIDQ1186946

Esther Frostig

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0167-6377(91)90069-2

zbMATH Keywords

makespanopen shopstochastic schedulingtwo machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic systems in control theory (general) (93E03)

Related Items (2)

Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops

Cites Work

• Stochastic Scheduling with Release Dates and Due Dates
• A Note on Stochastic Shop Models in Which Jobs have the Same Processing Requirements on Each Machine
• Minimizing expected makespan in stochastic open shops
• Open Shop Scheduling to Minimize Finish Time

This page was built for publication: On the optimality of static policy in stochastic open shop