Queueing systems with leadtime constraints: A fluid-model approach for admission and sequencing control

European Journal of Operational Research

Volumn 167, Issue 1, 2005, Pages 179-207

  Maglaras, Constantinos ^a   Van Mieghem, Jan A ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b NORTHWESTERN UNIVERSITY   (United States)

Author keywords

Admission control; Fluid models; Lead times; Queueing; Scheduling

Indexed keywords

CONSTRAINT THEORY; MANUFACTURE; PROBABILITY; RANDOM PROCESSES; SCHEDULING; VECTORS;

ADMISSION CONTROL; FLUID MODELS; QUEUEING SYSTEMS;

QUEUEING THEORY;

EID: 13544259563     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2002.11.005     Document Type: Article

References (37)

1. Avram F., Bertsimas D., Ricard M. Fluid models of sequencing problems in open queueing networks: An optimal control approach. Kelly F., Williams R. Stochastic Networks, Proceedings of the IMA. vol. 71:1995;199-234 Springer-Verlag, New York
2. D. Bertsimas, I. Paschalidis, Probabilistic service level guarantees of make-to-stock manufacturing systems, 1999, preprint
3. Bertsimas D., Paschalidis I.C., Tsitsiklis J.N. Asymptotic buffer overflow probabilities in multiclass multiplexers: An optimal control approach. IEEE Transactions on Automatic Control. 43(3):1998;315-335
4. Bertsimas D., Paschalidis I.C., Tsitsiklis J.N. On the large deviations behavior of acyclic networks of G/G/1 queues. Annals of Applied Probability. 8(4):1998;1027-1069
5. Chen H., Yao D. Dynamic scheduling of a multiclass fluid network. Operations Research. 41(6):1993;1104-1115
6. Cruz R.L. A calculus for network delay, part I: Network elements in isolation. IEEE Transactions on Information Theory. 37(1):1991;114-131
7. Cruz R.L. A calculus for network delay, part II: Network analysis. IEEE Transactions on Information Theory. 37(1):1991;132-141
8. Dai J.G., Weiss G. Stability and instability of fluid models for certain re-entrant lines. Mathematics of Operations Research. 21:1996;115-134
9. Demers A., Keshav S., Shenker S. Analysis and simulation of a fair queueing algorithm. Internetworking - Research and Experience. 1:1990
10. Duenyas I. Single facility due date setting with multiple customer classes. Management Science. 41:1995;608-619
11. Gallager R.G., Hajek B., Kelly F.P., Mitra D., Varaiya P.P. Advances in the fundamentals in networking - Parts I-II. IEEE Journal on Selected Areas of Communications. 13:1995
12. Glasserman P. Bounds and asymptotics for planning critical safety stocks. Operations Research. 45:1997;244-257
13. Glasserman P., Wang Y. Fill-rate bottlenecks in production-inventory networks. Manufacturing & Service Operations Management. 1:1999;62-76
14. Graves S. A review of production scheduling. Operations Research. 29:1981;646-675
15. Harrison J.M. The BIGSTEP approach to flow management. Kelly F.P., Zachary S., Ziedins I. Stochastic Networks: Theory and Applications. 1996;57-90 Clarendon Press, Oxford
16. J.M. Harrison, Network control problems with constraints on throughput time, in: 10th INFOMRS Applied Probability Conference, Ulm, Germany, 1999
17. Hopp W.J., Spearman M.L. Factory Physics. 1996;Irwin-McGraw-Hill
18. Kelly F.P. Reversibility and Stochastic Networks. 1979;John Wiley & Sons, New York, NY
19. Kelly F.P. Notes on effective bandwidths. Kelly F., Zachary S., Ziedins I. Stochastic Networks: Theory and Applications. 1996;141-168 Oxford University Press
20. L. Kleinrock, Queuing Systems Vol. 2: Computer Applications, 1976
21. Kumar P.R. Re-entrant lines. Queueing Systems. 13:1993;87-110
22. Y. Lu, Dynamic scheduling with side constraints, Ph.D. Thesis, IEOR Dept., Columbia University, 1998
23. Lawler E.L., Lenstra J.K., Kan A.H.G.R., Shmoys D.B. Sequencing and scheduling: Algorithms and complexity. Logistics of Production and Inventory. Graves S.C., Kan A.H.G.R., Zipkin P.H. Handbooks in OR & MS. vol. 4:1993;445-522 North-Holland
24. Maglaras C. Discrete-review policies for scheduling stochastic networks: Trajectory tracking and fluid-scale asymptotic optimality. Annals of Applied Probability. 10(3):2000
25. Paschalidis I. Class-specific quality of service guarantees in multimedia communication networks. Automatica. 35(12):1999;1951-1969
26. Parekh A.K., Gallager R.G. A generalized processor sharing approach to flow control in integrated services networks: The single-node case. IEEE/ACM Transactions on Networking. 1(3):1993;344-357
27. Plambeck E., Kumar S., Harrison J.M. A multiclass queue in heavy traffic with throughput time constraints: Asymptotically optimal dynamic controls. Queueing Systems. 39:2001;23-54
28. Reiman M.I. Open queueing networks in heavy traffic. Mathematics of Operations Research. 9:1984;441-458
29. Spearman M.L., Zhang R.Q. Optimal lead time policies. Management Science. 45:1999;290-295
30. A. Stolyar, K. Ramanan, Largest weighted delay first scheduling: Large deviations and optimality, preprint
31. A. Stolyar, Control of end-to-end delay tails in a multiclass network: LWDF discipline optimality, 2000, preprint
32. Van Mieghem J.A. Dynamic scheduling with convex delay costs: The generalized. cμ rule Annals of Applied Probability. 5:1995;809-833
33. Van Mieghem J.A. Due-date scheduling: Asymptotic optimality of generalized longest queue and generalized largest delay rules. Operations Research. 51(1):2003;113-122
34. Wein L.M. Scheduling semiconductor wafer fabrication. IEEE Transactions of Semiconductor Manufacturing. 1:1988;115-130
35. Wein L.M. Due-date setting and priority sequencing in a multiclass M/G/1 queue. Management Science. 37:1991;834-850
36. Wein L.M., Chevalier P.B. A broader view of the job-shop scheduling problem. Management Science. 38:1992;1018-1033
37. Zhang Z.-L. Large deviations and the generalized processor sharing scheduling for a two-queue system. Queueing Systems. 26:1997;229-264