The hybrid heuristic genetic algorithm for job shop scheduling

• Published in: Computers & industrial engineering 2001-07, Vol.40 (3), p.191-200
• Main Authors: Zhou, Hong, Feng, Yuncheng, Han, Limin
• Format: Article
• Language: English
• Subjects: Algorithms; Applied sciences; Combinatorial optimization; Evolution & development; Exact sciences and technology; Flows in networks. Combinatorial problems; Genetic algorithm; Genetic algorithms; Heuristic; Heuristics; Job shop scheduling; Job shops; Operational research and scientific management; Operational research. Management science; Optimization; Production management; Production scheduling; Scheduling; Scheduling, sequencing; Studies
• ISSN: 0360-8352; 1879-0550
• DOI: 10.1016/S0360-8352(01)00017-1

Scheduling for the job shop is very important in both fields of production management and combinatorial optimization. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization methods owing to the high computational complexity (NP-hard). Genetic algorithms (GA) have been proved to be effective for a variety of situations, including scheduling and sequencing. Unfortunately, its efficiency is not satisfactory. In order to make GA more efficient and practical, the knowledge relevant to the problem to be solved is helpful. In this paper, a kind of hybrid heuristic GA is proposed for problem n/ m/ G/ C max, where the scheduling rules, such as shortest processing time (SPT) and MWKR, are integrated into the process of genetic evolution. In addition, the neighborhood search technique (NST) is adopted as an auxiliary procedure to improve the solution performance. The new algorithm is proved to be effective and efficient by comparing it with some popular methods, i.e. the heuristic of neighborhood search, simulated annealing (SA), and traditional GA.