There are very few medical ethics courses in British medical schools which are a formal part of the clinical curriculum. Such a programme is described in the following, along with the way in which the long-term curriculum committee of the University College and Middlesex HospitalJointMedical Schoolwas persuaded to make it compulsoryforfirst-year students. Pedagogical lessons which have been lea...

Two ant algorithms solving a simplified version of a typical university course timetabling problem are presented – Ant Colony System and MAX -MIN Ant System. The algorithms are tested over a set of instances from three classes of the problem. Results are compared with recent results obtained with several metaheuristics using the same local search routine (or neighborhood definition), and a refe...

This paper presents a case-based heuristic selection approach for automated university course and exam timetabling. The method described in this paper is motivated by the goal of developing timetabling systems that are fundamentally more general than the current state of the art. Heuristics that worked well in previous similar situations are memorized in a case base and are retrieved for solvin...

There are very few medical ethics courses in British medical schools which are a formal part of the clinical curriculum. Such a programme is described in the following, along with the way in which the long-term curriculum committee of the University College and Middlesex Hospital Joint Medical School was persuaded to make it compulsory for first-year students. Pedagogical lessons which have bee...

This paper describes a comprehensive course timetabling and student scheduling system that was developed for the University of Waterloo between 1979 and 1985. The system is based on a “demand-driven” philosophy where students first chose their courses, and the system tries to find the best timetable to maximize the number of satisfied requests. The problem is first decomposed into small managea...

Classical notions of disjunctive and cumulative scheduling are studied from the point of view of soft constraint satisfaction. Soft disjunctive scheduling is introduced as an instance of soft CSP and preferences included in this problem are applied to generate a lower bound based on existing discrete capacity resource. Timetabling problems at Purdue University and Faculty of Informatics at Masa...

Automated examination timetabling has been addressed by a wide variety of methodologies and techniques over the last ten years or so. Many of the methods in this broad range of approaches have been evaluated on a collection of benchmark instances provided at the University of Toronto in 1996. Whilst the existence of these datasets has provided an invaluable resource for research into examinatio...