The minimum shift design problem

DOI10.1007/S10479-007-0221-1MaRDI QIDQ2468734zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• The minimum shift design problem: theory and practice
• Local search for shift design.
• Modeling and solving a real-life multi-skill shift design problem
• Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic
• On the complexity of manpower shift scheduling

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1016966 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 1487883 (Why is no real title available?)
• scientific article; zbMATH DE number 1559563 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• An implementation of linear and nonlinear multicommodity network flows
• Cyclic Scheduling via Integer Programs with Circular Ones
• Efficient generation of rotating workforce schedules
• Generalized submodular cover problems and applications
• Local search for shift design.
• Neighborhood portfolio approach for local search applied to timetabling problems
• Network flows. Theory, algorithms, and applications.
• On Manpower Scheduling Algorithms
• On the complexity of manpower shift scheduling
• Optimal Capacity Scheduling—I
• Rota: A research project on algorithms for workforce scheduling and shift design optimization
• Stochastic local search. Foundations and applications.
• The state of the art of nurse rostering
• Towards a characterisation of the behaviour of stochastic local search algorithms for SAT

Cited in

(12)

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

Describes a project that uses

Uses Software

• Tabu search
• DIMACS
• PPRN
• EasyLocal++

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

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