A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time.
Tianyu WangOdile Bellenguez-MorineauPublished in: J. Sched. (2019)
Keyphrases
- precedence constraints
- complexity analysis
- identical machines
- parallel machines
- scheduling problem
- branch and bound algorithm
- lower bound
- parallel processors
- maximum lateness
- release dates
- precedence relations
- batch processing machines
- sequence dependent setup times
- single machine scheduling problem
- theoretical analysis
- shared memory
- approximation algorithms
- vertex cover
- processing times
- partial order
- single machine
- partially ordered
- setup times
- completion times
- total tardiness
- scheduling jobs
- parallel computing
- flowshop
- unit length
- identical parallel machines
- partially ordered sets
- series parallel
- computational complexity
- np hard
- global constraints
- branch and bound
- upper bound
- genetic algorithm
- artificial intelligence
- first order logic
- knowledge representation
- optimal solution
- knowledge base
- release times
- combinatorial optimization
- message passing
- lagrangian relaxation