针对最小化最大完成时间、总机床负荷及最大机床负荷的多目标柔性作业车间调度问题,提出了一种带有Pareto档案集的混合禁忌搜索算法。该算法为每次迭代产生的邻域解集进行Pareto非支配排序,选择第一前沿的解用于Pareto档案集更新,并给出了一种Pareto档案集快速更新算法。为减小邻域搜索空间,结合问题特征,设计了基于公共关键块结构的插入邻域和交换邻域。通过3个经典算例的实验仿真,以及与其他算法的比较,验证了该算法的可行性和有效性。
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.