Clustered enhanced differential evolution for the blocking flow shop scheduling problem
DOI10.1007/S10100-011-0198-3zbMATH Open1339.90130OpenAlexW2090083140MaRDI QIDQ300862FDOQ300862
Authors: Donald Davendra, Ivan Zelinka, Magdalena Bialic-Davendra, Roman Senkerik, Roman Jasek 
Publication date: 29 June 2016
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-011-0198-3
Recommendations
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- scientific article; zbMATH DE number 2159399
- Solving permutation flowshop scheduling problems with a discrete differential evolution algorithm
- Scheduling flow shops using differential evolution algorithm
- Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Advances in differential evolution
- Differential evolution: A handbook for global permutation-based combinatorial optimization. With CD-ROM
- Fundamentals of scatter search and path relinking
- Differential evolution. A practical approach to global optimization. With CD-ROM.
- 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
- Ordonnancements à contraintes disjonctives
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Scheduling flow shops using differential evolution algorithm
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- Evolutionary Algorithms and the Edge of Chaos
- Differential evolution for permutation-based combinatorial problems
- Title not available (Why is that?)
- A differential evolution algorithm with self-adapting strategy and control parameters
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
Cited In (2)
Uses Software
This page was built for publication: Clustered enhanced differential evolution for the blocking flow shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q300862)
