Abstract
This paper addresses cyclic scheduling of multiple hoists in a no-wait electroplating line with constant processing times. The objective is to minimize the cycle time. or equivalently maximizing the production throughput, for a given number of hoists. The problem is first formulated as a set of prohibited intervals for the cycle time. We then prove that the optimal cycle time is necessarily one of special values of the cycle time, and thus reduce the problem to a feasibility-checking problem for a given value of the cycle time. We show that the latter problem can be transformed to a longest path problem in a directed graph. The complete algorithm is shown to be polynomial in the number of tanks in an electroplating line.
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.
