Review Article
Comprehensive Review on Divisible Load Theory: Concepts, Strategies, and Approaches
Table 3
Comparing the algorithm applied for divisible load scheduling.
| Algorithm | Advantages | Disadvantages | Approach | Reference |
| CDLT, IDLT, and TDP | Flexible | Complexity | Programming | [124] |
| Tractable recursive linear equation | Convergence | Complexity | Mathematical | [112, 131] |
| Linear programming | Convergence | NP-hard | Mathematical | [112] |
| Branch and bound | No limitation | NP-hard | Mathematical | [64] |
| Greedy algorithm | Certainty | Np-hard | Heuristics | [20] |
| Genetic algorithm | Fast | Divergence | Evolutionary heuristics | [68, 76] |
| Game theory | Truthful | Divergence | Heuristics | [62, 63] |
| Mixed integer linear programming | Certainty | Complexity | Mathematical | [76] |
|
|