A new method for constructing a minimal PERT network

DOI10.1016/J.APM.2011.03.031MaRDI QIDQ646227zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

graph theoryline graphproject managementproject schedulingminimal PERT networkminimum dummy arc

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 1517143 (Why is no real title available?)
• scientific article; zbMATH DE number 5199052 (Why is no real title available?)
• scientific article; zbMATH DE number 3218572 (Why is no real title available?)
• scientific article; zbMATH DE number 3378735 (Why is no real title available?)
• A Random Activity Network Generator
• CTP: A new constraint-based formalism for conditional, temporal planning
• Comment Construire un Graphe Pert Minimal
• Complexity of the minimum-dummy-activities problem in a pert network
• Computer construction of project networks
• Critical-Path Planning and Scheduling: Mathematical Basis
• On direction-preserving maps of graphs
• On the computational complexity of the minimum-dummy-activities problem in a pert network
• On the measurement of complexity in activity networks
• On the minimum dummy-arc problem
• Pancyclic and panconnected line graphs
• The minimum dummy task problem

Cited in

(10)

• On the computational complexity of the minimum-dummy-activities problem in a pert network
• A distributionally robust analysis of the program evaluation and review technique
• A note on minimum-dummy-activities PERT networks
• Properties of graphs of problems network planning and management
• Optimal constructions of reversible digraphs
• The minimum dummy task problem
• New heuristics for modeling temporal constraints and generating PERT network with minimum number of dummy-arcs
• scientific article; zbMATH DE number 1517143 (Why is no real title available?)
• Solution of interval PERT/CPM network problems by a simplified tabular method
• Creating an equivalent multi-phases activity network by adding the least dummy activities

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)