Abstract

The buffer allocation problem (BAP) is one of the major optimisation problems faced by production system designers. BAP is widely studied in the literature since buffers have a great impact on efficiency of production lines. This paper deals with buffer allocation problem and compares the performance of three heuristic search algorithms, namely myopic algorithm (MA), degraded ceiling (DC), and adaptive tabu search (ATS) with respect to both throughput maximisation and also computational time. To generalise experimental findings the experiments have been conducted both for reliable and also unreliable serial production lines over various sizes of problem instances. It is hoped that the findings of this research study can serve as a guideline for the decision makers while designing and operating production lines.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.