Impact of Core Precedences in a Cyclic RCPSP with Temporal Constraints
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00188928" target="_blank" >RIV/68407700:21230/11:00188928 - isvavai.cz</a>
Result on the web
<a href="http://www.mistaconference.org" target="_blank" >http://www.mistaconference.org</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Impact of Core Precedences in a Cyclic RCPSP with Temporal Constraints
Original language description
In this paper, we introduce a new kind of constraints, called core precedence constraints, in a cyclic resource constrained scheduling problem with temporal constraints. We use them to model energy saving in a network scheduling problem. Then we study the impact of these new constraints on an efficient approach for cyclic RCPSP: the decomposed software pipelining approach. After discussion, we show that this approach can be used to prove that even without resource constraint, the existence of a periodicschedule is an NP-complete problem.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/ME10039" target="_blank" >ME10039: Energy Efficient Scheduling in Data Processing and Communication</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů