IDEAS home Printed from https://ideas.repec.org/p/iim/iimawp/wp00869.html
   My bibliography  Save this paper

An Approximate Algorithm for Reducing Dummy-Activities in a Pert Network

Author

Listed:
  • Gupta Omprakash K

Abstract

A project is an enterprise consisting of several activities which are to be carried out in some specific order. The activities and the order in which they need to be carried out can be represented by a pert network. Two types of networks are commonly used: activity-On-Node (AON) and Activity-On-Arrow (AOA) networks. When networks are used, it often becomes necessary to draw dummy activities. Since the computation of project completion time is proportional to the number of arcs, including dummy, it is desirable to draw a network with as few dummy activities as possible. It has been earlier shown that the minimum-dummy-activities problem is NP-complete. In this paper we propose an approximate algorithm for solving the dummy activities problem. The algorithm is explained by an example.

Suggested Citation

  • Gupta Omprakash K, 1989. "An Approximate Algorithm for Reducing Dummy-Activities in a Pert Network," IIMA Working Papers WP1989-03-01_00869, Indian Institute of Management Ahmedabad, Research and Publication Department.
    • Handle: RePEc:iim:iimawp:wp00869
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    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:iim:iimawp:wp00869. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/eciimin.html .

    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.