Article1974

Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements

112 citations0/0 files storedManagement Science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Scheduling and Timetabling Solutions Healthcare Operations and Scheduling Optimization Optimization and Mathematical Programming

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.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 112 citations exist upstream.

Cited by

2000Hybrid optimization techniques for the workshift and rest assignment of nursing personnel 1985Integrated days off and shift personnel scheduling 2007Solving the multi-objective nurse scheduling problem with a weighted cost function 1990A network model for the rotating workforce scheduling problem 1991Tour Scheduling and Task Assignment of a Heterogeneous Work Force: A Heuristic Approach 1977Workforce Scheduling with Cyclic Demands and Day-Off Constraints 1987Cyclic nurse scheduling 1992A heuristic procedure for the crew rostering problem

Imported from OpenAlex (CC0) — nothing here is generated.