IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v46y2021i3p1230-1234.html
   My bibliography  Save this article

Corrigendum: Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling

Author

Listed:
  • Varun Gupta

    (University of Chicago, Chicago, Illinois 60637)

  • Benjamin Moseley

    (Carnegie Mellon University, Pittsburgh, Pennsylvania 15213)

  • Marc Uetz

    (University of Twente, Enschede 7500AE, Netherlands)

  • Qiaomin Xie

    (Cornell University, Ithaca, New York 14850)

Abstract

This corrigendum fixes an incorrect claim in the paper Gupta et al. [Gupta V, Moseley B, Uetz M, Xie Q (2020) Greed works—online algorithms for unrelated machine stochastic scheduling. Math. Oper. Res . 45(2):497–516.], which led us to claim a performance guarantee of 6 for a greedy algorithm for deterministic online scheduling with release times on unrelated machines. The result is based on an upper bound on the increase of the objective function value when adding an additional job j to a machine i (Gupta et al., lemma 6). It was pointed out by Sven Jäger from Technische Universität Berlin that this upper bound may fail to hold. We here present a modified greedy algorithm and analysis, which leads to a performance guarantee of 7.216 instead. Correspondingly, also the claimed performance guarantee of ( 6 + 3 Δ ) h ( Δ ) in theorem 4 of Gupta et al. for the stochastic online problem has to be corrected. We obtain a performance bound ( 7.216 + 3.608 Δ ) h ( Δ ) .

Suggested Citation

  • Varun Gupta & Benjamin Moseley & Marc Uetz & Qiaomin Xie, 2021. "Corrigendum: Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling," Mathematics of Operations Research, INFORMS, vol. 46(3), pages 1230-1234, August.
    • Handle: RePEc:inm:ormoor:v:46:y:2021:i:3:p:1230-1234
    DOI: 10.1287/moor.2021.1149
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1149
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2021.1149?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
    ---><---

    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:inm:ormoor:v:46:y:2021:i:3:p:1230-1234. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.