Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
From MaRDI portal
Publication:666941
Recommendations
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- Automatic algorithm design for hybrid flowshop scheduling problems
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- A local search method for permutation flow shop scheduling
Cites work
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A review and evaluation of multiobjective algorithms for the flowshop scheduling problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A unified ant colony optimization algorithm for continuous optimization
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Benchmarks for basic scheduling problems
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- Equation of state calculations by fast computing machines
- Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools
- Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Improved large-step Markov chain variants for the symmetric TSP
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Manufacturing Scheduling Systems
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- 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
- Scheduling in flowshops to minimize total tardiness of jobs
- Some efficient heuristic methods for the flow shop sequencing problem
- Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem
- Stochastic local search. Foundations and applications.
- Variable neighborhood search: Principles and applications
Cited in
(9)- Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem
- Iterative beam search algorithms for the permutation flowshop
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
- A landscape-based analysis of fixed temperature and simulated annealing
- emili
- Evaluating the impact of grammar complexity in automatic algorithm design
- Automatic algorithm design for hybrid flowshop scheduling problems
- Capping methods for the automatic configuration of optimization algorithms
- A cutoff time strategy based on the coupon collector's problem
This page was built for publication: Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666941)
