A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines

A. C. Diamantidis, C. T. Papadopoulos

Research output: Contribution to journalArticlepeer-review

37 Citations (Scopus)

Abstract

In this study, the buffer allocation problem (BAP) in homogeneous, asymptotically reliable serial production lines is considered. A known aggregation method, given by Lim, Meerkov, and Top (1990), for the performance evaluation (i.e., estimation of through-put) of this type of production lines when the buffer allocation is known, is used as an evaluative method in conjunction with a newly developed dynamic programming (DP) algorithm for the BAP. The proposed algorithm is applied to production lines where the number of machines is varying from four up to a hundred machines. The proposed algorithm is fast because it reduces the volume of computations by rejecting allocations that do not lead to maximization of the line's throughput. Numerical results are also given for large production lines.

Original languageEnglish
Pages (from-to)209-223
Number of pages15
JournalMathematical Problems in Engineering
Volume2004
Issue number3
DOIs
Publication statusPublished - Sep 15 2004

ASJC Scopus subject areas

  • Mathematics(all)
  • Engineering(all)

Fingerprint Dive into the research topics of 'A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines'. Together they form a unique fingerprint.

Cite this