| Popis: |
Aiming at the flexible job shop scheduling problem, this paper constructs a dual-objective mathematical model to minimize the maximum completion time and the minimum total processing cost. The traditional firework algorithm introduces a variable neighborhood search strategy, which is generated during the explosion of the algorithm. On the basis of explosive spark and Gaussian spark, the algorithm is further avoided from falling into the dilemma of local optimization. The product of completion time and processing cost is used as the fitness value of the plan, so that the firework algorithm is suitable for solving the two objective scheduling problems in this paper, and the ratio of fitness value and congestion is used as a comprehensive index for the selection of the optimal plan . In this paper, the selected 5×6 calculation examples are solved, and the completion time of the optimal scheduling scheme is reduced by 12.9%, and the total production cost is reduced by 17.67%, which verifies the feasibility and efficiency of the method. |
