Results 1 
4 of
4
A cliquebased algorithm for constructing feasible timetables
"... Constructing a feasible solution, where the focus is on “hard ” constraints only, is an important part of solving timetabling problems. For the University Course Timetabling Problem (UCTP), we propose a heuristic algorithm to schedule events to timeslots based on cliques, each representing a set of ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Constructing a feasible solution, where the focus is on “hard ” constraints only, is an important part of solving timetabling problems. For the University Course Timetabling Problem (UCTP), we propose a heuristic algorithm to schedule events to timeslots based on cliques, each representing a set of events that could be scheduled in the same timeslot, which the algorithm constructs. Our algorithm has been tested on a set of wellknown instances, and the experimental results show that our algorithm compares favorably with other effective algorithms.
bo
"... sig aps alin hm lth, tra blems. ging co made erate be taught during the first or last period of the day. Timetabling constraints can be classified into hard and soft constraints. Any feasible timetable has to satisfy all hard constraints. For instance, the constraint that a teacher cannot be assign ..."
Abstract
 Add to MetaCart
(Show Context)
sig aps alin hm lth, tra blems. ging co made erate be taught during the first or last period of the day. Timetabling constraints can be classified into hard and soft constraints. Any feasible timetable has to satisfy all hard constraints. For instance, the constraint that a teacher cannot be assigned to two classes during the same time period is a hard constraint that has to be satisfied by any feasible schedule. On the other hand, a classes) increases. In fact, the larger the problem’s size, the more constraints any feasible schedule has to satisfy, and the more conflicting objectives such a schedule has to fulfill. Therefore, the generation of ‘‘highquality ” timetables is not a straightforward task. As pinpointed in the numerous literature reviews [15,22,30, 33,34], various timetabling approaches have been investigated. Yet, no specific one can be applied universally due to the specifics of individual problems. The newer approaches focus on bridging the gap between research and the real world applications they
Programming (RDP’09)
"... The aim of the WFLP workshop is to bring together researchers interested in functional programming, (constraint) logic programming, as well as the integration of the two paradigms. It promotes the crossfertilizing exchange of ideas and experiences among researchers and students from the different c ..."
Abstract
 Add to MetaCart
(Show Context)
The aim of the WFLP workshop is to bring together researchers interested in functional programming, (constraint) logic programming, as well as the integration of the two paradigms. It promotes the crossfertilizing exchange of ideas and experiences among researchers and students from the different communities interested in the foundations, applications and combinations of highlevel, declarative programming languages and related areas. The Program Committee of WFLP’09 collected three reviews for each paper and held an electronic discussion during May 2009. The Program Committee selected 12 regular papers for presentation at the workshop. In addition to the selected papers, the scientific program includes two invited lectures by Claude Kirchner from the Centre de Recherche INRIA Bordeaux SudOuest, France and Roberto Ierusalimschy from the Departamento de Informática, PUCRio, Brazil. I would like to thank them for having accepted our invitation. I would also like to thank all the members of the Program Committee and all the referees for their careful work in the review and selection process. Many thanks to all authors who submitted papers and to all conference participants. We gratefully acknowledge the Departamento de Sistemas Informáticos y Computación of the Universidad Politécnica de Valencia, who has supported this
A cliquebased algorithm for constructing feasible timetables
, 2010
"... Publication details, including instructions for authors and subscription information: ..."
Abstract
 Add to MetaCart
(Show Context)
Publication details, including instructions for authors and subscription information: