A fixed-parameter algorithm for a unit-execution-time unit-communication-time tasks scheduling problem with a limited number of identical processors.
Alix Munier KordonNing TangPublished in: RAIRO Oper. Res. (2022)
Keyphrases
- np hard
- computational complexity
- preprocessing
- times faster
- learning algorithm
- dynamic programming
- detection algorithm
- space complexity
- memory requirements
- scheduling problem
- similarity measure
- execution times
- path planning
- matching algorithm
- simulated annealing
- probabilistic model
- search algorithm
- convergence rate
- expectation maximization
- optimization algorithm
- worst case
- cost function
- k means
- communication cost
- optimal solution
- objective function