A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process.
Kun MaoQuan-Ke PanXinfu PangTianyou ChaiPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- scheduling problem
- flowshop
- setup times
- total weighted tardiness
- lagrangian relaxation
- np hard
- single machine
- processing times
- minimizing makespan
- randomly generated test problems
- total tardiness
- bicriteria
- tabu search
- maximum lateness
- flowshop scheduling
- sequence dependent setup times
- parallel machines
- makespan minimization
- job shop
- total flowtime
- single machine scheduling problem
- integer programming
- lower bound
- special case
- release dates
- lot sizing
- precedence constraints
- job shop scheduling problem
- column generation