基于pareto方法的多目标柔性车间调度问题的研究

摘要

多目标柔性车间调度问题一直是一个学术的难题,关于并行机的问题更是很少讨论.建立了基于并行机的多目标柔性车间调度的数学模型,目标函数为最小化最大完工时间和加工成本.与以往智能优化算法不一样的是,提出了一种基于pareto的简单优化算法.该算法主要包括两个模块:加工顺序模块和机器选择模块,其中机器选择模块采用了基于pare-to优化算法.最后,数字实验表明了该算法的正确性和有效性.%Multi-objective flexible multi-objective job-shop scheduling problems (FJSP)are always difficult to solve. The problem with parallel machines was barely discussed in the literature. In this paper the FJSP with par-allel machines were formulated. The mathematical modeling was aimed to minimize makespan and processing cost. Instead of improvement of normal intelligent algorithm,this paper provided a simple approach. There are two modules in the algorithm:processing sequence module and machines choosing module,which is based on pareto-optimality approach. Numerical experiments were conducted and the results shown that the proposed algorithm was correct and efficient.