Approximability of single machine scheduling with fixed jobs to minimize total completion time.
Jinjiang YuanY. X. LinC. T. NgT. C. Edwin ChengPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- minimize total
- single machine
- release dates
- precedence constraints
- deteriorating jobs
- processing times
- single machine scheduling problem
- parallel machines
- weighted tardiness
- approximation algorithms
- scheduling problem
- completion times
- maximum lateness
- total cost
- sequence dependent setup times
- release times
- branch and bound algorithm
- setup times
- np hard
- special case
- global constraints