Off-Day Scheduling with Hierarchical Worker Categories
Hamilton Emmons, Richard N. Burns
Operations Research · 1991 · Volume 39 · Issue 3
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
Enable JavaScript for citation tools and additional paper interactions.