Lagrangian relaxation neural networks for job shop scheduling.
Peter B. LuhXing ZhaoYajun WangLakshman S. ThakurPublished in: IEEE Trans. Robotics Autom. (2000)
Keyphrases
- job shop scheduling
- lagrangian relaxation
- neural network
- integer programming
- scheduling problem
- np hard
- job shop scheduling problem
- lower bound
- lower and upper bounds
- branch and bound algorithm
- job shop
- linear programming
- column generation
- feasible solution
- dynamic programming
- dual decomposition
- combinatorial optimization problems
- genetic algorithm
- resource constraints
- artificial neural networks
- relaxation algorithm
- lagrangian heuristic
- fuzzy logic
- subgradient method
- shortest path
- simulated annealing
- special case
- evolutionary algorithm
- cutting plane algorithm
- ant colony optimization
- knapsack problem
- clustering method
- computational intelligence
- optimal solution