Abstract
Abstract Scheduling problems in manufacturing are large and complex, and there are many constraints. Therefore, it is difficult to obtain the optimal solution within a practical time. If it is necessary to avoid interference between cranes in addition to not violating the operational constraints of each machine, it is difficult to obtain the optimal solution to such scheduling problems in a practical time. For this scheduling problem, we propose a new solution algorithm combining scatter search with path relinking and operation simulation. In this paper, we describe previous research, our target process, the new solution algorithm, and discuss algorithm design methods based on numerical experiments.
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.
