A Method of Quay Crane Scheduling For Container Terminals

Abstract

This paper discusses the problem of allocating and scheduling quay cranes (QCs). The problem is decomposed into two sub problems. One is QCs-allocation problem, the other is QCs-scheduling problem. The objective is to find an optimal QCs-to-tasks matching and the QCs’ work sequence so as to ensure the synchronous among QCs and then maximizes container terminal’s throughput ultimately. And then for solving the QCs-scheduling model, a novel search methodology based on heuristic rule-modules with different priority is studied. Through experiments the decision-making system for QCs allocating and scheduling is proved efficient and applied.