An Adaptive Tabu Search Approach for Buffer Allocation Problem in Unreliable Non-Homogenous Production Lines
Loading...
Files
Date
2012
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Pergamon-Elsevier Science Ltd
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
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.
Description
Keywords
Buffer allocation problem, Production lines, Tabu search, Combinatorial optimization, Serial Production Lines, Queuing-Networks, Memory-Search, Algorithm, Machines, Optimization, Storage, Systems, Design, Space, Deterministic scheduling theory in operations research, tabu search, combinatorial optimization, buffer allocation problem, production lines
Fields of Science
0209 industrial biotechnology, 0211 other engineering and technologies, 02 engineering and technology
Citation
WoS Q
Q1
Scopus Q
Q1

OpenCitations Citation Count
43
Source
Computers & Operatıons Research
Volume
39
Issue
7
Start Page
1477
End Page
1486
PlumX Metrics
Citations
CrossRef : 25
Scopus : 56
Captures
Mendeley Readers : 41
SCOPUS™ Citations
56
checked on Feb 24, 2026
Web of Science™ Citations
45
checked on Feb 24, 2026
Page Views
4
checked on Feb 24, 2026
Google Scholar™


