IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v20y2017i3d10.1007_s10951-016-0507-8.html
   My bibliography  Save this article

The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays

Author

Listed:
  • Aurélien Carlier

    (Sorbonne Universités, UPMC Univ Paris 06, CNRS, LIP6 UMR 7606)

  • Claire Hanen

    (Sorbonne Universités, UPMC Univ Paris 06, CNRS, LIP6 UMR 7606
    Univeristé Paris-Lumières, Université Paris Ouest Nanterre La Défense)

  • Alix Munier Kordon

    (Sorbonne Universités, UPMC Univ Paris 06, CNRS, LIP6 UMR 7606)

Abstract

We consider a finite set of unit time execution tasks with release dates, due dates and precedence delays. The machines are partitioned into k classes. Each task requires one machine from a fixed class to be executed. The problem is the existence of a feasible schedule. This general problem is known to be $$\mathcal {NP}$$ NP -complete; many studies were devoted to the determination of polynomial time algorithms for some special subcases, most of them based on a particular list schedule. The Garey–Johnson and Leung–Palem–Pnueli algorithms (respectively GJ and LPP in short) are both improving the due dates to build a priority list. They are modifying them using necessary conditions until a fixed point is reached. The present paper shows that these two algorithms are different implementations of the same generic one. The main consequence is that all the results valid for GJ algorithm are also for LPP and vice versa.

Suggested Citation

  • Aurélien Carlier & Claire Hanen & Alix Munier Kordon, 2017. "The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays," Journal of Scheduling, Springer, vol. 20(3), pages 303-311, June.
    • Handle: RePEc:spr:jsched:v:20:y:2017:i:3:d:10.1007_s10951-016-0507-8
    DOI: 10.1007/s10951-016-0507-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-016-0507-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-016-0507-8?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:spr:jsched:v:20:y:2017:i:3:d:10.1007_s10951-016-0507-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.