Dual Decomposition of Single Machine Scheduling Problems.
Steef L. van de VeldePublished in: IPCO (1990)
Keyphrases
- single machine scheduling problem
- dual decomposition
- lagrangian relaxation
- branch and bound algorithm
- integer programming
- feasible solution
- dynamic programming
- energy minimization
- lower bound
- np hard
- linear programming
- column generation
- map inference
- lower and upper bounds
- processing times
- markov random field
- optimal solution
- single machine
- shortest path
- combinatorial optimization
- markov logic
- precedence constraints
- branch and bound
- graphical models
- mixed integer programming
- multi class
- search algorithm
- scheduling problem
- upper bound
- max margin
- solution quality
- resource consumption
- image segmentation
- reinforcement learning