A decomposition-based heuristic for large employee scheduling problems with inter-department transfers.
Dalia AttiaReinhard BürgyGuy DesaulniersFrançois SoumisPublished in: EURO J. Comput. Optim. (2019)
Keyphrases
- scheduling problem
- sequencing problems
- tabu search
- job shop scheduling problem
- list scheduling
- quay crane
- np hard
- processing times
- flowshop
- information systems
- single machine
- graph search
- decomposition method
- strongly np hard
- parallel machine scheduling problem
- squeaky wheel
- case study
- optimal solution
- human resources
- search procedure
- heuristic methods
- decomposition algorithm
- job shop scheduling
- setup times
- dynamic programming
- combinatorial optimization
- simulated annealing
- lower bound
- metaheuristic
- greedy heuristic
- np complete
- minimizing makespan
- search space