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.

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.