.png){kind=icon}
Return
A new method for solving buffer allocation problem in large unbalanced production lines
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2019.1685709.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Solving the buffer allocation problem (BAP) in long production lines is difficult because it is an NP-hard problem. In this paper, we propose a new approach to solve the BAP for long series-parallel unbalanced production lines with the objective of minimising the average work-in-process subject to a throughput rate constraint. Instead of directly optimising a long line, this method decomposes the original long line into several small decoupled subsystems and adds relation condition variables between the subsystems. After several iterations between subsystem optimisation and condition updating, this method can obtain the optimal or near-optimal solution of the original system with a significantly improved computational efficiency. Extensive numerical experiments demonstrate the accuracy and efficiency of this approach. Finally, several examples and a multi-factorial experimental analysis are provided to show the influence of the decomposition strategy, initial values, and parameters of the target systems on the performance of the proposed method.
Keywords:
buffer allocation problem
series-parallel production lines
unbalanced lines
decomposition-coordination
unsaturated supply
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
Exposure 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
OAAIShareSaveShareSaveA parallel tabu search for solving the primal buffer allocation problem in serial production systemsOAAI
OAAIShareSaveShareSave
View more