Messages

Good idea. At first glance I think it works no matter how many rooms we have (but not more than available teachers). We only have to assume that a good plan is much more important for students than for teachers. With no teacher we will get an optimal plan for students and then we can assign teachers to already planned activities. Assuming the opposite (teachers more important) leads to activities without students – no problem in FET. Thank You very very much I'll try it, but please don't expect results quickly as we have (oh, my God) over 300 groups.

Greetings,
Krzysztof K. (KK)

Thank You very much for the answer,
Of course I'll try to use FET to build the plan however I'm afraid that assigning teachers to students will lead to "impossible" plans (we have all 12 groups from the example  – and sometimes even more - on one year on one faculty). I can prepare a lot of input files with  combinations teachers and students but I've read all Your hints on forum and hoped that there is some trick for that. It doesn't change my opinion on FET – it is great and powerful program and whatever result I'll achieve I'll let You know.

Greetings,
Krzysztof K. (KK)

First of all, thanks for the program. It is really powerful.
I'm not familiar with FET so forgive me if this is obvious or I missed existing answer, but I try to find a way to define the following situation.
We have 12 groups of students (S1, S2, ..., S12) and 3 teachers (T1, T2, T3) for subject SU1 that can be hold in one of two rooms (R1 and R2).
Teachers are not assigned to any particular group, but we know that T1 has 6 groups, T2 has 4 groups and T3 has 2 groups (i.e. it doesn't matter which one of T1..3 will be assigned to the particular group). Very similar situation we have for many other activities.

This - I guess - makes all constrains much weaker and should let the algorithm to assign T(i) to S(j) by itself to find a (better) plan.

The question is how to define this in FET?

Thanks in advance for any advice!

Krzysztof K. (KK)