关键词: 柔性作业车间调度, 禁忌搜索, 多目标优化, 邻域结构, Pareto档案集

Abstract: In order to minimize the maximum completion time (makespan), the total workload and the maximal workload simultaneously in the multi-objective flexible job shop scheduling problem, hybrid Tabu Search algorithm with Pareto archives set was put forward. A Pareto non-dominated sort operator was applied to the set of neighbor solutions, and solutions in the Pareto first front were selected to update the Pareto set. A speed-up Pareto set update algorithm was developed. To reduce search space, combined with features of problems, inserting neighborhood and swapping neighborhood operators based on the public critical block structure were designed. Finally, three typical simulation results were provided to demonstrated the feasibility and effectiveness of the proposed method.

Key words: flexible Job Shop scheduling, tabu search, multi-objective optimization, neighborhood structure, Pareto archives set