Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
From MaRDI portal
Publication:2079447
Recommendations
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- Boosting ant colony optimization via solution prediction and machine learning
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- Hybrid simulated annealing with memory: an evolution-based diversification approach
- Effect of solution representations on tabu search in scheduling applications
Cites work
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- A discrete inter-species cuckoo search for flowshop scheduling problems
- A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems
- A hybrid neural network-genetic algorithm approach for permutation flow shop scheduling
- A learning-based metaheuristic for a multi-objective agile inspection planning model under uncertainty
- A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem
- A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A robust parameter design for multi-response problems
- A self-guided genetic algorithm for permutation flowshop scheduling problems
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
- An improved genetic algorithm for the flowshop scheduling problem
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
- Benchmarks for basic scheduling problems
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Equation of state calculations by fast computing machines
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- scientific article; zbMATH DE number 3159069 (Why is no real title available?)
- scientific article; zbMATH DE number 3067118 (Why is no real title available?)
- Hybrid bat algorithm for flow shop scheduling problems
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
- Metaheuristics. From design to implementation.
- MHD effects on the instability of thermocapillary convection in two-layer fluid system
- New hard benchmark for flowshop scheduling problems minimising makespan
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- Optimal two- and three-stage production schedules with set-up time included
- Pattern recognition and machine learning.
- Reinforcement learning. An introduction
- Selecting algorithms for large berth allocation problems
- Some efficient heuristic methods for the flow shop sequencing problem
- Stochastic mixed-model assembly line sequencing problem: mathematical modeling and Q-learning based simulated annealing hyper-heuristics
Cited in
(12)- Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II
- Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems
- On the integration of reinforcement learning and simulated annealing for the parallel batch scheduling problem with setups
- A trajectory-based algorithm enhanced by Q-learning and cloud integration for hybrid flexible flowshop scheduling problem with sequence-dependent setup times: a case study
- A graph reinforcement learning framework for neural adaptive large neighbourhood search
- A two-layer heuristic for patient sequencing in the operating room theatre considering multiple resource phases
- Multi-objective cooperative co-evolution algorithm with hypervolume-based Q-learning for hybrid \textit{seru} system
- Minimising makespan and total tardiness for the flowshop group scheduling problem with sequence dependent setup times
- Integrated trucks assignment and scheduling problem with mixed service mode docks: a Q-learning based adaptive large neighborhood search algorithm
- An effective greedy randomized adaptive search procedure-based hybrid metaheuristic for the distributed no-wait flowshop scheduling problem
- Bilevel programming optimization of floorplanning layout based on memristive reinforcement learning with strategy of neurodynamic estimate
- Job-shop scheduling problem with limited input buffers: mathematical models and solution methods
This page was built for publication: Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2079447)
