Creating symmetric Timetable

[beanb34n]

I want to create a 6 day timetable, where the time table of 1st 3 days and last 3 days is as close to identical as possible. I implemented this by creating a 3 day timetable and replicating it. It is good enough till i have to add leaves only on Friday and saturday. Is there a way to give FET a timetable and have it find the closest possible timetable to it? then i could make 1 timetable and then use that as inputs to 2 timetable for Mon-Wed and Thu-Sat

[Liviu Lalescu]

Interesting problem! I am thinking of these possible solutions:

1) For what you said, you can lock the timetable, then for the locking constraints of type activity preferred starting time make instead of 100% something like 99% and generate.

2) As my idea, add the activities for 6 days, and for each pair of activities add same starting hour something like 99%, min and max 3 days between them with something like 99%.

3) Another idea: 3 days timetable, double the teachers or students, say T1 and T2, T1 is week 1, T2 is week 2, then add all activities of T1 and T2 in a constraint activities occupy max time slots from selection, select with X (red) all the slots, max occupied = max(duration of T1 activities, d of T2 a)+say 4, and try to decrease this "say 4" to 3, to 2.

[beanb34n]

Is there a fast way to add these constraints? I am currently selecting 2 activities and setting their mindays to 3. For 360 total activities.

[Liviu Lalescu]

Do you refer to my point (2)? Not possible with current FET. Possible with a customization or if you see the XML fet file and do a program/script to write these constraints in the XML fet notation.

[beanb34n]

Ok. I will start doing 180 pairs of activities for mindays =3 and maxdays = 3 and same starting time. Thanks for the help.

[Liviu Lalescu]

Same starting hour (any days), not time.

You are welcome!