Human resources management at a marine container terminal

We consider the manpower planning problem in the real context of a marine container terminal. The main features of this problem are the uncertainty of workforce demand and the need of ensuring a time continuous efficiency of the terminal, which enforces to decompose the problem into two phases: a long-period planning first and then a daily planning. We propose mathematical programming models for both problems and suitably tailor them to the container terminal at the Gioia Tauro port. We derive solution algorithms by exploiting the mathematical properties of the models: a heuristic approach to a set-covering type problem for the long-term planing, and a branch-and-bound algorithm for the short-term planning. Finally, we report computational results on some rel instances.