An actor-critic algorithm with deep double recurrent agents to solve the job shop scheduling problem.
Marta MonaciValerio AgasucciGiorgio GraniPublished in: CoRR (2021)
Keyphrases
- job shop scheduling problem
- benchmark problems
- cost function
- actor critic
- simulated annealing
- learning algorithm
- memetic algorithm
- optimization algorithm
- np hard
- computational complexity
- multi agent
- objective function
- search space
- monte carlo
- reinforcement learning
- k means
- dynamic programming
- scheduling problem
- tabu search
- knapsack problem
- gradient method
- neural network