A heuristic algorithm to allocate shifts

In this paper we present an heuristic algorithm for the optimal solution of a problem of shifts allocation. We illustrate an instrument which is very easy to use, with a large applicability field and with a low computational difficulty. We have tested it for the problem of check-in at Milano-Linate airport. Computational results indicate that the algorithm is not only effective, but it is also very efficient since it enables considerable savings for the firm.