Research Article
Linear Integer Model for the Course Timetabling Problem of a Faculty in Rio de Janeiro
Table 8
Modelling information.
| | Number of binary allocation variables | 3,745 | | Number of , , and binary variables | 145, 145, and 145 |
| | Total number of integer variables | 4,180 |
| | Number of hard constraints in the first, second, and third groups | 302, 205, and 234 | | Number of soft constraints in the first, second, and third groups | 145, 145, and 145 |
| | Total number of constraints | 1,176 |
| | Weights () | 10; 100; 1 | | Satisfaction of soft constraints in the first group (from a total of 29 modules) | 28 of 29 (96.55%) | | Satisfaction of soft constraints in the second group (in pairs of SS modules) | 29 of 34 (85.29%) | | Satisfaction of soft constraints in the third group (for each nonpaired SS module) | 6 of 10 (60.00%) | | Lecturers allocated outside of their availability schedule | 0 of 77 (0.00%) | | Lecturers with no modules allocated | 0 of 77 (0.00%) | | Computational time | 261.41 seconds | | Number of unallocated modules (estimated 73 unallocated modules) | 80 (8.75% above estimate) |
|
|
