Hi Volker,
a)
a1- Teachers give to school labs they want to offer
a2- Students choose prefered labs
a3- We give back teachers schedule and students schedule
b) full teacher have 18 hours so 3 labs, 6+6+6
others are support teachers and some times they attend to students needs
so can be variable, teachers with 1 lab only, others 2 labs, others 3, one 4 because we have a teacher at 24 hour contract
the remaining hours, if in excess, are used to assist and help stuff (manually placed)
In FET i make 3 activities each teacher 2+2+2 , 2+2+2 , 2+2+2 or less in the cases indicated above
c) 3 different projects each teacher (no repetition)
I imagined i could prepare theachers schedule skeleton right after "a1" and before "a2".
Because i already know theachers availability,
and i can assume with sufficient accuracy
which laboratories will be chosen by a student with certain aptitudes.
30 hours a week are filled by 5 labs
If i've 10 labs in the same area we can set them overlapped 2 by 2
So 5 are full aviable without overlap.
This would be a manual approach.
But the temptation is to wait "a2" phase
and assuming n=100 labs, generate a 100x100 upper triangular matrix containing the number of students who chose both labs in the pair (lab_i, lab_j) for all n*(n-1)/2 pairs.
Extract a weighted list and insert the weights from 99% downward into FET, allowing it to generate the least overlapping schedule
If not possible with FET, i try to make a PLI model using open solver ( https://opensolver.org/ ) .
I've to solve some modelling challenges, maybe mask teachers availability is not hard, or a choise matrix that distinguish lab1 lab2 lab3, but the gap to change building!??!
This calculation would be fast and with a well weighted objective function it give back most non-overlapping possible followed by the least overlapping.
But before this modelling and implementation effort ... if FET can help ...
a)
a1- Teachers give to school labs they want to offer
a2- Students choose prefered labs
a3- We give back teachers schedule and students schedule
b) full teacher have 18 hours so 3 labs, 6+6+6
others are support teachers and some times they attend to students needs
so can be variable, teachers with 1 lab only, others 2 labs, others 3, one 4 because we have a teacher at 24 hour contract
the remaining hours, if in excess, are used to assist and help stuff (manually placed)
In FET i make 3 activities each teacher 2+2+2 , 2+2+2 , 2+2+2 or less in the cases indicated above
c) 3 different projects each teacher (no repetition)
I imagined i could prepare theachers schedule skeleton right after "a1" and before "a2".
Because i already know theachers availability,
and i can assume with sufficient accuracy
which laboratories will be chosen by a student with certain aptitudes.
30 hours a week are filled by 5 labs
If i've 10 labs in the same area we can set them overlapped 2 by 2
So 5 are full aviable without overlap.
This would be a manual approach.
But the temptation is to wait "a2" phase
and assuming n=100 labs, generate a 100x100 upper triangular matrix containing the number of students who chose both labs in the pair (lab_i, lab_j) for all n*(n-1)/2 pairs.
Extract a weighted list and insert the weights from 99% downward into FET, allowing it to generate the least overlapping schedule
If not possible with FET, i try to make a PLI model using open solver ( https://opensolver.org/ ) .
I've to solve some modelling challenges, maybe mask teachers availability is not hard, or a choise matrix that distinguish lab1 lab2 lab3, but the gap to change building!??!
This calculation would be fast and with a well weighted objective function it give back most non-overlapping possible followed by the least overlapping.
But before this modelling and implementation effort ... if FET can help ...