Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements
- 1 August 1974
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 20 (12) , 1561-1568
- https://doi.org/10.1287/mnsc.20.12.1561
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: