Mathematical basis?

[Benahmed Abdelkrim]

  Hello!
can we know the mathematical basis of the following constraint:
activities occupies max time slot from selection
Thanks in advance.

[Liviu Lalescu]

I do not understand. If you mean the uses of this constraint, enter the dialog there and press the Help button.

[Benahmed Abdelkrim]

       No I do not mean how to use this constraint, but I think that this constraint which is very powerful and very useful in various situations, deserves to be thrown more light on it
I also think that there may be a mathematical equation for this constraint?

[Liviu Lalescu]

       No I do not mean how to use this constraint, but I think that this constraint which is very powerful and very useful in various situations, deserves to be thrown more light on it

You are right. But I hope people will find it easily.
       

I also think that there may be a mathematical equation for this constraint?

You mean how FET works to generate a timetable with it? I think, if I remember correctly, that when I place an activity which occupies the (n+1)st slot, I displace the activities occupying other random slot. Of course this is a simplified explanation.

[Benahmed Abdelkrim]

You mean how FET works to generate a timetable with it? I think, if I remember correctly, that when I place an activity which occupies the (n+1)st slot, I displace the activities occupying other random slot. Of course this is a simplified explanation.

  Yes exactly this constraint deserves to be better explained.
I hope so!

[Liviu Lalescu]

  Yes exactly this constraint deserves to be better explained.
I hope so!

I cannot explain into the FET constraint dialog how the algorithm works for this constraint. The user needs to read the code in generate.cpp (for FET-5.31.6, lines 9645-9787).

[Benahmed Abdelkrim]

OK!
I will follow this way. Thanks!