A berth allocation problem encountered in a Brazilian ore terminal is presented.
Maintenances and extra fees (demurrage) or rewards (despatch) are considered.
A mixed integer linear programming model and real instances are proposed.
An adaptive large neighborhood search (ALNS) heuristic is developed.
Computational experiments indicate that ALNS consistently yields good solutions.