A Lagrangian relaxation based approach to schedule asset overhaul and repair services.
Peter B. LuhDanqing YuSada SoorapanthAlexander I. KhibnikRavi RajamaniPublished in: IEEE Trans Autom. Sci. Eng. (2005)
Keyphrases
- lagrangian relaxation
- single machine scheduling problem
- integer programming
- feasible solution
- branch and bound algorithm
- lower bound
- column generation
- linear programming
- np hard
- scheduling problem
- dynamic programming
- total weighted tardiness
- lower and upper bounds
- dual decomposition
- capacity constraints
- lagrangian heuristic
- relaxation algorithm
- mixed integer program
- network design problem
- mixed integer linear programs
- preventive maintenance
- subgradient method
- tabu search
- multidimensional knapsack problem
- single machine
- repair actions
- cutting plane algorithm
- optimal solution
- valid inequalities
- branch and bound
- combinatorial optimization