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

Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints

Author

Listed:
  • Charles Martel

    (University of California, Davis, California)

Abstract

We consider the problem of preemptively scheduling n jobs on m processors. The i th job has a processing requirement p i and a memory requirement q i . The i th processor has a speed s i and a memory capacity c i . The i th job can be run on the j th processor whenever c j ≥ q i . When all jobs have a deadline D i we develop an O ( n log m ) time algorithm that finds a feasible schedule or determines that no such schedule exists. We then use this algorithm to find the minimum time by which all jobs can be completed in O ( nm log 2 m ) time.

Suggested Citation

  • Charles Martel, 1985. "Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints," Operations Research, INFORMS, vol. 33(6), pages 1360-1380, December.
    • Handle: RePEc:inm:oropre:v:33:y:1985:i:6:p:1360-1380
    DOI: 10.1287/opre.33.6.1360
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.33.6.1360
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.33.6.1360?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. Celia A. Glass & Hans Kellerer, 2007. "Parallel machine scheduling with job assignment restrictions," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(3), pages 250-257, April.
    2. Leung, Joseph Y.-T. & Li, Chung-Lun, 2008. "Scheduling with processing set restrictions: A survey," International Journal of Production Economics, Elsevier, vol. 116(2), pages 251-262, 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:33:y:1985:i:6:p:1360-1380. 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.