A genetic algorithm for flowshop sequencing
Computers and Operations Research - Special issue on genetic algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A differential evolution approach for the common due date early/tardy job scheduling problem
Computers and Operations Research
Some scheduling problems with general position-dependent and time-dependent learning effects
Information Sciences: an International Journal
Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization
Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization
Some single-machine and m-machine flowshop scheduling problems with learning considerations
Information Sciences: an International Journal
A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
Computers and Operations Research
Hi-index | 0.00 |
In this paper, a hybrid differential evolution algorithm is developed for the permutation flow-shop scheduling problem to minimise the makespan. The iterative evolution procedure of the algorithm includes a DE-based global search for the population and an insert-based local search for the best individual. Experiments are performed, with the goal to discuss the impacts of different parameter values and the local search on the performance of the algorithm. The results reveal that choosing an appropriate CR is crucial on the global search performance for medium or larger-sized problems, and local search procedure brings the improvement in the optimisation ability, but leads to inevitable increase of computational time. Our future work is to exploit a more effective local search, which is capable of ensuring great optimisation power with reasonable computation time.