关键词: 柔性作业车间调度问题, Jaya算法, 禁忌搜索, 混合算法

Abstract: Flexile Job shop Scheduling Problem (FJSP) is a kind of strong NP-hard combinatorial optimization problem,which widely exists in the actual production process of manufacturing enterprises.Base on the characteristics of FJSP,an Improved Jaya and Tabu Search algorithm (IJA-TS) was proposed by combining the advantages of Jaya and tabu search algorithm.According to the formula of discrete Jaya algorithm,an extended discrete Jaya algorithm was proposed,a Jaya evolutionary solution set was designed and a new evaluation method combining similarity and maximum completion time was presented,which ensured the diversity of population and improved the solving ability of Jaya algorithm.A tabu search algorithm integrated M.G.and N7 neighborhood structures was proposed to make a good balance between exploration and exploitation.The validity and superiority of the proposed algorithm were verified by testing FJSP benchmark problem and comparing with the results of the latest literatures.

Key words: flexible job shop scheduling problem, Jaya algorithm, tabu search, hybrid algorithm