Optimal control of a two-stage tandem queuing system with flexible servers

Probability in the Engineering and Informational Sciences

Volumn 16, Issue 4, 2002, Pages 453-469

  Ahn, Hyun Soo ^a   Duenyas, Izak ^b   Lewis, Mark E ^b  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENGINEERING; INDUSTRIAL ENGINEERING;

EXHAUSTIVE SERVICE; FLEXIBLE SERVERS; HOLDING COSTS; OPTIMAL CONTROLS; OPTIMAL POLICIES; PARALLEL SERVERS; PER UNIT; QUEUING SYSTEMS;

QUEUEING NETWORKS;

EID: 23044532354     PISSN: 02699648     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0269964802164047     Document Type: Article

References (17)

1. Ahn, H.-S., Duenyas, I., & Zhang, R. (1999). Optimal stochastic scheduling of a two-stage tandem queue with parallel servers. Advances in Applied Probability 31: 1095-1117.
2. Andradottir, S., Ayhan, H., & Down, D.G. (2001). Server assignment policies for maximizing the steady-state throughput of finite queueing systems. Management Science, in press.
3. Andradottir, S., Ayhan, H., & Down, D.G. (2001). Dynamic server allocation for queueing networks with flexible servers. Preprint.
4. Duenyas, I., Gupta, D., & Olsen, T. (1998). Control of a single server tandem queueing system with setups. Technical Report No. 95-19, University of Michigan (to appear in Operations Research).
5. Farrar, T. (1993). Optimal use of an extra server in a two station tandem queueing network. IEEE Transactions on Automatic Control AC-38: 1296-1299.
6. Grassmann, W. & Tavakoli, J. (2001). A tandem queue with a movable server: An eigenvalue approach. Preprint.
7. Iravani, S.M.R. & Buzacott, J.A. (1996). An N-stage tandem queueing system attended by a moving server with holding and switching costs. Technical Report 96-09, University of Toronto, Department of Industrial Engineering, Toronto, Canada.
8. Iravani, S.M.R., Posner, M.J.M., & Buzacott, J.A. (1997). Two-stage tandem queue attended by a moving server with holding and switching costs; static and semi-dynamic policy. Queueing Systems 26:203-228.
9. Javidi, T., Song, N., & Teneketzis, D. (2001). Expected makespan minimization on identical machines in two interconnected queues. Probability in the Engineering and Informational Sciences 15: 409-443.
10. Kulkarni, V.G. (1995). Modeling and analysis of stochastic systems. London: Chapman & Hall.
11. Lippman, S. (1975). Applying a new device in the optimization of exponential queueing system. Operations Research 23: 687-710.
12. Meyn, S. (1997). The policy improvement algorithm for Markov decision processes. IEEE Transactions on Automatic Control AC-42(12): 1663-1680.
13. Meyn, S. (2001). Stability, performance evaluation, and optimization. In E. Feinberg & A. Schwartz (eds.), Handbook of Markov decision processes: Methods and applications. Boston: Kluwer Academic.
14. Meyn, S.&Tweedie, R. (1993). Markov chains and stochastic stability. New York: Springer-Verlag.
15. Pandelis, D. & Teneketzis, D. (1994). Optimal multiserver stochastic scheduling of two interconnected priority queues. Advances in Applied Probability 26: 258-279.
16. Sennott, L. (1999). Stochastic dynamic programming and the control of queueing systems. New York: Wiley.
17. Van Oyen, M.P., Senturk-Gel, E., & Hopp, W.J. Performance opportunity for workforce agility in collaborative and noncollaborative work systems. IIE Transactions, in press.