Thursday 25th of April 2024
 

An efficient algorithm for generating AoA networks


Nasser Eddine Mouhoub and Abdelhamid Benhocine

The activities, in project scheduling, can be represented graphically in two different ways, by either assigning the activities to the nodes 'AoN directed acyclic graph (dag) or to the arcs 'AoA dag. In this paper, a new algorithm is proposed for generating, for a given project scheduling problem, an Activity-on-Arc dag starting from the Activity-on-Node dag using the concepts of line graphs of graphs.

Keywords: Line graph of graph, project scheduling, AoN directed acyclic graph, AoA directed acyclic graph, PERT network.

Download Full-Text


ABOUT THE AUTHORS

Nasser Eddine Mouhoub
Nasser Eddine Mouhoub was born in Bordj Bou Arréridj, Algeria in 1962. He received his Engineer degree and his PhD in computer science from Sétif University, Algeria. Currently, he is a professor at the Computer department of Bordj Bou Arréridj University, Algeria. He is also the vice dean of Mathematics and Computer Science Institute of Bordj Bou Arréridj University. His main research interests are focused on Scheduling, Graph Theory and Computer Networks.

Abdelhamid Benhocine
Abdelhamid Benhocine was born in Medjana, Algeria in 1950. He received his PhD degree in computer science from Paris XI University, France. Currently, he is a professor at Information System department, Qassim University, Saudi Arabia . His main research interests are focused on Scheduling, Graph Theory and Image Processing.


IJCSI Published Papers Indexed By:

 

 

 

 
+++
About IJCSI

IJCSI is a refereed open access international journal for scientific papers dealing in all areas of computer science research...

Learn more »
Join Us
FAQs

Read the most frequently asked questions about IJCSI.

Frequently Asked Questions (FAQs) »
Get in touch

Phone: +230 911 5482
Email: info@ijcsi.org

More contact details »