A spatial pyramid pooling-based deep reinforcement learning model for dynamic job-shop scheduling problem
From MaRDI portal
Publication:6068734
DOI10.1016/j.cor.2023.106401OpenAlexW4386057109MaRDI QIDQ6068734
Publication date: 13 November 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2023.106401
dynamic job shop scheduling problemPPOdeep reinforcement learningrandom job arrivalsspatial pyramid pooling networks
Cites Work
- Ant colony optimization combined with taboo search for the job shop scheduling problem
- Benchmarks for shop scheduling problems
- A hybrid metaheuristic algorithm to optimise a real-world robotic cell
- A survey of job shop scheduling problem: the types and models
- Benchmarks for basic scheduling problems
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- A Computational Study of the Job-Shop Scheduling Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: A spatial pyramid pooling-based deep reinforcement learning model for dynamic job-shop scheduling problem