摘要

This paper investigates the short-term manpower planning problem regarding transhipment container terminals. It consists of determining shifts, tasks and activities of the manpower working in these terminals in order to serve vessels in time intervals, which typically do not overlap with personnel shifts. This complex problem is modelled by an integer linear programming formulation. The optimal solutions of the model are compared with the decisions made in accordance with the manpower policy adopted by a real transhipment container terminal. The experimentation sheds light on when its policy is effective or when there is room for optimisation. The computational tests indicate that the model can be optimally solved even in the case of huge transhipment container terminals.

  • 出版日期2016-7