Worst-Case Analysis of LPT Scheduling on Small Number of Non-Identical Processors.
Takuto MitsunobuReiji SudaVorapong SuppakitpaisarnPublished in: CoRR (2022)
Keyphrases
- worst case analysis
- worst case
- small number
- average case
- parallel processors
- list scheduling
- scheduling problem
- np hard
- communication delays
- multiprocessor systems
- upper bound
- approximation algorithms
- parallel machines
- greedy algorithm
- parallel algorithm
- lower bound
- greedy heuristic
- np hardness
- training examples
- learning algorithm
- computational complexity
- linear programming relaxation
- tabu search
- training set