Partitioning of servers in queueing systems during rush hour

Manufacturing and Service Operations Management

Volumn 11, Issue 3, 2009, Pages 416-428

  Hu, Bin ^a   Benjaafar, Saif ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b University of Minnesota   (United States)

Author keywords

Multiple demand classes; Multiserver queueing systems; Rush hour demand; Server partitioning

Indexed keywords

CLOSED FORM SOLUTIONS; FLUID MODELS; INTER-ARRIVAL TIME; MULTIPLE DEMAND CLASSES; MULTISERVER QUEUEING SYSTEMS; OPTIMAL PARTITIONS; PARALLEL SERVERS; QUEUEING SYSTEM; RUSH HOUR DEMAND; SERVER CAPACITY; SERVER GROUP; SERVICE TIME; SHORT PERIODS; SIMULATION MODEL;

CUSTOMER SATISFACTION; QUEUEING NETWORKS; QUEUEING THEORY; SALES; STOCHASTIC MODELS;

SERVERS;

EID: 68349114919     PISSN: 15234614     EISSN: 15265498     Source Type: Journal    
DOI: 10.1287/msom.1080.0225     Document Type: Article

References (16)

1. References Altman, E., T. Jimenez, G. Koole. 2001. Optimal call admission control in a resource-sharing system. IEEE Trans. Comm. 49 1659-1668. (Pubitemid 32981737)
2. Avram, F., D. Bertsimas, M. Ricard. 1995. Fluid models of sequencing problems in open queueing networks: An optimal control approach. F. Kelly, R. Williams, eds. Stochastic Networks, Proceedings of the IMA, Vol.71. Springer, New York, 199-234.
3. Benjaafar, S. 1995. Performance bounds for the effectiveness of pooling in multi-processing systems. Eur. J. Oper. Res. 87 375-388.
4. Benjaafar, S., W. L. Cooper, J. S. Kim. 2005. On the benefits of pooling in production-inventory systems. Management Sci. 51 548-565. (Pubitemid 41009652)
5. Hall, R. W. 1991. Queueing Methods for Services and Manufacturing. Prentice Hall, Upper Saddle River, NJ.
6. Kleinrock, L. 1976. Queuing Systems, Volume 2: Computer Applications. John Wiley & Sons, New York.
7. Kleinrock, L. 2002. Creating a mathematical theory of computer networks. Oper. Res. 50 125-131. (Pubitemid 34459815)
8. Newell, G. F. 1982. Applications of Queueing Theory. Chapman-Hall, London.
9. Pinedo, M. 2002. Scheduling: Theory, Algorithms, and Systems, 2nd ed. Prentice Hall, Englewood Cliffs, NJ.
10. Ross, K. W., D. D. Yao. 1990. Monotonicity properties for the stochastic knapsack. IEEE Trans. Inform. Theory 36 1173-1179.
11. Rothkopf, M. H., P. Rech. 1987. Perspectives on queues: Combining queues is not always beneficial. Oper. Res. 35 906-909. (Pubitemid 18608639)
12. Savin, S., B. Wang. 2006. Capacity allocation in rental businesses with reservations. Working paper, Columbia University, New York.
13. Smith, D. R., W. Whitt. 1981. Resource sharing for efficiency in traffic systems. Bell System Tech. J. 60 39-55. (Pubitemid 11466715)
14. Whitt, W. 1992. Understanding the efficiency of multi-server service systems. Management Sci. 38 708-723.
15. Whitt, W. 1999. Partitioning customers into service groups. Management Sci. 45 1579-1592. (Pubitemid 30523648)
16. Whitt, W. 2006. Fluid models for multiserver queues with abandonments. Oper. Res. 54 37-54. (Pubitemid 43296740)