IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v28y2025i4d10.1007_s10951-025-00848-x.html
   My bibliography  Save this article

Polynomial-time solutions for minimizing total load on unrelated machines with position-dependent processing times and rate-modifying activities

Author

Listed:
  • Baruch Mor

    (Ariel University)

  • Gur Mosheiov

    (The Hebrew University
    Lev Academic Center)

  • Dvir Shabtay

    (Ben-Gurion University of the Negev)

Abstract

We study the problem of minimizing total load on parallel unrelated machines. Job processing times are assumed to be machine- and position-dependent in the most general way. The scheduler may perform a rate-modifying maintenance activity on each machine. The processing times of the jobs scheduled after the maintenance are reduced. The maintenance time and the impact on the following jobs are machine-dependent. We introduce a solution algorithm which is polynomial when a constant bounds the number of machines. The special case of (general) job deterioration, the more general case in which job rejection is allowed, and the extension to the setting of job processing times, which are controllable through allocating a limited resource, are also studied. All these scheduling problems are shown to be solved in polynomial time.

Suggested Citation

  • Baruch Mor & Gur Mosheiov & Dvir Shabtay, 2025. "Polynomial-time solutions for minimizing total load on unrelated machines with position-dependent processing times and rate-modifying activities," Journal of Scheduling, Springer, vol. 28(4), pages 377-390, August.
    • Handle: RePEc:spr:jsched:v:28:y:2025:i:4:d:10.1007_s10951-025-00848-x
    DOI: 10.1007/s10951-025-00848-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-025-00848-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-025-00848-x?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    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:spr:jsched:v:28:y:2025:i:4:d:10.1007_s10951-025-00848-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.