A fast algorithm for buffer allocation problem

Abstract

In this paper, we address the problem of seeking optimal buffer configurations in unreliable production lines with the objective of maximising their production rates. A fast algorithm is proposed for solving the problem. The key idea is to decompose a long production line into a set of overlapping three-machine two-buffer systems. The performance of the algorithm is demonstrated by a comparison with the degraded ceiling (DC) algorithm. Numerical results show that the proposed algorithm is almost as accurate as the DC algorithm, but it is much faster, especially for long production lines.

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 — 18 citations exist upstream.

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