Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

Figure 1

An example of the solution representation with 3-berth and 15-ship.