[gecode-users] Optimization in GECODE

[Christian Schulte]

Hi,

I am sorry but I have to admit that I do not understand your question. Could
you please try to rephrase?

Thanks
Christian

--
Christian Schulte, http://www.imit.kth.se/~schulte/ 

-----Original Message-----
From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of Dhananjay Thiruvady
Sent: Thursday, September 28, 2006 4:06 AM
To: users at gecode.org
Subject: [gecode-users] Optimization in GECODE


Hi all,

I'm implementing a scheduling problem with start (s), duration (d), end(e),
setup times, for n jobs. I would like to find the minimum scheduling time
from s[0] to s[n-1] and e[0] to e[n-1]. I have set it up such that e[n-1]
contains the largest time point and I have attempted BAB with constrain to
minimize e[n-1]. I realize that this only attempts different values for
e[n-1] and does not try different branchings for the s and e variables. How
can I do this, i.e., try different branchings to find a minimum?

Regards,

Dhananjay

_______________________________________________
Gecode users mailing list
users at gecode.org https://www.gecode.org/mailman/listinfo/gecode-users