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

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-homog...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & operations research Ročník 39; číslo 7; s. 1477 - 1486
Hlavní autoři: Demir, Leyla, Tunalı, Semra, Eliiyi, Deniz Türsel
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.07.2012
Pergamon Press Inc
Témata:
Allocations
Assembly lines
Assignment problem
Buffer allocation problem
Buffer inventories
Buffers
Combinatorial optimization
Mathematical models
Operations research
Production lines
Searching
Strategy
Studies
Tabu search
Production lines
Tabu search
Combinatorial optimization
Buffer allocation problem
ISSN:0305-0548, 1873-765X, 0305-0548
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2011.08.019