Add to ORKGwww.elsevier.com/locate/dsw On the hardness of evaluating criticality of activities in a planar network with duration interval
This work compares several node (and network) criticality measures quantifying to which extend each ...
The additional relationships i.e., start-to-start, finish-to-finish, and start-to-finish, between ac...
AbstractWe investigate extremal networks of the Manhattan length functional. We give a criterion of ...
BBInternational audienceThe notion of the necessary criticality (both with respect to path and to ac...
BBInternational audienceA review of the main results obtained by the authors concerning analysis of ...
This paper reconsiders the PERT scheduling problem when information about task dura-tion is incomple...
Abstract. A review of the results obtained in the area of fuzzy network analysis is presented. The m...
AbstractThis paper deals with problems of computing possible values of latest starting times and det...
UMR IATE AXE 5; Contact: fortin@lirmm.frInternational audienceThis paper reconsiders the Project Eva...
AbstractRecently developed point-to-point relations have greatly extended the modeling capability of...
The Precedence Diagramming Method (PDM) is the prevalent scheduling technique used for temporal plan...
This paper describes a method for apportioning contingency in a probabilistic network. It distinguis...
<p>The red curve depicts the value of the potential energy landscape as a function of , whereas the...
DFargFort003International audienceIn project management, three quantities are often used by project ...
Network criticality is a graph-theoretic metric that quanti-fies network robustness, and that was or...
This work compares several node (and network) criticality measures quantifying to which extend each ...
The additional relationships i.e., start-to-start, finish-to-finish, and start-to-finish, between ac...
AbstractWe investigate extremal networks of the Manhattan length functional. We give a criterion of ...
BBInternational audienceThe notion of the necessary criticality (both with respect to path and to ac...
BBInternational audienceA review of the main results obtained by the authors concerning analysis of ...
This paper reconsiders the PERT scheduling problem when information about task dura-tion is incomple...
Abstract. A review of the results obtained in the area of fuzzy network analysis is presented. The m...
AbstractThis paper deals with problems of computing possible values of latest starting times and det...
UMR IATE AXE 5; Contact: fortin@lirmm.frInternational audienceThis paper reconsiders the Project Eva...
AbstractRecently developed point-to-point relations have greatly extended the modeling capability of...
The Precedence Diagramming Method (PDM) is the prevalent scheduling technique used for temporal plan...
This paper describes a method for apportioning contingency in a probabilistic network. It distinguis...
<p>The red curve depicts the value of the potential energy landscape as a function of , whereas the...
DFargFort003International audienceIn project management, three quantities are often used by project ...
Network criticality is a graph-theoretic metric that quanti-fies network robustness, and that was or...
This work compares several node (and network) criticality measures quantifying to which extend each ...
The additional relationships i.e., start-to-start, finish-to-finish, and start-to-finish, between ac...
AbstractWe investigate extremal networks of the Manhattan length functional. We give a criterion of ...