Yard crane scheduling with reshuffles in an import container block

Abstract : This paper studies the yard crane scheduling problem to minimize the maximum tardiness of tasks in an import container block, in which two yard cranes process both storage and retrieval tasks simultaneously. Since reshuffle is common in the process of retrieval tasks, we focus on the scenario with reshuffle operations for retrieval tasks, and the constraint of inter-crane interference is involved. An integer linear programming model is established, and a genetic algorithm is developed to solve the problem.