Queuing Models with Lane Selection: A New Class of Problems

Benjamin L. Schwartz
Additional contact information
Benjamin L. Schwartz: Informatics, Rockville, Maryland

Operations Research, 1974, vol. 22, issue 2, 331-339

Abstract: This paper presents a new class of queuing models. There are n distinct types of customers and n distinct types of service facilities. Some customers can be processed at any service facility, but other customer types can only use selected ones among the service-facility types. This class of model is named “lane selection,” abbreviated LS, since the arriving customers with some freedom of choice must select the queue, or lane, in which they are to be processed through the system. It is shown by example that many physical situations are represented more accurately by this model than by more conventional ones. However, in analysis, the LS concept raises many theoretical difficulties. For a number of special cases, this paper obtains in explicit form as functions of the model parameters the mean queue lengths and waiting times for the different classes of customers.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.22.2.331 (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:22:y:1974:i:2:p:331-339

Access Statistics for this article

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