IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v81y1998i0p321-34310.1023-a1018917426360.html
   My bibliography  Save this article

An iterative algorithm for scheduling unit-time taskswith precedence constraints to minimisethe maximum lateness

Author

Listed:
  • Yakov Zinder
  • Duncan Roper

Abstract

We consider the maximum lateness problem in which all tasks have the same executiontime and must be processed on m > 1 parallel identical processors subject to precedenceconstraints. All tasks and all processors are available at time t=0, and each task has a duedate. If all due dates are zero, the maximum lateness problem converts to the makespanproblem, which is known to be NP-hard. We present a polynomial time algorithm thatenables us to obtain an optimal schedule for the case m=2 and gives an approximate solutionfor the general case. The upper bound for this algorithm is derived and proved to be tight. Ifall due dates are zero, then the upper bound obtained coincides with the upper bound for theCoffman - Graham algorithm, which is the best known for the makespan problem. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Yakov Zinder & Duncan Roper, 1998. "An iterative algorithm for scheduling unit-time taskswith precedence constraints to minimisethe maximum lateness," Annals of Operations Research, Springer, vol. 81(0), pages 321-343, June.
    • Handle: RePEc:spr:annopr:v:81:y:1998:i:0:p:321-343:10.1023/a:1018917426360
    DOI: 10.1023/A:1018917426360
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018917426360
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018917426360?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.

    Citations

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


    Cited by:

    1. Singh, Gaurav, 2005. "Scheduling UET-UCT outforests to minimize maximum lateness," European Journal of Operational Research, Elsevier, vol. 165(2), pages 468-478, September.
    2. Zinder, Yakov, 2003. "An iterative algorithm for scheduling UET tasks with due dates and release times," European Journal of Operational Research, Elsevier, vol. 149(2), pages 404-416, September.
    3. Maria Ayala & Abir Benabid & Christian Artigues & Claire Hanen, 2013. "The resource-constrained modulo scheduling problem: an experimental study," Computational Optimization and Applications, Springer, vol. 54(3), pages 645-673, April.

    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:spr:annopr:v:81:y:1998:i:0:p:321-343:10.1023/a:1018917426360. 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.