Dynamic Routing in a Queueing System with a Multiple Service Facility

Janusz Filipiak
Additional contact information
Janusz Filipiak: Academy of Mining and Metallurgy, Krakow, Poland

Operations Research, 1984, vol. 32, issue 5, 1163-1180

Abstract: In this paper we analyze a problem of traffic assignment within a queueing system with multiple service facilities subject to a changing load. The evolution in time of the mean number in the system is approximated with a nonlinear differential equation. The dynamic flow pattern is found for which the total waiting time of all entities passing the system is minimal. A numerical example is given. For the system in a nonstationary environment an adaptive strategy developed in this paper is compared with the performance of the policy of joining the shorter queue.

Keywords: 693 optimization of multichannel system; 695 nonstationary average queue size; 702 switching conditions (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.32.5.1163 (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:32:y:1984:i:5:p:1163-1180

Access Statistics for this article

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