Referenced Items are not available for this document.
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
)
Date of Publication: Aug 2000
- Page(s):
- 429 - 434
- ISSN :
- 1042-296X
- INSPEC Accession Number:
- 6701205
- Digital Object Identifier :
- 10.1109/70.864238
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Aug 2000
- Sponsored by :
- IEEE Robotics and Automation Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
