Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{378716,
author = {Rudová, Hana},
address = {Prague, Czech Republic},
booktitle = {Proceedings of the 2001 ERCIM Workshop on Constraints},
keywords = {constraint satisfaction; scheduling; timetabling; preferences},
language = {eng},
location = {Prague, Czech Republic},
pages = {145-154},
publisher = {Charles University in Prague, Faculty of Mathematics and Physics},
title = {Soft Scheduling},
url = {http://arXiv.org/html/cs.PL/0110012},
year = {2001}
}
TY - JOUR
ID - 378716
AU - Rudová, Hana
PY - 2001
TI - Soft Scheduling
PB - Charles University in Prague, Faculty of Mathematics and Physics
CY - Prague, Czech Republic
KW - constraint satisfaction
KW - scheduling
KW - timetabling
KW - preferences
UR - http://arXiv.org/html/cs.PL/0110012
N2 - 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.
ER -
RUDOVÁ, Hana. Soft Scheduling. In \textit{Proceedings of the 2001 ERCIM Workshop on Constraints}. Prague, Czech Republic: Charles University in Prague, Faculty of Mathematics and Physics, 2001, s.~145-154.
|
