Stochastic local search and parameters recommendation: a case study on flowshop problems

DOI10.1111/itor.12922OpenAlexW3110965891MaRDI QIDQ6079864

Unnamed Author, Alex A. Freitas, Unnamed Author, Myriam Regattieri Delgado

Publication date: 29 September 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12922

zbMATH Keywords

flowshopstochastic local searchautomatic algorithm configurationalgorithm selection problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedy function approximation: A gradient boosting machine.
• Optimization by Simulated Annealing
• Fitness landscape analysis for the no-wait flow-shop scheduling problem
• A hybrid metaheuristic approach to solving the UBQP problem
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Some efficient heuristic methods for the flow shop sequencing problem
• Correlated and uncorrelated fitness landscapes and how to tell the difference
• Landscapes, operators and heuristic search
• An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
• Measuring instance difficulty for combinatorial optimization problems
• A comprehensive review and evaluation of permutation flowshop heuristics
• Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant
• Optimal two- and three-stage production schedules with setup times included
• Tabu Search—Part I
• The Complexity of Flowshop and Jobshop Scheduling
• Scheduling
• Random forests

This page was built for publication: Stochastic local search and parameters recommendation: a case study on flowshop problems