Dynamic Scheduling

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F08%3A00041928" target="_blank" >RIV/00216224:14330/08:00041928 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Dynamic Scheduling

Popis výsledku v původním jazyce

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/changingproblems. 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 Universit

Název v anglickém jazyce

Dynamic Scheduling

Popis výsledku anglicky

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/changingproblems. 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 Universit

Druh

O - Ostatní výsledky

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2008

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů