Abstract
Competition among companies leads to a race in order to improve the management system of their production with respect to the delivery time. In the last few decades, the optimization of production scheduling has attracted the interest of numerous researchers. This article deals with the Flexible Jobshop Scheduling Problem (FJSP) as one of the most challenging combinatorial optimization problems. FJSP is an extension of the classical jobshop scheduling problem, in which an operation can be processed by several different machines. This article presents a new decomposition based artificial bee colony algorithm for the multi-objective FJSP. The proposed algorithm is tested and compared to other algorithms from the literature on benchmarks of the multi-objective FJSP and its superior performance and robust results have been proved.
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.
