Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization

Abstract : Adequate allocation of buffers in transfer lines is crucial to the optimization of line throughput and work in process (WIP) inventory. Their optimal allocation is subject to specific constraints, associated costs, and revenue projections. In this paper, we implement a combined artificial immune system optimization algorithm in conjunction with a decomposition method to optimally allocate buffers in transfer lines. The aim of the buffer allocation problem (BAP) is to achieve optimal system performance under buffers space constraints. Maximizing line throughput does not necessarily achieve maximum profit. In this study the immune decomposition algorithm (IDA) is used to determine optimal buffer allocation for maximum line throughput and maximum line economic profit. Results of extensive series of tests carried out to compare, in production lines with different characteristics, the performances of the proposed method and those of other algorithms are presented.
Document type :
Journal articles
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02308833
Contributor : Jean-Baptiste Vu Van <>
Submitted on : Tuesday, October 8, 2019 - 5:25:39 PM
Last modification on : Wednesday, October 9, 2019 - 1:37:46 AM

Identifiers

Collections

Citation

Yamani Massim, Farouk Yalaoui, Lionel Amodeo, Eric Chatelet, A. Zeblah. Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization. Computers & Operations Research, 2010, 37 (4), pp.611-620. ⟨10.1016/j.cor.2009.06.016⟩. ⟨hal-02308833⟩

Share

Metrics

Record views

3