Optimal stochastic scheduling of a two-stage tandem queue with parallel servers

Advances in Applied Probability

Volumn 31, Issue 4, 1999, Pages 1095-1117

  Ahn, Hyun Soo ^a   Duenyas, Izak ^a   Zhang, Rachel Q ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Multiserver queues; Stochastic scheduling; Tandem queues

Indexed keywords

EID: 0033332650     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1029955262     Document Type: Article

References (23)

1. Agrawal, R., Hedge, M. and Teneketzis, D. (1990). Multi-armed bandit problems with multiple plays and switching costs. Stochastics and Stochastic Reports 29, 437-359.
2. Bartholdi, J. J., Bunimovich, L. A. and Eisenstein, D. (1995). Dynamics of 2 and 3-worker bucket brigade production lines. Tech. Rep. School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA.
3. Chang, C., Nelson, R. and Pinedo, M. (1991). Scheduling two classes of exponential jobs on parallel processors: Structural results and worst-case analysis. Adv. Appl. Prob. 23,925-944.
4. Duenyas, I., Gupta, D. and Olsen, T. (1998). Control of a single server tandem queueing system with setups. Operat. Res. 46, 218-230.
5. Farrar, T. (1993). Optimal use of an extra server in a two station tandem queueing network. IEEE Trans. Automat. Control 38,1296-1299.
6. GITTINS, J. C. (1989). Multi-armed Bandit Allocation Indices. John Wiley, New York.
7. Hajek, B. (1984). Optimal control of two interacting service stations. IEEE Trans. Automat. Control AC29, 491-499.
8. Hofri, M. and Ross, K. (1987). On the optimal control of two queues with server setup times and its analysis. SIAM J. Computing 16, 399-420.
9. IRAVANI, S. M. R., Posner, M. J. M. and Buzacott, J. A. (1995). Two-stage tandem queue attended by a moving server with holding and switching costs; static and semi-dynamic policy. Tech. Rep. 95-18, University of Toronto, Department of Industrial Engineering, Toronto, Canada.
10. IRAVANI, S. M. R., Posner, M. J. M. and Buzacott, J. A. (1996). An N-stage tandem queueing system attended by a moving server with holding and switching costs. Tech. Rep., 96-09, University of Toronto, Department of Industrial Engineering, Toronto, Canada.
11. Kampke, T. (1987). On the optimality of static priority policies in stochastic scheduling on parallel machines. J. Appl. Prob. 24, 430-448.
12. Kampke, T. (1989). Optimal scheduling of jobs with exponential service times on identical parallel processors. Operat. Res. 37,126-133.
13. McClain, J. O., Thomas, L. J. and Schultz, K. (1997). Management of worksharing systems. To appear in Manufacturing and Service Operations Management.
14. Van Oyen, M. and Teneketzis, D. (1992). Optimal scheduling of a finite capacity shuttle under delayed information. Prob. Eng. Inf. Sci. 6, 29-61.
15. Van Oyen, M. and Tenektzis, D. (1994). Optimal stochastic scheduling of forest networks with switching penalties. Adv. Appl. Prob. 26, 474-497.
16. Van Oyen, M. and Teneketzis, D. (1996). Optimal batch services for a polling system under partial information. ZOR: Meth. Models Op. Res. 44, 401-419.
17. Pandelis, D. and Teneketzis, D. (1994a). Optimal multiserver stochastic scheduling of two interconnected priority queues. Adv. Appl. Prob. 26, 258-279.
18. Pandelis, D. and Teneketzis, D. (1994b). Optimal stochastic dynamic scheduling in multi-class queues with tardiness and/or earliness penalties. Prob. Eng. Inf. Sci. 8, 491-509.
19. Pinedo, M. (1995). Scheduling: Theory, Algorithms and Systems. Prentice Hall, Princeton, NJ.
20. Rosberg, Z., VARAIYA, p. and Walrand, J. (1982). Optimal control of service in tandem queues. IEEE Trans. Automat. Control. AC27, 600-609.
21. Ross, S. (1983). Introduction to Stochastic Dynamic Programming. Academic Press, New York.
22. STIDHAM, S. and Weber, R. (1993). A survey of Markov decision models for control of networks of queues. QSTA 13, 291-314.
23. Weber, R. and Stidham, S. (1987). Optimal control of service rates in networks of queues. Adv. Appl. Prob. 19, 202-217.