Sequencing in an assembly line with blocking to minimize cycle time
Operations Research
Designing digital filters with differential evolution
New ideas in optimization
Journal of Global Optimization
Differential Evolution Training Algorithm for Feed-Forward Neural Networks
Neural Processing Letters
Minimizing Cycle Time in a Blocking Flowshop
Operations Research
Some local search algorithms for no-wait flow-shop problem with makespan criterion
Computers and Operations Research
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
Computers and Operations Research
An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Rapid and brief communication: Evolutionary extreme learning machine
Pattern Recognition
A differential evolution algorithm with self-adapting strategy and control parameters
Computers and Operations Research
Information Sciences: an International Journal
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing Theories and Applications: with aspects of artificial intelligence
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing
A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
Computers and Operations Research
Solving the Fm\block\Cmax problem using Bounded Dynamic Programming
Engineering Applications of Artificial Intelligence
Differential evolution-based nonlinear system modeling using a bilinear series model
Applied Soft Computing
Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm
Computers and Operations Research
Optimizing blocking flow shop scheduling problem with total completion time criterion
Computers and Operations Research
A real-integer-discrete-coded differential evolution
Applied Soft Computing
International Journal of Bio-Inspired Computation
Permutation flow-shop scheduling using a hybrid differential evolution algorithm
International Journal of Computing Science and Mathematics
Hi-index | 0.01 |
This paper proposes a novel hybrid discrete differential evolution (HDDE) algorithm for solving blocking flow shop scheduling problems to minimize the maximum completion time (i.e. makespan). Firstly, in the algorithm, the individuals are represented as discrete job permutations, and new mutation and crossover operators are developed for this representation, so that the algorithm can directly work in the discrete domain. Secondly, a local search algorithm based on insert neighborhood structure is embedded in the algorithm to balance the exploration and exploitation by enhancing the local searching ability. In addition, a speed-up method to evaluate insert neighborhood is developed to improve the efficiency of the whole algorithm. Computational simulations and comparisons based on the well-known benchmark instances of Taillard [Benchmarks for basic scheduling problems. European Journal of Operational Research 1993;64:278-285], by treating them as blocking flow shop problem instances with makespan criterion, are provided. It is shown that the proposed HDDE algorithm not only generates better results than the existing tabu search (TS) and TS with multi-moves (TS+M) approaches proposed by Grabowski and Pempera [The permutation flow shop problem with blocking. A tabu search approach 2007;35:302-311], but also outperforms the hybrid differential evolution (HDE) algorithm developed by Qian et al. [An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Computers and operations research 2009;36(1):209-233] in terms of solution quality, robustness and search efficiency. Ultimately, 112 out of 120 best known solutions provided by Grabowski and Pempera [The permutation flow shop problem with blocking. A tabu search approach 2007;35:302-311] and Ronconi [A branch-and-bound algorithm to minimize the makespan in a flowshop problem with blocking. Annals of Operations Research 2005;138(1):53-65] are further improved by the proposed HDDE algorithm.