Dual decomposition of a single-machine scheduling problem.
Steef L. van de VeldePublished in: Math. Program. (1995)
Keyphrases
- single machine scheduling problem
- dual decomposition
- lagrangian relaxation
- branch and bound algorithm
- integer programming
- map inference
- lower bound
- energy minimization
- feasible solution
- np hard
- linear programming
- column generation
- dynamic programming
- lower and upper bounds
- markov random field
- single machine
- mixed integer programming
- lp relaxation
- processing times
- markov logic
- graphical models
- scheduling problem
- valid inequalities
- graph cuts
- genetic algorithm
- tabu search
- higher order
- upper bound