Through the Quay Crane (QC) scheduling process, planners need to find the sequence of ship clusters that each QC will serve and the time schedule for the service, while satisfying various constraints among ship clusters. This paper studies this QC scheduling problem considering interference between QCs, which will cause waste waiting time for QC utilities. We propose a multiobjective genetic algorithm to minimize the turn around time of the container ships and to balance the workloads among Yard Cranes (YCs) at the same time for this NP-complete combinatorial problem. Numerical experiments using practical data is performed to test the performance of the multiobjective genetic algorithm suggested in this study.
展开▼
