Necessary and sufficient conditions are presented for the existence of a solution to the extended school time-tabling problem, in which each class (or year-group) and each teacher (or teaching department) is available more than once during each period, and in which pre-assignments may occur. An algorithm for constructing time-tables follows naturally from the proof of the result.(1)