Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14365/2830
Title: An integrated binary-tabu search approach for the buffer allocation problem: An industrial case study
Authors: Demir, Leyla
Kose, Simge Yelkenci
Tunali, Semra
Eliiyi Türsel, Deniz
Keywords: buffer allocation problem
simulation
tabu search
combinatorial optimization
Reliable Production Lines
Assembly Systems
Unreliable Machines
Selecting Machines
Optimization
Performance
Throughput
Algorithms
Networks
Design
Publisher: Dime Univ Genoa
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
URI: https://hdl.handle.net/20.500.14365/2830
ISBN: 978-88-97999-01-0
978-88-97999-09-6
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File SizeFormat 
2012.pdf
  Restricted Access
577.15 kBAdobe PDFView/Open    Request a copy
Show full item record



CORE Recommender

Page view(s)

64
checked on Nov 18, 2024

Download(s)

6
checked on Nov 18, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.