An improved Lagrangian relaxation heuristic for the scheduling problem of operating theatres.
Bing-Hai ZhouMeng YinZhiqiang LuPublished in: Comput. Ind. Eng. (2016)
Keyphrases
- lagrangian relaxation
- scheduling problem
- randomly generated test problems
- np hard
- setup times
- total weighted tardiness
- feasible solution
- tabu search
- integer programming
- lower bound
- dominance rules
- branch and bound algorithm
- dynamic programming
- lower and upper bounds
- column generation
- mixed integer programming
- linear programming
- single machine
- flowshop
- np complete
- multidimensional knapsack problem
- optimal solution
- network design problem
- relaxation algorithm
- dual decomposition
- precedence constraints
- mixed integer program
- upper bound
- single machine scheduling problem
- approximation algorithms
- job shop scheduling problem
- shortest path
- lagrangian heuristic
- lagrangian dual
- valid inequalities
- mixed integer
- parallel machines
- processing times
- simulated annealing
- special case
- computational complexity
- sequence dependent setup times
- cutting plane algorithm
- linear program
- maximum lateness
- metaheuristic
- genetic algorithm
- neural network