Yard Crane Scheduling with Real-time Reshuffle

Reshuffle operation is common in daily operations of container terminal especially in container yard. It usually occurs in the procedure of processing retrieval containers. However, most research has ignored it while some apply pre-marshalling or treat it as an independent operation with timely repositioning the reshuffle containers. Furthermore, only export containers without considering the impact of storage containers are studied. Therefore, this paper aims to investigate single yard crane scheduling problem with real-time reshuffle. Meanwhile, both storage and retrieval containers with release times and due dates are considered. A nonlinear programming model to minimize the total tardiness of all containers is proposed. Both genetic algorithm and lowest tier method are developed to solve the considered problem. Numerical experiments will be implemented to verify the efficiency and effectiveness of the proposed algorithms.