Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
type: Item
instance of: scholarly article
title: Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
author: Maryam Karimi-Mamaghan
author: Mehrdad Mohammadi
author: Bastien Pasdeloup
author: Patrick Meyer
published in: European Journal of Operational Research
publication date: 2022-09-29T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7594703
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: iterated greedy meta-heuristic
zbMATH Keywords: reinforcement learning
zbMATH Keywords: Q-learning algorithm
zbMATH Keywords: permutation flowshop scheduling problem
describes a project that uses: emili
MaRDI profile type: Publication
full work available at URL: j.ejor.2022.03.054
OpenAlex ID: W4226164141
cites work: Fast heuristics for minimizing the makespan in non-permutation flow shops
cites work: Machine learning for combinatorial optimization: a methodological tour d'horizon
cites work: A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
cites work: Q5483032
cites work: Q3276963
cites work: Q5806242
cites work: A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems
cites work: A self-guided genetic algorithm for permutation flowshop scheduling problems
cites work: A discrete inter-species cuckoo search for flowshop scheduling problems
cites work: A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
cites work: An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
cites work: On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
cites work: A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
cites work: Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
cites work: A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: A learning-based metaheuristic for a multi-objective agile inspection planning model under uncertainty
cites work: Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
cites work: A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Stochastic mixed-model assembly line sequencing problem: mathematical modeling and Q-learning based simulated annealing hyper-heuristics
cites work: A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling
cites work: Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
cites work: Local search methods for the flowshop scheduling problem with flowtime minimization
cites work: An improved genetic algorithm for the flowshop scheduling problem
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: Q4626283
cites work: Some efficient heuristic methods for the flow shop sequencing problem
cites work: Benchmarks for basic scheduling problems
cites work: Q5191184
cites work: Combining metaheuristics with mathematical programming, constraint programming and machine learning
cites work: Hybrid bat algorithm for flow shop scheduling problems
cites work: A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
cites work: Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
cites work: New hard benchmark for flowshop scheduling problems minimising makespan
cites work: A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem
cites work: Selecting algorithms for large berth allocation problems
cites work: A robust parameter design for multi-response problems
cites work: MHD effects on the instability of thermocapillary convection in two-layer fluid system
DOI: 10.1016/J.EJOR.2022.03.054
description: scientific article; zbMATH DE number 7594703