Abstract

Abstract A day-off scheduling problem is analyzed, in which the objective is to minimize the total workforce size necessary to meet a given daily requirement for staff and subject to constraints involving frequency of weekends off and length of work tours. By exploring special structure in the problem, we deduce a flexible, modular technique for building optimal schedules.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call