Translator Disclaimer
Decemmber 2011 Multiple-server system with flexible arrivals
Osman T. Akgun, Rhonda Righter, Ronald Wolff
Author Affiliations +
Adv. in Appl. Probab. 43(4): 985-1004 (Decemmber 2011). DOI: 10.1239/aap/1324045695

Abstract

In many service, production, and traffic systems there are multiple types of customers requiring different types of `servers', i.e. different services, products, or routes. Often, however, a proportion of the customers are flexible, i.e. they are willing to change their type in order to achieve faster service, and even if this proportion is small, it has the potential of achieving large performance gains. We generalize earlier results on the optimality of `join the shortest queue' (JSQ) for flexible arrivals to the following: arbitrary arrivals where only a subset are flexible, multiple-server stations, and abandonments. Surprisingly, with abandonments, the optimality of JSQ for minimizing the number of customers in the system depends on the relative abandonment and service rates. We extend our model to finite buffers and resequencing. We assume exponential service. Our optimality results are very strong; we minimize the queue length process in the weak majorization sense.

Citation

Download Citation

Osman T. Akgun. Rhonda Righter. Ronald Wolff. "Multiple-server system with flexible arrivals." Adv. in Appl. Probab. 43 (4) 985 - 1004, Decemmber 2011. https://doi.org/10.1239/aap/1324045695

Information

Published: Decemmber 2011
First available in Project Euclid: 16 December 2011

zbMATH: 1229.90041
MathSciNet: MR2867942
Digital Object Identifier: 10.1239/aap/1324045695

Subjects:
Primary: 90B22
Secondary: 60K25

Rights: Copyright © 2011 Applied Probability Trust

JOURNAL ARTICLE
20 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.43 • No. 4 • Decemmber 2011
Back to Top