Project activity analysis without the network model
TL;DR: In this article, the authors present a new procedure for analysing and managing activity sequences in projects without the use of the network model, which can be used to determine critical activities, critical path, start times, free floats, crash limits, and other useful information.
read more
Abstract: This paper presents a new procedure for analysing and managing activity sequences in projects. The new procedure determines critical activities, critical path, start times, free floats, crash limits, and other useful information without the use of the network model. Even though network models have been successfully used in project management so far, there are weaknesses associated with the use. A network is not easy to generate, and dummies that are usually associated with it make the network diagram complex – and dummy activities have no meaning in the original project management problem. The network model for projects can be avoided while still obtaining all the useful information that is required for project management. What are required are the activities, their accurate durations, and their predecessors. OPSOMMING Die navorsing beskryf ’n nuwerwetse metode vir die ontleding en bestuur van die sekwensiele aktiwiteite van projekte. Die voorgestelde metode bepaal kritiese aktiwiteite, die kritieke pad, aanvangstye, speling, verhasing, en ander groothede sonder die gebruik van ’n netwerkmodel. Die metode funksioneer bevredigend in die praktyk, en omseil die administratiewe rompslomp van die tradisionele netwerkmodelle.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A minimum weight labelling method for determination of a shortest route in a non-directed network
TL;DR: A new minimum weight labelling method for determining a shortest route in a non-directed network from a source node to a destination node and finds an optimal solution in at most (m − 1) iterations.
References
•Book
Operations Research: Applications and Algorithms
Wayne L. Winston
- 01 Aug 1991
TL;DR: In this paper, the authors present a model-based approach to solving linear programming problems, which is based on the Gauss-Jordan method for solving systems of linear equations, and the Branch-and-Bound method for solving mixed integer programming problems.
2.2K
•Book
Faster Construction Projects with CPM Scheduling
Murray B. Woolf
- 01 Jan 2007
TL;DR: This chapter discusses the changing style of Project Management, the Allure of the Project Schedule, and creating Schedules They'll Actually Want to Use!
30
A minimum incoming weight label method and its application in CPM networks
TL;DR: An efficient approach towards finding a directed, shortest path or a directed longest path from the source to all other nodes in a directed network is described in this paper and application with respect to CPM project networks is also considered.
A minimum weight labelling method for determination of a shortest route in a non-directed network
TL;DR: A new minimum weight labelling method for determining a shortest route in a non-directed network from a source node to a destination node and finds an optimal solution in at most (m − 1) iterations.
Related Papers (5)
Ali Zolfaghari
- 14 Jul 2009
Lin Chen,Guilin Cai,Yang Nan +2 more
- 01 Aug 2015
Hu Zhiguo,Guo Lifeng +1 more
- 07 Nov 2017
Xiaofan Yang,Shengxian Ma,Xiaomei Wu,Tongwen Guo,Jinlong Wang +4 more
- 21 May 2008