A Note on Hardness of Multiprocessor Scheduling with Scheduling Solution Space Tree.
Debasis DwibedyRakesh MohantyPublished in: CoRR (2022)
Keyphrases
- solution space
- simulated annealing
- optimal solution
- search space
- scheduling problem
- feasible solution
- metaheuristic
- exhaustive search
- test functions
- np hard
- premature convergence
- scheduling algorithm
- tree structure
- computational complexity
- round robin
- resource constraints
- phase transition
- parallel machines
- stochastic sampling
- genetic algorithm
- learning theory
- index structure
- tree structures
- binary tree
- candidate solutions
- multiple objectives
- spanning tree
- benchmark problems
- information theoretic
- lower bound
- objective function
- training data