Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic
DOI10.1007/s10951-014-0383-zzbMath1312.90020OpenAlexW1994932061MaRDI QIDQ2341394
Publication date: 24 April 2015
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-014-0383-z
integer programmingtabu searchshift schedulinghybrid heuristicmulti-activity contextheterogeneous workforcemulti-day planning horizon
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (11)
Cites Work
- Using Benders decomposition to implicitly model tour scheduling
- A \texttt{cost-regular} based hybrid column generation approach
- Implicit shift scheduling with multiple breaks and work stretch duration restrictions
- A large neighbourhood search approach to the multi-activity shift scheduling problem
- Staff scheduling and rostering: a review of applications, methods and models.
- A comparative evaluation of modeling approaches to the labor shift scheduling problem
- Formal languages for integer programming modeling of shift scheduling problems
- Grammar-Based Integer Programming Models for Multi-Activity Shift Scheduling
- Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling
- Modeling the Regular Constraint with Integer Programming
- Constraint Programming Based Column Generation for Employee Timetabling
- Unnamed Item
This page was built for publication: Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic