Optimal control of parallel queues with batch service

Probability in the Engineering and Informational Sciences

Volumn 16, Issue 3, 2002, Pages 289-307

  Xia, Cathy H ^a   Michailidis, George ^b   Bambos, Nicholas ^c   Glynn, Peter W ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

^c Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BATCH DATA PROCESSING;

AGGREGATE THROUGHPUT; BUFFER OVERFLOWS; DISTRIBUTED SERVICE; DYNAMIC ALLOCATIONS; EXTENSIVE SIMULATIONS; MUTUALLY INDEPENDENTS; PROCESSING CAPABILITY; THRESHOLD POLICIES;

QUEUEING THEORY;

EID: 0035993466     PISSN: 02699648     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0269964802163029     Document Type: Article

References (18)

1. Avramidis, A.N., Healy, K.J., & Uzsoy, R. (1998). Control of a batch processing machine: A computational approach. International Journal of Production Research 36: 3167-3181.
2. Deb, R.K. & Serfozo, R.F. (1973). Optimal control of batch service queues. Advances in Applied Probability 5: 340-361.
3. Duenyas, I. & Neale, J.J. (1997). Stochastic scheduling of a batch processing machine with incompatible job families. Annals of Operations Research 70: 191-220.
4. Koole, G. & Righter, R. (2001). A stochastic batching and scheduling problem. Probability in the Engineering and Informational Sciences 15: 465-479.
5. Koole, G., Sparaggis, P.D., & Towsley, D. (1999). Minimizing response times and queue lengths in systems of parallel queues. Journal of Applied Probability 36: 1185-1193.
6. Lindvall, T. (1993). Lectures on the coupling method. New York: John Wiley & Sons.
7. Nain, P., Tsoucas, P., & Walrand, J. (1989). Interchange arguments in stochastic scheduling. Journal of Applied Probability 27: 815-826.
8. Putterman, M.L. (1994). Markov decision processes. New York: John Wiley & Sons.
9. Righter, R. & Shanthikumar, J.G. (1992). Extrernal properties of the FIFO discipline in queueing networks. Journal of Applied Probability 29: 967-978.
10. Ross, S. (1983). Introduction to stochastic dynamic programming. New York: Academic Press.
11. Shaked, J. & Shanthikumar, J.G. (1994). Stochastic orders and their applications. New York: Academic Press.
12. Sparaggis, P.D., Cassandras, C.G., & Towsley, D. (1993). On the duality between routing and scheduling systems with finite buffer space. IEEE Transactions on Automatic Control 38 (9): 140-1446.
13. Stoyan, D. (1983). Comparison methods for queues and other stochastic models. New York: John Wiley & Sons.
14. Towsley, D. (1995). Application of majorization to control problems in queueing systems. In P. Chretienne et al. Scheduling Theory and its Applications. New York: John Wiley & Sons.
15. Uzsoy, R. (1995). Scheduling batch processing machines with incompatible job families. International Journal of Production Research 33: 2685-2708.
16. Walrand, J. (1988). An introduction to queueing networks. Englewood Cliffs, NJ: Prentice-Hall.
17. Wasserman, K.M. & Bambos, N. (1996). Optimal server allocation to parallel queues with finite-capacity buffers. Probability in the Engineering and Informational Sciences 10: 279-283.
18. Winston, W. (1977). Optimality of the shortest line discipline. Journal of Applied Probability 14: 181-189.