Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach
From MaRDI portal
Publication:6109307
DOI10.1016/J.COR.2022.106095OpenAlexW4309879851MaRDI QIDQ6109307
No author found.
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.106095
temporal differencelong short-term memorydeep reinforcement learningnon-permutation flow-shop scheduling problem
Related Items (2)
Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II ⋮ Robustness evaluation of trust and reputation systems using a deep reinforcement learning approach
Cites Work
- Unnamed Item
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
- A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem
- Benchmarks for shop scheduling problems
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Simple statistical gradient-following algorithms for connectionist reinforcement learning
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- FLOW SHOP SCHEDULING WITH REINFORCEMENT LEARNING
- Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
- Permutation flow shop scheduling with earliness and tardiness penalties
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
This page was built for publication: Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach
