Keywords: Quay crane assignment Quay crane scheduling Genetic algorithms Integrated models a b s t r a c t This paper presents a new approach to analyze the integrated quay crane assignment and scheduling problem (QCASP). The problem determines the assignment of quay cranes to vessels and the sequence of tasks to be processed by each quay crane simultaneously, and accounts for important conside...

The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel, in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained between them. The productivity of contai...

We consider a port consisting of a cluster of inter-related terminals, where container vessels arrive cyclically. The problem is to strategically assign a terminal and a time interval of berthing to each of the vessels in the cycle. Restricting properties are terminal quay lengths and quay crane capacity. Conflicting objectives are i) minimizing the number of required quay cranes, ii) minimizin...