I have developed this algorithm for my company where it should find the optimal planning to create products. We have multiple products that can be made on multiple machines however there are alot of different constraints applied to this issue making it so the solver cannot find an optimal solution even after 3 days of running. With permission from the manager i made the code public on my github to see if anybody with more CP SAT experience can find flaws or optimizations that i might have missed out on. I hope the ton of logging messages help in explaining what each constraint is suposed to do. https://github.com/SamuelW2002/Planning-CP-SAT Thanks in advance and ofcourse ask as much questions as you need Continue reading...
