Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Optimal rate allocation in unreliable, assembly/disassembly production networks with blocking

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Kouikoglou, Vassilis S. ; Dept. of Production Eng. & Manage., Tech. Univ. of Crete, Chania, Greece

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

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:16 ,  Issue: 4 )