Job shop scheduling by simulated annealing
Operations Research
Routing and scheduling in a flexible job shop by tabu search
Annals of Operations Research - Special issue on Tabu search
A fast taboo search algorithm for the job shop problem
Management Science
Statistical Comparisons of Classifiers over Multiple Data Sets
The Journal of Machine Learning Research
Computers and Operations Research
A genetic algorithm for the Flexible Job-shop Scheduling Problem
Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
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
A particle swarm optimization algorithm for flexible jobshop scheduling problem
CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
An artificial immune algorithm for the flexible job-shop scheduling problem
Future Generation Computer Systems
A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems
Applied Soft Computing
Computers & Mathematics with Applications
Expert Systems with Applications: An International Journal
An effective genetic algorithm for the flexible job-shop scheduling problem
Expert Systems with Applications: An International Journal
Combining Constraint Programming and Local Search for Job-Shop Scheduling
INFORMS Journal on Computing
Helper-objective optimization strategies for the Job-Shop Scheduling Problem
Applied Soft Computing
Computers and Industrial Engineering
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
IEEE Transactions on Evolutionary Computation
Co-evolutionary genetic algorithm for fuzzy flexible job shop scheduling
Applied Soft Computing
Analysis on the Collaboration Between Global Search and Local Search in Memetic Computation
IEEE Transactions on Evolutionary Computation
Path-relinking Tabu search for the multi-objective flexible job shop scheduling problem
Computers and Operations Research
Hi-index | 0.00 |
In this paper, a novel hybrid harmony search (HHS) algorithm based on the integrated approach, is proposed for solving the flexible job shop scheduling problem (FJSP) with the criterion to minimize makespan. First of all, to make the harmony search (HS) algorithm adaptive to the FJSP, the converting techniques are developed to convert the continuous harmony vector to a kind of discrete two-vector code for the FJSP. Secondly, the harmony vector is mapped into a feasible active schedule through effectively decoding the transformed two-vector code, which could largely reduce the search space. Thirdly, a resultful initialization scheme combining heuristic and random strategies is introduced to make the initial harmony memory (HM) occur with certain quality and diversity. Furthermore, a local search procedure is embedded in the HS algorithm to enhance the local exploitation ability, whereas HS is employed to perform exploration by evolving harmony vectors in the HM. To speed up the local search process, the improved neighborhood structure based on common critical operations is presented in detail. Empirical results on various benchmark instances validate the effectiveness and efficiency of our proposed algorithm. Our work also indicates that a well designed HS-based method is a competitive alternative for addressing the FJSP.