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

Scheduling of step-improving jobs with an identical improving rate

Author

Listed:
  • Hyun-Jung Kim
  • Eun-Seok Kim
  • Jun-Ho Lee

Abstract

Job processing times change over time in real-life production and manufacturing systems due to various factors including machine or worker learning, machine deterioration, production system upgrades or technological shocks. For step-improving processing times, job processing times are reduced by a certain rate if they start to process at, or after, a common critical date, which has wide applicability in real-world settings, such as data gathering networks and production systems with part-time workers. This paper considers single machine scheduling of minimizing total weighted completion time with step-improving jobs. The problem is shown to be intractable. Both exact and heuristic algorithms are developed, and the approximability of the heuristic algorithm is shown for a special case of the problem. Finally, computational experiments show that the proposed algorithms provide very effective and efficient solutions.

Suggested Citation

  • Hyun-Jung Kim & Eun-Seok Kim & Jun-Ho Lee, 2022. "Scheduling of step-improving jobs with an identical improving rate," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 73(5), pages 1127-1136, May.
    • Handle: RePEc:taf:tjorxx:v:73:y:2022:i:5:p:1127-1136
    DOI: 10.1080/01605682.2021.1886616
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2021.1886616
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2021.1886616?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:73:y:2022:i:5:p:1127-1136. 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.