Abstract
Using the multi-objective method is to solve the flexible job-shop scheduling problem (FJSP), this paper optimizes the three objectives of the total processing time, the total machine load and the key machine load, analyzes the relations between the three optimization objectives in detail, and decides to minimize the total machine load and the key machine load during the process route selection and to minimize the total processing time during the process scheduling. According to the characteristics of multi-objective optimization, the author redesigns the update mode and state transition probability formula for local heuristic information of ant in the optimized ant colony algorithm. The simulation experiment proves the effectiveness of the mixed optimization algorithm of ant colony algorithm and particle swarm algorithm.
Sign-in/Register to access full text options 
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.
