Approximation schemes for parallel machine scheduling problems with controllable processing times.
Klaus JansenMonaldo MastrolilliPublished in: Comput. Oper. Res. (2004)
Keyphrases
- approximation schemes
- single machine
- parallel machine scheduling problem
- total weighted tardiness
- scheduling problem
- maximum lateness
- release dates
- sequence dependent setup times
- approximation algorithms
- processing times
- np hard
- numerical methods
- single machine scheduling problem
- setup times
- parallel machines
- bin packing
- flowshop
- lower and upper bounds
- genetic algorithm
- multistage
- tabu search
- special case