IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v21y2018i4d10.1007_s10951-017-0536-y.html
   My bibliography  Save this article

Online-bounded analysis

Author

Listed:
  • Joan Boyar

    (University of Southern Denmark)

  • Leah Epstein

    (University of Haifa)

  • Lene M. Favrholdt

    (University of Southern Denmark)

  • Kim S. Larsen

    (University of Southern Denmark)

  • Asaf Levin

    (The Technion)

Abstract

Though competitive analysis is often a very good tool for the analysis of online algorithms, sometimes it does not give any insight and sometimes it gives counter-intuitive results. Much work has gone into exploring other performance measures, in particular targeted at what seems to be the core problem with competitive analysis: The comparison of the performance of an online algorithm is made with respect to a too powerful adversary. We consider a new approach to restricting the power of the adversary, by requiring that when judging a given online algorithm, the optimal offline algorithm must perform at least as well as the online algorithm, not just on the entire final request sequence, but also on any prefix of that sequence. This is limiting the adversary’s usual advantage of being able to exploit that it knows the sequence is continuing beyond the current request. Through a collection of online problems, including machine scheduling, bin packing, dual bin packing, and seat reservation, we investigate the significance of this particular offline advantage.

Suggested Citation

  • Joan Boyar & Leah Epstein & Lene M. Favrholdt & Kim S. Larsen & Asaf Levin, 2018. "Online-bounded analysis," Journal of Scheduling, Springer, vol. 21(4), pages 429-441, August.
    • Handle: RePEc:spr:jsched:v:21:y:2018:i:4:d:10.1007_s10951-017-0536-y
    DOI: 10.1007/s10951-017-0536-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-017-0536-y
    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-017-0536-y?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.

    References listed on IDEAS

    as
    1. Leah Epstein & Lene M. Favrholdt & Jens S. Kohrt, 2006. "Separating online scheduling algorithms with the relative worst order ratio," Journal of Combinatorial Optimization, Springer, vol. 12(4), pages 363-386, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jinjiang Yuan & Shisheng Li & Ji Tian & Ruyan Fu, 2009. "A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times," Journal of Combinatorial Optimization, Springer, vol. 17(2), pages 206-213, 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:jsched:v:21:y:2018:i:4:d:10.1007_s10951-017-0536-y. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.