I have this constraint in my model to allow faces to be mined respecting precedences among them N[f]*sum(p in shovels)a[p][f][t]- sum[f' in precedences]m[f'][t]<=0; forall f in faces, t in periods.
Here, N[f] is the number of precedences for face f. a[p][f][t] is the allocation variable. Sum of this is 1 if shovel p is assigned to face f in period t as only one shovel can be assigned to a face in a period. m[f][t] is 1 if face f is mined out in period t, else it's 0. This constraint makes sure that the precedences are respected. I am not really sure how to define the precedence set so that cplex will loop through the precedence faces and assign shovel to a new face accordingly. For example, f' = [{}, {}, {1,2}, {1,3}, {1,2,4}, {1,3,4}]; The first two faces have no precedence. Face three can be mined if face and 1 and 3 have been mined, so on and so forth. Could you please suggest how to pull this off?
