The “Largest Variance First” Policy in Some Stochastic Scheduling Problems
From MaRDI portal
Publication:3786262
DOI10.1287/opre.35.6.884zbMath0643.90036OpenAlexW2034321481MaRDI QIDQ3786262
Gideon Weiss, Michael L. Pinedo
Publication date: 1987
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.35.6.884
parallel machinesstochastic schedulingexpected makespanexpected flowtimerandom amounts of processing
Related Items (7)
Job-shop resource scheduling via simulating random operations ⋮ A case for on-machine load balancing ⋮ On the relation between complexity and uncertainty ⋮ Approximation results in parallel machines stochastic scheduling ⋮ Dynamic scheduling in manufacturing systems using Brownian approximations ⋮ On index policies for stochastic minsum scheduling ⋮ Effect of load, processing time and due date variation on the effectiveness of scheduling rules
This page was built for publication: The “Largest Variance First” Policy in Some Stochastic Scheduling Problems
