IDEAS home Printed from https://ideas.repec.org/a/taf/conmgt/v23y2005i2p199-213.html
   My bibliography  Save this article

Applying cluster identification algorithm and simulation to generate probabilistic network schedules for design projects

Author

Listed:
  • Wei-Chih Wang
  • Ren-Jye Dzeng

Abstract

Scheduling of a design project is complex because design activities often have information dependencies between each other. This study proposes a network-based model to schedule design projects and generate probabilistic project durations. The proposed model applies a modified cluster identification algorithm to evaluate information dependencies between design activities to facilitate the establishment of a schedule network (and regroup activities to support the assignment of design work); it also uses a simulation approach to incorporate the effect on duration of the uncertain number of design iterations. The model is implemented in four stages, which are breaking down the design work; evaluating the dependencies; identifying concurrent activities; and estimating the durations of activities and simulating the duration of design project. The advantages of the proposed model are demonstrated through its application to an example project, which was reviewed by industrial practitioners. Practitioners felt that the generated detailed scheduling data could help them to control their design work more precisely than a bar chart. Additionally, the simulated probabilistic project duration provided them with an awareness of the risk involved in meeting the contractual deadline.

Suggested Citation

  • Wei-Chih Wang & Ren-Jye Dzeng, 2005. "Applying cluster identification algorithm and simulation to generate probabilistic network schedules for design projects," Construction Management and Economics, Taylor & Francis Journals, vol. 23(2), pages 199-213.
  • Handle: RePEc:taf:conmgt:v:23:y:2005:i:2:p:199-213
    DOI: 10.1080/0144619042000301393
    as

    Download full text from publisher

    File URL: http://www.tandfonline.com/doi/abs/10.1080/0144619042000301393
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/0144619042000301393?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:conmgt:v:23:y:2005:i:2:p:199-213. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RCME20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.