IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v129y2004i1p205-21610.1023-banor.0000030689.69422.e1.html
   My bibliography  Save this article

An Almost Optimal Heuristic for Preemptive C max Scheduling of Dependent Tasks on Parallel Identical Machines

Author

Listed:
  • Joanna Józefowska
  • Marek Mika
  • Rafał Różycki
  • Grzegorz Waligóra
  • Jan Węglarz

Abstract

We consider the problem of scheduling preemptable, dependent tasks on parallel, identical machines to minimize the makespan. The computational complexity of this problem remains open if the number of machines is fixed and larger than 2. The aim of this paper is to compare two heuristic algorithms on a basis of a computational experiment. The solutions generated by the heuristics are compared with optimal solutions obtained by a branch-and-bound algorithm. Computational results show that the heuristic based on node ordering finds optimal schedules for 99.9% of instances with the maximum relative deviation from optimum of 4.8%. Copyright Kluwer Academic Publishers 2004

Suggested Citation

  • Joanna Józefowska & Marek Mika & Rafał Różycki & Grzegorz Waligóra & Jan Węglarz, 2004. "An Almost Optimal Heuristic for Preemptive C max Scheduling of Dependent Tasks on Parallel Identical Machines," Annals of Operations Research, Springer, vol. 129(1), pages 205-216, July.
    • Handle: RePEc:spr:annopr:v:129:y:2004:i:1:p:205-216:10.1023/b:anor.0000030689.69422.e1
    DOI: 10.1023/B:ANOR.0000030689.69422.e1
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/B:ANOR.0000030689.69422.e1
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/B:ANOR.0000030689.69422.e1?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. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
    2. R. Różycki & J. Węglarz, 2014. "Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan," Annals of Operations Research, Springer, vol. 213(1), pages 235-252, February.

    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:129:y:2004:i:1:p:205-216:10.1023/b:anor.0000030689.69422.e1. 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.