This paper describes the University Course Timetabling Problem (UCTP) used in the International Timetabling Competition 2003 organized by the Metaheuristics Network and presents a state-of-the-art heuristic approach towards the solution of the competition instances. It is a greatly improved version of the winning competition entry. The heuristic is divided into three phases: at first, a feasibl...

In this article, we deal with a variant of the classical course timetabling problem that has a practical application in many areas of education. In particular, in this paper we are interested in high schools remedial courses. The purpose of such courses is to provide under-prepared students with the skills necessary to succeed in their studies. In particular, a student might be under prepared i...

Problem definition: Physical distancing requirements during the COVID-19 pandemic have dramatically reduced effective capacity of university campuses. Under these conditions, we examine how to make most newly scarce resources in related problems curriculum planning and course timetabling. Academic/practical relevance: We propose a unified model for scheduling under two-stage framework draw para...

Note: Peter Ross and Emma Hart have since moved from the University of Edinburgh to Napier University. The AI Applications Institute at the University of Edinburgh was created in 1984 to transfer AI-related technology from the university into practice, working in partnership with a wide range of international businesses and organisations. These include NASA, the US Department of Defense, the RA...

This paper investigates a hybridisation of the very large neighbourhood search approach with local search methods to address examination timetabling problems. In this paper, we describe a 2 phase approach. The first phase employs “multi start” to carry out search upon a very large neighbourhood of solutions using graph theoretical algorithms implemented on an improvement graph. The second phase...