Browsing by Author "Demir L."

Now showing 1 - 2 of 2

Citation - Scopus: 5
An Adaptive Tabu Search Approach for Buffer Allocation Problem in Unreliable Production Lines
(Vilnius Gediminas Technical University, 2010) Demir L.; Tunali S.; Eliiyi Türsel, Deniz
The 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.
Citation - Scopus: 4
A Comparison of Three Search Algorithms for Solving the Buffer Allocation Problem in Reliable Production Lines
(IFAC Secretariat, 2013) Demir L.; Diamantidis A.; Eliiyi Türsel, Deniz; O'Kelly M.E.J.; Papadopoulos C.T.; Tsadiras A.K.; Tunali S.
This paper investigates the performance of three search algorithms: Myopic Algorithm, Adaptive Tabu Search and Degraded Ceiling to solve the buffer allocation problem in reliable production lines. DECO algorithm is used to calculate throughput. This algorithm is a variant of a decomposition algorithm specifically developed to solve large reliable production lines with parallel machines at each workstation and exponentially distributed service times. The measures of performance used are the CPU time required and closeness to the maximum throughput achieved. The three search algorithms are ranked in respect to these two measures and certain findings regarding their performances over the experimental set are given. © IFAC.