Routing and scheduling in a flexible job shop by tabu search
Annals of Operations Research - Special issue on Tabu search
A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation
Computers and Industrial Engineering
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
A hybrid particle swarm optimization for job shop scheduling problem
Computers and Industrial Engineering
Statistical Comparisons of Classifiers over Multiple Data Sets
The Journal of Machine Learning Research
A very fast TS/SA algorithm for the job shop scheduling problem
Computers and Operations Research
Journal of Global Optimization
Computers and Operations Research
A genetic algorithm for the Flexible Job-shop Scheduling Problem
Computers and Operations Research
Differential evolution for solving multi-mode resource-constrained project scheduling problems
Computers and Operations Research
Computers and Industrial Engineering
A DE-based approach to no-wait flow-shop scheduling
Computers and Industrial Engineering
Flexible job-shop scheduling with parallel variable neighborhood search algorithm
Expert Systems with Applications: An International Journal
An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
Computers and Industrial Engineering
An artificial immune algorithm for the flexible job-shop scheduling problem
Future Generation Computer Systems
Rapid and brief communication: Evolutionary extreme learning machine
Pattern Recognition
A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems
Applied Soft Computing
Discrepancy search for the flexible job shop scheduling problem
Computers and Operations Research
Parallel hybrid metaheuristics for the flexible job shop problem
Computers and Industrial Engineering
Expert Systems with Applications: An International Journal
Computers and Industrial Engineering
A GES/TS algorithm for the job shop scheduling
Computers and Industrial Engineering
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Iterative flattening search for the flexible job shop scheduling problem
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Large neighborhood search and adaptive randomized decompositions for flexible jobshop scheduling
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
| Hi-index | 0.00 |
This paper proposes hybrid differential evolution (HDE) algorithms for solving the flexible job shop scheduling problem (FJSP) with the criterion to minimize the makespan. Firstly, a novel conversion mechanism is developed to make the differential evolution (DE) algorithm that works on the continuous domain adaptive to explore the problem space of the discrete FJSP. Secondly, a local search algorithm based on the critical path is embedded in the DE framework to balance the exploration and exploitation by enhancing the local searching ability. In addition, in the local search phase, the speed-up method to find an acceptable schedule within the neighborhood structure is presented to improve the efficiency of whole algorithms. Extensive computational results and comparisons show that the proposed algorithms are very competitive with the state of the art, some new best known solutions for well known benchmark instances have even been found.