A Recursive Optimization Approach for Buffer Allocation in Large Production Lines

Buffer allocation is a critical issue in the design stage of manufacturing systems, as buffer capacities may have a great impact on system performance. In this paper, we consider the problem of minimizing the total buffer capacity of a flow line to achieve a desired production rate. A recursive optimization approach is proposed to solve the problem in large production lines. Instead of optimizing a long line directly, the proposed approach decomposes it into two sub-lines, optimizes them recursively, and combines their solutions to find the optimal buffer distribution of the original line. Two different recursive algorithms are developed and their performance is demonstrated by comparing them with a gradient search algorithm. The numerical results show that the recursive algorithms are almost as accurate as the gradient algorithm, but much more efficient, especially for large production lines.

Authors

Institutions

Publication Details

Journal
Applied Sciences
Published
2024-10-31
DOI
https://doi.org/10.3390/app14219953
Citations
3
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
1.05

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Recursive Optimization Approach for Buffer Allocation in Large Production Lines

Jian Zhou, Li Lei, Menggao Dong
3 citations
Applied Sciences
Scheduling and Optimization Algorithms
1.05
article

A Recursive Optimization Approach for Buffer Allocation in Large Production Lines

Jian Zhou, Li Lei, Menggao Dong
article en
3 citations

Abstract

Buffer allocation is a critical issue in the design stage of manufacturing systems, as buffer capacities may have a great impact on system performance. In this paper, we consider the problem of minimizing the total buffer capacity of a flow line to achieve a desired production rate. A recursive optimization approach is proposed to solve the problem in large production lines. Instead of optimizing a long line directly, the proposed approach decomposes it into two sub-lines, optimizes them recursively, and combines their solutions to find the optimal buffer distribution of the original line. Two different recursive algorithms are developed and their performance is demonstrated by comparing them with a gradient search algorithm. The numerical results show that the recursive algorithms are almost as accurate as the gradient algorithm, but much more efficient, especially for large production lines.

Applied SciencesVol. 14(21)
National University of Defense Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 20%
Scheduling and Optimization Algorithms
1.05
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.