RUDOVÁ, Hana. Dynamic Scheduling I. In Computer Science School at the University of Nottingham, invited talk. 2007.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Dynamic Scheduling I.
Name in Czech Dynamické rovrhování I.
Authors RUDOVÁ, Hana (203 Czech Republic, guarantor, belonging to the institution).
Edition Computer Science School at the University of Nottingham, invited talk, 2007.
Other information
Original language English
Type of outcome Requested lectures
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher United Kingdom of Great Britain and Northern Ireland
Confidentiality degree is not subject to a state or trade secret
WWW URL
RIV identification code RIV/00216224:14330/07:00041602
Organization unit Faculty of Informatics
Keywords in English scheduling; dynamic problems; local search; constructive search; course timetabling; grid scheduling
Tags constructive search, course timetabling, dynamic problems, grid scheduling, Local Search, scheduling
Tags International impact
Changed by Changed by: doc. Mgr. Hana Rudová, Ph.D., učo 3840. Changed: 2/5/2011 08:28.
Abstract

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.

Abstract (in Czech)
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.
Links
MSM0021622419, plan (intention)Name: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems
PrintDisplayed: 25/5/2024 08:58