An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents
From MaRDI portal
Publication:6087487
DOI10.1016/j.ejor.2023.07.037arXiv2110.09076OpenAlexW4385431284MaRDI QIDQ6087487
Valerio Agasucci, Marta Monaci, Giorgio Grani
Publication date: 15 November 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.09076
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Supervised sequence labelling with recurrent neural networks.
- An efficient algorithm for the job-shop problem with two jobs
- The complexity of shop-scheduling problems with two or three jobs
- The job shop scheduling problem: Conventional and new solution techniques
- A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
- A branch and bound algorithm for the job-shop scheduling problem
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- The disjunctive graph machine representation of the job shop scheduling problem
- NP-hardness of shop-scheduling problems with three jobs
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- The voice of optimization
- A learning-based algorithm to quickly compute good primal solutions for stochastic integer programs
- Deep learning assisted heuristic tree search for the container pre-marshalling problem
- Benchmarks for basic scheduling problems
- Complexity of shop-scheduling problems with fixed number of jobs: a survey
- A research survey: review of flexible job shop scheduling techniques
- An Algorithm for Solving the Job-Shop Problem
- An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
- A Survey of Scheduling Rules
- Flowshop and Jobshop Schedules: Complexity and Approximation
- The Complexity of Flowshop and Jobshop Scheduling
- Computational Complexity of Discrete Optimization Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- OnActor-Critic Algorithms
- Adaptive scheduling algorithm based on mixed graph model
- Actor-Critic--Type Learning Algorithms for Markov Decision Processes
- Online Mixed-Integer Optimization in Milliseconds
- Dantzig-Wolfe Decomposition for Job Shop Scheduling
- Benchmarking optimization software with performance profiles.
This page was built for publication: An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents
