Abstract

An efficient production planning and control is inevitable for the economic operation of a manufacturing system. As an essential part of production planning and control, process scheduling aims to assign processes to the available resources of a manufacturing system under consideration of its objectives. This forms an optimization problem also known as job shop scheduling which can be solved with computer aided techniques. Exact solution methods are only practical up to a certain number of functional units and processes, therefore, approximation methods are used in industry. However, as the problem size increases, the computational solving time increases significantly and the solution quality decreases in equal measure. In order to react to the current effects of global crises, such as disruptions in supply chains, approaches for fast and efficient rescheduling are needed. A dynamic shop job scheduling approach using Quantum Annealing bears the potential to close this research gap. Previous work has shown that Quantum Annealing is able to solve static job shop scheduling problems within seconds while finding good solutions. However, in a flexible environment such as a manufacturing system, the static approach is not suitable for process scheduling. Therefore, a dynamic Quantum Annealing based approach for job shop scheduling with consideration of machine breakdowns and new job arrivals is proposed. The approach monitors a manufacturing system and reacts to changes in the job pool or availabilities in functional units with rescheduling. The method is tested with several use cases involving small and large-scale problems and is compared with a simulated annealing approach. Thereby, the Quantum Annealing based computations show better results regarding solution quality and computing time. Moreover, the dynamic approach bears the potential for industrial application, especially as a supplement to a conventional advanced planning system.

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.