Simple Approaches to Shift, Days-Off and Tour Scheduling Problems

Abstract

Shift and days-off scheduling problems have received much attention in the literature of integer programming approaches to workforce scheduling. A typical managerial use would be to schedule full-time employees to minimize the number of labor hours while satisfying variable workforce requirements of a service delivery system. We present computational experience to show that an easily implemented application of linear programming frequently produces optimal solutions to these problems. When the context progresses toward a continuous operating environment (service delivery over 24 hours a day, 7 days a week) we stress the need to shed the myopic views of the shift and days-off scheduling formulations in favor of an integrative tour scheduling formulation. For this problem we observe that a simple heuristic initiated by rounding down the associated LP solution consistently produces near optimal solutions. This observation is based on experiments over varying workforce requirement patterns.

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

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