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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.