New heuristics for modeling temporal constraints and generating PERT network with minimum number of dummy-arcs

MaRDI QIDQ5223871zbMATH OpenFDO

Authors Nasser Eddine Mouhoub, Abdelhamid Benhocine, Abdelkader Gasmi

Publication date 18 July 2019

Full work available at URL http://aos.ro/wp-content/anale/MVol10Nr2Art.9.pdf

zbMATH Keywords

minimal AoA networkPERT graphproject scheduling problemtemporal constraints

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A new method for constructing a minimal PERT network
• A heuristic for constructing activity-on-arrow pert networks with minimal dummy activities
• scientific article; zbMATH DE number 1234734
• The minimum dummy task problem
• On the computational complexity of the minimum-dummy-activities problem in a pert network

Cited in

(4)

• A heuristic for constructing activity-on-arrow pert networks with minimal dummy activities
• A note on minimum-dummy-activities PERT networks
• scientific article; zbMATH DE number 1234734 (Why is no real title available?)
• A new method for constructing a minimal PERT network

This page was built for publication: New heuristics for modeling temporal constraints and generating PERT network with minimum number of dummy-arcs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223871)