Rıhtım vinci çizelgeleme problemi için kısıt programlama yaklaşımı

Minimizing the average vessel berthing time is one of the challenges for container terminals. Since containers are deployed from vessels by a quay crane, operations of this huge equipment may cause a bottleneck for the overall performance of a terminal. This study examines the quay crane scheduling problem (QCSP) at the seaside of container terminals. The QCSP requires completion of all loading and unloading operations of a berthed vessel. A constraint programming (CP) model, which consists of global constraints and propositional logic, is constructed by taking numerous properties of the problem such as safety margins, travel times and precedence relations into account. The performance of the proposed CP model is compared with algorithms presented in recent QCSP literature. The result from the computational experiments indicates that the proposed CP model is able to produce good results for the QCSP while reducing the computational time. Lastly, to show the robustness and the flexibility of the proposed model, extensions of the problem with ready times and time windows are also discussed.