Dynamic server allocation at parallel queues

Susan Martonosi

IISE Transactions, 2011, vol. 43, issue 12, 863-877

Abstract: This article explores whether dynamically reassigning servers to parallel queues in response to queue imbalances can reduce average waiting time in those queues. Approximate dynamic programming methods are used to determine when servers should be switched, and the performance of such dynamic allocations is compared to that of a pre-scheduled deterministic allocation. The proposed method is tested on both synthetic data and data from airport security checkpoints at Boston Logan International Airport. It is found that in situations where the uncertainty in customer arrival rates is significant, dynamically reallocating servers can substantially reduce waiting time. Moreover, it is found that intuitive switching strategies that are optimal for queues with homogeneous entry rates are not optimal in this setting.

Date: 2011
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2011.564602 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:43:y:2011:i:12:p:863-877

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/0740817X.2011.564602

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().