Abstract
Flexible job shop scheduling problem (FJSP) has always been a pivotal research content in the manufacture field. However, many studies only focus on the maximum completion time. The growing demand for development urgently needs a FJSP that can cover a variety of optimization goals. As a result, a multi-objective FJSP model is proposed, which includes four optimization objectives: maximum completion time, total energy depletion, delay time and total machine load. For the multi-objective FJSP, three optimization algorithms of NSGA-II, NSGA-III and MOEA/D are used to minimize the maximum completion time, total energy depletion, delay time and total machine load. The superiority and validity of these algorithms are verified by tests.
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.
