Worst-case analysis of LPT scheduling on a small number of non-identical processors.
Takuto MitsunobuReiji SudaVorapong SuppakitpaisarnPublished in: Inf. Process. Lett. (2024)
Keyphrases
- worst case analysis
- worst case
- small number
- average case
- parallel processors
- list scheduling
- scheduling problem
- communication delays
- multiprocessor systems
- np hard
- parallel algorithm
- parallel machines
- upper bound
- lower bound
- np hardness
- approximation algorithms
- greedy algorithm
- greedy heuristic
- special case
- machine learning
- training examples
- computational complexity