Off-Day Scheduling with Hierarchical Worker Categories

Hamilton Emmons and Richard N. Burns
Additional contact information
Hamilton Emmons: Case Western Reserve University, Cleveland, Ohio
Richard N. Burns: Queen's University, Kingston, Ontario, Canada

Operations Research, 1991, vol. 39, issue 3, 484-495

Abstract: A work force includes workers of m types. The worker categories are ordered, with type-1 workers the most highly qualified, type-2 the next, and so on. If the need arises, a type- k worker is able to substitute for a worker of any type j > k ( k = 1, …, m − 1). For 7-day-a-week operation, daily requirements are for at least D k workers of type- k or better, of which at least d k must be precisely type- k . Formulas are given to find the smallest number and most economical mix of workers, assuming that each worker must have 2 off-days per week and a given fraction of weekends off. Algorithms are presented which generate a feasible schedule, and provide work stretches between 2 and 5 days, and consecutive weekdays off when on duty for 2 weekends in a row, without additional staff.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.39.3.484 (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:39:y:1991:i:3:p:484-495

Access Statistics for this article

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