Custom FET for course planning

[Liviu Lalescu]

I tried to read and recall the stuff I did back then. I hope I am not mistaking:

Each activity only with students (without teacher) will be allocated to one of the preferred FET rooms = real teacher. Now, FET should not allocate two (or more) activities at the same time to the same real teacher = FET room. So, in order to help the algorithm, you add the list of FET rooms which represent each real teacher. The only thing inside the algorithm is this: say teacher T has proper rooms R1 and R2. Then R1 and R2 cannot be occupied at the same time slot (any time slot) by any activities (as T would be overwhelmed).

Please see the example file examples/examples-old-mapr-asa8/example-mapr-2.fet.

Where are you using the mapr version? Let me know more, if you want.

Note: There are two users who provided two examples which could not be solved by FET mapr. It seems that for large, highly constrained timetables, FET mapr is inefficient. You might lose your time trying FET mapr.

[fourat]

Thank you Mr Liviu
I'm trying to Solve exam plan for Tunisian high school
Simplifying : The supervisors (teachers) are subdivided into categories each activity has tow teachers from different categories
 

[Liviu Lalescu]

Oh, indeed.

See also: https://lalescu.ro/liviu/fet/forum/index.php?topic=3961.msg21210#msg21210 and other posts in that topic. It seemed to be successful for Peter B. It is another approach.

[fourat]

Big thanks 

[Liviu Lalescu]

You are welcome! And please call me simply Liviu