A Lagrangian relaxation approach to job shop scheduling problems.
Debra J. HoitomtPeter B. LuhKrishna R. PattipatiPublished in: ICRA (1990)
Keyphrases
- lagrangian relaxation
- job shop scheduling problem
- feasible solution
- tabu search
- job shop scheduling
- integer programming
- scheduling problem
- particle swarm algorithm
- np hard
- branch and bound algorithm
- lower bound
- simulated annealing
- genetic algorithm
- benchmark problems
- column generation
- dynamic programming
- linear programming
- memetic algorithm
- lower and upper bounds
- combinatorial optimization
- combinatorial optimization problems
- job shop
- metaheuristic
- graph model
- dual decomposition
- branch and bound
- relaxation algorithm
- upper bound
- lagrangian heuristic
- hybrid algorithm
- vehicle routing problem
- shortest path
- optimization problems
- optimal solution
- particle swarm optimisation
- multi objective
- subgradient method