Solving permutation flowshop scheduling problems with a discrete differential evolution algorithm

DOI10.3233/AIC-150695zbMATH Open1373.68385OpenAlexW2273663414MaRDI QIDQ4592699FDOQ4592699

Authors: Valentino Santucci, Marco Baioletti, Alfredo Milani 

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

Recommendations

• An effective differential evolution algorithm for permutation flow shop scheduling problem
• A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
• A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
• scientific article; zbMATH DE number 2159399
• A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion

zbMATH Keywords

differential evolutionpermutation-based optimizationpermutation flowshop scheduling problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cited In (12)

• 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
• Title not available (Why is that?)
• An effective differential evolution algorithm for permutation flow shop scheduling problem
• Scheduling flow shops using differential evolution algorithm
• A Permutation-Based Differential Evolution Algorithm Incorporating Simulated Annealing for Multiprocessor Scheduling with Communication Delays
• A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling 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
• A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
• Forward backward transformation
• Discrete set handling

This page was built for publication: Solving permutation flowshop scheduling problems with a discrete differential evolution algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592699)