A new method for constructing a minimal PERT network

DOI10.1016/j.apm.2011.03.031zbMath1225.90066OpenAlexW2044167542MaRDI QIDQ646227

Hocine Belouadah, Nasser Eddine Mouhoub, Abdelhamid Benhocine

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

zbMATH Keywords

project schedulinggraph theoryline graphproject managementminimal PERT networkminimum dummy arc

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A distributionally robust analysis of the program evaluation and review technique

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the measurement of complexity in activity networks
• CTP: A new constraint-based formalism for conditional, temporal planning
• Complexity of the minimum-dummy-activities problem in a pert network
• Critical-Path Planning and Scheduling: Mathematical Basis
• 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
• A Random Activity Network Generator
• Computer construction of project networks
• On direction-preserving maps of graphs

This page was built for publication: A new method for constructing a minimal PERT network