The Integrated Yard Truck and Yard Crane Scheduling and Storage Allocation Problem at Container Terminals

摘要

The storage block allocation, the yard truck and yard crane scheduling are three separate sub-problems in container terminals, playing an important role in the efficiency of port discharging operations. This paper proposes an integer programming model considering these three problems as a whole. The objective is to minimize the time when all the unloading operations have been completed and all containers have been stacked at storage block. A Local Sequence-Cut (LSC) method is developed to solve the problem.