Scheduling tasks with precedence constraints on multiple servers.
Ramtin PedarsaniJean C. WalrandYuan ZhongPublished in: Allerton (2014)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- parallel machines
- release dates
- parallel processors
- maximum lateness
- single machine scheduling problem
- vertex cover
- approximation algorithms
- sequence dependent setup times
- unit length
- partially ordered
- series parallel
- partial order
- lower bound
- single machine
- np hard
- round robin
- flowshop
- resource allocation
- setup times
- identical machines
- search algorithm
- global constraints
- combinatorial optimization