Partitioning Customers into Service Groups
We explore the issues of when and how to partition arriving customers into service groups that will be served separately, in a first-come first-served manner, by multiserver service systems having a provision for waiting, and how to assign an appropriate number of servers to each group. We assume that customers can be classified upon arrival, so that different service groups can have different service-time distributions. We provide methodology for quantifying the tradeoff between economies of scale associated with larger systems and the benefit of having customers with shorter service times separated from other customers with longer service times, as is done in service systems with express lines. To properly quantify this tradeoff, it is important to characterize service-time distributions beyond their means. In particular, it is important to also determine the variance of the service-time distribution of each service group. Assuming Poisson arrival processes, we then can model the congestion experienced by each server group as an M/G/squeue with unlimited waiting room. We use previously developed approximations for M/G/sperformance measures to quickly evaluate alternative partitions.
Volume (Year): 45 (1999)
Issue (Month): 11 (November)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Seelen, L. P., 1986. "An algorithm for Ph/Ph/c queues," European Journal of Operational Research, Elsevier, vol. 23(1), pages 118-127, January.
- Linda V. Green & Debashis Guha, 1995. "Note: On the Efficiency of Imbalance in Multi-Facility Multi-Server Service Systems," Management Science, INFORMS, vol. 41(1), pages 179-187, January.
- Jimmie L. Davis & William A. Massey & Ward Whitt, 1995. "Sensitivity to the Service-Time Distribution in the Nonstationary Erlang Loss Model," Management Science, INFORMS, vol. 41(6), pages 1107-1116, June.
- Ward Whitt, 1985. "The Best Order for Queues in Series," Management Science, INFORMS, vol. 31(4), pages 475-487, April.
- Ward Whitt, 1992. "Understanding the Efficiency of Multi-Server Service Systems," Management Science, INFORMS, vol. 38(5), pages 708-723, May.
- Otis B. Jennings & Avishai Mandelbaum & William A. Massey & Ward Whitt, 1996. "Server Staffing to Meet Time-Varying Demand," Management Science, INFORMS, vol. 42(10), pages 1383-1394, October.
- John A. Buzacott, 1996. "Commonalities in Reengineered Business Processes: Models and Issues," Management Science, INFORMS, vol. 42(5), pages 768-782, May.
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:45:y:1999:i:11:p:1579-1592. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.