IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v62y2024i6p2083-2092.html
   My bibliography  Save this article

A common due-date assignment problem with job rejection on parallel uniform machines

Author

Listed:
  • Gur Mosheiov
  • Assaf Sarig

Abstract

We study a common due-date assignment problem on two parallel uniform machines. The jobs are assumed to have identical processing times, and job-dependent and asymmetric earliness and tardiness unit costs. The scheduler may process only a subset of the jobs, i.e. the option of job-rejection is allowed. The objective function consists of three cost components: the total earliness-tardiness cost of all scheduled jobs, the cost of the common due-date, and total rejection cost. For a given number of rejected jobs and a given due-date, the problem is reduced to a non-standard linear assignment problem. Consequently, the optimal solution is shown to be obtained in polynomial time in the number of jobs. The case of a given (possibly restrictive) due-date, the extension to a setting of more than two machines, and a number of special cases, are also discussed.

Suggested Citation

  • Gur Mosheiov & Assaf Sarig, 2024. "A common due-date assignment problem with job rejection on parallel uniform machines," International Journal of Production Research, Taylor & Francis Journals, vol. 62(6), pages 2083-2092, March.
    • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:6:p:2083-2092
    DOI: 10.1080/00207543.2023.2217277
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2023.2217277
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2023.2217277?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:tprsxx:v:62:y:2024:i:6:p:2083-2092. 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/TPRS20 .

    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.