Minimizing expected makespan in stochastic open shops
From MaRDI portal
Publication:3953548
DOI10.2307/1427030zbMath0491.90052OpenAlexW2026102135MaRDI QIDQ3953548
Sheldon M. Ross, Michael L. Pinedo
Publication date: 1982
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1427030
exponential distributionopen shopminimization of makespantwo machinesoptimal scheduling policyn tasks
Related Items
Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival ⋮ On the optimality of static policy in stochastic open shop ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures ⋮ Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops ⋮ A note on the flow time and the number of tardy jobs in stochastic open shops ⋮ An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns
This page was built for publication: Minimizing expected makespan in stochastic open shops