An Integrated Binary-Tabu Search Approach for the Buffer Allocation Problem: An Industrial Case Study

Loading...
Publication Logo

Date

2012

Authors

Tunali, Semra
Eliiyi Türsel, Deniz

Journal Title

Journal ISSN

Volume Title

Publisher

Dime Univ Genoa

Open Access Color

OpenAIRE Downloads

OpenAIRE Views

Research Projects

Journal Issue

Abstract

In this study, an integrated binary-tabu search algorithm is proposed to solve the buffer allocation problem for a real manufacturing system producing heating exchanger in Turkey. The aim is to minimize the total buffer size in the system while improving the system performance. To achieve this objective first the production system is modeled by using simulation. After that the proposed algorithm is employed to find the optimal buffer levels for minimizing the total buffer size in the system. The experimental study shows that proposed algorithm improves the current average daily throughput rate about 31.68%.

Description

24th European Modeling and Simulation Symposium (EMSS) -- SEP 19-21, 2012 -- Vienna, AUSTRIA

Keywords

buffer allocation problem, simulation, tabu search, combinatorial optimization, Reliable Production Lines, Assembly Systems, Unreliable Machines, Selecting Machines, Optimization, Performance, Throughput, Algorithms, Networks, Design

Fields of Science

Citation

WoS Q

N/A

Scopus Q

N/A

Source

24Th European Modelıng And Sımulatıon Symposıum (Emss 2012)

Volume

Issue

Start Page

44

End Page

49
Google Scholar Logo
Google Scholar™

Sustainable Development Goals