We consider a container terminal operator who faces the problem of constructing a cyclic berth plan. Such a plan defines the arrival and departure times of each cyclically calling vessel on a terminal, taking into account the expected number of containers to be handled and the necessary quay and crane capacity to do so. Conventional berth planning methods ignore the fact that, in practice, container terminal operator and shipping line agree upon an arrival window rather than an arrival time: if a vessel arrives within that window then a certain vessel productivity and hence departure time is guaranteed. The contributions of this paper are twofold. We not only minimize the peak loading of quay cranes in a port, but also explicitly take into account the arrival window agreements between the terminal operator and shipping lines. We present a robust optimization model for cyclic berth planning. Computational results on a real-world scenario for a container terminal in Antwerp show that the robust planning model can reach a substantial reduction in the crane capacity that is necessary to meet the window arrival agreements, as compared to a deterministic planning approach.

No abstract

No abstract

No abstract

No abstract