Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops

DOI10.1017/S0269964800004563zbMath1093.90531OpenAlexW2039064745MaRDI QIDQ5485388

Georgia-Ann Klutke, Tian-Shyug Lee

Publication date: 30 August 2006

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964800004563

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• On the optimality of static policy in stochastic open shop
• Open shop scheduling with machine dependent processing times
• Optimal two- and three-stage production schedules with setup times included
• Stochastically minimizing the makespan in flow shops
• A note on the two machine job shop with exponential processing times
• On Johnson's Two-Machine Flow Shop with Random Processing Times
• Minimizing the Expected Makespan in Stochastic Flow Shops
• Minimizing expected makespan in stochastic open shops
• Open Shop Scheduling to Minimize Finish Time

This page was built for publication: Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops