A novel probabilistic approximate subgradient method in Lagrangian Relaxation for flow-shop scheduling problems.
Lei ShiYongheng JiangDexian HuangPublished in: ICCA (2013)
Keyphrases
- lagrangian relaxation
- subgradient method
- scheduling problem
- flowshop
- np hard
- setup times
- total weighted tardiness
- integer programming
- feasible solution
- tabu search
- branch and bound algorithm
- lower bound
- linear programming
- single machine
- column generation
- optimal solution
- sequence dependent setup times
- lagrangian dual
- special case
- lower and upper bounds
- dynamic programming
- mixed integer programming
- maximum lateness
- processing times
- optimization problems
- single machine scheduling problem
- knapsack problem
- constraint satisfaction problems
- approximation algorithms
- parallel machines
- upper bound
- cutting plane
- vehicle routing problem