Abstract
In this study, we develop effective optimization algorithms for solving the problem of cyclic scheduling of a multi-stage robotic processing line with two distinct parts and time window constraints. This problem in the literature is known as hoist scheduling problem. To our knowledge, most existing optimization algorithms for the hoist scheduling problem handle the case with identical parts. We present a formal analysis on the hoist scheduling problem with non-identical parts. The results are then used to develop new branching and bounding schemes to be used in the search process for optimal schedules. A proposed branch-and-bound algorithm is evaluated using both known benchmark problems as well as randomly generated test problems. A potential extension to the cases with arbitrary number of distinct parts is also discussed.
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 callMore From: INFOR: Information Systems and Operational Research
Disclaimer: 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.
