On Approximating a Scheduling Problem.
Pierluigi CrescenziXiaotie DengChristos H. PapadimitriouPublished in: J. Comb. Optim. (2001)
Keyphrases
- scheduling problem
- single machine
- flowshop
- minimizing makespan
- np hard
- earliness tardiness
- precedence constraints
- setup times
- processing times
- parallel machines
- tabu search
- permutation flowshop
- machine learning
- job shop scheduling problem
- limited capacity
- unrelated parallel machines
- neural network
- approximation algorithms
- computational complexity
- sequence dependent setup times
- learning algorithm