Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. (Abstract of thesis)

DOI10.1007/s10288-006-0002-8zbMath1125.90399OpenAlexW2086167402MaRDI QIDQ862824

Matthieu Basseur

Publication date: 24 January 2007

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-006-0002-8

zbMATH Keywords

Multi-objective optimizationCombinatorial optimizationMeta-heuristicCooperative methodsExact methodFlow-shop scheduling

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (5)

Quasi-Newton methods for multiobjective optimization problems ⋮ Multi‐objective optimization using metaheuristics: non‐standard algorithms ⋮ Two-phase Pareto local search for the biobjective traveling salesman problem ⋮ Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems ⋮ Speed-up techniques for solving large-scale biobjective TSP

Cites Work

• Benchmarks for basic scheduling problems
• Evolutionary Multi-Criterion Optimization
• Unnamed Item
• Unnamed Item

This page was built for publication: Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. (Abstract of thesis)