RE : [Help-glpk] Planning problem : dynamic constraint

[yo yo]

If you want it to work exactly T[j] quarters
continuously, then you can use a variable S(i,j,k)
that is true if i starts activity j on quarter k and
false otherwise.
And you add the constraint:
continuité{k1}:sum(k2 : k2>=k1 and k2<=k1+T[j]){
Ag[i,j,k2]>=S[i,j,k1]*T[j]
}
and also
unicité{j,k1}:sum(k2: k2>=k1 and k2<= k1+T[j]){
S[i,j,k2]<=1
}

That's a first thought.

Lionel BERTON.

--- Freund Olivier <address@hidden> a écrit :

> 
> Hello, i am a french student in work placement
> experience
> 
> I am working in an application which allocate some
> employees to some
> activities each quater during a period of two or
> four weeks. So this period
> is divided into quaters which are indexed from one
> to N.
> 
> My modelling describes a MIP problem which has one
> binary suscripted
> variable Ag[i,j,k] for all dummy indices i,j,k.
> Ag[i,j,k] is true if the
> employee i is allocated to activity j during the
> quater number k. If this
> employee isn't allocated to activity j during the
> quater k, Ag[i,j,k] is
> false.
> 
> My problem is that i have to model the constraint
> "an employee i which is
> allocated to an activity j has to be allocated to
> this activity during T[j]
> consecutives quaters at least". T[j] is a suscripted
> integer parameter which
> depends on the activity j and this parameter has
> already been assigned.
> 
> Thanks to help me
> -- 
> View this message in context:
>
http://www.nabble.com/Planning-problem-%3A-dynamic-constraint-tf2120199.html#a5847448
> Sent from the Gnu - GLPK - Help forum at Nabble.com.
> 
> 
> 
> _______________________________________________
> Help-glpk mailing list
> address@hidden
> http://lists.gnu.org/mailman/listinfo/help-glpk
> 



        
 p5.vert.ukl.yahoo.com uncompressed/chunked Thu Aug 17 12:14:03 GMT 2006 
        
                
___________________________________________________________________________ 
Découvrez un nouveau moyen de poser toutes vos questions quelque soit le sujet 
! 
Yahoo! Questions/Réponses pour partager vos connaissances, vos opinions et vos 
expériences. 
http://fr.answers.yahoo.com