Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization
DOI10.1016/J.COR.2009.06.016zbMath1175.90145OpenAlexW2012199358MaRDI QIDQ1040957
A. Zeblah, Y. Massim, Farouk Yalaoui, Lionel Amodeo, Eric Châtelet
Publication date: 27 November 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.06.016
Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Production theory, theory of the firm (91B38) Inventory, storage, reservoirs (90B05) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (6)
Cites Work
- Asymptotic behavior of the expansion method for open finite queueing networks
- Efficient algorithms for buffer space allocation
- A simulated annealing approach for buffer allocation in reliable production lines
- Application of immune algorithms on solving minimum-cost problem of water distribution network
- Buffer allocation in general single-server queueing networks
- An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
- Scheduling manufacturing systems with work-in-process inventory control: multiple-part-type systems
- Performance Evaluation of Production Lines with Random Processing Times, Multiple Failure Modes and Finite Buffer Capacity — Part II: The Decomposition
- On Decomposition Methods for Tandem Queueing Networks with Blocking
- Influence of Storage Bin Capacity on the Average Standstill Time of a Production Line
This page was built for publication: Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization