Refined ranking relations for selection of solutions in multi objective metaheuristics

DOI10.1016/J.EJOR.2014.10.044zbMath1346.90748OpenAlexW2056082261MaRDI QIDQ319120

Maik Schwarz, Matthias Bernt, Ruby L. V. Moritz, Enrico Reich, Martin Middendorf

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.10.044

zbMATH Keywords

genetic algorithmsant colony optimizationflow shop scheduling problemmulti objective optimizationranking relations

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Iterative ranking aggregation using quality improvement of subgroup ranking ⋮ Recent advances and future trends in exploring Pareto-optimal topologies and additive manufacturing oriented topology optimization

Uses Software

• MOPSO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A genetic algorithm for flowshop sequencing
• Benchmarks for basic scheduling problems
• Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
• The Complexity of Flowshop and Jobshop Scheduling
• Ordonnancements à contraintes disjonctives

This page was built for publication: Refined ranking relations for selection of solutions in multi objective metaheuristics