I am working on a scheduling problem in OR-Tools using the CP-SAT solver.
I'm working with python but I managed to rebuild this solution as starting point: Optimal way to ensure optional intervals are consecutive in OR-Tools
Just like in that problem I also have the constraint, that the jobs are consecutive. This works already.
My first problem is really easy in my mind, but somehow I cant make it work: the first job on each machine MUST start at 0.
Second problem: lets say I produce n colors of the same product. Every one of these $n$ colors has a maximum $i$, which is the maximum number of jobs of the same color I can build in sequence on the same machine.
My solution pretty much depends on my
x[job,machine] dict where
x[job,machine] is true if job is performed on machine.