Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness.
Tatsushi NishiYuichiro HiranakaMasahiro InuiguchiPublished in: Comput. Oper. Res. (2010)
Keyphrases
- weighted tardiness
- lagrangian relaxation
- single machine scheduling problem
- setup times
- flowshop scheduling problems
- flowshop
- flowshop scheduling
- scheduling problem
- branch and bound algorithm
- feasible solution
- integer programming
- sequence dependent setup times
- lower bound
- dynamic programming
- np hard
- tabu search
- linear programming
- column generation
- lower and upper bounds
- release dates
- single machine
- mixed integer programming
- special case
- processing times
- minimize total
- shortest path
- valid inequalities
- genetic algorithm
- single server
- precedence constraints
- multi objective
- parallel machines
- neural network
- upper bound
- computational complexity