A proposal for a hybrid meta-strategy for combinatorial optimization problems
DOI10.1007/S10732-007-9056-9zbMATH Open1151.90524OpenAlexW2171216849MaRDI QIDQ945052FDOQ945052
Authors: Jose M. Framinan, Rafael Pastor 
Publication date: 10 September 2008
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/handle//11441/103020
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A genetic algorithm for flowshop sequencing
- Title not available (Why is that?)
- 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 very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- 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
- A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
- A branch-and-bound-based local search method for the flow shop problem
- Title not available (Why is that?)
- Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems
- Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
Cited In (6)
- Title not available (Why is that?)
- 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
Uses Software
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)
