Jeffrey H. Kingston

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)
SUMMARY Lout is a high-level language for document formatting, whose ease of use has permitted an unprecedented number of advanced features to be added quickly and reliably. This paper charts the evolution of the design and implementation of Lout from conception in mid-1984 to public release in October 1991. It includes extensive discussions of remaining(More)
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)
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 describes a computer program for high school timetabling which has completely solved an instance taken without simplification from a large and tightly constrained high school. A timetable specification language allows the program to handle the many idiosyncratic constraints of such instances in a uniform way. New algorithms are introduced which(More)
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)