IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v22y2005i04ns0217595905000662.html
   My bibliography  Save this article

Preemptive Scheduling On Parallel Processors With Due Dates

Author

Listed:
  • YAKOV ZINDER

    (University of Technology, Sydney, PO Box 123, Broadway, NSW 2007, Australia)

  • GAURAV SINGH

    (CSIRO Mathematical and Information Sciences, Private Bag 10, South Clayton, VIC 3169, Australia)

Abstract

The paper presents a priority algorithm for the maximum lateness problem with parallel identical processors, precedence constraints, and preemptions. The presented algorithm calculates the priority of each task by constructing a schedule for the set of its successors. The algorithm is motivated by comparison of its nonpreemptive counterpart with other algorithms for the problem with unit execution time tasks. It is shown that the presented algorithm constructs an optimal schedule for the problem with two processors and arbitrary precedence constraints, and for the problem with an arbitrary number of processors and precedence constraints in the form of an in-tree. This proof also indicates that the presented algorithm allows the worst-case performance ratio previously established for the so-called Muntz–Coffman algorithm for a particular case of the considered problem where all due dates are zero.

Suggested Citation

  • Yakov Zinder & Gaurav Singh, 2005. "Preemptive Scheduling On Parallel Processors With Due Dates," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 22(04), pages 445-462.
    • Handle: RePEc:wsi:apjorx:v:22:y:2005:i:04:n:s0217595905000662
    DOI: 10.1142/S0217595905000662
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595905000662
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595905000662?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:wsi:apjorx:v:22:y:2005:i:04:n:s0217595905000662. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.