Beyond the cμ rule: Dynamic scheduling of a two-class loss queue

Mathematical Methods of Operations Research

Volumn 48, Issue 1, 1998, Pages 17-36

  Kim, Eungab ^a   Van Oyen, Mark P ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b Northwestern University   (United States)

Author keywords

C rule; Finite buffer; Loss penalty; Polling system; Stochastic scheduling; Threshold policy

Indexed keywords

EID: 0004395236     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00003992     Document Type: Article

References (18)

1. Bertsekas DP (1987) Dynamic programming: Deterministic and stochastic models. Prentice-Hall, Engte wood Cliffs
2. Buyukkoc C, Varaiya P, Walrand J (1985) The cμ-rule revisited. Advances in Applied Probability 17: 237-238
3. Duenyas I, Van Oyen MP (1995) Stochastic scheduling of parallel queues with set-ups costs. Queueing Systems (QUESTA) 19(4): 421-444
4. Duenyas I, Van Oyen MP (1996) Heuristic scheduling of parallel heterogeneous queues with set-ups. Management Sciences 42(6): 814-829
5. Gittins JC (1989) Multi-armed bandit allocation indices. Wiley, New York
6. Ha AY (1993) Optimal dynamic scheduling policy for a make-to-stock production system. (to appear in Operations Research), Yale School of Management
7. Hofri M, Ross KW (1987) On the optimal control of two queues with server setup times and its analysis. SIAM Journal on Computing 16: 399-420
8. Kim E, Van Oyen MP, Rieders M (1998) General dynamic programming algorithms applied to polling systems. Communications in Statistics: Stochastic Models 14(5)
9. Kim E, Van Oyen MP (1998) Finite-capacity multi-class production scheduling with setup times. Working paper
10. Koole G (1994) Assigning a single server to inhomogeneous queues with switching costs. To appear Theoretical Computer Science
11. Liu Z, Nain P, Towsley D (1992) On optimal polling policies. Queueing Systems (QUESTA) 11:59-83
12. Reiman M, Wein LM (1994) Dynamic scheduling of a two-class queue with setups, preprint
13. Rosberg Z, Kermani P (1992) Customer scheduling under queueing constraints. IEEE Transactions on Automatic Control 37(2): 252-257
14. Ross SM (1983) Introduction to stochastic dynamic programming. Academic Press, New York
15. Ross SM (1983) Stochastic processes. Wiley, New York
16. Suk JB, Cassandras CG (1991) Optimal scheduling of two competing queues with blocking. IEEE Transactions on Automatic Control AC-36: 1086-1091
17. Varaiya P, Walrand I, Buyukkoc C (1985) Extensions of the multi-armed bandit problem. IEEE Transactions on Automatic Control AC-30: 426-439
18. Walrand J (1988) An introduction to queueing networks. Prentice-Hall, Englewood Cliffs