Work Force Size and Single Shift Schedules with Variable Demands

R. N. Burns and M. W. Carter
Additional contact information
R. N. Burns: School of Business, Queen's University, Kingston, Ontario, Canada K7L 3N6
M. W. Carter: School of Business, Queen's University, Kingston, Ontario, Canada K7L 3N6

Management Science, 1985, vol. 31, issue 5, 599-607

Abstract: In recent years, labour negotiations for seven-day-week organizations such as hospitals, mining companies and chemical industries have seen an increased emphasis on improving shift schedules. This paper gives an exact lower bound on the number of workers required to satisfy such primary contractual commitments as ensuring that each employee receives at least A out of every B weekends off, everyone works exactly five days per week, and no one works more than six consecutive days. The model addressed is general in that it allows the number of workers required each day to vary. The proof that the bound is the best possible is constructive. A linear time algorithm is presented that generates schedules satisfying all the primary objectives. Extensions discuss means of incorporating secondary objectives such as giving pairs of adjacent days off.

Keywords: labor; organizational studies: manpower planning; production/scheduling (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (26)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.31.5.599 (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:31:y:1985:i:5:p:599-607

Access Statistics for this article

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