IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v41y2024i01ns0217595923500057.html
   My bibliography  Save this article

Online Single-Processor Scheduling with an Unexpected Breakdown

Author

Listed:
  • Sainan Guo

    (School of Mathematical Science and Institute of Mathematics, Nanjing Normal University, Nanjing, 210023, P. R. China)

  • Yannan Chen

    (School of Mathematical Sciences, South China Normal University, Guangzhou 510631, P. R. China)

  • Yaping Mao

    (Department of Mathematics and Statistics, Qinghai Normal University, Xining 810008, Qinghai, P. R. China4Academy of Plateau Science and Sustainability, Xining 810008, Qinghai, P. R. China)

  • Xiaoyan Zhang

    (School of Mathematical Science and Institute of Mathematics, Nanjing Normal University, Nanjing, 210023, P. R. China)

Abstract

In this paper, we consider two single-processor online scheduling problems with an unexpected breakdown. Speaking specifically, there is a group of nonresumable jobs being processed on the single processor. Note that the breakdown will emerge on the processor suddenly, which signifies that its beginning time and its length are unknown in advance. In this study, we are interested in scheduling the jobs so as to minimize the maximum weighted completion time. Most noticeably, when all jobs respect an agreeable condition, i.e., for each two jobs Ja and Jb, wa ≥ wb means that pa ≥ pb, we design an optimal online algorithm. In addition, for the general version, we propose an online algorithm with a competitive ratio of at most 2.

Suggested Citation

  • Sainan Guo & Yannan Chen & Yaping Mao & Xiaoyan Zhang, 2024. "Online Single-Processor Scheduling with an Unexpected Breakdown," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 41(01), pages 1-15, February.
    • Handle: RePEc:wsi:apjorx:v:41:y:2024:i:01:n:s0217595923500057
    DOI: 10.1142/S0217595923500057
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595923500057
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595923500057?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.

    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:wsi:apjorx:v:41:y:2024:i:01:n:s0217595923500057. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.