An efficient algorithm for generating AoA networks
Nasser Eddine Mouhoub, Abdelhamid Benhocine

TL;DR
This paper introduces a novel algorithm that efficiently converts Activity-on-Node diagrams into Activity-on-Arc diagrams using line graph concepts, enhancing project scheduling visualization.
Contribution
It presents a new algorithm for generating AoA networks from AoN diagrams, leveraging line graph theory for improved efficiency.
Findings
Algorithm successfully converts AoN to AoA diagrams
Reduces complexity in generating AoA networks
Applicable to various project scheduling problems
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsResource-Constrained Project Scheduling · Manufacturing Process and Optimization · Software Engineering Techniques and Practices
