"2015-01-22+01:00"^^ . "Dynamick\u00E9 aspekty rozvrhov\u00E1n\u00ED" . "Computer software helps to solve planning and scheduling problems in many areas from space applications (Mars Rovers), through high-demanding computing applications (Grid computing), to manufacturing problems (job-shop, supply-chain). Typically, these systems operate in highly dynamic environments where the problem specification tends to change, the original solution becomes invalid, and a solution to the new problem must be found. Unfortunately, existing scheduling technologies do not support enough such a dynamic behaviour.The project addresses the above mentioned dynamic aspects of scheduling. The aim is to develop new techniques in the context of constraint satisfaction that will cover dynamicity of real-life problems. In particular, we will focus on incremental and open constraint propagation and filtering techniques typically integrating some classical discrete mathematics methods. We also intend to study how search techniques can fit the dynamic problems, for example via restarts or"@en . "."@en . " scheduling" . . . "planning; scheduling; constraints; dynamicity"@en . " constraints" . . "2009-12-31+01:00"^^ . "Projekt byl zam\u011B\u0159en na studium vnit\u0159n\u00ED a vn\u011Bj\u0161\u00ED dynamicity pl\u00E1novac\u00EDch a rozvrhovac\u00EDch probl\u00E9m\u016F. V prvn\u00ED oblasti \u0159e\u0161itel\u00E9 navrhli nov\u00E9 modely a techniky spl\u0148ov\u00E1n\u00ED podm\u00EDnek (constraint satisfaction). V druh\u00E9 oblasti se \u0159e\u0161itel\u00E9 v\u011Bnovali problematice rozvrh"@cs . . . . . "2009-04-22+02:00"^^ . . . "Dynamic aspects of scheduling"@en . . . . "Po\u010D\u00EDta\u010Dov\u00FD software pom\u00E1h\u00E1 \u0159e\u0161it pl\u00E1novac\u00ED a rozvrhovac\u00ED probl\u00E9my v \u0159ad\u011B oblast\u00ED od vesm\u00EDrn\u00E9ho programu (Mars Rovers), p\u0159es v\u00FDpo\u010Dtov\u011B n\u00E1ro\u010Dn\u00E9 po\u010D\u00EDta\u010Dov\u00E9 aplikace (Grid computing), a\u017E po klasick\u00E9 v\u00FDrobn\u00ED probl\u00E9my (job-shop a supply-chain). Takov\u00E9 syst\u00E9my typicky pracuj\u00ED ve vysoce dynamick\u00E9m prost\u0159ed\u00ED, kter\u00E9 se vyzna\u010Duje zm\u011Bnami zad\u00E1n\u00ED \u0159e\u0161en\u00E9ho probl\u00E9mu vedouc\u00EDmi k zneplatn\u011Bn\u00ED nalezen\u00E9ho \u0159e\u0161en\u00ED, a tedy k nutnosti rychle nal\u00E9zt \u0159e\u0161en\u00ED nov\u00E9ho probl\u00E9mu. Bohu\u017Eel existuj\u00EDc\u00ED rozvrhovac\u00ED technologie neposkytuje takov\u00E9mu dynamick\u00E9mu chov\u00E1n\u00ED dostate\u010Dnou podporu.Projekt se bude zab\u00FDvat v\u00FD\u0161e zm\u00EDn\u011Bn\u00FDmi dynamick\u00FDmi aspekty \u0159e\u0161en\u00ED rozvrhovac\u00EDch probl\u00E9m\u016F. C\u00EDlem je navrhnout nov\u00E9 \u0159e\u0161\u00EDc\u00ED techniky v kontextu spl\u0148ov\u00E1n\u00ED omezuj\u00EDc\u00EDch podm\u00EDnek, kter\u00E9 budou pokr\u00FDvat dynami\u010Dnostre\u00E1ln\u00FDch probl\u00E9m\u016F. Konkr\u00E9tn\u011B se budeme soust\u0159edit na inkrement\u00E1ln\u00ED a otev\u0159en\u00E9 propaga\u010Dn\u00ED a filtra\u010Dn\u00ED techniky typicky integruj\u00EDc\u00ED klasick\u00E9 metody diskr\u00E9tn\u00ED matematiky. Zam\u00FD\u0161l\u00EDme tak\u00E9 studovat mo\u017En\u00E1 roz\u0161\u00ED\u0159en\u00ED prohled\u00E1vac\u00EDch algoritm\u016F pro \u0159e\u0161en\u00ED" . "planning" . "0"^^ . "2007-01-01+01:00"^^ . . "68"^^ . "68"^^ . "1"^^ . . "1"^^ . . . "http://www.isvav.cz/projectDetail.do?rowId=GA201/07/0205"^^ . . . "GA201/07/0205" .