On three-machine flow shops with random job processing times
From MaRDI portal
Recommendations
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops
- Three-machine flowshop stochastic scheduling to minimize distribution of schedule length
- Stochastically minimizing the makespan in two-machine flow shops without blocking
- Stochastic flowshop no-wait scheduling
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 605729 (Why is no real title available?)
- A concise survey of efficiently solvable special cases of the permutation flow-shop problem
- Counterexamples to optimal permutation schedules for certain flow shop problems
- Mathematical aspects of the 3 × n job-shop sequencing problem
- Minimizing the Expected Makespan in Stochastic Flow Shops
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- Optimal two- and three-stage production schedules with set-up time included
- Rearrangement, Majorization and Stochastic Scheduling
- Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
- Stochastically minimizing the makespan in two-machine flow shops without blocking
- Technical Note—Johnson's Three-Machine Flow-Shop Conjecture
- The Complexity of Flowshop and Jobshop Scheduling
- Three-machine flowshop stochastic scheduling to minimize distribution of schedule length
- nx2 flowshop sequencing problem with random processing times
Cited in
(13)- Inequalities for stochastic flow shops and job shops
- scientific article; zbMATH DE number 3843477 (Why is no real title available?)
- A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs
- Three-machine flowshop stochastic scheduling to minimize distribution of schedule length
- Flowshop scheduling problem to minimize total completion time with random and bounded processing times
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- scientific article; zbMATH DE number 5856053 (Why is no real title available?)
- Markovian analysis for performance evaluation and scheduling in m machine stochastic flow-shop with buffers of any capacity
- A contribution to the stochastic flow shop scheduling problem.
- Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
- A Note on Stochastic Shop Models in Which Jobs have the Same Processing Requirements on Each Machine
- Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops
- Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times
This page was built for publication: On three-machine flow shops with random job processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1580990)
