Lower bounds for single machine subproblems occurring in weighted tardiness oriented shifting bottleneck procedures.
Roland BrauneGünther ZäpfelMichael AffenzellerPublished in: CISched (2011)
Keyphrases
- weighted tardiness
- single machine
- lower bound
- scheduling problem
- np hard
- lagrangian relaxation
- single machine scheduling problem
- setup times
- minimize total
- branch and bound algorithm
- upper bound
- sequence dependent setup times
- processing times
- release dates
- lower and upper bounds
- objective function
- branch and bound
- dynamic programming
- worst case
- parallel machines
- integer programming
- job shop scheduling problem
- optimal solution
- special case
- precedence constraints
- tabu search
- search space
- constraint satisfaction problems
- global constraints
- linear programming