Optimal control of a flexible server

Advances in Applied Probability

Volumn 36, Issue 1, 2004, Pages 139-170

  Ahn, Hyun Soo ^a,d   Duenyas, Izak ^b   Zhang, Rachel Q ^c,e  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

^c Department of Obstetrics Gynecology   (United States)

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

^e The Samuel Curtis Johnson Graduate School of Management   (United States)

Author keywords

Clearing system; Flexible server; Multiserver queue; Stochastic scheduling

Indexed keywords

CLEARING SYSTEM; FLEXIBLE SERVER; MULTISERVER QUEUE; STOCHASTIC SCHEDULING;

APPROXIMATION THEORY; ASYMPTOTIC STABILITY; COSTS; QUEUEING NETWORKS; SCHEDULING; SERVERS; STOCHASTIC PROGRAMMING;

OPTIMAL CONTROL SYSTEMS;

EID: 1842457608     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1077134468     Document Type: Article

References (18)

1. AHN, H.-S., DUENYAS, I. AND ZHANG, R. Q. (1999). Optimal stochastic scheduling of a two-stage tandem queue with parallel servers. Adv. Appl. Prob. 31, 1095-1117.
2. ANDRADOTTIR, S., AYHAN, H. AND DOWN, D. G. (2001). Server assignment policies for maximizing the steady-state throughput of finite queueing systems. Manag. Sci. 47, 1421-1439.
3. BELL, S. AND WILLIAMS, R. (2001). Dynamic scheduling of a system with two parallel servers in heavy traffic with complete resource pooling: asymptotic optimality of a continuous review threshold policy. Ann. Appl. Prob. 11, 608-649.
4. BUYUKKOC, C., VARAIYA, P. AND WALRAND, J. (1985). The cμ. rule revisited. Adv. Appl. Prob. 17, 237-238.
5. CHEN, M., PANDIT, C. AND MEYN, S. P. (2003). In search of sensitivity in network optimization. Queueing Systems 44, 313-363.
6. DUENYAS, I., GUPTA, D. AND OLSEN, T. (1998). Control of a single-server tandem queueing system with setups. Operat. Res. 46, 218-230.
7. FARRAR, T. (1993). Optimal use of an extra server in a two station tandem queueing network. IEEE Trans. Automatic Control 38, 1296-1299.
8. HARRISON, J. M. (1998). Heavy traffic analysis of a system with parallel servers: asymptotic analysis of discrete-review policies. Ann. Appl. Prob. 8, 822-848.
9. HARRISON, J. M. AND LOPEZ, M. J. (1999). Heavy traffic resource pooling in parallel-server systems. Queueing Systems 33, 339-368.
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, Department of Industrial Engineering, University of Toronto.
11. IRAVANI, S. M. R., POSNER, M. J. M. AND BUZACOTT, J. A. (1997). A two-stage tandem queue attended by a moving server with holding and switching costs. Queueing Systems 26, 203-228.
12. KIM, E. AND VAN OYEN, M. P. (1998). Beyond the cμ rule: dynamic scheduling of a two-class loss queue. Math. Meth. Operat. Res. 48, 17-36.
13. KUMAR, S. AND MUTHURAMAN, M. (2002). A numerical method for solving singular stochastic control problems. Preprint, Stanford University.
14. MEYN, S. (2001). Sequencing and routing in multiclass queueing networks. I. Feedback regulation. SIAM J. Control Optimization 40, 741-776.
15. MEYN, S. (2003). Sequencing and routing in multiclass queueing networks. II. Workload relaxations. SIAM J. Control Optimization 42, 178-217.
16. PANDELIS, D. G. AND TENEKETZIS, D. (1994). Optimal multiserver stochastic scheduling of two interconnected priority queues. Adv. Appl. Prob. 26, 258-279.
17. VAN OYEN, M. P., GEL, E. S. AND HOPP, W. J. (2001). Performance opportunity for workforce agility in collaborative and noncollaborative work systems. IIE Trans. 33, 761-777.
18. WALRAND, J. (1988). An Introduction to Queueing Networks. Prentice-Hall, New York.