Scheduling with Start Time Related Deadlines

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F04%3A03099440" target="_blank" >RIV/68407700:21230/04:03099440 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Scheduling with Start Time Related Deadlines
Original language description
This paper presents a scheduling problem for a monoprocessor without preemption with timing constraints given by a task-on-node graph. The precedence relations are given by an oriented graph where edges are related either to the minimum time or to the maximum time elapsed between start times of the tasks. The processing time of a given task is associated to a given node in the oriented graph. The problem, finding an optimal schedule satisfying the timing constraints while minimizing makespan Cmax, is solved by two approaches. The first is implemented as a B&B algorithm using a Critical Path estimation and estimation of Remaining Processing TimeThe second solution is based on ILP. Experimental results show comparison of the B&B and ILP solution.
Czech name
Není k dispozici
Czech description
Není k dispozici

Project
<a href="/en/project/LN00B096" target="_blank" >LN00B096: Center for Applied Cybernetics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Article name in the collection
IEEE Conference on Control Applications, International Symposium on Inteligent Control, Computer Aided Control Systems Design 2004
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
1
Pages from-to
94-94
Publisher name
IEEE Control System Society
Place of publication
New York
Event location
Taipei
Event date
Sep 2, 2004
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)