The State of the Art on Buffer Allocation Problem: a Comprehensive Survey
Loading...
Files
Date
2014
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
The buffer allocation problem is an NP-hard combinatorial optimization problem and it is an important research issue in designing manufacturing systems. The problem deals with finding optimal buffer sizes to be allocated into buffer areas in a production system to achieve a specific objective. This paper presents a comprehensive survey on buffer allocation problem in production systems. To provide a systematic review of current relevant research, first studies are grouped in two categories: 1. Reliable production lines, 2. Unreliable production lines. Next, the studies in each group are reviewed based on topology of the production line, the solution methodologies suggested and the objective function employed. The aim of this review is twofold. First, it provides an overview of recent advances in the field in order to highlight the new trends in solution methodology. Second, it presents ideas for future research by identifying gaps in the current literature.
Description
Keywords
Buffer allocation problem, Production systems, Combinatorial optimization, Serial Production Lines, Tabu Search Approach, Preventive Maintenance, Heuristic Algorithm, Selecting Machines, Production Systems, Genetic Algorithm, Assembly Systems, Capacity, Design
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
125
Source
Journal of Intellıgent Manufacturıng
Volume
25
Issue
3
Start Page
371
End Page
392
PlumX Metrics
Citations
CrossRef : 57
Scopus : 149
Captures
Mendeley Readers : 115
SCOPUS™ Citations
149
checked on Mar 15, 2026
Web of Science™ Citations
117
checked on Mar 15, 2026
Page Views
3
checked on Mar 15, 2026
Google Scholar™


