IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v22y2022i3d10.1007_s12351-021-00627-4.html
   My bibliography  Save this article

Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection

Author

Listed:
  • Baruch Mor

    (Ariel University)

  • Gur Mosheiov

    (The Hebrew University)

Abstract

We study a single machine scheduling problem, where the goal is to maximize the weighted number of jobs completed exactly at their due-dates. The option of job-rejection is considered, i.e., the scheduler may perform only a subset of the jobs. An upper bound on the total permitted rejection cost is assumed. The problem is proved to be NP-hard, and a pseudo-polynomial dynamic programming algorithm is introduced. Our numerical tests indicate that the proposed algorithm performs well: medium size instances (of up to 100 jobs) are solved in less than 1 s.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:operea:v:22:y:2022:i:3:d:10.1007_s12351-021-00627-4
    DOI: 10.1007/s12351-021-00627-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-021-00627-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/s12351-021-00627-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. Baruch Mor & Dana Shapira, 2019. "Improved algorithms for scheduling on proportionate flowshop with job-rejection," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(11), pages 1997-2003, November.
    2. Yunqiang Yin & T. C. E. Cheng & Du-Juan Wang & Chin-Chia Wu, 2017. "Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs," Journal of Scheduling, Springer, vol. 20(4), pages 313-335, August.
    3. 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.
    4. Gordon, Valery & Proth, Jean-Marie & Chu, Chengbin, 2002. "A survey of the state-of-the-art of common due date assignment and scheduling research," European Journal of Operational Research, Elsevier, vol. 139(1), pages 1-25, May.
    5. Xianzhao Zhang & Dachuan Xu & Donglei Du & Chenchen Wu, 2018. "Approximation algorithms for precedence-constrained identical machine scheduling with rejection," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 318-330, January.
    6. Nicholas G. Hall & Wieslaw Kubiak & Suresh P. Sethi, 1991. "Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 847-856, October.
    7. Gur Mosheiov & Vitaly A. Strusevich, 2017. "Determining optimal sizes of bounded batches with rejection via quadratic min‐cost flow," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(3), pages 217-224, April.
    8. Kenneth R. Baker & Gary D. Scudder, 1990. "Sequencing with Earliness and Tardiness Penalties: A Review," Operations Research, INFORMS, vol. 38(1), pages 22-36, February.
    9. Nicholas G. Hall & Marc E. Posner, 1991. "Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 836-846, October.
    10. Juan Zou & Cuixia Miao, 2016. "The single machine serial batch scheduling problems with rejection," Operational Research, Springer, vol. 16(2), pages 211-221, July.
    11. Dvir Shabtay & George Steiner, 2012. "Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey," Springer Optimization and Its Applications, in: Roger Z. Ríos-Mercado & Yasmín A. Ríos-Solís (ed.), Just-in-Time Systems, chapter 0, pages 3-20, Springer.
    12. Janiak, Adam & Janiak, Władysław A. & Krysiak, Tomasz & Kwiatkowski, Tomasz, 2015. "A survey on scheduling problems with due windows," European Journal of Operational Research, Elsevier, vol. 242(2), pages 347-357.
    13. 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.
    14. Yin, Yunqiang & Cheng, Shuenn-Ren & Cheng, T.C.E. & Wang, Du-Juan & Wu, Chin-Chia, 2016. "Just-in-time scheduling with two competing agents on unrelated parallel machines," Omega, Elsevier, vol. 63(C), pages 41-47.
    15. 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.
    16. Hui-Chih Hung & Bertrand M. T. Lin & Marc E. Posner & Jun-Min Wei, 2019. "Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs," Journal of Scheduling, Springer, vol. 22(4), pages 413-431, August.
    17. Mohammadreza Dabiri & Soroush Avakh Darestani & Bahman Naderi, 2019. "Multi-machine flow shop scheduling problems with rejection using genetic algorithm," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 32(2), pages 158-172.
    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. 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.
    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. Feng Li & Zhi-Long Chen & Zhi-Long Chen, 2017. "Integrated Production, Inventory and Delivery Problems: Complexity and Algorithms," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 232-250, May.
    4. 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.
    5. Hino, Celso M. & Ronconi, Debora P. & Mendes, Andre B., 2005. "Minimizing earliness and tardiness penalties in a single-machine problem with a common due date," European Journal of Operational Research, Elsevier, vol. 160(1), pages 190-201, January.
    6. Lin, Shih-Wei & Chou, Shuo-Yan & Ying, Kuo-Ching, 2007. "A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date," European Journal of Operational Research, Elsevier, vol. 177(2), pages 1294-1301, March.
    7. Dvir Shabtay & George Steiner, 2008. "The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times," Annals of Operations Research, Springer, vol. 159(1), pages 25-40, March.
    8. Wang, Julong & Liu, Zhixue & Li, Feng, 2024. "Integrated production and transportation scheduling problem under nonlinear cost structures," European Journal of Operational Research, Elsevier, vol. 313(3), pages 883-904.
    9. Baruch Mor, 2019. "Minmax scheduling problems with common due-date and completion time penalty," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 50-71, July.
    10. Shabtay, Dvir & Mosheiov, Gur & Oron, Daniel, 2022. "Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work," European Journal of Operational Research, Elsevier, vol. 303(1), pages 66-77.
    11. Baruch Mor & Gur Mosheiov, 2021. "A note: flowshop scheduling with linear deterioration and job-rejection," 4OR, Springer, vol. 19(1), pages 103-111, March.
    12. Esteve, B. & Aubijoux, C. & Chartier, A. & T'kindt, V., 2006. "A recovering beam search algorithm for the single machine Just-in-Time scheduling problem," European Journal of Operational Research, Elsevier, vol. 172(3), pages 798-813, August.
    13. Biskup, Dirk & Feldmann, Martin, 2005. "On scheduling around large restrictive common due windows," European Journal of Operational Research, Elsevier, vol. 162(3), pages 740-761, May.
    14. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    15. Baker, Kenneth R., 2014. "Minimizing earliness and tardiness costs in stochastic scheduling," European Journal of Operational Research, Elsevier, vol. 236(2), pages 445-452.
    16. X. Cai & F. S. Tu, 1996. "Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early‐tardy penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(8), pages 1127-1146, December.
    17. Li, Y. & Ip, W. H. & Wang, D. W., 1998. "Genetic algorithm approach to earliness and tardiness production scheduling and planning problem," International Journal of Production Economics, Elsevier, vol. 54(1), pages 65-76, January.
    18. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    19. Chung‐Lun Li & Edward C. Sewell & T. C. E. Cheng, 1995. "Scheduling to minimize release‐time resource consumption and tardiness penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 949-966, September.
    20. Cai, X. & Lum, V. Y. S. & Chan, J. M. T., 1997. "Scheduling about a common due date with kob-dependent asymmetric earliness and tardiness penalties," European Journal of Operational Research, Elsevier, vol. 98(1), pages 154-168, April.

    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:operea:v:22:y:2022:i:3:d:10.1007_s12351-021-00627-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.