An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines

Demir L., TUNALI S., Eliiyi D. T.

COMPUTERS & OPERATIONS RESEARCH, cilt.39, sa.7, ss.1477-1486, 2012 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 39 Sayı: 7
  • Basım Tarihi: 2012
  • Doi Numarası: 10.1016/j.cor.2011.08.019
  • Dergi Adı: COMPUTERS & OPERATIONS RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1477-1486
  • Anahtar Kelimeler: Buffer allocation problem, Production lines, Tabu search, Combinatorial optimization, SERIAL PRODUCTION LINES, QUEUING-NETWORKS, MEMORY-SEARCH, ALGORITHM, MACHINES, OPTIMIZATION, STORAGE, SYSTEMS, DESIGN, SPACE
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

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, a novel adaptive tabu search approach is proposed for solving buffer allocation problem in unreliable and non-homogeneous production lines. The objective is to maximize the throughput of the line, which is constrained by the capacity of each buffer space and also the total buffer capacity to allocate to these spaces. Besides proposing a new strategy to tune the parameters of tabu search adaptively during the search, an experimental study is carried out to select an intelligent initial solution scheme among three alternatives so as to decrease the search effort to obtain the best solutions. The performance of the proposed approach is evaluated by computational tests and very promising results are obtained. (C) 2011 Elsevier Ltd. All rights reserved.