Dynamic Scheduling
| Authors | |
|---|---|
| Year of publication | 2008 |
| MU Faculty or unit | |
| Citation | |
| Description | 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. |
| Related projects: |