Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem

Abstract EN

Decision makers must face the dynamism and uncertainty of real-world environments when they need to solve the scheduling problems.

Different incidences or breakdowns, for example, initial data could change or some resources could become unavailable, may eventually cause the infeasibility of the obtained schedule.

To overcome this issue, a robust model and a proactive approach are presented for scheduling problems without any previous knowledge about incidences.

This paper is based on proportionally distributing operational buffers among the tasks.

In this paper, we consider the berth allocation problem and the quay crane assignment problem as a representative example of scheduling problems.

The dynamism and uncertainty are managed by assessing the robustness of the schedules.

The robustness is introduced by means of operational buffer times to absorb those unknown incidences or breakdowns.

Therefore, this problem becomes a multiobjective combinatorial optimization problem that aims to minimize the total service time, to maximize the buffer times, and to minimize the standard deviation of the buffer times.

To this end, a mathematical model and a new hybrid multiobjective metaheuristic is presented and compared with two well-known multiobjective genetic algorithms: NSGAII and SPEA2+.