Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Annals of Operations Research - Special issue on Tabu search
Manufacturing flow line systems: a review of models and analytical results
Queueing Systems: Theory and Applications - Special issue on queueing models of manufacturing systems
Tabu Search
Optimal buffer allocation of serial production lines with quality inspection machines
Computers and Industrial Engineering
INFORMS Journal on Computing
Adaptive memory search for multidemand multidimensional knapsack problems
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Buffer allocation in general single-server queueing networks
Computers and Operations Research
Buffer size design linked to reliability performance: A simulative study
Computers and Industrial Engineering
Effect of solution representations on Tabu search in scheduling applications
Computers and Operations Research
Computers and Industrial Engineering
Hi-index | 0.01 |
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.