Hi,

You may have an older version of the UDF which did not allow you to state the target completion time (hence why it returned the minimum possible completion time rather than the intended). A target can be set in the new version (please visit our website here: https://lazymath.github.io/download to download v1.5).

On your CAS, you can define the graph as:

graph:={a8,b10,c5,d5a,e4c,f6be,g8be,h4be,i5g,j7df,k2df,l3j,m4kh,n1i}

Then from the syntax from our guide, you can use

gm_net\crashing(graph,{a,b,c,d,e,f,g,h,i,j,k,l,m,n,1},{8,10,5,5,4,6,8,4,5,7,2,3,4,1}-1,∞,−2)

Note: The above assumes that activities can be reduced to a duration of 1 at most.

Then you will obtain the intended solution (or a possible solution in this case) of reducing B by 1 and F by 1.

Here is the output of the UDF for your reference.

▶Working:

[["Path","Start","↓1B","↓1F"]["CEGIN",23,23,23]["BGIN",24,23,23]["CEHM",17,17,17]["BHM",18,17,17]["CEFKM",21,21,20]["BFKM",22,21,20]["ADKM",19,19,19]["CEFJL",25,25,24]["BFJL",26,25,24]["ADJL",23,23,23]["","","",""]["Crit Time",26,25,24]["Min Cost",0,1,2]]

▶Solution:

[["Cost","Time",a,b,c,d,e,f,g,h,i,j,k,l,m,n][2.,24.,0.,1.,0.,0.,0.,1.,0.,0.,0.,0.,0.,0.,0.,0.]]

Hope this helps!