Demir L.Diamantidis A.Eliiyi Türsel, DenizO'Kelly M.E.J.Papadopoulos C.T.Tsadiras A.K.Tunali S.2023-06-162023-06-1620139.78E+121474-6670https://doi.org/10.3182/20130619-3-RU-3018.00345https://hdl.handle.net/20.500.14365/3757et al.;for Management and Control;IFAC Technical Committee 3.2 on Computational;Intelligence in Control;International Federation of Automatic Control (IFAC) -;Technical Committee 5.2 - Manufacturing Modelling7th IFAC Conference on Manufacturing Modelling, Management, and Control, MIM 2013 -- 19 June 2013 through 21 June 2013 -- Saint Petersburg -- 99324This 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.eninfo:eu-repo/semantics/closedAccessAlgorithmsBuffer storageDesignOptimization problemsProduction linesSearch methodsAlgorithmsDesignLearning algorithmsManufactureTabu searchAdaptive tabu searchDecomposition algorithmDistributed serviceMaximum through-putMeasures of performanceOptimization problemsProduction lineSearch methodBuffer storageConference Object10.3182/20130619-3-RU-3018.003452-s2.0-84884336460