Το work with title Optimal rate allocation in unreliable, assembly/disassembly production networks with blocking by Kouikoglou Vasilis is licensed under Creative Commons Attribution 4.0 International
Bibliographic Citation
V. S. Kouikoglou, "Optimal rate allocation in unreliable, assembly/disassembly production networks with blocking," Robotics and Automation, IEEE Transactions on, vol.16, no. 4, pp. 429 - 434, 2000, doi: 10.1109/70.864238
https://doi.org/10.1109/70.864238
We consider finite-buffered production networks, in which each machine is capable of performing a single assembly and/or disassembly operation and it is subject of operation-dependent failures. We address the problem of allocating processing and repair rates to each machine so as to maximize the throughput of the system. This problem is shown to be equivalent to a convex minimization problem. The optimal allocation is found using a steepest-descent algorithm that employs discrete-event simulation for performance evaluation and gradient estimation