Pages that link to "Item:Q3745604"
From MaRDI portal
The following pages link to On Minimizing the Expected Makespan and Flow Time in Stochastic Flow Shops with Blocking (Q3745604):
Displaying 12 items.
- On heuristic solutions for the stochastic flowshop scheduling problem (Q319784) (← links)
- A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length (Q796444) (← links)
- Two-machine stochastic flow shops with blocking and the traveling salesman problem (Q880520) (← links)
- Minimizing variation in stochastic flow shop (Q1306384) (← links)
- Stochastically minimizing the makespan in two-machine flow shops without blocking (Q1806913) (← links)
- Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity (Q1887781) (← links)
- Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines (Q2305020) (← links)
- A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures (Q2475628) (← links)
- (Q3610539) (← links)
- On Pinedo's Conjecture for Scheduling in a Stochastic Flow Shop (Q3703564) (← links)
- Minimizing Cycle Time in a Blocking Flowshop (Q4530646) (← links)
- A new algorithm for minimizing makespan, <i>C</i><sub>max</sub>, in blocking flow-shop problem through slowing down the operations (Q5292811) (← links)
