A tutorial survey of job-shop scheduling problems using genetic algorithms: Part II. Hybrid genetic search strategies

Job-shop scheduling problem is one of the well-known hardest combinatorial optimization problems. During the past decade, two important issues have been extensively studied. One is how to encode a solution into a chromosome so as to ensure that a chromosome will correspond to a feasible solution. The other issue is how to enhance the performance of genetic search by incorporating traditional heuristic method. The purpose of the paper is to give a brief survey of recent works on various hybrid genetic algorithms for the problem.