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 parallel 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.
参考文献
相似文献
引证文献
引用本文
陈江波,曹爱霞,郑义,岳庆超.基于pareto方法的多目标柔性车间调度问题的研究[J].机床与液压,2017,45(18):96-104. . A new approach for multi-objective flexible job-shop scheduling problems[J]. Machine Tool & Hydraulics,2017,45(18):96-104