Kiss, Judit; Kosztyán, Zsolt Tibor
January 2011
Problems of Management in the 21st Century;2011, Vol. 1, p67
Academic Journal
Network planning methods for project planning and scheduling have been applied for more than fifty years including CPM, PDM, PERT and GERT (Fondahl, 1961; Fulkerson, 1962; Kelley & Walker, 1959; PMI, 2206; Pritsker, 1966), which can be widely applied to project planning from areas as diverse as construction and R&D. However, these network planning methods are not very appropriate in cases where IT, innovation or product development are involved. There are some shortcomings when using network planning methods for scheduling these kinds of projects, because these methods cannot handle the importance of the task realizations. They cannot solve the problem, when some tasks have to be left out from the project because of the constraints, or when the completion order of tasks can be different. In this paper new matrix-based project planning methods are introduced which illustrate how all possible solutions can be determined in two steps based on the Project Expert Matrix. Firstly those tasks are selected, which have to be or can be realized during the project. Afterwards the dependencies (the sequence of the chosen tasks) are determined taking the project constraints into account. The possible solutions can be ranked and the most probable solution can be chosen which can be realized within the given constraints. This method can be a useful tool for project managers as a part of an expert system.


Related Articles

  • Stochastic Audit Planning and Control Using GERT Simulation. Zebda, Awni // Accounting & Business Research (Wolters Kluwer UK);Summer86, Vol. 16 Issue 63, p235 

    Auditing standards require auditors adequately to plan audit engagements and properly to supervise assistants. Technically, Critical Path Method (CPM) and Program Evaluation and Review Technique (PERT) are limited because they are based on network modeling that may not be capable of representing...

  • TIME-COST OPTIMIZATION MODEL FOB DETERMINISTIC NETWORK PROJECTS. Ben-Yair, Avner; Laslo, Zohar; Greenberg, Doron; Golenko-Ginzburg, Dimitri // Journal of Applied Quantitative Methods;2008, Vol. 3 Issue 4, p339 

    A deterministic PERT activity-on-arc network G(N, A) with logical operation "AND" at the event's receiver and "MUST FOLLOW" at the event's emitter, is considered. Each activity (i, j) ∊ A entering the model can be operated within several deterministic durations tij depending on the...

  • A GENERALIZED NETWORK APPROACH TO THE PLANNING AND SCHEDULING OF A RESEARCH PROJECT. Eisner, Howard // Operations Research;Jan/Feb62, Vol. 10 Issue 1, p115 

    This paper describes a configurational and mathematical tool that may be used in the planning and scheduling of a research program The configuration, termed a decision box (db) network, is a generalization of the PERT network and allows alternative procedures for accomplishing research tasks to...

  • R & D PROJECT PLANNING WITH Q-GERT NETWORK MODELING AND SIMULATION. Taylor III, Bernard W.; Moore, Laurence J. // Management Science;Jan1980, Vol. 26 Issue 1, p44 

    This paper describes a simulation study of two cases of research and development planning. The first case is for a series of R & D projects analyzed sequentially by a single R & D team, while the second case is for a series of R & D projects analyzed sequentially and concurrently by two teams....

  • Ä°ÅŸ SÃœREÇLERÄ°NÄ°N MODELLENMESÄ°NDE GERT ÅŸEBEKELERÄ°NÄ°N KULLANIMI. Aytulun, S. Kerem; Ermis, Murat // Journal of Aeronautics & Space Technologies / Havacilik ve Uzay ;2010, Vol. 4 Issue 3, p19 

    Recent years, Firms have to use various and complex business processes for providing knowledge needs that is becoming increased. With understanding impact of the business processes on performance and profitableness of the firms, many academicians and managers need to get closer these business...

  • Determining the K Most Critical Paths in PERT Networks. Dodin, Bajis // Operations Research;Jul/Aug84, Vol. 32 Issue 4, p859 

    A fundamental problem in PERT networks is to identify a project's critical paths and its critical activities. In this paper we define the criticality index of a path as the probability that the duration of the path is greater than or equal to the duration of every other path in the network and...

  • PERT and Fuzzy PERT Methods on Project Scheduling under Uncertainty. Petrovan, Adrian; Costea, Cristinel // Carpathian Journal of Electronic & Computer Engineering;2010, Vol. 3 Issue 1, p99 

    Program Evaluation and Review Technique (PERT) is the most widely used network modeling method used to track the planning activities required to complete large-scale projects. This technique has the potential to reduce the time and costs required to complete a project. Unlike classical PERT,...

  • PROGRAM EVALUATION AND REVIEW TECHNIQUE (PERT).  // Encyclopedia of Operations Research & Management Science;2001, p649 

    The article presents information on program evaluation and review technique. It is a method for planning and scheduling a project which models uncertainties in activity through the use of optimistic, likely and pessimistic time estimates for each activity.

  • Bounding the Project Completion Time Distribution in PERT Networks. Dodin, Bajis // Operations Research;Jul/Aug85, Vol. 33 Issue 4, p862 

    We consider the PERT model of a project composed of activities whose durations are random variables with known distributions. For the situations in which the activity durations are completely independent, we present a new method for obtaining a probability distribution function that bounds the...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics