Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements

A simple algorithm is developed for the problem of assigning days off to full-time staff given a cyclic seven-day demand pattern. The formulation assumes that employees are entitled to two consecutive days off each week and that the objective is to find a minimum staff size capable of meeting the requirements. The algorithm involves only hand calculations, and its computing effort is predictable.

• 저널Management Science · 20(12) · 1561–1568
• 토픽Scheduling and Timetabling Solutions · Management Science and Operations Research
• DOI10.1287/mnsc.20.12.1561
• 저자Kenneth R. Baker