Allocation of service time in a multiserver system

• 成果类型: Article
• 署名作者: El-Taha, M; Maddah, B
• 署名单位: University of Maine System; University of Southern Maine; American University of Beirut
• 刊物名称: MANAGEMENT SCIENCE
• ISSN/ISSBN: 0025-1909
• DOI: 10.1287/mnsc.1050.0467
• 发表日期: 2006
• 页码: 623-637
• 关键词: queueing; truncated distributions; heavy tail distributions; repair models; simulation

摘要

Reducing congestion is a primary concern in the design and analysis of queueing networks, especially in systems where sources of randomness are characterized by high variability. This paper considers a multiserver first-come, first-served (FCFS) queueing model where we arrange servers in two stations in series. All arrivals join the first service center, where they receive a maximum of T units of service. Arrivals with service requirements that exceed the threshold T join the second queue, where they receive their remaining service. For a variety of heavy tail service time distributions, characterized by large coefficient of variations, analytical and numerical comparisons show that our scheme provides better system performance than the standard parallel multiserver model in the sense of reducing the mean delay per customer in heavy traffic systems. Our model is likely to be useful in systems where high variability is a cause for degradation and where numerous service interruptions are not desired.