Routing and scheduling in a flexible job shop by tabu search
Annals of Operations Research - Special issue on Tabu search
Computers and Operations Research
A genetic algorithm for the Flexible Job-shop Scheduling Problem
Computers and Operations Research
Computers and Industrial Engineering
An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
Computers and Industrial Engineering
Chemical-reaction-inspired metaheuristic for optimization
IEEE Transactions on Evolutionary Computation
Parallel hybrid metaheuristics for the flexible job shop problem
Computers and Industrial Engineering
An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems
Computers and Industrial Engineering
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Hi-index | 0.00 |
In this paper, we propose a novel discrete chemical-reaction optimization (DCRO) algorithm for solving the flexible job shop scheduling problem with three objectives. The molecule is used to represent a solution. The four elementary reactions, i.e., the on-wall ineffective collision, the decomposition, the inter-molecular ineffective collision, and the synthesis, are used as the operators for the hybrid algorithm. In the hybrid algorithm, the crossover operator is embedded to learn information among molecules. To increase the ability to escape from the local optima, the buffer is used as the energy center to share kinetic energy among molecules. Experimental results on the well-known benchmarks show the efficiency and effectiveness of the proposed algorithm.