Not generating, really few number of restrictions

[Viafara]

Morning!

I'm looking for help in this file. It is has a few number of restrictions I don´t know what can be wrong.
Thanks in advance for your help!

[Liviu Lalescu]

Good morning!

I removed many data, and obtained a minimal impossible file. I attach it. Please check this file and think why it is impossible. You can view the highest stage timetable.

[Viafara]

Thanks for your fast answer!

I download your file and it keeps giving me a failure with the activity called ASL, with ING ROSA as a teacher. This subject needs to be 5 modules (2h+2h+2h+2h+1h), the ones that are 2h in different days and the module of an hour can be on a separate day or in the same day as one of the others. How would you recommend to imput this activity on the programme? Is it better to set 2 activities one 2+2+2+2 and another one of an hour or is it better the 5 modules together?

Or is this activity something imposible to settle?

[Liviu Lalescu]

You are welcome, Viafara!

You need to have a constraint min 1 days between 2+2+2+2. But this is not the important problem.

The important problem is only your activities in my simplified file. They are impossible, even without any constraints but basic ones. You need to examine the highest-stage timetable and consider why the last activity cannot be placed.

Note that the activities for a students year/group are propagated to subgroups. Maybe the students' structure of year 4 is not correct.

[Viafara]

I really appreciate your help. I finally understood were the failure was!

[Viafara]

Just for the next time I find myself in trouble. Could you tell me how you analyzed and reduced the issue to that class? In order for me to follow the same steps

[Liviu Lalescu]

I just saw that the timetable blocked very fast after few activities, and I removed year 1, saw that it was still impossible, removed year 2, then 3. I also saw that year 4 has a bit more complex structure.

Then I saw the initial order of placing the activities, and removed the last ones, keeping the timetable impossible.

[Viafara]

Nice logical thinking

[Liviu Lalescu]

Thank you!

[Liviu Lalescu]

I keep on removing data; if the timetable becomes solvable, I revert from the History to the previous state and continue removing other data.

[Viafara]

I finally got my schedules! All thanks to your help!

[Liviu Lalescu]

I am glad I could help!

Thank you for letting me know!