Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems.
Paolo DettiAlessandro AgnetisGianfranco CiaschettiPublished in: J. Sched. (2005)
Keyphrases
- mobile telecommunications
- scheduling problem
- theoretical analysis
- distributed systems
- orders of magnitude
- computational cost
- learning algorithm
- np hard
- management system
- computationally efficient
- significant improvement
- benchmark datasets
- tabu search
- genetic algorithm
- special case
- data mining
- computer systems
- greedy algorithm