Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function

DOI10.1016/0377-2217(93)E0318-RzbMath0927.90044OpenAlexW2070699284MaRDI QIDQ1129910

John Mittenthal, Ali Allahverdi

Publication date: 20 December 1999

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

Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0318-r

zbMATH Keywords

makespanstochastic schedulingrandom breakdownstwo-machine flowshop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times ⋮ Two-machine ordered flowshop scheduling under random breakdowns ⋮ Two-machine flowshop minimum-length scheduling problem with random and bounded processing times ⋮ Risk measure of job shop scheduling with random machine breakdowns ⋮ Scheduling in stochastic flowshops with independent setup, processing and removal times ⋮ A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty ⋮ Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown ⋮ Stochastic single machine scheduling subject to machines breakdowns with quadratic early-tardy penalties for the preemptive-repeat model ⋮ A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures ⋮ Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time ⋮ Stochastically minimizing total flowtime in flowshops with no waiting space ⋮ On stochastic machine scheduling with general distributional assumptions ⋮ Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness ⋮ Johnson's problem with stochastic processing times and optimal service level

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• nx2 flowshop sequencing problem with random processing times
• Minimizing total expected costs in the two-machine, stochastic flow shop
• Optimal two- and three-stage production schedules with setup times included
• Stochastically minimizing the makespan in flow shops
• On Johnson's Two-Machine Flow Shop with Random Processing Times
• Schedulingn nonoverlapping jobs and two stochastic jobs in a flow shop
• Minimizing the Expected Makespan in Stochastic Flow Shops
• Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties
• Single-machine scheduling subject to stochastic breakdowns
• Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop