Construction of university faculty timetables using logic programming techniques
A Prolog rule system for timetable construction in university faculties is proposed. The main module is concerned to the search of feasible instructor/room assignments under additional consideration of the faculty's education plan and certain a priori fixed assignment options. For accelerating...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
1992
|
| In: |
Discrete applied mathematics
Year: 1992, Volume: 35, Issue: 3, Pages: 221-236 |
| ISSN: | 1872-6771 |
| DOI: | 10.1016/0166-218X(92)90246-7 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1016/0166-218X(92)90246-7 Verlag, lizenzpflichtig, Volltext: https://www.sciencedirect.com/science/article/pii/0166218X92902467 
|
| Author Notes: | R. Fahrion and G. Dollansky |
| Summary: | A Prolog rule system for timetable construction in university faculties is proposed. The main module is concerned to the search of feasible instructor/room assignments under additional consideration of the faculty's education plan and certain a priori fixed assignment options. For accelerating the assignment search, a simple heuristic priority scheme is assumed. In another module, manual procedures for manipulating interactively the assignment results are possible. Further modules control the menu-driven input and maintenance of room and time planning data, manage the creation of timetable outputs and numerous survey tables, and thus contribute to a high transparency of the timetable planning process. The conceptional scheme of the underlying database contains information about lectures, exercises and seminars, lecturers and instructors, lecture halls, exercise rooms, and equivalent compatible rooms. Practical experiences with the program system, run on At microcomputers, will be reported. |
|---|---|
| Item Description: | Available online 20 May 2002 Gesehen am 31.10.2024 |
| Physical Description: | Online Resource |
| ISSN: | 1872-6771 |
| DOI: | 10.1016/0166-218X(92)90246-7 |