MOEA/DEP: An Algebraic Decomposition-Based Evolutionary Algorithm for the Multiobjective Permutation Flowshop Scheduling Problem

DOI10.1007/978-3-319-77449-7_9zbMath1423.90081OpenAlexW2794140717MaRDI QIDQ5233124

Marco Baioletti, Alfredo Milani, Valentino Santucci

Publication date: 16 September 2019

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-77449-7_9

zbMATH Keywords

multiobjective optimization permutation flowshop scheduling problem algebraic evolutionary algorithms

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) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

A constraint handling technique using compound distance for solving constrained multi-objective optimization problems ⋮ A binary algebraic differential evolution for the multidimensional two-way number partitioning problem ⋮ An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems ⋮ Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs ⋮ An algebraic approach for the search space of permutations with repetition

This page was built for publication: MOEA/DEP: An Algebraic Decomposition-Based Evolutionary Algorithm for the Multiobjective Permutation Flowshop Scheduling Problem