The Best Order for Queues in Series

Ward Whitt
Additional contact information
Ward Whitt: AT&T Bell Laboratories, Holmdel, New Jersey 07733

Management Science, 1985, vol. 31, issue 4, 475-487

Abstract: An important design problem for queueing systems is to determine the best order for two or more service stations in series. For given external arrival process and given service-time distributions, the object is to determine the order of the stations (to be used by all customers) that minimizes the expected equilibrium sojourn time per customer. Unfortunately, very little is known about this problem because exact analysis is extremely difficult. This paper applies approximation methods recently developed for networks of queues to obtain approximation formulas and useful heuristic design principles.

Keywords: tandem queues; approximations; queueing networks; queueing system design (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.31.4.475 (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:ormnsc:v:31:y:1985:i:4:p:475-487

Access Statistics for this article

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