Presentation described the general scheduling problem from the point of view of static and dynamic/changing problems. Methodologies based on local search methods were presented and their applicability for dynamic problem solving were discussed. Two case studies demonstrated the use of dynamic scheduling in practical real-life problems. Main features of the scheduling system for the large scale timetabling problem at Purdue University were presented. Local search based algorithm allows solving variety of timetabling problems for different scheduling units at Purdue University where the largest problem has 800 courses and 55 classrooms. The second study is concentrated on scheduling of jobs in the Grid environment. A novel incremental use of local search algorithms allows to construct better solutions in a reasonable time.
Česky
Prezentace popisovala algoritmy pro řešení problémů dynamického rozvrhování, které byly použity v aplikacích universitního rozvrhování a rozvrhování v prostřední gridů. Zároveň byla ukázána aplikace těchto algoritmů na uvedené problémy.
Návaznosti
MSM0021622419, záměr
Název: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministerstvo školství, mládeže a tělovýchovy ČR, Vysoce paralelní a distribuované výpočetní systémy
RUDOVÁ, Hana. Dynamic Scheduling I. In Computer Science School at the University of Nottingham, invited talk. 2007.
@misc{728216, author = {Rudová, Hana}, booktitle = {Computer Science School at the University of Nottingham, invited talk}, keywords = {scheduling; dynamic problems; local search; constructive search; course timetabling; grid scheduling}, language = {eng}, title = {Dynamic Scheduling I.}, url = {http://www.fi.muni.cz/~hanka/publ/nottingham07.pdf}, year = {2007} }
TY - SLIDE ID - 728216 AU - Rudová, Hana PY - 2007 TI - Dynamic Scheduling I. KW - scheduling KW - dynamic problems KW - local search KW - constructive search KW - course timetabling KW - grid scheduling UR - http://www.fi.muni.cz/~hanka/publ/nottingham07.pdf L2 - http://www.fi.muni.cz/~hanka/publ/nottingham07.pdf N2 -
Presentation described the general scheduling problem from the point of view of static and dynamic/changing problems. Methodologies based on local search methods were presented and their applicability for dynamic problem solving were discussed. Two case studies demonstrated the use of dynamic scheduling in practical real-life problems. Main features of the scheduling system for the large scale timetabling problem at Purdue University were presented. Local search based algorithm allows solving variety of timetabling problems for different scheduling units at Purdue University where the largest problem has 800 courses and 55 classrooms. The second study is concentrated on scheduling of jobs in the Grid environment. A novel incremental use of local search algorithms allows to construct better solutions in a reasonable time.
ER -
RUDOVÁ, Hana. Dynamic Scheduling I. In \textit{Computer Science School at the University of Nottingham, invited talk}. 2007.