Complexity Results for Scheduling Tasks with Discrete Starting Times.
Kazuo NakajimaS. Louis HakimiPublished in: J. Algorithms (1982)
Keyphrases
- round robin
- computational grids
- state space
- orders of magnitude
- resource allocation
- scheduling algorithm
- dynamic scheduling
- computational complexity
- special case
- scheduling problem
- robotic systems
- discrete space
- resource requirements
- data mining
- flexible manufacturing systems
- space complexity
- objective function
- multiscale