Job Shop Scheduling Problem
I'm currently doing some researching on Binary Quadratic Models and Constraint Satisfaction Problems. Specifically, I have been researching to find out how you could make a program that allows a user to implement the Job Shop Scheduling problem to create some schedule.
The program would take in multiple constraints such as the time each job can start, what each job depends on, the length of jobs etc, and find out the most optimized schedule for the day.
I have limited experience making CSPs and BQMs, so I am wondering how hard it would be to create a model that can then be turned into a QUBO and sent to the D-Wave solver. Are problems with this many constraints very complex and take a lot of research?
As a complete noob to this kind of maths, I am wondering if this is worth pursuing any further and if I should instead just use the current D-Wave implementation of a JSP.