On Minimizing the Expected Makespan and Flow Time in Stochastic Flow Shops with Blocking

Recommendations

Minimizing variation in stochastic flow shop
Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops
Stochastic flowshop no-wait scheduling
A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length
Stochastically minimizing the makespan in two-machine flow shops without blocking

Cited in

(19)

Minimizing variation in stochastic flow shop
Stochastically minimizing the makespan in two-machine flow shops without blocking
Markovian analysis for performance evaluation and scheduling in m machine stochastic flow-shop with buffers of any capacity
Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines
A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures
Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops
Trading off between makespan and customer responsiveness in flow shop sequencing
On heuristic solutions for the stochastic flowshop scheduling problem
On Optimal Permutation Scheduling in Stochastic Proportionate Flowshops
scientific article; zbMATH DE number 5525237 (Why is no real title available?)
Stochastic flowshop no-wait scheduling
On Pinedo's Conjecture for Scheduling in a Stochastic Flow Shop
The stochastic flowshop makespan. Part II. Some general results for the unbuffered case
Minimizing Cycle Time in a Blocking Flowshop
Stochastic Minimization of the Makespan in Flow Shops with Identical Machines and Buffers of Arbitrary Size
A new algorithm for minimizing makespan, C_max, in blocking flow-shop problem through slowing down the operations
An upper bound for the inter-exit time of two jobs in an \(m\)-machine flow shop
A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length
Two-machine stochastic flow shops with blocking and the traveling salesman problem

This page was built for publication: On Minimizing the Expected Makespan and Flow Time in Stochastic Flow Shops with Blocking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745604)