IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v75y2024i4p720-730.html
   My bibliography  Save this article

On scheduling of step-improving jobs to minimize the total weighted completion time

Author

Listed:
  • T.C.E. Cheng
  • Svetlana A. Kravchenko
  • Bertrand M.T. Lin

Abstract

Kim et al. (2022) studied single-machine scheduling of step-improving jobs with a common discount factor to minimize the total weighted completion time. This study proposes a pseudo-polynomial algorithm to solve the problem. We then consider the general problem in which the discount factors are job dependent. It is proven that there is an optimal solution in which the early normal jobs are sequenced in the WSPT order and the late discounted jobs are sequenced in the WSPT order. Based on two WSPT lists, a dynamic programming solution algorithm is proposed. The run time is pseudo-polynomial when the distance of any job is bounded by a constant, where the distance of a job is the absolute difference of the two positions of this job in two WSPT-ordered job lists.

Suggested Citation

  • T.C.E. Cheng & Svetlana A. Kravchenko & Bertrand M.T. Lin, 2024. "On scheduling of step-improving jobs to minimize the total weighted completion time," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 75(4), pages 720-730, April.
    • Handle: RePEc:taf:tjorxx:v:75:y:2024:i:4:p:720-730
    DOI: 10.1080/01605682.2023.2203150
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2023.2203150
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2023.2203150?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:tjorxx:v:75:y:2024:i:4:p:720-730. 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/tjor .

    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.