Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems to minimize makespan
From MaRDI portal
Publication:5154491
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
Cites work
- scientific article; zbMATH DE number 1348743 (Why is no real title available?)
- A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
- A bicriteria approach to the two-machine flow shop scheduling problem
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- A genetic algorithm for flowshop sequencing
- A multi-objective particle swarm for a flow shop scheduling problem
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
- An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Asynchronous stochastic approximation and Q-learning
- Benchmarks for basic scheduling problems
- Comparison of distributed methods for resource allocation
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
- Minimizing makespan for a no-wait flowshop using genetic algorithm
- Scheduling
- Scheduling algorithms
- Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance
- The Complexity of Flowshop and Jobshop Scheduling
- Two-machine flow shops with limited machine availability
- \({\mathcal Q}\)-learning
Cited in
(7)- Application of improved Q learning algorithm to job shop problem
- Flow shop scheduling with reinforcement learning
- A reinforcement learning approach for scheduling problems
- Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning
- Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach
- Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times
- scientific article; zbMATH DE number 1960880 (Why is no real title available?)
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)
