On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines
1995 ◽
Vol 27
(03)
◽
pp. 821-839
◽
Keyword(s):
We consider scheduling a batch of jobs with stochastic processing times on single or parallel machines, with the objective of minimizing the expected holding costs. Preemption of jobs is allowed, and the holding costs of preempted jobs may depend on the stage of completion. We provide a new proof of the optimality of a Gittins priority rule for the single machine and use the same proof to show that the Gittins priority rule is nearly optimal for parallel machines.
2014 ◽
Vol 668-669
◽
pp. 1641-1645
1986 ◽
Vol 23
(03)
◽
pp. 841-847
◽
Keyword(s):
2017 ◽
Vol 79
◽
pp. 23-36
◽
2021 ◽
Vol 290
(2)
◽
pp. 453-468
Keyword(s):
2014 ◽
Vol 46
◽
pp. 101-117
◽