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

Scheduling with regular performance measures and optional job rejection on a single machine

Author

Listed:
  • Baruch Mor
  • Dana Shapira

Abstract

We address single machine problems with optional job rejection, and focus on minimizing regular performance measures, ie, functions that are non-decreasing in the jobs, completion times, subject to the constraint that the total rejection cost cannot exceed a predefined upper bound. Our contribution is twofold. First, we consider two problems that, to the best of our knowledge, were not addressed in scheduling theory – total (unweighted) tardiness with a common due date and total weighted tardiness with a common due date. For these problems, we show that they are NP-hard and present pseudo-polynomial-time dynamic programming (DP) solution algorithms. Second, we revisit three problems: makespan with release-dates, total completion time, and total weighted completion time, and present enhanced DP solution algorithms. To all studied problems, we provide extensive numerical studies, verifying their efficiency, subsequently demonstrating both theoretical and practical enhancement.

Suggested Citation

  • Baruch Mor & Dana Shapira, 2020. "Scheduling with regular performance measures and optional job rejection on a single machine," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 71(8), pages 1315-1325, August.
    • Handle: RePEc:taf:tjorxx:v:71:y:2020:i:8:p:1315-1325
    DOI: 10.1080/01605682.2019.1621222
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2019.1621222
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2019.1621222?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sang, Yao-Wen & Wang, Jun-Qiang & Sterna, Małgorzata & Błażewicz, Jacek, 2023. "Single machine scheduling with due date assignment to minimize the total weighted lead time penalty and late work," Omega, Elsevier, vol. 121(C).
    2. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
    3. Matan Atsmony & Gur Mosheiov, 2023. "Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection," Journal of Scheduling, Springer, vol. 26(2), pages 193-207, April.

    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:71:y:2020:i:8:p:1315-1325. 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.