Computationally efficient approximations for balanced flowlines with finite intermediate buffers

Abstract

SUMMARY 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.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 17 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.