A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures

DOI10.1007/s10696-006-8819-1zbMath1172.90412OpenAlexW2059394253MaRDI QIDQ2475628

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

Publication date: 11 March 2008

Published in: International Journal of Flexible Manufacturing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10696-006-8819-1

zbMATH Keywords

Expected makespanRandom breakdownsRandom repair timesStochastic open-shop scheduling

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Related Items

Uncertain flexible flow shop scheduling problem subject to breakdowns ⋮ Risk measure of job shop scheduling with random machine breakdowns ⋮ Minimizing makespan for scheduling stochastic job shop with random breakdown ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Group shops scheduling with makespan criterion subject to random release dates and processing times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
• Two-machine ordered flowshop scheduling under random breakdowns
• Scheduling in stochastic flowshops with independent setup, processing and removal times
• A tabu search algorithm for the open shop problem
• An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns
• Stochastically minimizing total flowtime in flowshops with no waiting space
• Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities
• Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
• Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs
• 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
• Minimizing Maximum Lateness in a Two-Machine Open Shop
• Open Shop Scheduling to Minimize Finish Time
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns

This page was built for publication: A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures