On three-machine flow shops with random job processing times
From MaRDI portal
Publication:1580990
DOI10.1016/S0377-2217(99)00222-2zbMath0952.90016MaRDI QIDQ1580990
Publication date: 14 September 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (4)
Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates ⋮ Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity ⋮ A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs ⋮ A contribution to the stochastic flow shop scheduling problem.
Cites Work
- Unnamed Item
- Unnamed Item
- nx2 flowshop sequencing problem with random processing times
- Stochastically minimizing the makespan in two-machine flow shops without blocking
- Optimal two- and three-stage production schedules with setup times included
- Rearrangement, Majorization and Stochastic Scheduling
- A concise survey of efficiently solvable special cases of the permutation flow-shop problem
- Three-machine flowshop stochastic scheduling to minimize distribution of schedule length
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- Counterexamples to optimal permutation schedules for certain flow shop problems
- Minimizing the Expected Makespan in Stochastic Flow Shops
- Technical Note—Johnson's Three-Machine Flow-Shop Conjecture
- The Complexity of Flowshop and Jobshop Scheduling
- Mathematical aspects of the 3 × n job-shop sequencing problem
- Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
This page was built for publication: On three-machine flow shops with random job processing times
