4.6 Article

A novel algorithm for optimal buffer allocation in automated asynchronous unreliable lines

Journal

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
Volume 122, Issue 11-12, Pages 4405-4419

Publisher

SPRINGER LONDON LTD
DOI: 10.1007/s00170-022-09867-w

Keywords

Buffer allocation; Manufacturing systems; Optimization

Funding

  1. Politecnico di Milano within the CRUI-CARE Agreement

Ask authors/readers for more resources

This study proposes a new algorithm for the buffer allocation problem, which integrates performance evaluation and optimization based on linear approximation. The numerical results show the effectiveness of the proposed method compared to traditional methods. Additionally, an industrial case study incorporating the proposed method into a decision-support system for buffer allocation and reallocation is analyzed.
The Buffer Allocation Problem is a well-known optimization problem aiming at determining the optimal buffer sizes in a manufacturing system composed by various machines decoupled by buffers. This problem still has scientific relevance because of problem complexity and trade-off between conflicting goals. Moreover, it assumes industrial relevance in reconfigurable manufacturing lines, where buffer sizes can be easily adapted to the production scenario. This work proposes a novel algorithm integrating performance evaluation and optimization by means of throughput cuts based on a linear approximation. Numerical results show the validity of the proposed approach with respect to the traditional gradient-based method. Moreover, an industrial case study integrating the proposed approach into a decision-support system for the buffer allocation and reallocation is analyzed.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available