Gantry crane scheduling in intermodal rail-road container terminals

Modern rail-road container terminals serve as important consolidation nodes in intermodal transportation networks where containers are transferred between freight trains and trucks. Among the most important decision problems in these yards is the crane scheduling problem, which decides on the sequences of container moves executed by each of the parallel gantry cranes. This paper treats a rich crane scheduling problem, which considers plenty relevant constraints and is directly applicable in Chinese intermodal terminals. For solving this problem, we propose a fix-and-optimise procedure, which is easy to implement and shown to successfully solve even large-sized instances with 100 container moves in reasonable time.