Link scheduling in polynomial time.
Bruce E. HajekGalen H. SasakiPublished in: IEEE Trans. Inf. Theory (1988)
Keyphrases
- scheduling problem
- special case
- scheduling algorithm
- resource allocation
- worst case
- computational complexity
- project scheduling
- flow control
- approximation algorithms
- np hardness
- scheduling strategy
- minimize total
- flexible manufacturing systems
- round robin
- link structure
- resource constraints
- response time
- parallel machines
- parallel processors
- single machine
- np hard
- bounded treewidth
- evolutionary algorithm
- information retrieval