Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems to minimize makespan
zbMATH Open1471.90157MaRDI QIDQ5154491FDOQ5154491
Authors: Yunior César Fonseca Reyna, Yailen Martínez Jiménez, Ann Nowé 
Publication date: 5 October 2021
Full work available at URL: http://archives-web.univ-paris1.fr/rev-inv-ope/fileadmin/rev-inv-ope/files/38317/38317-09.pdf
Recommendations
- A reinforcement learning approach for scheduling problems
- Flow shop scheduling with reinforcement learning
- scientific article; zbMATH DE number 1960880
- Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm
- Application of improved Q learning algorithm to job shop problem
Learning and adaptive systems in artificial intelligence (68T05) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- \({\mathcal Q}\)-learning
- The Complexity of Flowshop and Jobshop Scheduling
- Scheduling
- A genetic algorithm for flowshop sequencing
- Scheduling algorithms
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Benchmarks for basic scheduling problems
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- Asynchronous stochastic approximation and Q-learning
- A bicriteria approach to the two-machine flow shop scheduling problem
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
- Two-machine flow shops with limited machine availability
- An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed
- A multi-objective particle swarm for a flow shop scheduling problem
- Title not available (Why is that?)
- Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic
- Minimizing makespan for a no-wait flowshop using genetic algorithm
- Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
- An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times
- Comparison of distributed methods for resource allocation
Cited In (7)
- Flow shop scheduling with reinforcement learning
- Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times
- Title not available (Why is that?)
- Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach
- A reinforcement learning approach for scheduling problems
- Application of improved Q learning algorithm to job shop problem
- Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning
Uses Software
This page was built for publication: Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems to minimize makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154491)
