Dear All,
I like the crew allocation problem that mentioned in the finite set
constraint manual and I want to write a similar code for the lectures
time-table for doctors in a university but I couldn't, so I hope someone will
help
The input data and constraints are as the following
Subjects : set of subjects with total no of lectures per week
Teatchers : set of teatchers names with subjects that they have
the ability to teach
Rooms : set of rooms numbers with subjects that they can be
assigned to this room
Teacher-max-hours-per-week : set of teatcher names with their maximum hours per
week
Teacher-max-hours-per-day : set of teatcher names with their maximum hours
per day
Working days are 5 days from Sun. Thur
For all teachers in their time tables, their lectures per day should be put
adjacent. i.e no gap between lectures per day
The output may be look like this
timetable(ali(sun [4:math 5:math 6:programmin language 7:programming language]
mon[
]
.....)
saad(sun......................................................]
mon[....................................................]
........)
......
)
Thanks,
Ali El-Matarawy
_________________________________________________________________________________
mozart-users mailing list
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users
