Local search and lower bounds for the patient admission scheduling problem.
Sara CeschiaAndrea SchaerfPublished in: Comput. Oper. Res. (2011)
Keyphrases
- knapsack problem
- lower bound
- np hard
- scheduling problem
- optimal solution
- tabu search
- intensive care
- job shop scheduling problem
- emergency department
- upper bound
- branch and bound algorithm
- branch and bound
- patient data
- single machine
- objective function
- precedence constraints
- approximation algorithms
- flowshop
- worst case
- memetic algorithm
- setup times
- lower and upper bounds
- metaheuristic
- search space
- quadratic assignment problem
- permutation flowshop
- randomly generated test problems
- processing times
- integer programming
- clinical data
- genetic algorithm
- feasible solution
- search algorithm
- parallel machines
- strongly np hard
- decision support system
- constraint satisfaction problems
- admission control
- combinatorial optimization
- simulated annealing
- health care
- max sat
- clinical trials
- stochastic local search
- lagrangian relaxation
- vc dimension
- vital signs
- min sum
- search procedure
- global search