Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness.
Jeffrey E. SchallerPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- minimize total
- identical parallel machines
- release dates
- single machine
- lower bound
- competitive ratio
- scheduling problem
- single machine scheduling problem
- parallel machines
- branch and bound algorithm
- scheduling jobs
- processing times
- precedence constraints
- strongly np hard
- sequence dependent setup times
- upper bound
- np hard
- branch and bound
- flowshop
- setup times
- lagrangian relaxation
- optimal solution
- lower and upper bounds
- worst case
- resource consumption
- dynamic programming
- single server
- objective function
- online algorithms
- response time
- total cost
- search space
- combinatorial optimization