Referenced Items are not available for this document.
The paper proposes an algorithm for generating optimal cyclic schedules of hoist moves in a printed circuit board electroplating facility where transportation of parts between workstations is performed by a computer-controlled hoist. The objective of the scheduling problem is to maximize the throughput rate. Unlike many previous algorithms which consider 1-part cyclic schedules, the proposed algorithm provides an exact solution for the more complicated case of r-part cyclic schedules where r>1. The algorithm is illustrated with numerical examples comparing 1-part and multiple-part optimal schedules
Published in:
Robotics and Automation, IEEE Transactions on
(Volume:15
,
Issue:
4
)
Date of Publication: Aug 1999
- Page(s):
- 704 - 713
- ISSN :
- 1042-296X
- INSPEC Accession Number:
- 6343830
- Digital Object Identifier :
- 10.1109/70.781993
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Aug 1999
- 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.
