Citation
Impact of core precedences in a Cyclic RCPSP with temporal constraints. In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA, pages 245-260, 2011.
Paper
Abstract
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 effcient 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 periodic schedule is an NP-complete problem.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2011-245-260-P, author = {Z. Hanzalek and C. Hanen},
title = {Impact of core precedences in a Cyclic RCPSP with temporal constraints},
booktitle = {In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA},
year = {2011},
editor = {J. Fowler and G. Kendall and B. McCollum},
pages = {245--260},
note = {Paper},
abstract = {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 effcient 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 periodic schedule is an NP-complete problem.},
owner = {gxk},
timestamp = {2011.08.15},
webpdf = {2011-245-260-P.pdf} }