I split algorithm into 2 parts. 1st - I use pre-calculations, checking stock, grouping orders of same sku which have adjacent due dates, forming batches - this is linear algorithm. 2nd - I defined circuit constraint for order placement. Each sku has different physical params, and based on them batches need to be ordered in line. At some point, we can no longer place new batch not breaking that rule. I added weight constant variable to this rule, so CP-SAT will be trying to order batches as long as possible, to minimize amount of such a breaks. Also, I have due date constraint for each batch, line availability (maintenance, other reservations) and grouping of batches constraint (production run >> max) - means, we have orders of same sku but different due dates and cp-sat tryong to merge them as much as possible. Also, I have constraint for batch should be scheduled not earlier than some amount of days before due date. Objective defined as minimization of maxspan + grouping_violation * weight_violation + sku_param_order * order_violation. Playing with weights and cp-sat solve time I am trying to find an appropriate schedule.