Abstract
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.
Highlights
Flexible job shop scheduling breaks the limitations of processes on processing machines in traditional workshop scheduling problems [1]
This article will aim at minimizing the maximum completion time and minimizing production costs, construct a flexible job shop scheduling mathematical model, and use the firework algorithm based on the variable neighborhood search algorithm to solve the problem and obtain the optimal scheduling plan
Calculate the fitness value of 50 initial fireworks in the population, calculate the number of sparks and the explosion amplitude of the explosion of the fireworks according to the Equation, and generate explosion sparks and Gaussian sparks according to the algorithm
Summary
Flexible job shop scheduling breaks the limitations of processes on processing machines in traditional workshop scheduling problems [1]. The processing time and consumption of different equipment in equipment concentration are different, so the flexible job shop scheduling problem is a high-dimensional planning problem of multi-workpieces and multi-processes in multiple equipment processing and sequencing, and it is a complex NP-hard problem [2]. This problem has been closely discussed by scholars in many related fields, and it is more in line with the actual scheduling needs of enterprises, and has strong theoretical significance and application value [3]. This article will aim at minimizing the maximum completion time and minimizing production costs, construct a flexible job shop scheduling mathematical model, and use the firework algorithm based on the variable neighborhood search algorithm to solve the problem and obtain the optimal scheduling plan
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
