Demir L.Tunali S.Eliiyi Türsel, Deniz2023-06-162023-06-1620109.79E+120305-0548https://hdl.handle.net/20.500.14365/397824th Mini EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector, MEC EurOPT 2010 -- 23 June 2010 through 26 June 2010 -- Izmir -- 106702The buffer allocation problem, i.e. how much buffer storage to allow and where to place it within the line, is an important research issue in designing production lines. In this study, buffer allocation problem is solved for unreliable non-homogeneous production lines. The objective is to maximize the throughput of the line under buffer capacity constraints. To evaluate the throughput of the line the decomposition method is employed. An adaptive tabu search approach is proposed to optimize the buffer sizes for each location. The performance of the proposed approach is evaluated by the computational tests. © Izmir University of Economics, Turkey, 2010.eninfo:eu-repo/semantics/closedAccessAdaptive tabu searchBuffer allocation problemCombinatorial optimizationProduction linesCombinatorial optimizationAdaptive tabu searchAdaptive tabu search approachBuffer allocationBuffer capacityComputational testsDecomposition methodsNon-homogeneousProduction lineOptimizationConference Object10.1016/j.cor.2011.08.0192-s2.0-84901390365