Hi, there's no direct way to model this using the scheduling constraints in Gecode. On workaround I could imagine would be to make an array x of all start and end times, and then use the "sort" constraint to produce a sorted array y. On a unary resource, this should mean that the start and end times in y are still in the right order, and you can post the constraint y[i+1]-y[i] <= Tmax for i in 1,3,5,7...
Hope this helps, Guido On 13/03/2013, at 20:30 , Mitrych Jiří <jiri.mitr...@rtscs.cz> wrote: > Hi, > > I have following problem to solve. I have one resource and some tasks with > starting times and durations. The constraint for scheduling is unary, it > ensures no overlaying in time. To that point it is clear for me. But what to > do, when I want to constrain the time gap between two consequential tasks not > bigger then let’s say Tmax? The complication is, that consequetial tasks from > time’s point of view haven’t got fixed positions in array, so I don’t know, > between which elements of array I should make a constraint for that Tmax. > > Best regards > Jiri Mitrych > > _______________________________________________ > Gecode users mailing list > users@gecode.org > https://www.gecode.org/mailman/listinfo/gecode-users -- Guido Tack, http://www.csse.monash.edu/~guidot/ _______________________________________________ Gecode users mailing list users@gecode.org https://www.gecode.org/mailman/listinfo/gecode-users
