Abstract:
This study examines the integrated quay crane assignment and scheduling problem (QCASP) under uncertainty at container terminals. First, a mixed integer linear programming model is formulated to optimally assign and schedule quay cranes to multiple vessels simultaneously. The model derives a baseline schedule that minimises the cost of waiting and departure delays of vessels. However, different disruptions; delays in vessel arrivals and quay crane breakdowns may occur when implementing the baseline schedule. Therefore, a reactive strategy is formulated to generate a reactive reschedule that minimises delays from the baseline schedule when a disruption occurs. The reactive strategy takes the baseline schedule as a reference and derives the reactive schedule by rescheduling only quay cranes. Finally, the accuracy of the model is tested by running small-size problem instances.
