Detailed Information on Publication Record
2001
Soft Scheduling
RUDOVÁ, HanaBasic information
Original name
Soft Scheduling
Authors
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
Language
English
Type of outcome
Stať ve sborníku
Field of Study
20200 2.2 Electrical engineering, Electronic engineering, Information engineering
Country of publisher
Czech Republic
Confidentiality degree
není předmětem státního či obchodního tajemství
References:
RIV identification code
RIV/00216224:14330/01:00004835
Organization unit
Faculty of Informatics
Keywords in English
constraint satisfaction; scheduling; timetabling; preferences
Změněno: 16/5/2002 16:46, doc. Mgr. Hana Rudová, Ph.D.
Abstract
V originále
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 project |
|