next up previous
Next: A Project Management Problem Up: Adding Computation Domains: CLP Previous: A Project Management Problem

A Project Management Problem (III)


  $\mbox{$\bullet$}$
An alternative setting:

figure=clp_seminar_figs/prec_net_2.eps,width=0.36

  $\mbox{$\bullet$}$
We can accelerate task F at some cost

pn2(A, B, C, D, E, F, G, X):-
A #>= 0, G #<= 10,
B #>= A, C #>= A, D #>= A,
E #>= B + 1, E #>= C + 2,
F #>= C + 2, F #>= D + 3,
G #>= E + 4, G #>= F + X.
  $\mbox{$\bullet$}$
We do not want to accelerate it more than needed!
?- pn2(A, B, C, D, E, F, G, X),
mindomain(G,G), maxdomain(X, X).
A = 0, B::0..1, C = 0, D = 0,
E = 2, F = 3, G = 6, X = 3



Last modification: Thu Oct 7 12:04:03 MEST 1999 <webmaster@clip.dia.fi.upm.es>