Pages that link to "Item:Q3220336"
From MaRDI portal
The following pages link to Stochastically minimizing the makespan in flow shops (Q3220336):
Displaying 19 items.
- A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length (Q796444) (← links)
- Infinitesimal perturbation analysis and optimization for make-to-stock manufacturing systems based on stochastic fluid models (Q853683) (← links)
- Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function (Q1129910) (← links)
- Stochastically minimizing total penalty costs in stochastic flow shops (Q1184369) (← links)
- Minimizing variation in stochastic flow shop (Q1306384) (← links)
- Scheduling in stochastic flowshops with independent setup, processing and removal times (Q1366705) (← links)
- A contribution to the stochastic flow shop scheduling problem. (Q1410626) (← links)
- Stochastically minimizing total flowtime in flowshops with no waiting space (Q1806645) (← links)
- Stochastically minimizing the makespan in two-machine flow shops without blocking (Q1806913) (← links)
- A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures (Q2475628) (← links)
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness (Q2563893) (← links)
- Minimizing makespan and throughput times at Aalsmeer flower auction (Q3545655) (← links)
- On Pinedo's Conjecture for Scheduling in a Stochastic Flow Shop (Q3703564) (← links)
- Three-machine flowshop stochastic scheduling to minimize distribution of schedule length (Q3712110) (← 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)
- A note on minimizing the expected makespan in flowshops subject to breakdowns (Q4859580) (← links)
- Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops (Q5485388) (← links)
- Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem (Q6106559) (← links)
