#### Filter Results:

#### Publication Year

1985

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Scheduling lectures or exams for universities is a large and complex task. There are many different departments and faculties, each with their own ideas about how and when their courses should be run. Furthermore, modularisation means that students can take courses from a combination of several departments, possibly even in different faculties. Numerous… (More)

- Gerhard Post, Samad Ahmadi, Sophia Daskalaki, Jeffrey H. Kingston, Jari Kyngäs, Kimmo Nurmi +1 other
- Annals OR
- 2012

We discuss the High School Timetabling Problem as it appears in different countries. Based on this discussion, we propose a data model for exchanging datasets. The data model is defined by an xml schema, which is available online 1 .

This paper is the organizers' report on the Third International Timetabling Competition (ITC2011), run during the first half of 2012. Its participants tackled 35 instances of the high school timetabling problem, taken from schools in 10 countries.

This paper shows that timetable construction is NP-complete in a number of quite different ways that arise in practice, and discusses the prospects of overcoming these problems. A formal specification of the problem based on TTL, a timetable specification language, is given.

The foundation courses in Computer Science pose particular challenges for teacher and learner alike. This paper describes some of these challenges and how we have designed Problem-Based Learning (PBL) courses to address them. We discuss the particular problems we were keen to overcome: the pure technical focus of many courses; the problems of individual… (More)

In this paper we investigate the inherent complexity of the priority queue abstract data type. We show that, under reasonable assumptions, there exist sequences of n Insert, n Delete, m DecreaseKey and t FindMin operations, where 1 ≤ t ≤ n, which have Ω(nlogt + n + m) complexity. Although Fibonacci heaps do not achieve this bound, we present a modified… (More)

This paper introduces a divide-and-conquer approach to the single-source shortest path problem. For an arbitrary digraph with n vertices, m edges, and c cycles, a particular division is exhibited which leads to an O(klogk + m) algorithm, where k = min(n, c), improving on previous methods for near-acyclic digraphs.

STTL is a language for specifying and evaluating timetabling problems, instances, and solutions. An interpreter for STTL is freely available on the Internet. After a brief overview of the language, this paper explores the issues involved in applying STTL to real-world problems, using high school timetabling as a case study.

This paper presents a tiling algorithm for high school timetabling. The meetings are grouped into small, regular clusters called tiles, each of which is thereafter treated as a unit. Experiments with three actual instances show that tiling, coupled with an alternating path algorithm for assigning resources to meetings after times are fixed, produces good,… (More)