Article ID: | iaor1992730 |
Country: | Netherlands |
Volume: | 46 |
Issue: | 1 |
Start Page Number: | 124 |
End Page Number: | 135 |
Publication Date: | May 1990 |
Journal: | European Journal of Operational Research |
Authors: | Jun Kyung P., Perros Harry G. |
An approximation algorithm is presented for open tandem queueing networks with finite buffers and with general service times. The algorithm decomposes the system into individual queues with revised arrival and service processes and revised queue capacity. Then, each queue is analyzed in isolation. The service process is revised to reflect the additional delay a unit might undergo due to blocking. Unlike previous algorithms, the arrival process to each decomposed queue is described by a