IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v347y2025i3d10.1007_s10479-025-06468-0.html
   My bibliography  Save this article

Scheduling problems on parallel machines with machine-dependent generalized due-dates

Author

Listed:
  • Baruch Mor

    (Ariel University)

  • Gur Mosheiov

    (The Hebrew University
    Lev Academic Center)

  • Dvir Shabtay

    (Ben-Gurion University of the Negev)

Abstract

In scheduling problems with generalized due-dates, the due-dates are position-dependent (and not job-dependent as in classical scheduling). In this paper, we study scheduling problems on parallel machines, and the underlying assumption is that the generalized due-dates are machine-dependent. The following scheduling measures are considered: total tardiness, maximum tardiness, number of tardy jobs, and total late work. We show that all the problems are NP-hard even if all generalized due-dates are identical. We complement this hardness result by showing that all problems are solvable in pseudo-polynomial time and that minimizing total late work is fixed parametrized tractable with respect to the number of different generalized due-dates and processing times in the instance. We also tested the pseudo-polynomial time algorithms, showing they can easily solve instances containing up to 200 jobs.

Suggested Citation

  • Baruch Mor & Gur Mosheiov & Dvir Shabtay, 2025. "Scheduling problems on parallel machines with machine-dependent generalized due-dates," Annals of Operations Research, Springer, vol. 347(3), pages 1455-1471, April.
    • Handle: RePEc:spr:annopr:v:347:y:2025:i:3:d:10.1007_s10479-025-06468-0
    DOI: 10.1007/s10479-025-06468-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-025-06468-0
    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/s10479-025-06468-0?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:spr:annopr:v:347:y:2025:i:3:d:10.1007_s10479-025-06468-0. 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.