A proposal for a hybrid meta-strategy for combinatorial optimization problems
From MaRDI portal
Recommendations
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems
- A branch-and-bound-based local search method for the flow shop problem
- Hybrid simulated annealing with memory: an evolution-based diversification approach
- A hybrid particle swarm optimization algorithm for the permutation flowshop scheduling problem
Cites work
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 956852 (Why is no real title available?)
- A branch-and-bound-based local search method for the flow shop problem
- A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- A computational study of the permutation flow shop problem based on a tight lower bound
- A genetic algorithm for flowshop sequencing
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
- Benchmarks for basic scheduling problems
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
- Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems
Cited in
(6)- scientific article; zbMATH DE number 1488101 (Why is no real title available?)
- A meta-control algorithm for generating approximate solutions to binary integer programming problems
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
- An effective matheuristic for the capacitated total quantity discount problem
- Guidelines for the use of meta-heuristics in combinatorial optimization.
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
This page was built for publication: A proposal for a hybrid meta-strategy for combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q945052)
