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

DOI10.1007/S10951-007-0040-XMaRDI QIDQ835588zbMATH OpenOpenAlexFDO

Authors Moustafa Elshafei, Hesham K. Alfares

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)

Recommendations

• A note on a single-shift days-off scheduling problem with sequence-dependent labor costs
• Efficient optimization of cyclic labor days-off scheduling
• An efficient two-phase algorithm for cyclic days-off scheduling.
• An acyclic days-off scheduling problem
• Integer programming models for hierarchical workforce scheduling problems including excess off-days and idle labour times
• A sequential integer programming method for discontinuous labor tour scheduling
• Optimum workforce scheduling under the (14, 21) days-off timetable
• Dynamic programming algorithm for a FMS scheduling problem
• Single-shift off-day scheduling of a hierarchical workforce with variable demands
• Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks

Cites work

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

Cited in

(9)

• Solving shift scheduling problem with days-off preference for power station workers using binary integer goal programming model
• A note on a single-shift days-off scheduling problem with sequence-dependent labor costs
• Bounded flexibility in days-on and days-off scheduling
• Optimal maintenance scheduling of \(N\)-vehicles with time-varying reward functions and constrained maintenance decisions
• A resource type analysis of the integrated project scheduling and personnel staffing problem
• Minimizing shifts for personnel task scheduling problems: a three-phase algorithm
• Shift rostering using decomposition: assign weekend shifts first
• Designing an annual leave scheduling policy: case of a financial center
• Optimum workforce scheduling for multiple security gates

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835588)