RUDOVÁ, Hana and Miroslav VLK. Multi-Criteria Soft Constraints in Timetabling (extended abstract). In Proceedings of the 2nd Multidisciplinary International Conference on Scheduling (MISTA 2005). New York, USA: New York University, 2005, p. 11-15.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Multi-Criteria Soft Constraints in Timetabling (extended abstract)
Name in Czech Multikriteriální měkká omezení v rozvrhování
Authors RUDOVÁ, Hana (203 Czech Republic, guarantor) and Miroslav VLK (203 Czech Republic).
Edition New York, USA, Proceedings of the 2nd Multidisciplinary International Conference on Scheduling (MISTA 2005), p. 11-15, 2005.
Publisher New York University
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher United States of America
Confidentiality degree is not subject to a state or trade secret
WWW URL
RIV identification code RIV/00216224:14330/05:00014770
Organization unit Faculty of Informatics
Keywords in English timetabling; constraint satisfaction; soft-contraints; multi-criteria reasoning; optimization
Tags constraint satisfaction, multi-criteria reasoning, Optimization, soft-contraints, timetabling
Changed by Changed by: doc. Mgr. Hana Rudová, Ph.D., učo 3840. Changed: 18/5/2009 15:43.
Abstract
Multi-criteria optimization is an important issue in many scheduling problems. The goal of this paper is to show how such an optimization may be incorporated into constraint programming. We propose a new approach which allows the inclusion of multiple criteria in a declarative style with the help of weighted soft constraints. These soft constraints are integrated with hard constraints in a standard CLP(FD) library. Our approach addresses the requirements of a large scale timetabling problem at Purdue University. We describe representative criteria from this problem and propose inference rules to be implemented using soft constraints.
Abstract (in Czech)
Multi-kriteriální optimalizace hrají významnou roli v mnoha rozvrhovacích problémech. Tato práce ukazuje, jakým zpusobem lze rozšířít programování s omezujícími podmínkami tak, aby umožňovalo řešení problému s více optimalizačními kriterii. Tento návrh je umožněn prostřednictví měkkých omezení, která mohou být integrována s pevnými omezeními standardní CLP(FD) knihovny. Práce také demonstruje použití tohoto přístupu při řešení rozsáhleho rozvrhovacího problemu na Purdue University.
Links
MSM0021622419, plan (intention)Name: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems
PrintDisplayed: 28/5/2024 00:05