HBBA: hybrid algorithm for buffer allocation in tandem production lines |
| |
Authors: | Alexandre Dolgui Anton V. Eremeev Viatcheslav S. Sigaev |
| |
Affiliation: | (1) Division for Industrial Engineering and Computer Science, Ecole des Mines de Saint Etienne, 158, Cours Fauriel, 42023 Saint-Etienne Cedex 2, France;(2) Discrete Optimization Laboratory, Omsk Branch of Sobolev Institute of Mathematics, Omsk, Russia;(3) Department of Mathematics, Omsk State University, Omsk, Russia |
| |
Abstract: | In this paper, we consider the problem of buffer space allocation for a tandem production line with unreliable machines. This problem has various formulations all aiming to answer the question: how much buffer storage to allocate between the processing stations? Many authors use the knapsack-type formulation of this problem. We investigate the problem with a broader statement. The criterion depends on the average steady-state production rate of the line and the buffer equipment acquisition cost. We evaluate black-box complexity of this problem and propose a hybrid optimization algorithm (HBBA), combining the genetic and branch-and-bound approaches. HBBA is excellent in computational time. HBBA uses a Markov model aggregation technique for goal function evaluation. Nevertheless, HBBA is more general and can be used with other production rate evaluation techniques. |
| |
Keywords: | Production line Buffer allocation NP completeness Black-box complexity Genetic algorithm Branch-and-Bound method Hybrid algorithm |
本文献已被 SpringerLink 等数据库收录! |
|