Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
From MaRDI portal
Publication:666941
DOI10.1016/j.ejor.2019.01.018zbMath1430.90284OpenAlexW2909673565WikidataQ128595812 ScholiaQ128595812MaRDI QIDQ666941
Federico Pagnozzi, Thomas Stützle
Publication date: 12 March 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/286627/5/paper.pdf
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Pattern recognition, speech recognition (68T10)
Related Items (8)
Iterative beam search algorithms for the permutation flowshop ⋮ emili ⋮ A landscape-based analysis of fixed temperature and simulated annealing ⋮ Capping methods for the automatic configuration of optimization algorithms ⋮ A cutoff time strategy based on the coupon collector's problem ⋮ Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem ⋮ Evaluating the impact of grammar complexity in automatic algorithm design ⋮ Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
Uses Software
Cites Work
- Unnamed Item
- New hard benchmark for flowshop scheduling problems minimising makespan
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Some efficient heuristic methods for the flow shop sequencing problem
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Benchmarks for basic scheduling problems
- A unified ant colony optimization algorithm for continuous optimization
- Improved large-step Markov chain variants for the symmetric TSP
- Optimal two- and three-stage production schedules with setup times included
- A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
- Scheduling in flowshops to minimize total tardiness of jobs
- Equation of State Calculations by Fast Computing Machines
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Manufacturing Scheduling Systems
- Variable neighborhood search: Principles and applications
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
This page was built for publication: Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
