Abstract

We address the problem of scheduling twin automated stacking cranes (ASCs) used in automated container terminals. By extending the previous works, we show that it is important to make explicit the hidden jobs needed to prepare for the main requested jobs. Since the preparatory jobs can be done by any of the two ASCs, appropriate assignment of these jobs can help to promote cooperation and avoid interference between the two ASCs. The proposed genetic algorithm (GA) performs search within the framework of iterative rescheduling to cope with the uncertainty of ASC operation. To boost the search performance under tight real-time constraint of iterative rescheduling, our GA uses some of the solutions of the previous iteration to initialize the population of the current iteration. It has also been shown that our GA performs more robustly than other algorithm such as simulated annealing in an uncertain environment.

Full Text
Paper version not known

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 call

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.