A More Efficient lagrangian Relaxation Approach to Job-Shop Scheduling Problems.
Haoxun ChenChengbin ChuJean-Marie ProthPublished in: ICRA (1995)
Keyphrases
- lagrangian relaxation
- job shop scheduling problem
- integer programming
- job shop scheduling
- branch and bound algorithm
- dynamic programming
- linear programming
- np hard
- feasible solution
- column generation
- benchmark problems
- dual decomposition
- lagrangian heuristic
- shortest path
- memetic algorithm
- particle swarm algorithm