Detailed Information on Publication Record
2008
Dynamic Scheduling
RUDOVÁ, HanaBasic information
Original name
Dynamic Scheduling
Name in Czech
Dynamické rovrhování
Authors
RUDOVÁ, Hana (203 Czech Republic, guarantor, belonging to the institution)
Edition
Istituto di Scienza e Tecnologie dell'Informazione, Consiglio Nazionale delle Ricerche, invited talk, 2008
Other information
Language
English
Type of outcome
Vyžádané přednášky
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Italy
Confidentiality degree
není předmětem státního či obchodního tajemství
References:
RIV identification code
RIV/00216224:14330/08:00041928
Organization unit
Faculty of Informatics
Keywords in English
scheduling; dynamic problems; local search;grid scheduling; course timetabling
Tags
International impact
Změněno: 2/5/2011 08:29, doc. Mgr. Hana Rudová, Ph.D.
V originále
Scheduling represents a wide area of problems with many different aspects given by practical applications and studied by various theoretical approaches. Complete information necessary for scheduling is sometimes available before the problem is solved. However, the problem often changes as time goes, scheduler must react on the changed state of the problem and dynamic schedule updates are needed. This talk will describe the general scheduling problem from the point of view of static and dynamic/changing problems. Solving methodologies based on local search methods and dispatching rules will be presented and their applicability for dynamic problem solving will be discussed. Application of the dynamic job scheduling in the Grid environment will be presented. A novel incremental use of local search algorithms allows to construct better solutions in a reasonable time. Also we will demonstrate application of local search methods for solving large scale timetabling problem at Purdue University.
In Czech
Cílem prezentace je popsat algoritmy pro řešení problémů dynamického rozvrhování, které byly použity v aplikacích plánování na Gridech a universitního rozvrhování. Zároveň je zde ukázána aplikace těchto algoritmů na uvedené problémy.
Links
MSM0021622419, plan (intention) |
|