A Quick Heuristic for some Cyclic Staffing Problems with Breaks

In this paper a linear time heuristic for a class of cyclic staffing problems with breaks is described. A novel feature of the heuristic is that the quality of the heuristic solution increases as the requirements for each period become more uniform. As a by-product of this work, a new class of polynomially solvable set-covering problems is identified.