The performances of quay cranes and stacking cranes are critical to the overall throughput of a container terminal and so there are a lot of research studying the schedule of quay cranes and stacking cranes to increase the throughput or minimize the completion time. There are various studies on the operations of stacking cranes and different algorithms and heuristics have been proposed. However, there are few studies on the scheduling of ASC with non-crossing constraints in an automatic terminal. In this study, an integer programming has been proposed to solve the problem of loading export or transshipment-out container with a given sequence optimally. As it is impractical to use IP to solve the problem within a reasonable time, a dynamic programming formulation has been proposed to get...[ Read more ]

The performances of quay cranes and stacking cranes are critical to the overall throughput of a container terminal and so there are a lot of research studying the schedule of quay cranes and stacking cranes to increase the throughput or minimize the completion time. There are various studies on the operations of stacking cranes and different algorithms and heuristics have been proposed. However, there are few studies on the scheduling of ASC with non-crossing constraints in an automatic terminal. In this study, an integer programming has been proposed to solve the problem of loading export or transshipment-out container with a given sequence optimally. As it is impractical to use IP to solve the problem within a reasonable time, a dynamic programming formulation has been proposed to get satisfying results in a reasonable time. An extension to the problem has also been studied to make good use of the formulation.