Abstract
Flexible job shop scheduling problem (FJSP) is a very important problem in the modern manufacturing system. It is an extension of the classical job shop scheduling problem. Because of the importance of FJSP and the multiple objectives requirement from the real-world production, this research focuses on the multi-objective FJSP. This paper proposes a collaborative evolutionary algorithm (CEA) based on Pareto optimality to solve the multi-objective FJSP. Experimental studies have been used to test the approach. And the experimental results show that the proposed approach is a promising and very effective method on the research of multi-objective FJSP.
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.
