Stochastic scheduling with priority classes

Mathematics of Operations Research

Volumn 23, Issue 1, 1998, Pages 119-144

  Garbe, R ^a   Glazebrook, K D ^b  

^a Bremerhaven University of Applied Sciences   (Germany)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

Branching bandit; Conservation laws; Gittins index; Performance space; Suboptimality bounds

Indexed keywords

CONSTRAINT THEORY; SCHEDULING;

GITTINS INDICES; INDEX-BASED SUBOPTIMALITY BOUNDS;

STOCHASTIC CONTROL SYSTEMS;

EID: 0031999142     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.23.1.119     Document Type: Article

References (20)

1. Bertsimas, D., J. Niño-Mora (1996). Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to indexable systems. Math. Oper. Res. 21 257-306.
2. Bhattacharya, P. B., L. Georgiadis, P. Tsoucas (1992). Extended polymatroids: properties and optimization. Proceedings of Conference on Integer Programming and Combinatorial Optimization, Carnegie Mellon University, Mathematical Programming Society, 298-315.
3. _, _, _(1995). Problems of adaptive optimization in multiclass M/GI/1 queues with Bernoulli feedback. Math. Oper. Res. 20 355-380.
4. Federgruen, A., H. Groenevelt (1988a). Characterization and optimization of achievable performance in general queuing systems. Oper. Res. 36 733-741.
5. _, _(1988b). M/G/c queuing systems with multiple customer classes: characterization and control of achievable performance under non-preemptive priority rules. Management Sci. 34 1121-1138.
6. Gelenbe, E., I. Mitrani (1980). Analysis and Synthesis of Computer Systems, Academic Press, New York.
7. Gittins, J. C. (1989). Bandit Process and Dynamic Allocation Indices, John Wiley, Chichester.
8. Glazebrook, K. D. (1982). On the evaluation of suboptimal strategies for families of alternative bandit processes. J. Appl. Probab. 19 716-722.
9. _ (1987). Sensitivity analysis for stochastic scheduling problems. Math. Oper. Res. 12 205-225.
10. _ (1995). Stochastic scheduling and forwards induction. Discrete Appl. Math. 57 145-165.
11. _, R. W. Owen (1995). Gittins-index heuristics for research planning. Naval Res. Logist. 42 1041-1062.
12. Katehakis, M. N., A. F. Veinott (1987). The multiarmed bandit problem: decomposition and computation. Math. Oper. Res. 12 262-268.
13. Klimov, G. P. (1974). Time sharing service systems I. Theory Probab. Appl. 19 532-551.
14. Li, L. M., C. J. Hu, P. Liu (1994). Maximum throughput of an input queueing packet switch with two priority classes. IEEE Trans. Comm. 42 3095-3097.
15. Molle, M. L. (1991). Prioritized-virtual-time CSMA-head-of-the-line priority classes without added overhead. IEEE Trans. Comm. 39 915-927.
16. Nash, P. (1973). Optimal allocation of resources between research projects. Ph.D. Thesis, Cambridge University.
17. Pilnick, S. E., K. D. Glazebrook, D. P. Gaver (1991). Optimal sequential replenishment of ships during combat. Naval Res. Logist. 38 637-668.
18. Shanthikumar, J. G., D. D. Yao (1992). Multiclass queuing systems: polymatroidal structure and optimal scheduling control. Oper. Res. 40 Supplement 2 S293-299.
19. Sharrock, S. M., D. H. C. Du (1989). Efficient CSMA/CD-based protocols for multiple priority classes. IEEE Trans. Comput. 38 943-954.
20. Whittle, P. (1981). Arm acquiring bandits. Ann. Probab. 9 284-292.