A polynomial algorithm for some preemptive multiprocessor task scheduling problems.
Lukasz KusznerMichal MalafiejskiPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- benchmark problems
- experimental evaluation
- times faster
- test problems
- detection algorithm
- significant improvement
- scheduling algorithm
- segmentation algorithm
- preprocessing
- k means
- optimization algorithm
- np hard
- computational cost
- linear programming
- high accuracy
- iterative algorithms
- decision trees
- matching algorithm
- clustering method
- simulated annealing
- learning algorithm
- cost function
- search space
- computational complexity
- similarity measure
- recognition algorithm
- support vector machine
- average case
- combinatorial optimization
- constraint satisfaction problems
- neural network
- scheduling problem
- multi objective
- data structure
- genetic algorithm