Soft Scheduling

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F01%3A00004835" target="_blank" >RIV/00216224:14330/01:00004835 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Soft Scheduling
Original language description
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 aresolved via proposed methods. Implementation of general preference constraint solver is discussed and first computational results for timetabling problem are presented.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA201%2F01%2F0942" target="_blank" >GA201/01/0942: Advanced Planning and Scheduling</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 2001 ERCIM Workshop on Constraints
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
145
Publisher name
Charles University in Prague, Faculty of Mathematics and Physics
Place of publication
Prague, Czech Republic
Event location
Prague
Event date
Jan 1, 2001
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)