A dynamic programming algorithm for the bufferallocation problem in homogeneous asymptotically reliable serial production lines
A. C. Diamantidis, C. T. Papadopoulos
Source record
Source: Crossref
Published: Jan 1, 2004
DOI: 10.1155/s1024123x04402014
Open original source ↗Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.