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

Resource Constrained Chain Scheduling of UET Jobs on Two Machines

Author

Listed:
  • W. Kubiak

    (Memorial University of Newfoundland, St. John's, Canada)

  • J. Błażewicz

    (Politechnika Poznańska, Poznan, Poland)

  • M. Dror

    (University of Arizona, Tucson, Arizona)

  • N. Katoh

    (Kobe University of Commerce, Kobe, Japan)

  • H. Rock

    (Universität Rostock, Rostock, Germany)

Abstract

A well-known technique for solving scheduling problems with two identical parallel processors and unit execution time jobs under a makespan minimization criteria involves finding maximum cardinality matchings in the graph associated with the problem, and then using these matchings to create optimal schedules. For some problem instances, however, this method will not work, since the problems are NP-hard. In this note, a previously open problem involving additional resource constraints is shown to have a polynomial algorithm using cardinality matching method.

Suggested Citation

  • W. Kubiak & J. Błażewicz & M. Dror & N. Katoh & H. Rock, 1998. "Resource Constrained Chain Scheduling of UET Jobs on Two Machines," Operations Research, INFORMS, vol. 46(5), pages 742-746, October.
    • Handle: RePEc:inm:oropre:v:46:y:1998:i:5:p:742-746
    DOI: 10.1287/opre.46.5.742
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.46.5.742
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.46.5.742?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. Faramroze G. Engineer & Pınar Keskinocak & Larry K. Pickering, 2009. "OR Practice---Catch-Up Scheduling for Childhood Vaccination," Operations Research, INFORMS, vol. 57(6), pages 1307-1319, December.

    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:46:y:1998:i:5:p:742-746. 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.