A Sequence of Service Stations with Arbitrary Input and Regular Service Times

B. Avi-Itzhak
Additional contact information
B. Avi-Itzhak: Cornell University, Ithaca, New York

Management Science, 1965, vol. 11, issue 5, 565-571

Abstract: In a queuing system with an ordered sequence of stations, the arrivals process is arbitrary and service times are regular at all stations. The case where each station consists of the same number of servers in parallel and the service times at all servers belonging to one station are the same is investigated and shown to possess the following properties: (a) The time spent in the system by any customer is independent of the order of the stations and of the allowable sizes of the intermediate queues; (b) The waiting time (not including service) of any customer equals the time the same customer would have been waiting in the queue of a single station system with regular service time, equaling the longest service time of the sequence (assuming the same arrivals process in both systems). These properties enable one to obtain waiting time distributions and other characteristics of such queuing processes.

Date: 1965
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.11.5.565 (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:11:y:1965:i:5:p:565-571

Access Statistics for this article

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