Pages that link to "Item:Q5485388"
From MaRDI portal
The following pages link to Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops (Q5485388):
Displaying 13 items.
- Two-machine stochastic flow shops with blocking and the traveling salesman problem (Q880520) (← links)
- Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival (Q1112720) (← links)
- On the optimality of static policy in stochastic open shop (Q1186946) (← links)
- Stochastically minimizing the makespan in two-machine flow shops without blocking (Q1806913) (← links)
- Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage (Q2248262) (← links)
- A cyclical search for the two machine flow shop and open shop to minimise finishing time (Q2356124) (← links)
- A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures (Q2475628) (← links)
- A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation (Q2572847) (← links)
- Stochastically minimizing the makespan in flow shops (Q3220336) (← links)
- On Pinedo's Conjecture for Scheduling in a Stochastic Flow Shop (Q3703564) (← links)
- A Note on Stochastic Shop Models in Which Jobs have the Same Processing Requirements on Each Machine (Q3754428) (← links)
- Schedulingn nonoverlapping jobs and two stochastic jobs in a flow shop (Q3754431) (← links)
- Stochastic scheduling for a two-machine open shop (Q4364879) (← links)
