Column generation for sequence dependent flowshop scheduling to minimize the total weighted tardiness.
Tatsushi NishiYukinori IsoyaMasahiro InuiguchiPublished in: SMC (2011)
Keyphrases
- column generation
- flowshop scheduling
- weighted tardiness
- flowshop
- setup times
- single machine scheduling problem
- lagrangian relaxation
- scheduling problem
- single machine
- branch and bound
- linear programming
- sequence dependent setup times
- minimize total
- integer programming
- integer program
- set partitioning
- parallel machines
- linear program
- tabu search
- mixed integer programming
- optimal solution
- constraint programming
- cutting plane
- processing times
- branch and bound algorithm
- special case
- search algorithm
- job shop scheduling problem
- np hard
- computational complexity