Partitioning of Servers in Queueing Systems During Rush Hour
Published Online:24 Sep 2008https://doi.org/10.1287/msom.1080.0225
References
- Optimal call admission control in a resource-sharing system. IEEE Trans. Comm. (2001) 49:1659–1668Crossref, Google Scholar
- , Kelly F., Williams R. Fluid models of sequencing problems in open queueing networks: An optimal control approach. Stochastic Networks, Proceedings of the IMA (1995) 71(Springer, New York) 199–234Crossref, Google Scholar
- Performance bounds for the effectiveness of pooling in multi-processing systems. Eur. J. Oper. Res. (1995) 87:375–388Crossref, Google Scholar
- On the benefits of pooling in production-inventory systems. Management Sci. (2005) 51:548–565Link, Google Scholar
- Queueing Methods for Services and Manufacturing (1991) (Prentice Hall, Upper Saddle River, NJ) Google Scholar
- Queuing Systems, Volume 2: Computer Applications (1976) (John Wiley & Sons, New York) Google Scholar
- Creating a mathematical theory of computer networks. Oper. Res. (2002) 50:125–131Link, Google Scholar
- Applications of Queueing Theory (1982) (Chapman-Hall, London) Crossref, Google Scholar
- Scheduling: Theory, Algorithms, and Systems (2002) 2nd ed.(Prentice Hall, Englewood Cliffs, NJ) Google Scholar
- Monotonicity properties for the stochastic knapsack. IEEE Trans. Inform. Theory (1990) 36:1173–1179Crossref, Google Scholar
- Perspectives on queues: Combining queues is not always beneficial. Oper. Res. (1987) 35:906–909Link, Google Scholar
- Capacity allocation in rental businesses with reservations. (2006) . Working paper, Columbia University, New YorkGoogle Scholar
- Resource sharing for efficiency in traffic systems. Bell System Tech. J. (1981) 60:39–55Crossref, Google Scholar
- Understanding the efficiency of multi-server service systems. Management Sci. (1992) 38:708–723Link, Google Scholar
- Partitioning customers into service groups. Management Sci. (1999) 45:1579–1592Link, Google Scholar
- Fluid models for multiserver queues with abandonments. Oper. Res. (2006) 54:37–54Link, Google Scholar

