Computationally efficient approximations for balanced flowlines with finite intermediate buffers
Author:
- 1 February 1990
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 28 (2) , 401-419
Abstract
In this paper we derive approximations for the main performance characteristics of balanced flowlines, i.e. flowlines with identical workstations and equally-sized intermediate buffers. The derivation of the approximations is based on a hybrid approach: classical results from queueing theory are mixed with empirical findings. The approximations are extremely simple to compute regardless of the dimensions of the Bowline. The form of the approximations hint at possibly existing structural results for balanced flowlines that call for further more fundamental research.Keywords
This publication has 8 references indexed in Scilit:
- An improved algorithm to approximate the behaviour of flow lines†International Journal of Production Research, 1988
- An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and BlockingOperations Research, 1987
- A queueing system with impatient customersJournal of Applied Probability, 1985
- A two-moment approximation for a buffer design problem requiring a small rejection probabilityPerformance Evaluation, 1985
- Performance of the Queueing Network AnalyzerBell System Technical Journal, 1983
- The Queueing Network AnalyzerBell System Technical Journal, 1983
- The Effect of Interstage Buffer Storage on the Output of Two Unreliable Production Units in Series, with Different Production RatesA I I E Transactions, 1979
- AUTOMATIC TRANSFER LINES WITH BUFFER STOCKSInternational Journal of Production Research, 1967