[gecode-users] odering information for unary scheduling constraints

[Kish Shen]

Hi Guido,

Thanks for your reply.

Guido Tack wrote:

> It's the same information that is expressed in an STN (Simple Temporal Network), and I'm currently implementing that.  It won't be part of the unary constraint, because it's really not tied to any particular resource, but it's shared between all resources (tasks can be on more than one resource, but there's only one order among all tasks).

Is this information tied into gecode's search engines? That is, would 
the booleans be available for explicit labelling by the programmer? I 
ask this because the ECLiPSe gecode interface allows the search to be 
done from ECLiPSe.

Cheers,

Kish
-- 
This e-mail may contain confidential and privileged material for the
sole use of the intended recipient. Any review, use, distribution or
disclosure by others is strictly prohibited. If you are not the intended
recipient (or authorized to receive for the recipient), please contact
the sender by reply e-mail and delete all copies of this message.
Cisco Systems Limited (Company Number: 02558939), is registered in
England and Wales with its registered office at 1 Callaghan Square,
Cardiff, South Glamorgan CF10 5BT.