Incremental Propagation Rules for a Precedence Graph with Optional Activities and Time Windows
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10052028" target="_blank" >RIV/00216208:11320/10:10052028 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Incremental Propagation Rules for a Precedence Graph with Optional Activities and Time Windows
Original language description
Constraint-based scheduling is a powerful tool for solving complex real-life scheduling problems. This paper describes new incremental propagation rules integrating propagation of precedence relations and time windows for activities allocated to a disjunctive resource. Moreover, the rules also cover so called optional activities that may or may not be present in the final schedule.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
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
2010
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
Name of the periodical
Transactions of the Institute of Measurement and Control
ISSN
0142-3312
e-ISSN
—
Volume of the periodical
32
Issue of the periodical within the volume
1
Country of publishing house
GB - UNITED KINGDOM
Number of pages
24
Pages from-to
—
UT code for WoS article
000275006500004
EID of the result in the Scopus database
—