Solving permutation flowshop scheduling problems with a discrete differential evolution algorithm

DOI10.3233/AIC-150695zbMath1373.68385OpenAlexW2273663414MaRDI QIDQ4592699

Alfredo Milani, Valentino Santucci, Marco Baioletti

Publication date: 8 November 2017

Published in: AI Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/aic-150695

zbMATH Keywords

differential evolutionpermutation-based optimizationpermutation flowshop scheduling problem

Mathematics Subject Classification ID

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 (4)

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: Solving permutation flowshop scheduling problems with a discrete differential evolution algorithm