An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns

DOI10.1016/S0377-2217(02)00077-2zbMath1001.90031MaRDI QIDQ1598772

Joaquín Sicilia, David Alcaide, Andrés Rodriguez-Gonzalez

Publication date: 28 May 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

scheduling; stochastic scheduling; expected makespan; flow-shops

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90B36: Stochastic scheduling theory in operations research

Related Items

Minimizing makespan for scheduling stochastic job shop with random breakdown, A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures

Cites Work

• Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities
• Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs
• Optimal two- and three-stage production schedules with setup times included
• A note on the two machine job shop with exponential processing times
• A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair
• Inequalities for stochastic flow shops and job shops
• Minimizing expected makespan in stochastic open shops
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item