IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v128y2024ics0305048324000811.html
   My bibliography  Save this article

Scheduling with a weight-modifying activity to minimize the total weighted completion time

Author

Listed:
  • Lin, Bertrand M.T.
  • Liu, Shu-Wei
  • Mosheiov, Gur

Abstract

This paper considers a single-machine scheduling problem to minimize the total weighted completion time with a weight modifying activity, after which the job weights are discounted by a given factor. The problem is known to be ordinary NP-hard. We propose two mixed integer linear programs (MILPs) and a dynamic programming algorithm to optimally solve the problem. Optimality properties are established and then formulated as pruning constraints to improve the problem-solving efficiency of the MILPs. Special cases are discussed and shown to be solvable by polynomial time algorithms. Complexity status of the studied problem with several instance characteristics is shown. Computational experiments indicate that the optimality properties can reduce the computing efforts and that one of the proposed MILPs can solve instances of 200 jobs in a few seconds.

Suggested Citation

  • Lin, Bertrand M.T. & Liu, Shu-Wei & Mosheiov, Gur, 2024. "Scheduling with a weight-modifying activity to minimize the total weighted completion time," Omega, Elsevier, vol. 128(C).
    • Handle: RePEc:eee:jomega:v:128:y:2024:i:c:s0305048324000811
    DOI: 10.1016/j.omega.2024.103115
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048324000811
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2024.103115?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:eee:jomega:v:128:y:2024:i:c:s0305048324000811. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.