Modelling Alternatives in Temporal Networks
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F07%3A00004780" target="_blank" >RIV/00216208:11320/07:00004780 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Modelling Alternatives in Temporal Networks
Original language description
Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose an extension of temporal networks by parallel and alternative branching. This extension supports modelling of alternative paths in the network; in particular, it is motivated by modelling alternative process routes in manufacturing scheduling. We show that deciding which nodes can be consistently included in this extended temporal network is an NP-complete problem. To simplify solving this problem, we propose a pre-processing step whose goal is to identify classes of equivalent nodes. The ideas are presented using precedence networks, but we also show how they can be extendedto simple temporal networks.
Czech name
Modelování alternativ v temporálních sítích
Czech description
Článek popisuje techniky pro modelování alternativních procesů v temporálních sítích.
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling (CI-Sched 2007)
ISBN
1-4244-0698-6
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
129-136
Publisher name
IEEE
Place of publication
Honolulu
Event location
Honolulu
Event date
Jan 1, 2007
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—