A set‐processing algorithm for scheduling staff on 4‐day or 3‐day work weeks

Richard N. Burns, Rangarajan Narasimhan and L. Douglas Smith

Naval Research Logistics (NRL), 1998, vol. 45, issue 8, 839-853

Abstract: This paper presents an efficient algorithm for scheduling a single‐category work force on 4‐day or 3‐day work weeks. Employees work 4 or 3 days each week, have A out of every B weekends off, and work no more than 5 consecutive days in a work stretch on 4‐day work weeks and no more than 4 days in a work stretch on 3‐day work weeks. Such conditions often prevail in 7‐day‐a‐week organizations such as hospitals, manufacturing plants, and retail stores. We determine the minimum number of workers required to satisfy the scheduling constraints under any pattern of daily requirements. Then we present the algorithm for assigning days off for each worker, thereby determining the work schedules. We show that the algorithm, by construction, will necessarily satisfy the scheduling constraints. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 839–853, 1998

Date: 1998
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/(SICI)1520-6750(199812)45:83.0.CO;2-R

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:wly:navres:v:45:y:1998:i:8:p:839-853

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().