Originally posted by: istenc
Hi,
I need it for a scheduling problem with batch delivery. At the end of some orders, a batch is delivered in our problem. So, let a batch be delivered immediately after order 1 is completed. If order 2 is also in this batch, i should ensure that order 1 is completed after order 2; at this point, i should ensure that endOf(A[2]])<endOf(A[1]). In a closed form, it would be like
endOf(A[i])<endOf(A[B[i]]) where B[i] is the order that has the maximum completion time in the batch by which order i is delivered.
Thanks to the post by Alex Fleischer, i can model this constraint easily.
Best,
İstenç
#CPOptimizer#DecisionOptimization