Scheduling of Patients in Emergency Departments with a Variable Neighborhood Search.
Thiago Alves de QueirozManuel IoriArthur KramerYong-Hong KuoPublished in: ICVNS (2021)
Keyphrases
- variable neighborhood search
- emergency department
- tabu search
- metaheuristic
- scheduling problem
- single machine scheduling problem
- routing problem
- traveling salesman problem
- heuristic methods
- minimum spanning tree
- scheduling algorithm
- precedence constraints
- hybrid method
- path relinking
- benchmark instances
- search procedure
- vehicle routing problem
- job shop scheduling problem
- neural network
- parallel machines
- resource allocation
- search space
- combinatorial problems
- flowshop
- branch and bound algorithm
- simulated annealing
- np hard
- special case