.png){kind=icon}
Return
A fast algorithm for buffer allocation problem
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2015.1092612.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
buffer allocation problem
optimisation
unreliable production lines
decomposition method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W
Organization
Cited Papers
ShareSaveExposure of Neonatal Mice to Tobacco Smoke Disturbs Synaptic Proteins and Spatial Learning and Memory from Late Infancy to Early Adulthood.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAIShareSaveShareSaveShareSave
View more