. . . . . . . . . . . . "0"^^ . "http://www.isvav.cz/projectDetail.do?rowId=GAP202/10/1188"^^ . "0"^^ . "2013-12-31+01:00"^^ . . "1"^^ . "2010-01-01+01:00"^^ . . . "GAP202/10/1188" . "V\u00FDsledky projektu zcela splnily zad\u00E1n\u00ED n\u00E1vrhu projektu. \u0158e\u0161itel\u00E9 projektu dos\u00E1hli kvalitn\u00EDch origin\u00E1ln\u00EDch v\u00FDsledk\u016F. Po\u010Dty v\u00FDsledk\u016F, p\u0159edev\u0161\u00EDm kategorie Jimp jsou v\u00FDborn\u00E9 (i s ohledem na velikost t\u00FDmu a dobu trv\u00E1n\u00ED projektu) a v kvalitn\u00EDch \u010Dasopisech."@cs . . "scheduling knowledge engineering constraint satisfaction and optimisation"@en . . "KnowSched: Znalostn\u00ED techniky v rozvrhov\u00E1n\u00ED" . "KnowSched: Knowledge Techniques in Scheduling"@en . "Scheduling is studied for a long time and the research results include many solving algorithms for particular scheduling problems. There exists a classification of scheduling problems but no unified approach to describe particular scheduling problems that can serve as interface to schedulers. Another issue of traditional scheduling research lies in the increasing distance between the studied formal problems and reality. The project addresses the problem of identifying the core features of scheduling problems, proposing formalism for modeling them, and providing an extendible solving mechanism to solve such problems. In addition to traditional resource and temporal constraints, the logical constraints will be newly assumed in the formalism. Rather than a rich modeling language, the focus will be on a light model (something like CNF is to SAT) and hence techniques for automated conversion of particular scheduling features to this model will also be studied together with techniques for modeling and extraction of control rules for the generic scheduling engine."@en . "Results from the project fully accomplished the objectives of the project listed in the project proposal. The proposers created high-quality original results. The amount of the results in the category Jimp is excellent (given the size of the team and duration of the project) in high quality journals."@en . "2013-06-12+02:00"^^ . . "44"^^ . "Rozvrhov\u00E1n\u00ED je dlouhodob\u011B studovanou oblast\u00ED, jej\u00ED\u017E v\u00FDzkumn\u00E9 v\u00FDsledky zahrnuj\u00ED \u0159adu \u0159e\u0161\u00EDc\u00EDch algoritm\u016F pro r\u016Fzn\u00E9 t\u0159\u00EDdy rozvrhovac\u00EDch probl\u00E9m\u016F. Existuje klasifikace rozvrhovac\u00EDch probl\u00E9m\u016F, ale fakticky nen\u00ED k\u00A0dispozici jednotn\u00FD p\u0159\u00EDstup k\u00A0popisu konkr\u00E9tn\u00EDho rozvrhovac\u00EDho probl\u00E9mu, kter\u00FD by slou\u017Eil jako rozhran\u00ED pro rozvrhovac\u00ED syst\u00E9my. Jin\u00FDm probl\u00E9mem tradi\u010Dn\u00EDho rozvrhov\u00E1n\u00ED je nar\u016Fstaj\u00EDc\u00ED vzd\u00E1lenost mezi studovan\u00FDmi form\u00E1ln\u00EDmi probl\u00E9my a prax\u00ED. Projekt se zam\u011B\u0159uje na identifikaci kl\u00ED\u010Dov\u00FDch vlastnost\u00ED rozvrhovac\u00EDch probl\u00E9m\u016F, n\u00E1vrh formalismu pro modelov\u00E1n\u00ED t\u011Bchto vlastnost\u00ED a vytvo\u0159en\u00ED roz\u0161i\u0159iteln\u00E9ho \u0159e\u0161\u00EDc\u00EDho mechanismu pro takto popsan\u00E9 probl\u00E9my. K\u00A0tradi\u010Dn\u00EDm zdrojov\u00FDm a \u010Dasov\u00FDm podm\u00EDnk\u00E1m budou nov\u011B p\u0159id\u00E1ny logick\u00E9 vazby. M\u00EDsto bohat\u00E9ho modelovac\u00EDho jazyka se projekt soust\u0159ed\u00ED na \u201Elehk\u00FD\u201C model (podobn\u011B jako KNF pro SAT), pro kter\u00FD budou studov\u00E1ny techniky automatick\u00E9 konverze konkr\u00E9tn\u00ED vlastnosti do dan\u00E9ho formalismu a pro popis a extrakci \u0159\u00EDd\u00EDc\u00EDch pravidel pro obecn\u00FD rozvrhovac\u00ED mechanismus." . "44"^^ . "2014-07-01+02:00"^^ . .