Minimizing expected makespan in stochastic open shops

DOI10.2307/1427030MaRDI QIDQ3953548zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

exponential distributionminimization of makespann tasksopen shopoptimal scheduling policytwo machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited in

(8)

• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
• On the optimality of static policy in stochastic open shop
• An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns
• 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
• Fifty years of research in scheduling -- theory and applications
• A note on the flow time and the number of tardy jobs in stochastic open shops

This page was built for publication: Minimizing expected makespan in stochastic open shops

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