A direct method for the computation of waiting times

Lionello Lombardi

Naval Research Logistics Quarterly, 1961, vol. 8, issue 2, 193-197

Abstract: A recurrence relation for the direct computation of the waiting times of an array of c customers served by s parallel channels on a first come first served basis, where the time of arrival and the holding time of each customer are known, is worked out. The number of operations required by this procedure is proportional to c.s, while the method commonly used, which is due to F. Pollaczek, requires a number of operations proportional to c2. In (c): this improvement is obtained by means of the adoption of sorting by insertion and by saving certain intermediate results.

Date: 1961
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800080207

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:wly:navlog:v:8:y:1961:i:2:p:193-197

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().