On the undiscounted tax problem with precedence constraints
Keyword(s):
A single machine is available to process a collection of jobs J, each of which evolves stochastically under processing. Jobs incur costs while awaiting the machine at a rate which is state dependent and processing must respect a set of precedence constraints Γ. Index policies are optimal in a variety of scenarios. The indices concerned are characterised as values of restart problems with the average reward criterion. This characterisation yields a range of efficient approaches to their computation. Index-based suboptimality bounds are derived for general processing policies. These bounds enable us to develop sensitivity analyses and to evaluate scheduling heuristics.
2011 ◽
Vol 42
(12)
◽
pp. 2085-2096
Keyword(s):
1980 ◽
Vol 25
(1)
◽
pp. 70-81
◽
Keyword(s):
2001 ◽
Vol 53
(1)
◽
pp. 1-24
◽
Keyword(s):
1999 ◽
Vol 30
(7-8)
◽
pp. 7-20
Keyword(s):
1991 ◽
Vol 7
(1)
◽
pp. 6-16
◽
Keyword(s):
1987 ◽
Vol 26
◽
pp. 123-140
◽