HBBA : Hybrid Algorithm for Buffer Allocation in Tandem Production Lines

Alexandre Dolgui 1 A. Eremeev V.S. Sigaev
1 Laboratoire en Sciences et Technologies de l'Information
MSGI-ENSMSE - Département Méthodes Scientifiques pour la Gestion Industrielle
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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00387662
Contributor : Grégory Six <>
Submitted on : Monday, May 25, 2009 - 5:40:56 PM
Last modification on : Thursday, October 17, 2019 - 12:36:37 PM

Links full text

Identifiers

Citation

Alexandre Dolgui, A. Eremeev, V.S. Sigaev. HBBA : Hybrid Algorithm for Buffer Allocation in Tandem Production Lines. Journal of Intelligent Manufacturing, Springer Verlag (Germany), 2007, 18 (3), pp.411-420. ⟨10.1007/s10845-007-0030-z⟩. ⟨hal-00387662⟩

Share

Metrics

Record views

164