Optimal buffer allocation for serial production lines using heuristic search algorithms: a comparative study

Leyla Demir, Alexandros C. Diamantidis, Deniz Türsel Eliiyi, M.E.J. O'Kelly and Semra Tunali

International Journal of Industrial and Systems Engineering, 2019, vol. 33, issue 2, 252-270

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.

Keywords: production lines; buffer allocation problem; BAP; tabu search; myopic algorithm; degraded ceiling. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=102473 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:33:y:2019:i:2:p:252-270

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().