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 journalArticle

33 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
Externally publishedYes

Fingerprint

Buffer Allocation
Production Line
Dynamic programming
Dynamic Programming
Throughput
Performance Evaluation
Aggregation
Agglomeration
Numerical Results
Line

ASJC Scopus subject areas

  • Engineering(all)

Cite this

@article{c6b809894a094dad86fad318deb634cb,
title = "A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines",
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.",
author = "Diamantidis, {A. C.} and Papadopoulos, {C. T.}",
year = "2004",
month = "9",
day = "15",
doi = "10.1155/S1024123X04402014",
language = "English",
volume = "2004",
pages = "209--223",
journal = "Mathematical Problems in Engineering",
issn = "1024-123X",
publisher = "Hindawi Publishing Corporation",
number = "3",

}

TY - JOUR

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

AU - Diamantidis, A. C.

AU - Papadopoulos, C. T.

PY - 2004/9/15

Y1 - 2004/9/15

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

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

UR - http://www.scopus.com/inward/record.url?scp=10844258811&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=10844258811&partnerID=8YFLogxK

U2 - 10.1155/S1024123X04402014

DO - 10.1155/S1024123X04402014

M3 - Article

VL - 2004

SP - 209

EP - 223

JO - Mathematical Problems in Engineering

JF - Mathematical Problems in Engineering

SN - 1024-123X

IS - 3

ER -