New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks.
Enrico AngelelliMaria Grazia SperanzaZsolt TuzaPublished in: Discret. Math. Theor. Comput. Sci. (2006)
Keyphrases
- upper bound
- worst case
- upper and lower bounds
- lower bound
- lower and upper bounds
- learning algorithm
- orders of magnitude
- computationally efficient
- theoretical analysis
- parallel processors
- parallel processing
- response time
- scheduling problem
- np hard
- significant improvement
- computational complexity
- data structure
- genetic algorithm
- machine learning algorithms
- approximation algorithms
- data mining tasks
- theoretical guarantees
- linear functions
- multiprocessor systems