A Note on Stochastic Shop Models in Which Jobs have the Same Processing Requirements on Each Machine
From MaRDI portal
Publication:3754428
DOI10.1287/mnsc.31.7.840zbMath0617.90045OpenAlexW2133873014MaRDI QIDQ3754428
Publication date: 1985
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.31.7.840
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (6)
Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival ⋮ Proportionate flow shop with controllable processing times ⋮ On the optimality of static policy in stochastic open shop ⋮ Flow shops with reentry: reversibility properties and makespan optimal schedules ⋮ The three-machine proportionate flow shop problem with unequal machine speeds ⋮ Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops
This page was built for publication: A Note on Stochastic Shop Models in Which Jobs have the Same Processing Requirements on Each Machine
