Abstract
In this paper, we address the quay crane scheduling problem in maritime container terminals, with some new features on the machine environment. We consider rail-mounted cranes and we assume that they are not allowed to span all over the vessel and that they can work only in predefined time windows. We furthermore take into account one-way constraints on the crane movements. We present a mixed integer mathematical model and a heuristic algorithm to get feasible solutions to the problem. Finally, we report on some computational experience.
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 callMore From: International Journal of Shipping and Transport Logistics
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.
