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

A. C. Diamantidis and C. T. Papadopoulos

Mathematical Problems in Engineering, 2004, vol. 2004, 1-15

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 throughput) 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.

Date: 2004
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2004/259834.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2004/259834.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:259834

DOI: 10.1155/S1024123X04402014

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().