A note on a single machine scheduling problem with generalized total tardiness objective function.
Evgeny R. GafarovAlexander A. LazarevFrank WernerPublished in: Inf. Process. Lett. (2012)
Keyphrases
- total tardiness
- single machine scheduling problem
- sequence dependent setup times
- objective function
- single machine
- branch and bound algorithm
- release dates
- setup times
- lower bound
- scheduling problem
- processing times
- precedence constraints
- release times
- optimal solution
- combinatorial optimization
- optimization problems
- lagrangian relaxation
- cost function
- multi objective
- weighted sum
- parallel machines
- branch and bound
- upper bound
- resource consumption
- completion times
- np hard
- linear program
- response time
- special case