Preemptive and Non-preemptive On-line Algorithms for Scheduling with Rejection on Two Uniform Machines.
György DósaYong HePublished in: Computing (2006)
Keyphrases
- scheduling problem
- scheduling algorithm
- parallel machines
- computational efficiency
- recently developed
- lower bound
- single machine
- learning algorithm
- data structure
- parallel processors
- computational complexity
- computational cost
- data sets
- times faster
- computationally efficient
- priority queue
- computationally expensive
- np hard
- search algorithm
- machine learning