Treffer: University course timetabling with soft constraints
Title:
University course timetabling with soft constraints
Authors:
Source:
PATAT 2002 : practice and theory of automated timetabling IV (Gent, 21-23 August 2002, selected revised papers)Lecture notes in computer science. :310-328
Publisher Information:
Berlin: Springer, 2003.
Publication Year:
2003
Physical Description:
print, 29 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Ordonnancement, Scheduling, sequencing, Algorithme recherche, Search algorithm, Algoritmo búsqueda, Problème confection horaire, Timetabling problem, Problema concepción horario, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Programmation mathématique, Mathematical programming, Programación matemática, Préférence, Preference, Preferencia, Réparation, Repair, Reparación, Satisfaction contrainte, Constraint satisfaction, Satisfaccion restricción, Système développement, Development systems, Contrainte douce, Soft constraint, Problème affectation, Assignment problem, Problema asignación
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Faculty of Informatics, Masaryk University, Botanická 68a, Brno 602 00, Czech Republic
Space Management and Academic Scheduling, Purdue University, 400 Centennial Mall Drive, West Lafayette, IN 47907-2016, United States
Space Management and Academic Scheduling, Purdue University, 400 Centennial Mall Drive, West Lafayette, IN 47907-2016, United States
ISSN:
0302-9743
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.15734380
Database:
PASCAL Archive
Weitere Informationen
An extension of constraint logic programming that allows for weighted partial satisfaction of soft constraints is described and applied to the development of an automated timetabling system for Purdue University. The soft-constraint solver implemented in the proposed solution approach allows constraint propagation for hard constraints together with preference propagation for soft constraints. A new repair search algorithm is proposed to improve upon initially generated (partial) assignments of the problem variables. The model and search methods applied to the solution of the large lecture room component are presented and discussed along with the computational results.