Figure 1 example, pp. 153–154 — the printed weekly timetable solves CT3 for p = 3 days
ProvedTimetabling85.ClassTeacher.figure_1_exampleexamplep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1timetabling
Take two classes , three teachers , days and the requirement matrix
The paper's solution, day by day,
is a solution of CT3: it schedules every lecture exactly once and satisfies the balance constraints (8), (9) and (10).
This is the worked example illustrating Proposition 2.3.
Formalization Note The page labels the three matrices ", and "; the third label is a misprint for , and the third matrix is used for day 3. The blank entry of is .
Preamble
import Mathlib import Definitions.Def_Timetabling85_ClassTeacher_Problems
Formal statement
namespace Timetabling85.ClassTeacher
/-- The requirement matrix of Figure 1 (de Werra 1985, pp. 153–154): two classes, three teachers. -/
theorem figure_1_example :
IsCT3 (m := 2) (n := 3) ![![1, 2, 4], ![3, 0, 2]] 3
(fun i j k => (![![![0, 0, 2], ![1, 0, 0]],
![![0, 1, 1], ![1, 0, 1]],
![![1, 1, 1], ![1, 0, 1]]] : Fin 3 → Fin 2 → Fin 3 → ℕ) k i j) := by sorry
end Timetabling85.ClassTeacher
Source
de Werra, An introduction to timetabling, Eur. J. Oper. Res. 19 (1985), pp. 153–154, §2.1, example of Figure 1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.