An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective.
Roland BrauneGünther ZäpfelMichael AffenzellerPublished in: Eur. J. Oper. Res. (2012)
Keyphrases
- total weighted tardiness
- single machine
- completion times
- processing times
- maximum lateness
- scheduling problem
- release times
- single machine scheduling problem
- release dates
- scheduling jobs
- lagrangian relaxation
- sequence dependent setup times
- makespan minimization
- flowshop
- job shop
- deteriorating jobs
- np hard
- dynamic programming
- resource consumption
- shortest processing time
- setup times
- production scheduling
- job shop scheduling problem
- tardiness cost
- branch and bound algorithm
- tabu search
- lower bound
- job shop scheduling
- lower and upper bounds
- column generation
- integer programming
- hybrid algorithm
- optimization problems
- search space