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

Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints

Author

Listed:
  • H. M. Abdel-Wahab

    (University of Waterloo, Waterloo, Ontario)

  • T. Kameda

    (University of Waterloo, Waterloo, Ontario)

Abstract

Consider a set of events that are constrained by a certain precedence relation. Associated with each event is a cost (an integer), which may be interpreted as an additional number of resource units necessary for the event to occur (units are released if the cost is negative). It is desired to order the events into a single sequence in such a way that the maximum cumulative cost encountered (largest number of resource units used at one time) is minimized. It is known that this problem is in general NP-complete. For the special case where the precedence constraints can be represented by a series-parallel graph, we present an algorithm for finding an optimal schedule whose running time does not grow faster than the square of the number of events.

Suggested Citation

  • H. M. Abdel-Wahab & T. Kameda, 1978. "Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints," Operations Research, INFORMS, vol. 26(1), pages 141-158, February.
    • Handle: RePEc:inm:oropre:v:26:y:1978:i:1:p:141-158
    DOI: 10.1287/opre.26.1.141
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. Hans Kellerer & Vladimir Kotov & Franz Rendl & Gerhard J. Woeginger, 1998. "The Stock Size Problem," Operations Research, INFORMS, vol. 46(3-supplem), pages 1-12, June.

    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:26:y:1978:i:1:p:141-158. 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.