A new method for constructing a minimal PERT network
DOI10.1016/J.APM.2011.03.031zbMATH Open1225.90066OpenAlexW2044167542MaRDI QIDQ646227FDOQ646227
Authors: Nasser Eddine Mouhoub, Abdelhamid Benhocine, Hocine Belouadah 
Publication date: 11 November 2011
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2011.03.031
Recommendations
- A heuristic for constructing activity-on-arrow pert networks with minimal dummy activities
- New heuristics for modeling temporal constraints and generating PERT network with minimum number of dummy-arcs
- scientific article; zbMATH DE number 1234734
- On the computational complexity of the minimum-dummy-activities problem in a pert network
- The minimum dummy task problem
Applications of graph theory (05C90) Management decision making, including multiple objectives (90B50) Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)
Cites Work
- On the measurement of complexity in activity networks
- CTP: A new constraint-based formalism for conditional, temporal planning
- Title not available (Why is that?)
- Critical-Path Planning and Scheduling: Mathematical Basis
- A Random Activity Network Generator
- Computer construction of project networks
- Complexity of the minimum-dummy-activities problem in a pert network
- Title not available (Why is that?)
- On the computational complexity of the minimum-dummy-activities problem in a pert network
- The minimum dummy task problem
- Comment Construire un Graphe Pert Minimal
- On the minimum dummy-arc problem
- Pancyclic and panconnected line graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On direction-preserving maps of graphs
Cited In (10)
- New heuristics for modeling temporal constraints and generating PERT network with minimum number of dummy-arcs
- On the computational complexity of the minimum-dummy-activities problem in a pert network
- Creating an equivalent multi-phases activity network by adding the least dummy activities
- A distributionally robust analysis of the program evaluation and review technique
- The minimum dummy task problem
- Properties of graphs of problems network planning and management
- A note on minimum-dummy-activities PERT networks
- Title not available (Why is that?)
- Solution of interval PERT/CPM network problems by a simplified tabular method
- Optimal constructions of reversible digraphs
This page was built for publication: A new method for constructing a minimal PERT network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646227)
