a multi-objective bisexual reproduction genetic algorithm for ...

48
Lecturers register their busy time. This checking will compare their busy time
with the time that is used to book the lecturers courses. If duplicated, an error is
counted.
3.6.4.3 Checking Conflicts about Preferable Time
Some lecturers dislike teaching in some working-sessions in a week. The system
should try to avoid booking their courses to this time.
The course scheduling program tries to book lecturers’ courses in these desired
time periods. Any conflict will be counted as a soft constraint.
A pseudo code for checking this is given in Figure 3-15.
Count=0
For each lecturer
For each day in a week
For each time-slot in a day
For each classroom
If (the current lecturer teaching the class is held in the current classroom and at
this time-slot ) and (the current lecturer dislikes teaching at this time) Count=Count+1
FIGURE 3-15 Pseudo code for detecting conflicts about preferable times
3.6.4.4 Checking Conflicts about Double Booked Lecturers
A lecturer cannot teach more than one course at the same time.
A pseudo code for checking this is given in Figure 3-16.
Count=0
For each lecturer
For each day in a week
For each time-slot in a day
Booked=0
For each classroom
If (course held in this classroom is taught by the current lecturer) Booked = Booked+1
If (Booked>1) Count=Count+1
FIGURE 3-16 Pseudo code for checking conflicts about double scheduled lecturers