Instability of the Join-the-Shortest-Queue and FCFS Policies in Queueing Systems and Their Stabilization

Ali Sharifnia
Additional contact information
Ali Sharifnia: Boston University, Boston, Massachusetts

Operations Research, 1997, vol. 45, issue 2, 309-314

Abstract: We demonstrate the instability of the “join-the-shortest-queue” routing policy and the “first-come-first-served” dispatching policy for a multiclass single-station queuing system with multiple nonidentical servers. Although instability is demonstrated in a deterministic setting, we have found strong evidence that it is not limited to this setting. The phenomenon that leads to instability is different from the one reported recently in the literature for nonacyclic systems, namely, servers starvation. The systems considered here are acyclic, and instability is caused by the failure of the policies to assign jobs to servers in an efficient manner. A modification to the investigated policies is proposed to make them stable. The modified policies (called guided policies ) provide an oversight control that ensure efficient utilization of the servers and hence stability.

Keywords: production/scheduling; instability of join-the-shortest-queue and FCFS policies; queues; instability of join-the-shortest-queue and FCFS policies (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.45.2.309 (application/pdf)

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:inm:oropre:v:45:y:1997:i:2:p:309-314

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().