Empty timetable sheet showing time slot allocations.

A school timetable is a calendar that coordinates students and teachers within the classrooms and time periods of the school day. Other factors include the class subjects and the type of classrooms available (for example, science laboratories).

Since the 1970s, researchers in operations research and management science have developed computerized solutions for the school timetable problem (STP).

Description and purpose of a school timetable

A school timetable consists of a list of the complete set of offered courses, as well as the time and place of each course offered. The purposes of the school timetable are to inform teachers when and where they teach each course, and to enable students to enroll in a subset of courses without schedule conflicts.[1]


Prior to the introduction of operations research and management science methodologies, school timetables had to be generated by hand. Hoshino and Fabris wrote, "As many school administrators know, creating a timetable is incredibly difficult, requiring the careful balance of numerous requirements (hard constraints) and preferences (soft constraints). When timetables are constructed by hand, the process is often 10% mathematics and 90% politics,[2] leading to errors, inefficiencies, and resentment among teachers and students."[1]

For the simplest school timetable, such as an elementary school, these conditions must be satisfied:[3]

Hoshino and Fabris describe other conditions of real-life timetabling problems, that

...involve additional constraints that must be satisfied, further increasing the complexity of the STP (school timetable problem).[3] These variations include event constraints (e.g. Course X must be scheduled before Course Y), and resource constraints (e.g. scheduling only one lab-based course in any timeslot). At large universities, there are additional constraints that must be considered, such as taking into account the time students need to walk from one end of the campus to the other.[1]

Since the 1970s, researchers have developed computerized solutions to manage the complex constraints involved in building school timetables.[1] In 1976, for example, Gunther Schmidt and Thomas Ströhlein formalized the STP with an iterative algorithm using logical matrices and hypergraphs.[4]

Nelishia Pillay published a comprehensive survey paper of these algorithms in 2014,[5] including a table of methods for solving the school timetabling problem.[6]

High school

High school timetables are quite different from university timetables. The main difference is that in high schools, students have to be occupied and supervised every hour of the school day, or nearly every hour. Also, high school teachers generally have much higher teaching loads than is the case in universities. As a result, it is generally considered that university timetables involve more human judgement whereas high school timetabling is a more computationally intensive task (see the constraint satisfaction problem).[7]

Selected other options

The task of constructing a high school timetable[8] may involve the following options (not an exhaustive list):

See also


  1. ^ a b c d Hoshino, Richard; Fabris, Irene (2020). "Optimizing Student Course Preferences in School Timetabling". In Hebrard, Emmanuel; Musliu, Nysret (eds.). Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Lecture Notes in Computer Science. Vol. 12296. Springer International Publishing. pp. 283–299. doi:10.1007/978-3-030-58942-4_19. ISBN 978-3-030-58942-4. S2CID 221839945. Also available as .pdf: Hoshino & Fabris
  2. ^ Burke, Edmund; Erben, Wilhelm, eds. (2001). Practice and Theory of Automated Timetabling III. Lecture Notes in Computer Science. Vol. 2079. doi:10.1007/3-540-44629-x. ISBN 978-3-540-42421-5. ISSN 0302-9743. S2CID 1258394.
  3. ^ a b Post, Gerhard; Ahmadi, Samad; Daskalaki, Sophia; Kingston, Jeffrey H.; Kyngas, Jari; Nurmi, Cimmo; Ranson, David (2012-04-01). "An XML format for benchmarks in High School Timetabling". Annals of Operations Research. 194 (1): 385–397. doi:10.1007/s10479-010-0699-9. ISSN 1572-9338. S2CID 254227100.
  4. ^ Gunther Schmidt and Thomas Ströhlein (1976) "A Boolean matrix iteration in timetable construction", Linear Algebra and Its Applications 15(1):27–51
  5. ^ Pillay, Nelishia (2014). "A survey of school timetabling research". Annals of Operations Research. 218 (1): 261–293. doi:10.1007/s10479-013-1321-8. S2CID 254236964.
  6. ^ Pillay, Nelishia (2014-07-01). "Overview of methods used to solve the school timetabling problem". Annals of Operations Research. 218 (1). doi:10.1007/s10479-013-1321-8. ISSN 1572-9338. S2CID 254236964.
  7. ^ Brailsford, Sally C.; Potts, Chris N.; Smith, Barbara M. (1999-12-16). "Constraint satisfaction problems: Algorithms and applications" (PDF). European Journal of Operational Research. 119 (3): 557–581. doi:10.1016/S0377-2217(98)00364-6. ISSN 0377-2217.
  8. ^ "Importance of the School Time Table You Must Know". Notes Read. 2016-11-30. Retrieved 2018-07-23.
  9. ^ "ASTI: Regular part-time teacher". www.asti.ie. November 22, 2019. Archived from the original on November 22, 2019. Retrieved 2018-07-23.
  10. ^ "Chegg.com". www.chegg.com. Retrieved 2018-07-23.
  11. ^ "STEM, Science and D&T resources | Schools | Practical Action". practicalaction.org. Retrieved 2018-07-23.
  12. ^ "College Writing Course Policies". UMass Amherst. 2010. Archived from the original on January 2, 2017. Retrieved 17 January 2016.
  13. ^ Ivers, Karen S. (2003). A teacher's guide to using technology in the classroom. Westport, CT: Libraries Unlimited. p. 121. ISBN 9781591580744. tth mw.