A set-processing algorithm for scheduling staff on 4-day or 3-day work weeks
From MaRDI portal
Publication:4248933
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(199812)45:8<839::AID-NAV5>3.0.CO;2-R" /><839::AID-NAV5>3.0.CO;2-R 10.1002/(SICI)1520-6750(199812)45:8<839::AID-NAV5>3.0.CO;2-RzbMath0940.90028OpenAlexW2034830769MaRDI QIDQ4248933
L. Douglas Smith, Rangarajan Narasimhan, R. N. Burns
Publication date: 10 June 1999
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199812)45:8<839::aid-nav5>3.0.co;2-r
Related Items (7)
A dynamic programming algorithm for days-off scheduling with sequence dependent labor costs ⋮ Efficient shift scheduling in the retail sector through two-stage optimization ⋮ A resource type analysis of the integrated project scheduling and personnel staffing problem ⋮ Shift rostering using decomposition: assign weekend shifts first ⋮ A Novel Approach for the Nurse Scheduling Problem ⋮ Designing an annual leave scheduling policy: case of a financial center ⋮ Staffing geographically distributed service facilities with itinerant personnel
This page was built for publication: A set-processing algorithm for scheduling staff on 4-day or 3-day work weeks
