IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v24y2021i6d10.1007_s10951-021-00697-4.html
   My bibliography  Save this article

Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates

Author

Listed:
  • Baruch Mor

    (Ariel University)

  • Gur Mosheiov

    (The Hebrew University)

  • Dvir Shabtay

    (Ben-Gurion University of the Negev)

Abstract

We study a scheduling problem involving both partitioning and scheduling decisions. A solution for our problem is defined by (i) partitioning the set of jobs into a set of accepted and a set of rejected jobs and (ii) scheduling the set of accepted jobs in a proportionate flow shop scheduling system. For a given solution, the jth largest due date is assigned to the job with the jth largest completion time. The quality of a solution is measured by two criteria, one for each set of jobs. The first is the total tardiness of the set of accepted jobs, and the second is the total rejection cost. We study two problems. The goal in the first is to find a solution minimizing the sum of the total tardiness and the rejection cost, while the goal in the second is to find a solution minimizing the total rejection cost, given a bound on the total tardiness. As both problems are $${\mathcal {N}}{\mathcal {P}}$$ N P -hard, we focus on the design of both exact algorithms and approximation schemes.

Suggested Citation

  • Baruch Mor & Gur Mosheiov & Dvir Shabtay, 2021. "Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates," Journal of Scheduling, Springer, vol. 24(6), pages 553-567, December.
  • Handle: RePEc:spr:jsched:v:24:y:2021:i:6:d:10.1007_s10951-021-00697-4
    DOI: 10.1007/s10951-021-00697-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-021-00697-4
    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-021-00697-4?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.

    References listed on IDEAS

    as
    1. Hermelin, Danny & Pinedo, Michael & Shabtay, Dvir & Talmon, Nimrod, 2019. "On the parameterized tractability of single machine scheduling with rejection," European Journal of Operational Research, Elsevier, vol. 273(1), pages 67-73.
    2. Edmund Burke & Michael Pinedo, 2019. "Journal of scheduling (2019)," Journal of Scheduling, Springer, vol. 22(1), pages 1-2, February.
    3. C. Sriskandarajah, 1990. "A note on the generalized due dates scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 587-597, August.
    4. Enrique Gerstl & Gur Mosheiov, 2020. "Single machine scheduling to maximize the number of on-time jobs with generalized due-dates," Journal of Scheduling, Springer, vol. 23(3), pages 289-299, June.
    5. Hall, Nicholas G. & Sethi, Suresh P. & Sriskandarajah, Chelliah, 1991. "On the complexity of generalized due date scheduling problems," European Journal of Operational Research, Elsevier, vol. 51(1), pages 100-109, March.
    6. Jianzhong Du & Joseph Y.-T. Leung, 1990. "Minimizing Total Tardiness on One Machine is NP-Hard," Mathematics of Operations Research, INFORMS, vol. 15(3), pages 483-495, August.
    7. Dvir Shabtay & Nufar Gaspar & Liron Yedidsion, 2012. "A bicriteria approach to scheduling a single machine with job rejection and positional penalties," Journal of Combinatorial Optimization, Springer, vol. 23(4), pages 395-424, May.
    8. Baruch Mor & Gur Mosheiov, 2018. "A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection," Annals of Operations Research, Springer, vol. 271(2), pages 1079-1085, December.
    9. K. Tanaka & M. Vlach, 1999. "Minimizing maximum absolute lateness and range of lateness under generalizeddue dates on a single machine," Annals of Operations Research, Springer, vol. 86(0), pages 507-526, January.
    10. Enrique Gerstl & Gur Mosheiov, 2017. "Single machine scheduling problems with generalised due-dates and job-rejection," International Journal of Production Research, Taylor & Francis Journals, vol. 55(11), pages 3164-3172, June.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Baruch Mor, 2023. "Single machine scheduling problems involving job-dependent step-deterioration dates and job rejection," Operational Research, Springer, vol. 23(1), pages 1-19, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mosheiov, Gur & Oron, Daniel & Shabtay, Dvir, 2021. "Minimizing total late work on a single machine with generalized due-dates," European Journal of Operational Research, Elsevier, vol. 293(3), pages 837-846.
    2. Enrique Gerstl & Gur Mosheiov, 2020. "Single machine scheduling to maximize the number of on-time jobs with generalized due-dates," Journal of Scheduling, Springer, vol. 23(3), pages 289-299, June.
    3. Gur Mosheiov & Daniel Oron & Dvir Shabtay, 2022. "On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates," Journal of Scheduling, Springer, vol. 25(5), pages 577-587, October.
    4. 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.
    5. 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.
    6. Danny Hermelin & Dvir Shabtay & Chen Zelig & Michael Pinedo, 2022. "A general scheme for solving a large set of scheduling problems with rejection in FPT time," Journal of Scheduling, Springer, vol. 25(2), pages 229-255, April.
    7. Baruch Mor & Gur Mosheiov & Dana Shapira, 2021. "Single machine lot scheduling with optional job-rejection," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 1-11, January.
    8. Barketau, M.S. & Cheng, T.C.E. & Kovalyov, M.Y., 2008. "Batch scheduling of deteriorating reworkables," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1317-1326, September.
    9. Inderfurth, Karl & Kovalyov, Mikhail Y. & Ng, C.T. & Werner, Frank, 2007. "Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables," International Journal of Production Economics, Elsevier, vol. 105(2), pages 345-356, February.
    10. Ma, Ran & Guo, Sainan, 2021. "Applying “Peeling Onion” approach for competitive analysis in online scheduling with rejection," European Journal of Operational Research, Elsevier, vol. 290(1), pages 57-67.
    11. Myoung-Ju Park & Byung-Cheon Choi & Yunhong Min & Kyung Min Kim, 2020. "Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(01), pages 1-16, January.
    12. Mohamadreza Dabiri & Mehdi Yazdani & Bahman Naderi & Hassan Haleh, 2022. "Modeling and solution methods for hybrid flow shop scheduling problem with job rejection," Operational Research, Springer, vol. 22(3), pages 2721-2765, July.
    13. Baruch Mor & Gur Mosheiov & Dana Shapira, 2020. "Flowshop scheduling with learning effect and job rejection," Journal of Scheduling, Springer, vol. 23(6), pages 631-641, December.
    14. Wang, Du-Juan & Yin, Yunqiang & Xu, Jianyou & Wu, Wen-Hsiang & Cheng, Shuenn-Ren & Wu, Chin-Chia, 2015. "Some due date determination scheduling problems with two agents on a single machine," International Journal of Production Economics, Elsevier, vol. 168(C), pages 81-90.
    15. Lin, B.M.T. & Liu, S.T., 2008. "Maximizing the reward in the relocation problem with generalized due dates," International Journal of Production Economics, Elsevier, vol. 115(1), pages 55-63, September.
    16. Matthias Bentert & Robert Bredereck & Péter Györgyi & Andrzej Kaczmarczyk & Rolf Niedermeier, 2023. "A multivariate complexity analysis of the material consumption scheduling problem," Journal of Scheduling, Springer, vol. 26(4), pages 369-382, August.
    17. Klaus Heeger & Danny Hermelin & George B. Mertzios & Hendrik Molter & Rolf Niedermeier & Dvir Shabtay, 2023. "Equitable scheduling on a single machine," Journal of Scheduling, Springer, vol. 26(2), pages 209-225, April.
    18. Baruch Mor & Gur Mosheiov, 2021. "A note: flowshop scheduling with linear deterioration and job-rejection," 4OR, Springer, vol. 19(1), pages 103-111, March.
    19. Baruch Mor & Gur Mosheiov, 2022. "Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection," Operational Research, Springer, vol. 22(3), pages 2707-2719, July.
    20. Derya Deliktaş, 2022. "Self-adaptive memetic algorithms for multi-objective single machine learning-effect scheduling problems with release times," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 748-784, September.

    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:spr:jsched:v:24:y:2021:i:6:d:10.1007_s10951-021-00697-4. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.