MSOM
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MANUFACTURING & SERVICE OPERATIONS MANAGEMENT
Vol. 11, No. 3, Summer 2009, pp. 416-428
DOI: 10.1287/msom.1080.0225
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Hu, B.
Right arrow Articles by Benjaafar, S.
Right arrow Search for Related Content

Partitioning of Servers in Queueing Systems During Rush Hour

Bin Hu, Saif Benjaafar

Department of Operations and Management Science, Ross School of Business, University of Michigan, Ann Arbor, Michigan 48109
Division of Industrial and Systems Engineering, Department of Mechanical Engineering, University of Minnesota, Minneapolis, Minnesota 55455

hub{at}umich.edu
saif{at}umn.edu

This paper is motivated by two phenomena observed in many queueing systems in practice. The first is the partitioning of server capacity among different customers based on their service time requirements. The second is rush hour demand where a large number of customers arrive over a short period of time followed by few or no arrivals for an extended period thereafter. We study a system with multiple parallel servers and multiple customer classes. The servers can be partitioned into server groups, each dedicated to a single customer class. The system operates under a rush hour regime with a large number of customers arriving at the beginning of the rush hour period. We show that this allows us to reduce the problem to one that is deterministic and for which closed-form solutions can be obtained. We compare the performance of the system with and without server partitioning during rush hour and address three basic questions. (1) Is partitioning beneficial to the system? (2) Is it equally beneficial to all customer classes? (3) If it is implemented, what is an optimal partition? We evaluate the applicability of our results to systems where customers arrive over time using (1) deterministic fluid models and (2) simulation models for systems with stochastic interarrival times.

Key Words: server partitioning; multiserver queueing systems; multiple demand classes; rush hour demand
History: Received: October 26, 2006; accepted: April 11, 2008.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2009 by INFORMS.