A FJSSP Method Based on Dynamic Multi-Objective Squirrel Search Algorithm
Author(s) -
Yanjiao Wang,
Jieru Han
Publication year - 2021
Publication title -
international journal of antennas and propagation
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.282
H-Index - 37
eISSN - 1687-5877
pISSN - 1687-5869
DOI - 10.1155/2021/6062689
Subject(s) - computer science , scheduling (production processes) , mathematical optimization , dynamic priority scheduling , algorithm , mathematics , schedule , operating system
This paper comprehensively analyzes the characteristics of flexible job shop scheduling problem (FJSSP), takes the dynamic factors in the actual scheduling process such as the arrival and departure of jobs, the breakdown and recovery of machines into account at the same time, and establishes a new dynamic multi-objective mathematical model. Take the Squirrel Search Algorithm (SSA) as the core evolution strategy, and combine the multi-objective framework and the dynamic processing technology to solve the established mathematical model. Experimental results show that the mathematical model proposed in this paper can solve the flexible job shop scheduling problem effectively. Compared with other mathematical models, the mathematical model established in this paper can keep better balance between the efficiency and stability.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom