A rotation-based branch-and-price approach for the nurse scheduling problem.
Antoine LegrainJérémy OmerSamuel RosatPublished in: Math. Program. Comput. (2020)
Keyphrases
- scheduling problem
- single machine
- flowshop
- np hard
- processing times
- tabu search
- health care
- minimizing makespan
- setup times
- total tardiness
- permutation flowshop
- earliness tardiness
- parallel machines
- invariant features
- maximum lateness
- precedence constraints
- unrelated parallel machines
- rotation invariant
- list scheduling
- medical care
- job shop scheduling problem
- release dates
- search space