IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v20y1972i4p835-850.html
   My bibliography  Save this article

An Algorithm for Project (Job) Sequencing with Resource Constraints

Author

Listed:
  • Samuel Corenstein

    (IBM Thomas J. Watson Research Center, Yorktown Heights, New York)

Abstract

This paper treats the problem of project (or machine) scheduling with resource constraints to achieve minimum total duration time as a disjunctive graph. The prospective advantage of this approach is the elimination of the need to consider individual time periods over the program horizon; a feasibility check determines whether the resource constraints can be met by any particular network representation of the project. The paper gives an algorithm that uses partial enumeration for what is essentially a mixed integer program. The algorithm employs a maximum-flow computation as a check for feasibility with respect to available resources.

Suggested Citation

  • Samuel Corenstein, 1972. "An Algorithm for Project (Job) Sequencing with Resource Constraints," Operations Research, INFORMS, vol. 20(4), pages 835-850, August.
    • Handle: RePEc:inm:oropre:v:20:y:1972:i:4:p:835-850
    DOI: 10.1287/opre.20.4.835
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.20.4.835
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.20.4.835?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
    ---><---

    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:oropre:v:20:y:1972:i:4:p:835-850. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.