The shifting bottleneck procedure for job shop scheduling
Management Science
A genetic algorithm for the job shop problem
Computers and Operations Research - Special issue on genetic algorithms
A fast taboo search algorithm for the job shop problem
Management Science
A new adaptive neural network and heuristics hybrid approach for job-shop scheduling
Computers and Operations Research
Selected Papers from AISB Workshop on Evolutionary Computing
A hybrid genetic algorithm for the job shop scheduling problems
Computers and Industrial Engineering
A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem
Journal of Heuristics
A hybrid particle swarm optimization for job shop scheduling problem
Computers and Industrial Engineering
A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
Computers and Operations Research
A memetic algorithm for the job-shop with time-lags
Computers and Operations Research
A multi-modal immune algorithm for the job-shop scheduling problem
Information Sciences: an International Journal
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem
IEEE Transactions on Evolutionary Computation
Meta-Lamarckian learning in memetic algorithms
IEEE Transactions on Evolutionary Computation
A GRASP×ELS approach for the job-shop with a web service paradigm packaging
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
The job shop scheduling problem (JSP) is well known as one of the most complicated combinatorial optimization problems, and it is a NP-hard problem. Memetic algorithm (MA) which combines the global search and local search is a hybrid evolutionary algorithm. In this paper, an efficient MA with a novel local search is proposed to solve the JSP. Within the local search, a systematic change of the neighborhood is carried out to avoid trapping into local optimal. And two neighborhood structures are designed by exchanging and inserting based on the critical path. The objective of minimizing makespan is considered while satisfying a number of hard constraints. The computational results obtained in experiments demonstrate that the efficiency of the proposed MA is significantly superior to the other reported approaches in the literature.