IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v9y2005i2d10.1007_s10878-005-6854-6.html
   My bibliography  Save this article

A Tighter Extra-Resource Analysis of Online Deadline Scheduling

Author

Listed:
  • Tak-Wah Lam

    (University of Hong Kong)

  • Tusen-Wan Johnny Ngan

    (Rice University)

  • Kar-Keung To

    (University of Hong Kong)

Abstract

This paper is concerned with online algorithms for scheduling jobs with deadlines on a single processor. It has been known for long that unless the system is underloaded, no online scheduling algorithm can be 1-competitive, i.e., matching the performance of the optimal offline algorithm. Nevertheless, recent work has revealed that some online algorithms using a moderately faster processor (or extra processors) can guarantee very competitive performance Kalyanasundaram and Pruhs, 2000 or even be 1-competitive Koo et al., 2002; Lam and To, 2001. This paper takes a further step to investigate online scheduling algorithms with an even higher performance guarantee (i.e., better than 1-competitive algorithms) and in particular, presents an extra-resource analysis of the earliest-deadline-first strategy (EDF) with respect to such a higher performance guarantee.

Suggested Citation

  • Tak-Wah Lam & Tusen-Wan Johnny Ngan & Kar-Keung To, 2005. "A Tighter Extra-Resource Analysis of Online Deadline Scheduling," Journal of Combinatorial Optimization, Springer, vol. 9(2), pages 157-165, March.
    • Handle: RePEc:spr:jcomop:v:9:y:2005:i:2:d:10.1007_s10878-005-6854-6
    DOI: 10.1007/s10878-005-6854-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-005-6854-6
    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/s10878-005-6854-6?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. Feifeng Zheng & Yinfeng Xu & E. Zhang, 2007. "On-line production order scheduling with preemption penalties," Journal of Combinatorial Optimization, Springer, vol. 13(2), pages 189-204, 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:jcomop:v:9:y:2005:i:2:d:10.1007_s10878-005-6854-6. 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.