Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one.
Evgeny R. GafarovAlexander A. LazarevFrank WernerPublished in: Ann. Oper. Res. (2012)
Keyphrases
- single machine
- total tardiness
- competitive ratio
- dynamic programming
- scheduling problem
- total weighted tardiness
- processing times
- objective function
- sequence dependent setup times
- optimal solution
- setup times
- linear programming
- np hard
- computational complexity
- hybrid algorithm
- branch and bound
- search procedure
- simulated annealing
- worst case