Rezumat articol ediţie STUDIA UNIVERSITATIS BABE┼×-BOLYAI

În partea de jos este prezentat rezumatul articolului selectat. Pentru revenire la cuprinsul ediţiei din care face parte acest articol, se accesează linkul din titlu. Pentru vizualizarea tuturor articolelor din arhivă la care este autor/coautor unul din autorii de mai jos, se accesează linkul din numele autorului.

 
       
         
    STUDIA INFORMATICA - Ediţia nr.4 din 2012  
         
  Articol:   GENERATING PERT NETWORK WITH TEMPORAL CONSTRAINTS.

Autori:  NASSER EDDINE MOUHOUB.
 
       
         
  Rezumat:  A scheduling problem is organizing in time a set of activities, so as to satisfy a set of constraints and optimize the result. The temporal constraint modifies the project scheduling, therefore in loses its characteristics. Our objective is to solve this problem by finding the various types of temporal constraints then modeling them by using graphs. Furthermore we apply a technique for transforming an AoN graph (Activities on Nodes) which is unique and contains a significant number of arcs. This graph is not preferred by practitioners of project management. We transform the AoN graph into an AoA graph (Activities on Arcs) which contains fewer arcs and is preferred by practitioners of project management. In this paper we present some concepts of line graphs and an illustrative example of the proposed method.

Key words and phrases. AoA network, AoN network, PERT network, Project scheduling, Temporal constraint.
 
         
     
         
         
      Revenire la pagina precedentă