A Modular Approach to Optimal Multiple-Shift Manpower Scheduling

Abstract

This paper introduces a practical approach to multiple-shift manpower scheduling by presenting an algorithm that applies the approach to a large and common class of problems. The algorithm constructs schedules that utilize no more than the minimum number of workers necessary for a schedule satisfying constraints that include two offdays each week, a specified number of offweekends in any fixed number of consecutive weekends, a maximum of six consecutive work shifts and different staffing demands for each type of shift. We discuss the application of the approach to several other classes of manpower scheduling problems.

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 — 64 citations exist upstream.

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