A dynamic programming algorithm for days-off scheduling with sequence dependent labor costs

DOI10.1007/s10951-007-0040-xzbMath1168.90435OpenAlexW2152562335MaRDI QIDQ835588

Hesham K. Alfares, Moustafa Elshafei

Publication date: 28 August 2009

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-007-0040-x

zbMATH Keywords

optimizationdynamic programminglabor schedulingcompressed workweek

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (8)

Optimum workforce scheduling for multiple security gates ⋮ A resource type analysis of the integrated project scheduling and personnel staffing problem ⋮ A note on a single-shift days-off scheduling problem with sequence-dependent labor costs ⋮ Solving shift scheduling problem with days-off preference for power station workers using binary integer goal programming model ⋮ Shift rostering using decomposition: assign weekend shifts first ⋮ Minimizing shifts for personnel task scheduling problems: a three-phase algorithm ⋮ Optimal Maintenance Scheduling of N-Vehicles with Time-Varying Reward Functions and Constrained Maintenance Decisions ⋮ Designing an annual leave scheduling policy: case of a financial center

Cites Work

• An acyclic days-off scheduling problem
• Staff scheduling and rostering: a review of applications, methods and models.
• A case study of single shift planning and scheduling under annualized hours: a simple three-step approach.
• Models and algorithms for a staff scheduling problem
• Integer programming to schedule a hierarchical workforce with variable demands
• Sufficient Working Subsets for the Tour Scheduling Problem
• A set-processing algorithm for scheduling staff on 4-day or 3-day work weeks

This page was built for publication: A dynamic programming algorithm for days-off scheduling with sequence dependent labor costs