In cplex 

Forall (I in P)

Forall(t in 1..T)

Sum(j in 1..N[t], k in 1..K, s in 1..S-R [I]+1) Y[I, J, K, s, t]==1

I didnt check it on cplex but I think it will be ok ISA

You may try this in LINGO:

@FOR(IVAR(I) | I :

     @FOR(TVAR(T):

          @SUM(JVAR(J) | J :

               @SUM(KVAR(K):

                    @SUM(SVAR(S) | S #LE# MAXS-R(I,T)+1 : Y(I,J,K,S,T) = 1)))));

Sorry, I do not know about how to write and parts. Hope someone can help.

For the second equation, you may write the similar code by using @MAX and @MIN in LINGO syntax.

Dear Dr Ahmed,

Thank you for your reply.

I did your suggestion in Cplex, but it does not work. I think it could not extract this (S-R[i]. S and R are int. The error message is "Cannot use the type int with "in"". Thus I changed R to be float, but the error still exists "Cannot use the type float with "in"".

What about the second constraint?

Best Regards,

Mahmoud

Dear Ivan,

Thank you for your reply.

The first constraint is done in Lingo. With respect to constraint 2, I could not do it, I do not know how to use @max and @min in the same time with @sum which contains another set. If you could do it, I would be grateful.

Regards,

Mahmoud

 Dear Lago,

Thank you for your reply.

I think Ivan included the index t. Regarding your proposed code, in which solver  I can write these statements? 

Regards,

Mahmoud

Ivan Kristianto Singgih comment is good.

You download LINGO demo version and check several sample models.

Especially, the blending models tell you how to code.

Hi,

Does anybody know Cplex? I am currenty programming a production problem where i m minimizing the setup cost. I have my production with product 1 & 2, period 1-3 and a microperiod 1-3. Now i want to schedule that if product 1 was produced for ex. in period 1 and microperiod 2 and product 2 is produced in period 1 and microperiod 3, i have setup costs.

Here is what i tried:

minimize obj_holding_cost+obj_production_cost+obj_backorder_cost+obj_setup_cost;

subject to {

forall(t in T, p in P)

if(t=b_z[m][i][t-1][s]+b_z[m][j][t][s]-1;

forall(i, j in P:i!=j, m in M,t in T:t>1, s in S:s=b_z[m][i][t][1]+b_z[m][j][t-1][s]-1;

forall(i, j in P:i!=j, m in M,t in T:t>1, s in S)

b_W[m][i][j][t][s]>=b_z[m][i][t][3]+b_z[m][j][t-1][s]-1;

forall(i, j in P:i!=j, m in M,t in T, s in S:s>1)

b_W[m][i][j][t][s]>=b_z[m][i][t][s]+b_z[m][j][t][s]-1;

I hope someone can help me.

Thank you in advance.

Hi, Nadine

I am unfamiliar in this area. So, I asked the professor Linus.

His answer is the following:

Shuichi:     Here is a one product-one machine version, LotBackLog01.lng,  in LINGO for this class of problems. It illustrates the basic approach for this class of problems, including holding, backlogging, and setup costs.  If you want to have multiple products and machines, then you must add a Product set, and a  machine set.    A free trial version of LINGO, capable of solving this model can be downloaded from www.lindo.com   Thanks,      LS

Hello,

I am using ILOG CPLEX and I am running an Integer optimisation problem that takes about 24 h to complete the 0.0%. I need to terminate the program after a certain time limit and obtain a solution for whatever the limit left. Can anyone let me know how to do that?

Thanks in advance