[gecode-users] odering information for unary scheduling constraints

[Guido Tack]

Kish Shen wrote:

> 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.

The STN will be available to the programmer, so the ECLiPSe search engine could query the existing partial order as well as post new ordering constraints.  The interface will not use BoolVars but a direct representation of tasks.

Cheers,
	Guido

-- 
Guido Tack, http://people.cs.kuleuven.be/~guido.tack/