Hi, I need help and its urgent.
I have this code for scheduling in one machine, I made it according to another one I have but for two machines, the diference is in this case it is one machin, I need to minimize the earliness and tardiness and I used alias and pairmap to make easier the coding, everything seems fine but the solver cant find a solution
Integer infeasible: the first MIP master problem was infeasible.
Ive used MINLP and MIP but nothing works.
I cant upload the file but this is the code
$offSymXRef
$offSymlist
option limrow=0;
option limcol=0;
option solprint=on;
option sysout=off;
option LP=CPlEX;
option MIP=CPlEX;
option NLP=CONOPT;
option MINLP=DICOPT;
option OPTCR=0;
$title *Secuencia 1 machine*
$onText
*j tp DD*
*17 15 74*
*18 10 84*
*19 25 59*
*20 30 104*
*21 17 24*
*22 20 94*
$offtext
Sets
i trabajo /17,18,19,20,21,22/,
o binaria /1,2,3,4,5,6,7,8,9,10,11,12,13,14,15/;
Alias (i,j);
Set pairMap(o,i,j);
pairMap(o,i,j)$(ord(i)<ord(j)) = yes;
Parameters
t(i) tp
/17 15, 18 10, 19 25, 20 30, 21 17, 22 20/
d(i) due date
/17 74, 18 84, 19 59, 20 104, 21 24, 22 94/,
M gran M /1000/;
Variables
x(i) t. inicio
s(i) tardanza izquierda
z(i) tardanza derecha
obj FO
y(o) lotes de var bin
l(i) tardanza var bin
ft(i) fin tarea
Positive Variables x(i), s(i), z(i), ft(i) ;
Binary Variables y(o), l(i);
EQUATIONS
funobj, fin(i), tari(i), tard(i),comp1(o,i,j), comp2(o,i,j);
funobj.. obj =e= sum((i), s(i)+z(i));
fin(i).. ft(i) =e= x(i)+t(i);
tari(i).. s(i) =e= (ft(i)-d(i))*l(i);
tard(i).. z(i) =e= (d(i)-ft(i))*(1-l(i));
comp1(o,i,j).. x(i)+t(i) =l= x(j)+M*(y(o));
comp2(o,i,j).. x(j)+t(j) =l= x(i)+M*(1-y(o));
MODEL Machine1Sequence / all /;
SOLVE Machine1Sequence using MINLP min obj;