Work

Timetabling in constraint logic programming

Year: 1996

Type: conference-paper

Abstract: In this paper we describe the timetabling problem and its solvability in a Constraint Logic Programming Language. A solution to the problem has been developed and implemented in ECLiPSe, since it deals with finite domains, it has well-defined interfaces between basic building blocks and supports good debugging facilities. The implemented timetable was based on the existing, currently used, timetables at the School of Informatics at out university. It integrates constraints concerning room and period availability.

Source: Brunel University Research Archive (BURA) (Brunel University London)

Authors: M Kambi, David Gilbert

Institution: City, University of London

Language: English

Topic: Scheduling and Timetabling Solutions

Subfield: Management Science and Operations Research

Field: Decision Sciences

Domain: Social Sciences

Open Access status: green

OpenAlex ID: W1597583991

FWCI: 8.48

Cites: 18

Cited by: 33

Related to: 10