A theoretical framework to accelerate scheduling improvement heuristics using a new longest path algorithm in perturbed DAGs.
Golshan MadrakiSeyedamirabbas MousavianYasamin SalmaniPublished in: Int. J. Prod. Res. (2023)
Keyphrases
- theoretical framework
- computational complexity
- significant improvement
- detection algorithm
- conceptual framework
- probabilistic model
- objective function
- learning algorithm
- dynamic programming
- theoretical foundation
- expectation maximization
- simulated annealing
- np hard
- k means
- optimal solution
- worst case
- evolutionary algorithm
- lower bound
- list scheduling