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

Authors: Leyla Demir; Alexandros C. Diamantidis; Deniz Türsel Eliiyi; M.E.J. O'Kelly; Semra Tunali

Addresses: Department of Industrial Engineering, Pamukkale University, Denizli, Turkey ' Department of Economics, Aristotle University of Thessaloniki, Thessaloniki, Greece ' Department of Industrial Engineering, Yaşar University, Izmir, Turkey ' Clen Jing Ltd., Princethorpe, UK ' Department of Business Administration, Izmir University of Economics, Izmir, Turkey

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.

DOI: 10.1504/IJISE.2019.102473

International Journal of Industrial and Systems Engineering, 2019 Vol.33 No.2, pp.252 - 270

Received: 23 Aug 2017
Accepted: 18 Feb 2018
Published online: 27 Sep 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article