An effective MCTS-based algorithm for minimizing makespan in dynamic flexible job shop scheduling problem.
Kexin LiQianwang DengLike ZhangQing FanGuiliang GongSun DingPublished in: Comput. Ind. Eng. (2021)
Keyphrases
- detection algorithm
- optimization algorithm
- linear programming
- learning algorithm
- computational complexity
- preprocessing
- multi objective
- cost function
- np hard
- probabilistic model
- worst case
- computationally efficient
- simulated annealing
- monte carlo
- genetic algorithm
- search space
- graphical models
- dynamic programming
- k means
- combinatorial optimization
- benchmark problems
- solution quality
- job shop scheduling problem
- shortest path problem