Local search for shift design.

DOI10.1016/S0377-2217(03)00098-5zbMath1053.90043MaRDI QIDQ1417484

Wolfgang Slany, Nysret Musliu, Andrea Schaerf

Publication date: 5 January 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Tabu searchLocal searchShift designWorkforce scheduling

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Shift Design with Answer Set Programming ⋮ A Benders decomposition-based matheuristic for the cardinality constrained shift design problem ⋮ Generating, scheduling and rostering of shift crew-duties: applications at the Hong Kong international airport ⋮ Personnel scheduling in the call center industry ⋮ A multistage approach for an employee timetabling problem with a high diversity of shifts as a solution for a strongly varying workforce demand ⋮ Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem ⋮ Modeling and solving a real-life multi-skill shift design problem ⋮ The minimum shift design problem ⋮ A successful three-phase metaheuristic for the shift minimization personal task scheduling problem ⋮ Solving the general employee scheduling problem

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Efficient generation of rotating workforce schedules
• A comparative evaluation of modeling approaches to the labor shift scheduling problem
• On the complexity of manpower shift scheduling
• On Manpower Scheduling Algorithms
• Optimal Shift Scheduling with Multiple Break Windows
• Improved Implicit Optimal Modeling of the Labor Shift Scheduling Problem

This page was built for publication: Local search for shift design.