Activity nets: A guided tour through some recent developments

European Journal of Operational Research

Volumn 82, Issue 3, 1995, Pages 383-408

  Elmaghraby, Salah E ^a  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

Activity nets; Complexity; Financial considerations; Project representation

Indexed keywords

COMPUTER SOFTWARE; COSTS; CRITICAL PATH ANALYSIS; DECISION MAKING; OPTIMIZATION; PERSONAL COMPUTERS; PERT; PIECEWISE LINEAR TECHNIQUES; PLANNING; PROJECT MANAGEMENT; SCHEDULING; SUPERVISORY PERSONNEL;

ACTIVITY NETS; COMPLEXITY; FINANCIAL CONSIDERATIONS; PROJECT REPRESENTATION;

OPERATIONS RESEARCH;

EID: 0029635345     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00184-E     Document Type: Article

References (71)

1. A classified bibliography of research on stochastic PERT networks: 1966–1987
2. DAGEN1: A generator of test sets for project activity nets
3. The history of modern project management
4. Project management using a micro-computer
5. Interrelating project estimates to CPM schedules
6. Optimal Reduction of Two-Terminal Directed Acyclic Graphs
7. On a routing problem
8. Letter to the Editor—Bibliography on Project Planning and Control by Network Analysis: 1959–1961
9. Scheduling projects to resource constraints: Classification and complexity
10. On direction-preserving maps of graphs
11. Project scheduling with resource constraints: A branchand-bound approach
12. Payments in projects: A contractor's model
13. On the use of the complexity index as a measure of complexity in activity networks
14. An evaluation of microcomputer-based software packages for project management
15. A decomposition approach to multi-project scheduling
16. Resource constrained project crashing
17. A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
18. A branchand-bound procedure for the generalized resource-constrained project scheduling problem
19. Project management with the PC: Part I and Part II
20. Project management with the PC: Part I and Part II
21. Project bidding under deterministic and probabilistic activity durations
22. Optimal project compression with due-dated events
23. On the measurement of complexity in activity networks
24. The scheduling of activities to maximize the net present value of projects
25. On project representation and activity floats
26. The analysis of activity networks under generalized precedence relations (GPR), Parts I and II
27. The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
28. On project representation and activity floats
29. Minimizing the complexity of a stochastic PERT network
30. Fair and reasonable markup (FaRM) pricing model
31. High-End project managers make the plans
32. A Network Flow Computation for Project Cost Curves
33. An algorithm for project sequencing with resource constraints
34. Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects
35. Project planning programs put to the test
36. 5/2 algorithm for maximum matchings in bipartite graphs
37. Critical-Path Planning and Scheduling: Mathematical Basis
38. Network planning by the extended METRA Potential Method
39. Characterization and generation of a general class of resource-constrained project scheduling problems: Easy and hard instances
40. Complexity of the minimum-dummy-activities problem in a PERT network
41. Letter to the Editor—Bibliography on Network-Based Project Planning and Control Techniques: 1962–1965
42. Optimal representation of activity networks as directed acyclic graphs
43. On the minimum dummy-arc problem
44. A faster strongly polynomial minimum cost flow algorithm
45. Exact and heuristic solution procedures for the constrained-resource, project scheduling problem: Volumes I, II, and III
46. Scheduling a project under multiple resource constraints: A zero-one programming approach
47. An algorithm for a general class of precedence and resource constrained scheduling problems
48. Graphes et ordonnancements
49. Solving resource-constrained network problems by implicit enumeration — nonpremptive case
50. Project scheduling with discounted cash flows and progress payments
51. Unbalanced highway contract tendering
52. Comment construire un graphe PERT minimal
53. Multiple resource-constrained scheduling using branch and bound
54. On the computational complexity of the minimum dummy activity problem in a PERT network
55. An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems
56. Optimal constructions of reversible digraphs
57. The Recognition of Series Parallel Digraphs
58. Four float measures for critical path scheduling