Demir, LeylaTunali, SemraEliiyi Türsel, DenizLokketangen, Arne2023-06-162023-06-1620130305-05481873-765Xhttps://doi.org/10.1016/j.cor.2013.02.004https://hdl.handle.net/20.500.14365/1155This paper presents an integrated approach to solve the buffer allocation problem in unreliable production lines so as to maximize the throughput rate of the line with minimum total buffer size. The proposed integrated approach has two control loops; the inner loop and the outer loop. While the inner loop control includes an adaptive tabu search algorithm proposed by Demir et al. [8], binary search and tabu search are proposed for the outer loop. These nested loops aim at minimizing the total buffer size to achieve the desired throughput level. To improve the efficiency of the proposed tabu search, alternative neighborhood generation mechanisms are developed. The performances of the proposed algorithms are evaluated by extensive computational experimentation, and the results are reported. (C) 2013 Elsevier Ltd. All rights reserved.eninfo:eu-repo/semantics/closedAccessBuffer allocation problemProduction linesTabu searchCombinatorial optimizationSerial Production LinesTabu Search ApproachAlgorithmOptimizationCapacityDesignSizeMachinesSpaceTwo Approaches for Solving the Buffer Allocation Problem in Unreliable Production LinesArticle10.1016/j.cor.2013.02.0042-s2.0-84879064396