Research on Multi-objective FJSP Problem with Parallel Batch Processing Machines
A mathematical model was established for the multi-objective flexible job shop scheduling problem with parallel batch processing machines,with maximum completion time,maximum machine load,and energy con-sumption as optimization objectives.A multi group MOEAD algorithm was proposed in the paper for solution.The al-gorithm combined the advantages of multiple-population strategies,and the three sub-populations used three aggrega-tion functions of WS,TE and BI for collaborative search,which maintains the diversity of the population while expan-ding the search breadth of the algorithm.An evolutionary operator and a local search strategy were designed in line with the characteristics of the problem to improve the overall search performance of the algorithm.The feasibility and effectiveness of the proposed algorithm were verified by standard FJSP examples and actual data that meet the charac-teristics of the problem.
NETL
NSTL
万方数据
