IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v25y2025i1d10.1007_s12351-024-00887-w.html
   My bibliography  Save this article

Scheduling with step learning and job rejection

Author

Listed:
  • Jiaxin Song

    (Qufu Normal University
    Nanjing University of Information Science and Technology)

  • Cuixia Miao

    (Qufu Normal University)

  • Fanyu Kong

    (Qufu Normal University)

Abstract

This paper focuses on job scheduling with step learning and job rejection. The step learning model aims to reduce the processing time for jobs starting after a specific learning date. Our objective is to minimize the sum of the maximum completion time of accepted jobs and the total rejection penalty of rejected jobs. We examine special cases of processing times for both single-machine and parallel-machine scenarios. For the former, we design a pseudo-polynomial time algorithm, a 2-approximation algorithm and a fully polynomial-time approximation scheme (FPTAS) based on data rounding. For the latter, we present a fully polynomial-time approximation scheme achieved by trimming the state space. Additionally, for the general case of the single-machine problem, we propose a pseudo-polynomial time algorithm.

Suggested Citation

  • Jiaxin Song & Cuixia Miao & Fanyu Kong, 2025. "Scheduling with step learning and job rejection," Operational Research, Springer, vol. 25(1), pages 1-18, March.
    • Handle: RePEc:spr:operea:v:25:y:2025:i:1:d:10.1007_s12351-024-00887-w
    DOI: 10.1007/s12351-024-00887-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-024-00887-w
    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-024-00887-w?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. Wei-Wei Liu & Chong Jiang, 2020. "Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(03), pages 1-27, April.
    2. Cuixia Miao & Fanyu Kong & Juan Zou & Ran Ma & Yujia Huo, 2023. "Parallel-Machine Scheduling with Step-Deteriorating Jobs to Minimize the Total (Weighted) Completion Time," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 40(01), pages 1-13, February.
    3. Zhenyou Wang & Cai-Min Wei & Linhui Sun, 2017. "Solution algorithms for the number of tardy jobs minimisation scheduling with a time-dependent learning effect," International Journal of Production Research, Taylor & Francis Journals, vol. 55(11), pages 3141-3148, June.
    4. Yi-Chun Wang & Ji-Bo Wang, 2023. "Study on Convex Resource Allocation Scheduling with a Time-Dependent Learning Effect," Mathematics, MDPI, vol. 11(14), pages 1-20, July.
    5. Mikhail Y. Kovalyov & Wieslaw Kubiak, 1999. "A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem," Operations Research, INFORMS, vol. 47(5), pages 757-761, October.
    6. Hongyu He & Yanzhi Zhao & Xiaojun Ma & Yuan-Yuan Lu & Na Ren & Ji-Bo Wang, 2023. "Study on Scheduling Problems with Learning Effects and Past Sequence Delivery Times," Mathematics, MDPI, vol. 11(19), pages 1-19, September.
    7. Ming-Hui Li & Dan-Yang Lv & Yuan-Yuan Lu & Ji-Bo Wang, 2024. "Scheduling with Group Technology, Resource Allocation, and Learning Effect Simultaneously," Mathematics, MDPI, vol. 12(7), pages 1-21, March.
    8. Biskup, Dirk, 1999. "Single-machine scheduling with learning considerations," European Journal of Operational Research, Elsevier, vol. 115(1), pages 173-178, May.
    9. Liqi Zhang & Lingfa Lu, 2016. "Parallel-machine scheduling with release dates and rejection," 4OR, Springer, vol. 14(2), pages 165-172, June.
    10. G Mosheiov, 2001. "Parallel machine scheduling with a learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(10), pages 1165-1169, October.
    11. Kuo, Wen-Hung & Yang, Dar-Li, 2006. "Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1184-1190, October.
    12. Zhang, Liqi & Lu, Lingfa & Yuan, Jinjiang, 2009. "Single machine scheduling with release dates and rejection," European Journal of Operational Research, Elsevier, vol. 198(3), pages 975-978, November.
    13. Ji-Bo Wang & Yi-Chun Wang & Congying Wan & Dan-Yang Lv & Lei Zhang, 2024. "Controllable Processing Time Scheduling with Total Weighted Completion Time Objective and Deteriorating Jobs," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 41(03), pages 1-24, June.
    Full references (including those not matched with items on IDEAS)

    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. Heuser, Patricia & Tauer, Björn, 2023. "Single-machine scheduling with product category-based learning and forgetting effects," Omega, Elsevier, vol. 115(C).
    2. Yi-Chun Wang & Ji-Bo Wang, 2023. "Study on Convex Resource Allocation Scheduling with a Time-Dependent Learning Effect," Mathematics, MDPI, vol. 11(14), pages 1-20, July.
    3. Gur Mosheiov & Assaf Sarig & Vitaly Strusevich, 2020. "Minmax scheduling and due-window assignment with position-dependent processing times and job rejection," 4OR, Springer, vol. 18(4), pages 439-456, December.
    4. Chang, Pei-Chann & Chen, Shih-Hsin & Mani, V., 2009. "A note on due-date assignment and single machine scheduling with a learning/aging effect," International Journal of Production Economics, Elsevier, vol. 117(1), pages 142-149, January.
    5. Zoltán Varga & Pál Simon, 2014. "Examination Of Scheduling Methods For Production Systems," Advanced Logistic systems, University of Miskolc, Department of Material Handling and Logistics, vol. 8(1), pages 111-120, December.
    6. Biskup, Dirk, 2008. "A state-of-the-art review on scheduling with learning effects," European Journal of Operational Research, Elsevier, vol. 188(2), pages 315-329, July.
    7. Radosław Rudek, 2017. "Parallel machine scheduling with general sum of processing time based models," Journal of Global Optimization, Springer, vol. 68(4), pages 799-814, August.
    8. Wang, J.-B. & Ng, C.T. & Cheng, T.C.E. & Liu, L.L., 2008. "Single-machine scheduling with a time-dependent learning effect," International Journal of Production Economics, Elsevier, vol. 111(2), pages 802-811, February.
    9. 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.
    10. Wen-Hung Wu & Yunqiang Yin & T C E Cheng & Win-Chin Lin & Juei-Chao Chen & Shin-Yi Luo & Chin-Chia Wu, 2017. "A combined approach for two-agent scheduling with sum-of-processing-times-based learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(2), pages 111-120, February.
    11. Jun Pei & Bayi Cheng & Xinbao Liu & Panos M. Pardalos & Min Kong, 2019. "Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time," Annals of Operations Research, Springer, vol. 272(1), pages 217-241, January.
    12. Peng Liu & Xiaoli Wang, 2017. "Maximum Lateness Scheduling on Two-Person Cooperative Games with Variable Processing Times and Common Due Date," Journal of Optimization, Hindawi, vol. 2017, pages 1-7, April.
    13. Xiaofei Liu & Weidong Li & Yaoyu Zhu, 2021. "Single Machine Vector Scheduling with General Penalties," Mathematics, MDPI, vol. 9(16), pages 1-16, August.
    14. Ji-Bo Wang & Ming-Zheng Wang, 2011. "Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects," Annals of Operations Research, Springer, vol. 191(1), pages 155-169, November.
    15. Li, Gang & Wang, Xiao-Yuan & Wang, Ji-Bo & Sun, Lin-Yan, 2013. "Worst case analysis of flow shop scheduling problems with a time-dependent learning effect," International Journal of Production Economics, Elsevier, vol. 142(1), pages 98-104.
    16. Zong-Jun Wei & Li-Yan Wang & Lei Zhang & Ji-Bo Wang & Ershen Wang, 2023. "Single-Machine Maintenance Activity Scheduling with Convex Resource Constraints and Learning Effects," Mathematics, MDPI, vol. 11(16), pages 1-21, August.
    17. D-L Yang & W-H Kuo, 2007. "Single-machine scheduling with an actual time-dependent learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(10), pages 1348-1353, October.
    18. Koulamas, Christos & Gupta, Sushil & Kyparisis, George J., 2010. "A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times," European Journal of Operational Research, Elsevier, vol. 205(2), pages 479-482, September.
    19. Hans Kellerer & Vitaly A. Strusevich, 2016. "Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications," Annals of Operations Research, Springer, vol. 240(1), pages 39-94, May.
    20. Wen-Hung Kuo, 2012. "Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect," Annals of Operations Research, Springer, vol. 196(1), pages 349-359, July.

    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:25:y:2025:i:1:d:10.1007_s12351-024-00887-w. 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.