BrazilInstance1Originally from Souza, M.J.F, translated by Santos, H.G.S. and Post, G.F.Dec 4,2009 11:57:26BrazilInstance number 1 used originally in D.Sc. thesis of Souza, M.J.F. and later in works of Santos, H.G.S. et al.MoTuWeThFrTimesDurationTwoTeacherClassallTeachersallClassesT1T2T3T4T5T6T7T8S1S2S3T1-S1T1-S2T1-S3T2-S1T2-S2T3-S1T3-S2T3-S3T4-S1T4-S2T4-S3T5-S2T5-S3T6-S1T6-S2T6-S3T7-S1T7-S3T8-S1T8-S2T8-S3All EventsT1-S13ClassTeacherT1-S23ClassTeacherT1-S33ClassTeacherT2-S15ClassTeacherT2-S25ClassTeacherT3-S13ClassTeacherT3-S23ClassTeacherT3-S33ClassTeacherT4-S13ClassTeacherT4-S23ClassTeacherT4-S33ClassTeacherT5-S25ClassTeacherT5-S35ClassTeacherT6-S14ClassTeacherT6-S24ClassTeacherT6-S34ClassTeacherT7-S15ClassTeacherT7-S35ClassTeacherT8-S12ClassTeacherT8-S22ClassTeacherT8-S32ClassTeacherAssignTimestrue1LinearSplit events to duration 1 and 2true1Linear121999At least 1 double lesson(s)false1Linear211At least 2 double lesson(s)false1Linear222Times for duration 2true1Linear2Spread events max 1 per daytrue1Linear0101010101NoResourceClashestrue1LinearForbiddenTimesOfT1true1LinearForbiddenTimesOfT2true1LinearForbiddenTimesOfT3true1LinearForbiddenTimesOfT4true1LinearForbiddenTimesOfT5true1LinearForbiddenTimesOfT6true1LinearForbiddenTimesOfT7true1LinearForbiddenTimesOfT8true1LinearNo IDLE times for teachersfalse3Linear00Not more than 2 days with lessonsfalse9Linear02Not more than 3 days with lessonsfalse9Linear03Haroldo Gambini SantosDecember 2011Obtained from a compact IP formulation, solved with CBC212112221122122121121221221212211112221222122112Matias Sorensen04042015Solution approach described in "Integer programming for the generalized high school timetabling problem (Journal of Scheduling, 2014)"12121212212212121212121212212222221121221221122