Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
