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

Table 1

Information of 3 berths.

1	12	300
2	12	300
3	12	300