Stochastic Scheduling with Priority Classes

References

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