This paper presents an integrated approach to solve the buffer allocation problem in unreliable production lines so as to maximize the throughput rate of the line with minimum total buffer size. The proposed integrated approach has two control loops; the inner loop and the outer loop. While the inner loop control includes an adaptive tabu search algorithm proposed by Demir et al. [8], binary search and tabu search are proposed for the outer loop. These nested loops aim at minimizing the total buffer size to achieve the desired throughput level. To improve the efficiency of the proposed tabu search, alternative neighborhood generation mechanisms are developed. The performances of the proposed algorithms are evaluated by extensive computation...
In this study, an integrated binary-tabu search algorithm is proposed to solve the buffer allocation...
The Buffer Allocation Problem is a well-known optimization problem aiming at determining the optimal...
The buffer allocation problem, i.e. how much buffer storage to allow and where to place the buffer, ...
This paper presents an integrated approach to solve the buffer allocation problem in unreliable prod...
The buffer allocation problem, i.e. how much buffer storage to allow and where to place it within th...
The optimal allocation of buffers is an important research issue in designing production lines. In t...
The buffer allocation problem, i.e. how much buffer storage to allow and where to place it within th...
The design of a production line directly affects the system performance which is usually measured by...
In production lines, buffers function as a means to decouple stations, which reduce the effect that ...
This paper investigates the performance of three search algorithms: Myopic Algorithm, Adaptive Tabu ...
The buffer allocation problem (BAP) is one of the major optimisation problems faced by production sy...
The optimal allocation of buffers is an important research issue in designing production lines. The ...
Efficient heuristic algorithms are developed for the buffer allocation in a production line so as to...
The buffer allocation problem (BAP) aims to determine the optimal buffer configuration for a product...
The buffer allocation problem is an NP-hard combinatorial optimization problem and it is an importan...
In this study, an integrated binary-tabu search algorithm is proposed to solve the buffer allocation...
The Buffer Allocation Problem is a well-known optimization problem aiming at determining the optimal...
The buffer allocation problem, i.e. how much buffer storage to allow and where to place the buffer, ...
This paper presents an integrated approach to solve the buffer allocation problem in unreliable prod...
The buffer allocation problem, i.e. how much buffer storage to allow and where to place it within th...
The optimal allocation of buffers is an important research issue in designing production lines. In t...
The buffer allocation problem, i.e. how much buffer storage to allow and where to place it within th...
The design of a production line directly affects the system performance which is usually measured by...
In production lines, buffers function as a means to decouple stations, which reduce the effect that ...
This paper investigates the performance of three search algorithms: Myopic Algorithm, Adaptive Tabu ...
The buffer allocation problem (BAP) is one of the major optimisation problems faced by production sy...
The optimal allocation of buffers is an important research issue in designing production lines. The ...
Efficient heuristic algorithms are developed for the buffer allocation in a production line so as to...
The buffer allocation problem (BAP) aims to determine the optimal buffer configuration for a product...
The buffer allocation problem is an NP-hard combinatorial optimization problem and it is an importan...
In this study, an integrated binary-tabu search algorithm is proposed to solve the buffer allocation...
The Buffer Allocation Problem is a well-known optimization problem aiming at determining the optimal...
The buffer allocation problem, i.e. how much buffer storage to allow and where to place the buffer, ...