Dynamic control of a multiclass queue with thin arrival streams

Operations Research

Volumn 54, Issue 5, 2006, Pages 876-892

  Ata, Bariş ^a  

^a NORTHWESTERN UNIVERSITY   (United States)

Author keywords

Admission control in queues; Dynamic scheduling via heavy traffic approximations; dynamic programming; Make to order production systems; queues; Production scheduling

Indexed keywords

ADMISSION CONTROL IN QUEUES; DYNAMIC SCHEDULING; HEAVY-TRAFFIC APPROXIMATIONS; MAKE-TO-ORDER PRODUCTION SYSTEMS;

CONSTRAINT THEORY; DECISION MAKING; DYNAMIC PROGRAMMING; PRODUCTION CONTROL; SCHEDULING; SERVERS;

QUEUEING THEORY;

EID: 33749629114     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1060.0308     Document Type: Article

References (45)

1. Ata, B. 2003. Dynamic control of stochastic networks. Ph.D. thesis, Graduate School of Business, Stanford University, Stanford, CA.
2. Ata, B. 2005. Dynamic power control in a wireless static channel subject to a quality-of-service constraint. Oper. Res. 53(5) 842-851.
3. Ata, B., S. Kumar. 2005. Heavy traffic analysis of open processing networks with complete resource pooling: Asymptotic optimality of discrete review policies. Ann. Appl. Probab. 15(1A) 331-391.
4. Ata, B., J. M. Harrison, L. A. Shepp. 2005. Drift rate control of a Brownian processing system. Ann. Appl. Ptobab. 15(2) 1145-1160.
5. Bell, S. L., R. J. Williams. 2001. Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy. Ann. Appl. Probab. 11 608-649.
6. Bell, S. L., R. J. Williams. 2004. Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling. Working paper, University of California at San Diego, San Diego, CA.
7. Bertsekas, D. P. 1995. Dynamic Programming and Optimal Control, Vol. 2. Athena Scientific, Boston, MA.
8. Billingsley, P. 1999. Convergence of Probability Measures, 2nd ed. John Wiley and Sons, New York.
9. Bramson, M. 1998. State space collapse with applications to heavy-traffic limits for multiclass queueing networks. Queueing Systems 30 89-148.
10. Budhiraja, A., A. P. Ghosh. 2005. A large deviations approach to asymptotically optimal control of criss-cross network in heavy traffic. Ann. Appl. Probab. 15(3) 1887-1935.
11. Chevalier, P. B., L. M. Wein. 1993. Scheduling networks of queues: Heavy traffic analysis of a multistation closed network. Oper. Res. 41 743-758.
12. Crabill, T. B., D. Gross, M. J. Magazine. 1977. A classified bibliography of research on optimal design and control of queues. Oper. Res. 25(2) 219-232.
13. Dayanik, S., J. Song, S. Xu. 2003. The effectiveness of several performance bounds for capacitated production, partial-order-service, assemble-to-order systems. Manufacturing Service Oper. Management 5(3) 230-251.
14. Duenyas, I. 1995. Single facility due date setting with multiple customer classes. Management Sci. 41 608-619.
15. George, J. M., J. M. Harrison. 2001. Dynamic control of a queue with adjustable service rate. Oper. Res. 49(5) 720-731.
16. Graves, S. 1981. A review of production scheduling. Oper. Res. 29 646-675.
17. Harrison, J. M. 1985. Brownian Motion and Stochastic Flow Systems. Wiley, New York.
18. Harrison, J. M. 1988. Brownian models of queueing networks with heterogenous customer populations. W. Fleming, P. L. Lions, eds. Stochastic Differential Systems, Stochastic Control Theory and Their Applications, Vol. 10 of IMA. Springer-Verlag, New York, 147-186.
19. Harrison, J. M. 2000. Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Probab. 10(1) 75-103.
20. Harrison, J. M. 2003. A broader view of Brownian networks. Ann. Appl. Probab. 13 1119-1150.
21. Harrison, J. M., J. Van Mieghem. 1997. Dynamic control of Brownian networks: State space collapse and equivalent workload formulations. Ann. Appl. Probab. 7 747-771.
22. Harrison, J. M., L. Wein. 1989. Scheduling network of queues: Heavy traffic analysis of a simple open network. Queueing Systems 5 265-280.
23. Harrison, J. M., L. Wein. 1990. Scheduling networks of queues: Heavy traffic analysis of a two-station closed network. Oper. Res. 38 1052-1064.
24. Karlin, S., H. M. Taylor. 1997. A First Course in Stochastic Processes, 2nd ed. Academic Press, New York.
25. Kumar, S. 2000. Two-server closed networks in heavy traffic: Diffusion limits and asymptotic optimality. Ann. Appl. Probab. 10 930-961.
26. Maglaras, C., J. A. Van Mieghem. 2005. Queueing systems with leadtime constraints: A fluid-model approach for admission and sequencing control. Eur. J. Oper. Res. 167 179-207.
27. Plambeck, E. L., A. R. Ward. 2006a. Optimal control of high-volume assemble-to-order systems. Working paper, Stanford University, Stanford, CA.
28. Plambeck, E. L., A. R. Ward. 2006b. Optimal control of high-volume assemble-to-order systems with delay constraints. Working paper, Stanford University, Stanford, CA.
29. Plambeck, E., S. Kumar, J. M. Harrison. 2001. A multiclass queue in heavy traffic with throughput time constraints: Asymptotically optimal dynamic controls. Queueing Systems 39 23-54.
30. Rubino, M. A. 2003. Managing workflow in parallel-server systems: A heavy traffic approach. Ph.D. thesis, Management Science and Engineering Department, Stanford University, Stanford, CA.
31. Rubino, M. A., J. M. Harrison. 2001. The Intel mask operation. Case study S-OIT-31, Graduate School of Business, Stanford University, Stanford, CA.
32. Spearman, M. L., R. Q. Zhang. 1999. Optimal lead time policies. Management Sci. 45 290-295.
33. Stidham, S. 1985. Optimal control of admission to a queueing system. IEEE Trans. Automatic Control AC-30(8) 705-713.
34. Stidham, S. 1988. Scheduling, routing, and flow control in stochastic networks. W. Fleming, P. L. Lions, eds. Stochastic Differential Systems, Stochastic Control Theory and Applications, Vol. 10 of IMA. Springer-Verlag, Berlin, Germany, 529-561.
35. Stolyar, A. L. 2004. Maxweight scheduling in a generalized switch: State space collapse and equivalent workload minimization under complete resource pooling. Ann. Appl. Probab. 14(1) 1-53.
36. Van Mieghem, J. 1995. Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probab. 5 809-833.
37. Wein, L. 1990. Brownian networks with discretionary routing. Oper. Res. 38 1065-1078.
38. Wein, L. 1991a. Due-date setting and priority sequencing in a multiclass M/G/1 queue. Management Sci. 37 834-850.
39. Wein, L. 1991b. Scheduling network of queues: Heavy traffic analysis of a two-station network with controllable inputs. Oper. Res. 39 322-340.
40. Wein, L. 1992a. Scheduling network of queues: Heavy traffic analysis of a multistation network with controllable inputs. Oper. Res. 40 S312-S334.
41. Wein, L. M. 1992b. Dynamic scheduling of a multiclass make-to-stock queue. Oper. Res. 40 724-735.
42. Wein, L. M., M. H. Veatch. 1996. Scheduling a make-to-stock queue: Index policies and hedging points. Oper. Res. 44 634-647.
43. Whitt, W. 2002. Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Application to Queues. Springer, New York.
44. Williams, R. J. 1998a. Diffusion approximations for open multiclass networks: Sufficient conditions for state space collapse. Queueing Systems 30 27-88.
45. Williams, R. J. 1998b. An invariance principle for semimartingale reflecting Brownian motion. Queueing Systems 30 5-25.