Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach

D. Michael Warner
Additional contact information
D. Michael Warner: Duke University, Durham, North Carolina

Operations Research, 1976, vol. 24, issue 5, 842-856

Abstract: This paper describes a nurse scheduling system, the heart of which poses the scheduling decision as a large multiple-choice programming problem whose objective function quantifies preferences of individual nursing personnel concerning length of work stretch, rotation patterns, and requests for days off. The constraints provide for minimum numbers of nursing personnel of each skill class to be assigned to each day and shift of a four- or six-week scheduling period. The problem is solved by a modification of Balintfy and Blackburn's algorithm for multiple-choice programming problems. We include a description of the implementation of the scheduling system on nursing units of several hospitals.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (40)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.24.5.842 (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:oropre:v:24:y:1976:i:5:p:842-856

Access Statistics for this article

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