RUDOVÁ, Hana. Soft Scheduling. In Proceedings of the 2001 ERCIM Workshop on Constraints. Prague, Czech Republic: Charles University in Prague, Faculty of Mathematics and Physics, 2001, p. 145-154.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Soft Scheduling
Authors RUDOVÁ, Hana.
Edition Prague, Czech Republic, Proceedings of the 2001 ERCIM Workshop on Constraints, p. 145-154, 2001.
Publisher Charles University in Prague, Faculty of Mathematics and Physics
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 20200 2.2 Electrical engineering, Electronic engineering, Information engineering
Country of publisher Czech Republic
Confidentiality degree is not subject to a state or trade secret
WWW CoRR proceedings
RIV identification code RIV/00216224:14330/01:00004835
Organization unit Faculty of Informatics
Keywords in English constraint satisfaction; scheduling; timetabling; preferences
Tags constraint satisfaction, preferences, scheduling, timetabling
Changed by Changed by: doc. Mgr. Hana Rudová, Ph.D., učo 3840. Changed: 16/5/2002 16:46.
Abstract
Classical notions of disjunctive and cumulative scheduling are studied from the point of view of soft constraint satisfaction. Soft disjunctive scheduling is introduced as an instance of soft CSP and preferences included in this problem are applied to generate a lower bound based on existing discrete capacity resource. Timetabling problems at Purdue University and Faculty of Informatics at Masaryk University considering individual course requirements of students demonstrate practical problems which are solved via proposed methods. Implementation of general preference constraint solver is discussed and first computational results for timetabling problem are presented.
Links
GA201/01/0942, research and development projectName: Pokročilé plánování a rozvrhování
Investor: Czech Science Foundation, Advanced Planning and Scheduling
PrintDisplayed: 28/5/2024 00:43