int NTasks$=...$; $//$Number of tasks are read from data file

int NStations$=...$;

range Tasks$=1..$NTasks;

range Stations$=1..$NStations;

float T$[$Tasks$]=...$;

int b$[$Tasks$][$Tasks$]=...$;

dvar boolean x$[$Tasks$][$Stations$]$;

dvar float$+$ Tc;

minimize Tc;

subject to

$\{$

forall$($i in Stations$)$

Tc$>=$sum$($j in Tasks$)$T$[$j$]*$x$[$j$][$i$]$;

forall$($j in Tasks$)$

sum$($i in Stations$)$x$[$j$][$i$]==1$;

forall$($j in Tasks, k in Tasks:j$!=$k$)$

sum $($i in Stations$)$i$*$x$[$k$][$i$]>=$b$[$j$][$k$]*$sum $($i in Stations$)$i$*$x$[$j$][$i$]$;

$\}$ rewrite this code as a CP With IBM CPLEX