MOEA/DEP: an algebraic decomposition-based evolutionary algorithm for the multiobjective permutation flowshop scheduling problem
DOI10.1007/978-3-319-77449-7_9zbMATH Open1423.90081OpenAlexW2794140717MaRDI QIDQ5233124FDOQ5233124
Authors: 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
Recommendations
- scientific article; zbMATH DE number 6746310
- Multi-objective flow shop scheduling using differential evolution
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
- On operators and search space topology in multi-objective flow shop scheduling
- A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cited In (5)
- 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
- A constraint handling technique using compound distance for solving constrained multi-objective optimization problems
- An algebraic approach for the search space of permutations with repetition
- A binary algebraic differential evolution for the multidimensional two-way number partitioning problem
This page was built for publication: MOEA/DEP: an algebraic decomposition-based evolutionary algorithm for the multiobjective permutation flowshop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233124)
