Abstract

The traditional flexible job shop scheduling problem (FJSP) ignores transportation issues or merely introduces a time lag for transportation tasks while assuming an infinite number of transportation resources. With the development of intelligent manufacturing, automated guided vehicles (AGVs), which are the key transportation equipment for manufacturing enterprises, have been widely used for their high flexibility and stability. In addition, the increase in energy consumption and the trend of green manufacturing make it critical to take into account energy-related objectives in the decision-making of scheduling. Therefore, the multi-objective green scheduling problem of integrated flexible job shop and AGVs (MOGSP-IFJS&AGVs) is addressed in this paper. To solve this problem effectively, the multi-objective mixed-integer programming (MMIP) model is formulated to minimize total energy consumption and makespan simultaneously. An efficient heuristic algorithm (EHA) is designed to solve the MMIP model. In the EHA, one solution encoding scheme and corresponding greedy insertion decoding method considering the selection of AGVs are presented. To acquire a high-quality initial population, the population initialization method balancing the processing time and energy consumption is designed. Further, a local search strategy is presented to enhance the quality of solutions and accelerate the convergence speed of the EHA. Experiment results of 45 test instances indicate that the EHA can obtain better solutions than that of comparison algorithms, which confirms the effectiveness of the EHA for solving the MOGSP-IFJS&AGVs.

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 call

Disclaimer: 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.