The Time complexity of Scheduling Interval Orders with Communication Is Polynomial.
Hesham H. AliHesham El-RewiniPublished in: Parallel Process. Lett. (1993)
Keyphrases
- flow control
- vapnik chervonenkis dimension
- communication systems
- space complexity
- polynomial hierarchy
- round robin
- scheduling algorithm
- communication networks
- resource allocation
- decision problems
- polynomial size
- information systems
- resource constraints
- resource constrained
- worst case
- upper bound
- flexible manufacturing systems
- resource requirements
- exponential size
- scheduling problem
- computational cost