A Successive Lagrangian Relaxation Method for Solving Flowshop Scheduling Problems with Total Weighted Tardiness.
Tatsushi NishiYuichiro HiranakaMasahiro InuiguchiPublished in: CASE (2007)
Keyphrases
- total weighted tardiness
- flowshop scheduling problems
- lagrangian relaxation
- flowshop
- flowshop scheduling
- scheduling problem
- single machine
- sequence dependent setup times
- job shop
- integer programming
- linear programming
- parallel machines
- feasible solution
- processing times
- special case
- column generation
- job shop scheduling problem
- dynamic programming
- precedence constraints
- branch and bound algorithm
- single machine scheduling problem
- strongly np hard
- np hard
- setup times
- combinatorial optimization
- production scheduling
- variable neighborhood search
- integer program
- resource constrained
- optimal solution
- lower bound
- computational complexity