A class of manpower scheduling problems

In this paper we formulate a mathematical programming model for solving a class of manpower scheduling problems. The objective is to assign working schedules to a fixed number of employees in order to meet the workforce demand, assumed to be constant over the planning period. Necessary and sufficient conditions of existence of the solution are stated, heuristic methods are presented and the results of computational experiences are reported.