Abstract

With the increase of mass customization, flexible job shop scheduling problem considering assembly stage has widely existed in many manufacturing industries, such as die-casting mould factories. This problem is to find a reasonable machine assignment and operation sequence both in fabrication and assembly stages and simultaneously maximize production efficiency. In reality, energy shortages and environmental pollution have given an impetus to the development of energy-aware production scheduling problems. In this study, we address an energy-aware flexible assembly job shop scheduling problem (EFAJSP) with the objectives of minimizing flow time and energy consumption and first develop a mixed-integer linear programming (MILP) model to solve EFAJSP problem. Then, the model-specific characteristics are extracted and applied to a matheuristic decoding method for exploring the Pareto optimal solution. Due to the complexity of EFAJSP problem, a matheuristic and learning-oriented multi-objective artificial bee colony algorithm (MLABC), which combines the advantages of mathematical programming, reinforcement learning and meta-heuristic algorithm, is proposed. In addition, an initialization, destruction/construction operator and population update operator are proposed and work together to improve the exploration and exploitation performance of the proposed MLABC. Finally, numerical experimental results demonstrate the effectiveness of the proposed MILP model and the superiority of the MLABC over other algorithms in the literature.

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.