Off-Day Scheduling with Hierarchical Worker Categories

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 greater than k (k = 1, ..., m - 1). For 7-day-a-week operation, daily requirements are for at least Dk workers of type-k or better, of which at least dk 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.

Cite this work

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

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

Papers that cite the same references — the relational fallback while embeddings are still backfilling.