Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements

Kenneth R. Baker
Additional contact information
Kenneth R. Baker: Duke University

Management Science, 1974, vol. 20, issue 12, 1561-1568

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.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.20.12.1561 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:20:y:1974:i:12:p:1561-1568

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().