IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v11y1965i3p444-459.html
   My bibliography  Save this article

Decomposition of Project Networks

Author

Listed:
  • Shailendra C. Parikh

    (Applied Mathematics Division, Esso Research and Engineering Company, Florham Park, New Jersey)

  • William S. Jewell

    (Department of Industrial Engineering and Operations Research Center, University of California, Berkeley)

Abstract

This paper considers "critical path" networks which are used for the planning and scheduling of projects that consist of well defined sequences of individual activities. When the number of activities is large, it becomes difficult to prepare a network for the project as one unit, and it may also be difficult to store the network in the high speed memory of a digital computer. Also, in the cases where there are two or more independent projects, which are weakly inter-related by common activities, the problem of efficient scheduling of all the projects becomes quite difficult. This paper presents a method to "tear" or "decompose" a project network into several subnetworks, schedule the subnetworks and then to put the subnetworks back together. A computational algorithm is first given for time-only networks; then two computational formulations are given for cost-time network of project subnetworks. The latter essentially generalize the algorithm due to Fulkerson, in order to handle piecewise linear, convex, cost-time curves for some or all of the activities.

Suggested Citation

  • Shailendra C. Parikh & William S. Jewell, 1965. "Decomposition of Project Networks," Management Science, INFORMS, vol. 11(3), pages 444-459, January.
  • Handle: RePEc:inm:ormnsc:v:11:y:1965:i:3:p:444-459
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.11.3.444
    Download Restriction: no

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Heinemann, Hergen H., 1971. "Ein allgemeines Dekompositionsverfahren fuer lineare Optimierungsprobleme
      [A General Decomposition Algorithm for Linear Optimization Problems]
      ," MPRA Paper 28842, University Library of Munich, Germany.
    2. Massiani, Jérôme, 2014. "A micro founded approach to the valuation of benefits of freight travel time savings," Research in Transportation Economics, Elsevier, vol. 47(C), pages 61-69.
    3. De, Prabuddha & James Dunne, E. & Ghosh, Jay B. & Wells, Charles E., 1995. "The discrete time-cost tradeoff problem revisited," European Journal of Operational Research, Elsevier, vol. 81(2), pages 225-238, March.

    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:inm:ormnsc:v:11:y:1965:i:3:p:444-459. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc). General contact details of provider: http://edirc.repec.org/data/inforea.html .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.