Year-end Sale % OFF 
Abstract
In the practical production, the transportation of jobs is existed between different machines. These transportation operations directly affect the production cycle and the production efficiency. In this study, an improved memetic algorithm is proposed to solve the flexible job shop scheduling problem with transportation times, and the optimization objective is minimizing the makespan. In the improved memetic algorithm, an effective simulated annealing algorithm is adopted in the local search process, which combines the elite library and mutation operation. All the feasible solutions are divided into general solutions and local optimal solutions according to the elite library. The general solutions are executed by the simulated annealing algorithm to improve the quality, and the local optimal solutions are executed by the mutation operation to increase the diversity of the solution set. Comparison experiments with the improved genetic algorithm show that the improved memetic algorithm has better search performance and stability.
Highlights
The flexible job shop scheduling problem (FJSP) is an extension of the classic job shop scheduling problem (JSP), which is more in line with the characteristics of discrete manufacture environment
The time factors include the processing time, and the transportation time. These time factors affect the completion time and make the problem more complicated. If this part of the time is not taken into account, it may occur that the processing time is short but the transportation time is long during implementation, resulting in reduced scheduling efficiency
The experiment tested the performance of the improved memetic algorithm (IMA) for the TT-FJSP
Summary
The flexible job shop scheduling problem (FJSP) is an extension of the classic job shop scheduling problem (JSP), which is more in line with the characteristics of discrete manufacture environment. In the IMA, an effective SA with the elite library and mutation operation is adopted to form the local search method with parallel structure.
Sign-in/Register to view highlights & summary 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.
