Messages

Life brings a lot of experience, more than a developer may predict. In my timetable, I needed something like "three activities are consecutive". Assuming "consecutiveness" relation is transient, if you declare that activity_1 and activity_2 are consecutive and activity_2 and activity_3 are too consecutive there should be relation that activity_1, activity_2 and activity_3 are consecutive. Additionally, activity_3 must end students day. In theory, but program gets stuck after a small percent of placed activities.
My workaround was this: activity_1 and activity_2 are consecutive, activity_3 must end students day and that three activities were grouped. The program then solves the timetable but it needs more time to do it.
The question is: is the program aware of chained activities and can warn a user that they may lead to no solution?

Because you use Qt library, I suppose the problem lies between Qt and Gtk rather than between Application and Qt and possibly has no serious impact on FET.

After running program from terminal there appears this message.

Code Select Expand

Gtk-Message: GtkDialog mapped without a transient parent. This is discouraged.
I don't know what is its importance but it's for your knowledge.

Ah, that's the trick . Good to know. Thanks.

After generation of several timetables, which one can I view within FET program and how can I switch between them? I don't mean HTML version that are in separate folders.

I have a data plan for 852 activities. It's not an easy one. I try to figure out how FET tries to place activities which might help to make a better data file. What I see is that after 3 mins, FET managed to place 669 activities and then it continuously decreased number of placed ones. After 11 hrs FET says it placed 302 activities and it's been stuck at this point for 3 or more hours. With 300 of 850 activities placed FET has a plenty of time slots and space to try placing but it does not do it, I suppose, or it's not visible. Is there something in the algorithm that prevents FET from more intensive searching?

Thanks very much. I'll try this immediately.

BTW: did you modify the number of hours per day or the number of days per week after generating?

Yes, I did.
If I replicate this I'll let you know.

For the first time, I met the following assertion failure. It does not mean anything for me. What about you?

Code Select Expand


fet: interface/timetableviewstudentstimehorizontalform.cpp:540: void TimetableViewStudentsTimeHorizontalForm::updateStudentsTimetableTable(): Assertion `d*gt.rules.nHoursPerDay+h<studentsTimetableTable->columnCount()' failed.
Aborted


It happened while closing the dialog after finished successful generation.

I think I'd like it and I feel it would be valuable in some circumstances. Thanks.

I think you got it right what I meant.
Would it be possible the highest timetable in the sense of the same max placed activities not to be always the same?
I mean this mechanics:

• At a stage there are 500 max placed activities (of 600)
• Then after some time there are 430 out of 600 activities placed
• Then after next some time there are 500 out of 600 activities placed again

What I'd like to examine is this next the same max because I suppose this next timetable will be a different one, at least partly, and I could see it writing the next highest stage timetable (here 500). I think this (or these) new timetable(s) would help me to find the cause why it doesn't generate or else I have to wait for at least n+1 max activities placed which may last quite a long time.

Given the status of max placed activities I wonder if the next time FET reaches that number it replaces the previous schedule. I think that would be useful after writing the highest timetable to check e.g. conflicts.

Just to be sure:

Suppose:

• a teacher T teaches subject S
• a subject S has preferred room R1
• teacher T has home room R2

Assuming above, will FET be able to schedule S in room R2?
I would doubt but I may be wrong.

How to increase probability that a teacher will have an activity in his home room rather than in other allowed by space constraint for a subject? I've assigned a home room for a teacher with the weight of 100% and an activity has been scheduled in other room despite there was a free time slot in the teacher home room.

Doesn't "min hours daily for a teacher" solve the problem?