Application of Dependency Structure Matrix in Time Scheduling

From apppm
Revision as of 10:49, 9 June 2017 by S133599 (Talk | contribs)

Jump to: navigation, search

Contents

Abstract

In planning management with regards to time scheduling there are several ways to get an overview of the number of activities in a timeline like the Gantt plot or using the Critical Path Method (CPM) to estimate the time used and needed for activities dependent on each other. But CPM is limited in the way that it only looks at sequential activities though it is possible for a design case to have both dependent activities as well as interdependent activities. This means that the information flow is not necessarily linear but can be cyclic giving rise to situations where some activity is initiated but still needs information from a later activity. The structure of these activities through time can be sorted in a Dependency Structure Matrix (DSM) which marks all the interdependencies in a square matrix. The matrix can both be used for visualization and optimization of information flows. This article will discuss the application of DSM for use in a time scheduling situation of project management. Here some of the common ways to rearrange or change the matrix to reduce loops of information flow or to let non-dependent activities run in parallel will be discussed.

Background

How to Read the Matrix

Using the Matrix

Shearing

tearing

Advantages of the Method

Disadvantages of the Method

Personal tools
Namespaces

Variants
Actions
Navigation
Toolbox