A Modular Approach to Optimal Multiple-Shift Manpower Scheduling

This paper introduces a practical approach to multiple-shift manpower scheduling by presenting an algorithm that applies the approach to a large and common class of problems. The algorithm constructs schedules that utilize no more than the minimum number of workers necessary for a schedule satisfying constraints that include two offdays each week, a specified number of offweekends in any fixed number of consecutive weekends, a maximum of six consecutive work shifts and different staffing demands for each type of shift. We discuss the application of the approach to several other classes of manpower scheduling problems.