Approximation Schemes for Scheduling Jobs with Chain Precedence Constraints.
Klaus JansenRoberto Solis-ObaPublished in: Int. J. Found. Comput. Sci. (2010)
Keyphrases
- precedence constraints
- approximation schemes
- scheduling jobs
- approximation algorithms
- release dates
- parallel machines
- scheduling problem
- partially ordered sets
- single machine
- processing times
- identical machines
- np hard
- sequence dependent setup times
- single machine scheduling problem
- release times
- identical parallel machines
- setup times
- special case
- branch and bound algorithm
- production system
- worst case
- parallel computing
- numerical methods
- single server
- shared memory
- higher order
- tabu search
- partial order
- partially ordered
- flowshop
- polynomial time approximation
- bin packing
- global constraints