摘要
Job shop scheduling problems (JSP) arise from the scheduling of modern manufacturing enterprises. It is one of the most famous NP-complete problem. To evaluate the performance of algorithms, several famous benchmarks have been presented from 1990s. A few decades later, some instances had been found the optimal solutions, but more instances remain unresolved. Trying to update the new upper bounds, the paper presents a hybrid algorithm (HA) combining the genetic algorithm (GA) and the tabu search (TS) to solve JSP with the makespan criterion. GA has an excellent global search ability, and TS has a powerful local search ability. Our HA can combine their advantages and well balance the intensification and the diversification. In the GA part, the paper designs a crossover operator referring to a path relinking procedure and a mutation operator on a basis of critical paths. In the TS part, the paper adopts our previously proposed neighborhood structure, which can effectively expand the search space of neighborhood solutions. 135 famous benchmark instances are selected to evaluate the optimization effect of HA. Six state-of-the-art methods are selected to compare with HA. The results verify that the HA outperforms its compared algorithms in both computational efficiency and solution quality. Especially, the proposed HA has updated the upper bounds of two challenging instances, DMU56-4939 and DMU57-4647.
学科与关键词
- A hybrid genetic tabu search algorithm for solving job shop scheduling problems: a case studyMeeran, S.*; Morshed, M. S.JOURNAL OF INTELLIGENT MANUFACTURING, 2012, 23(4): 1063-1078.被引 66
- Evaluation of a hybrid genetic tabu search framework on job shop scheduling benchmark problemsMeeran, S.*; Morshed, M. S.International Journal of Production Research, 2014, 52(19): 5780-5798.被引 9
- Improved Hybrid Heuristic Algorithm Inspired by Tissue-Like Membrane System to Solve Job Shop Scheduling ProblemTian, Xiang; Liu, Xiyu*Processes, 2021, 9(2): 219.被引 9
