Scheduling in stochastic flowshops with independent setup, processing and removal times
From MaRDI portal
Publication:1366705
DOI10.1016/S0305-0548(97)00006-3zbMath0893.90084OpenAlexW2068337065MaRDI QIDQ1366705
Publication date: 17 September 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00006-3
Related Items (10)
Two-machine flowshop minimum-length scheduling problem with random and bounded processing times ⋮ A bicriteria flowshop scheduling problem with setup times ⋮ Total flowtime in no-wait flowshops with separated setup times. ⋮ A two-machine flowshop scheduling problem with a separated maintenance constraint ⋮ A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures ⋮ Scheduling under machine breakdown in a continuous process industry ⋮ A new heuristic and dominance relations for no-wait flowshops with setups ⋮ Stochastically minimizing total flowtime in flowshops with no waiting space ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Two-machine flowshop group scheduling problem
Cites Work
- Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
- Two-machine ordered flowshop scheduling under random breakdowns
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
- Stochastically minimizing the makespan in flow shops
- Sequency on two and three machines with setup, processing and removal times separated
- 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
- Sequencing n jobs on two machines with setup, processing and removal times separated
- Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns
- Stochastic Minimization of the Makespan in Flow Shops with Identical Machines and Buffers of Arbitrary Size
- Single-machine scheduling subject to stochastic breakdowns
This page was built for publication: Scheduling in stochastic flowshops with independent setup, processing and removal times