Job shop scheduling, especially in its dynamic form, is crucial in manufacturing, adapting to real-time changes, and ensuring optimal resource allocation. However, the complexity classifies it as an NP-hard problem, making finding optimal solutions computationally challenging for large-scale scenarios.

In this webinar, researchers from RPTU describe a novel approach using D-Wave’s quantum computer.
Classification of job shop scheduling
Flexible job shop scheduling
Dynamic job shop scheduling
Multi-objective optimization
Mathematical formulation
Implementation strategies
Results of some use cases