The minimum shift design problem

DOI10.1007/s10479-007-0221-1zbMath1145.90019OpenAlexW2003530823MaRDI QIDQ2468734

Andrea Schaerf, Nysret Musliu, Guy Kortsarz, Johannes Gärtner, Wolfgang Slany, Luca Di Gaspero

Publication date: 25 January 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-007-0221-1

zbMATH Keywords

local searchhybrid algorithmsworkforce schedulinggreedy heuristics

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (10)

Shift Design with Answer Set Programming ⋮ Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder ⋮ A Benders decomposition-based matheuristic for the cardinality constrained shift design problem ⋮ Minimizing average project team size given multi-skilled workers with heterogeneous skill levels ⋮ A multistage approach for an employee timetabling problem with a high diversity of shifts as a solution for a strongly varying workforce demand ⋮ Modeling and solving a real-life multi-skill shift design problem ⋮ Complexity of minimum irreducible infeasible subsystem covers for flow networks ⋮ Minimizing shifts for personnel task scheduling problems: a three-phase algorithm ⋮ A successful three-phase metaheuristic for the shift minimization personal task scheduling problem ⋮ On fixed cost \(k\)-flow problems

Uses Software

• EasyLocal++
• PPRN
• DIMACS
• Tabu search

Cites Work

• An implementation of linear and nonlinear multicommodity network flows
• Efficient generation of rotating workforce schedules
• Local search for shift design.
• Generalized submodular cover problems and applications
• Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
• On the complexity of manpower shift scheduling
• The state of the art of nurse rostering
• Neighborhood portfolio approach for local search applied to timetabling problems
• Optimal Capacity Scheduling—I
• Cyclic Scheduling via Integer Programs with Circular Ones
• On Manpower Scheduling Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The minimum shift design problem