IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v62y2024i6p2272-2285.html
   My bibliography  Save this article

Minimising total weighted completion time for semi-online single machine scheduling with known arrivals and bounded processing times

Author

Listed:
  • Hajar Nouinou
  • Taha Arbaoui
  • Alice Yalaoui

Abstract

This paper addresses the semi-online scheduling problem of minimising the total weighted completion time on a single machine, where a combination of information on jobs release dates and processing times is considered. In this study, jobs can only arrive at known future times and a lower bound on jobs processing times is known in advance. A new semi-online algorithm is presented and is shown to be the best possible for the considered problem. In order to make this statement, a new lower bound on the competitive ratio of any semi-online algorithm for the problem is developed and, using competitive analysis, the proposed semi-online algorithm is shown to have a competitive ratio that matches the lower bound.

Suggested Citation

  • Hajar Nouinou & Taha Arbaoui & Alice Yalaoui, 2024. "Minimising total weighted completion time for semi-online single machine scheduling with known arrivals and bounded processing times," International Journal of Production Research, Taylor & Francis Journals, vol. 62(6), pages 2272-2285, March.
    • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:6:p:2272-2285
    DOI: 10.1080/00207543.2023.2217294
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2023.2217294
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2023.2217294?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.

    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:taf:tprsxx:v:62:y:2024:i:6:p:2272-2285. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.