Search Advanced

Journal of Industrial and Management Optimization

2026, Volume 22, Issue 9: 4422-4448. doi: 10.3934/jimo.2026154
Previous Article Next Article
Research article Special Issues

Single-machine linear resource-dependent consumption scheduling with DeJong's time-dependent learning effect

  • School of Computer, Shenyang Aerospace University, Shenyang, 110136, P.R. China
  • Published: 20 August 2026

  • 90B35

  • This article addresses a single-machine scheduling problem with resource-consumption and DeJong's time-dependent learning effect simultaneously. Under linear resource-consumption, the objective is to find the optimal sequence and optimal resource-consumption such that the weighted sum of makespan, total completion time, and total resource-consumption cost is minimized. To solve the problem, some optimal properties are given, then some solution algorithms (including a branch-and-bound algorithm and some heuristic algorithms) are proposed.

    Citation: Kai-Fang Zhang, Jia-Fan Zhang, Ji-Bo Wang. Single-machine linear resource-dependent consumption scheduling with DeJong's time-dependent learning effect[J]. Journal of Industrial and Management Optimization, 2026, 22(9): 4422-4448. doi: 10.3934/jimo.2026154

    Related Papers:

  • This article addresses a single-machine scheduling problem with resource-consumption and DeJong's time-dependent learning effect simultaneously. Under linear resource-consumption, the objective is to find the optimal sequence and optimal resource-consumption such that the weighted sum of makespan, total completion time, and total resource-consumption cost is minimized. To solve the problem, some optimal properties are given, then some solution algorithms (including a branch-and-bound algorithm and some heuristic algorithms) are proposed.



    加载中


    [1] Z. Y. Jiang, F. F. Chen, X. D. Zhang, Single-machine scheduling with times-based and job-dependent learning effect, J. Oper. Res. Soc., 68 (2017), 809–815. https://doi.org/10.1057/jors.2016.40 doi: 10.1057/jors.2016.40
    [2] A. Azzouz, M. Ennigrou, L. B. Said, Scheduling problems under learning effects: Classification and cartography, Int. J. Prod. Res., 56 (2018), 1642–1661. https://doi.org/10.1080/00207543.2017.1355576 doi: 10.1080/00207543.2017.1355576
    [3] C. C. Wu, W. C. Lin, X. G. Zhang, I. H. Chung, T. H. Yang, K. J. Lai, Tardiness minimisation for a customer order scheduling problem with sum-of-processing-time-based learning effect, J. Oper. Res. Soc., 70 (2019), 487–501. https://doi.org/10.1080/01605682.2018.1447249 doi: 10.1080/01605682.2018.1447249
    [4] B. Liao, X. Wang, X. Zhu, S. Yang, P. M. Pardalos, Less is more approach for competing groups scheduling with different learning effects, J. Comb. Optim., 39 (2020), 33–54. https://doi.org/10.1007/s10878-019-00452-8 doi: 10.1007/s10878-019-00452-8
    [5] S. W. Liu, X. B. Liu, J. Pei, P. M. Pardalos, Q. R. Song, Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm, Optim. Methods Softw., 35 (2020), 116–141. https://doi.org/10.1080/10556788.2019.1577415 doi: 10.1080/10556788.2019.1577415
    [6] X. Sun, X. N. Geng, F. Liu, Flow shop scheduling with general position weighted learning effects to minimise total weighted completion time, J. Oper. Res. Soc., 72 (2021), 2674–2689. https://doi.org/10.1080/01605682.2020.1806746 doi: 10.1080/01605682.2020.1806746
    [7] S. Zhao, Scheduling jobs with general truncated learning effects including proportional setup times, Comput. Appl. Math., 41 (2022), 146. https://doi.org/10.1007/s40314-022-01851-0 doi: 10.1007/s40314-022-01851-0
    [8] Z. Liu, J. B. Wang, Single-machine scheduling with simultaneous learning effects and delivery times, Mathematics, 12 (2024), 2522. https://doi.org/10.3390/math12162522 doi: 10.3390/math12162522
    [9] D. Y. Lv, J. B. Wang, Considering the peak power consumption problem with learning and deterioration effect in flow shop scheduling, Comput. Ind. Eng., 197 (2024), 110599. https://doi.org/10.1016/j.cie.2024.110599 doi: 10.1016/j.cie.2024.110599
    [10] N. Yin, M. Gao, Single-machine group scheduling with general linear deterioration and truncated learning effects, Comput. Appl. Math., 43 (2024), 386. https://doi.org/10.1007/s40314-024-02881-6 doi: 10.1007/s40314-024-02881-6
    [11] J. Gao, J. Zou, Y. Zhang, Single-machine scheduling with a deteriorating maintenance activity and DeJong's learning effect, Int. J. Found. Comput. Sci., 36 (2025), 635–648. https://doi.org/10.1142/S0129054122460030 doi: 10.1142/S0129054122460030
    [12] D. Y. Lv, J. B. Wang, Research on two-machine flow shop scheduling problem with release dates and truncated learning effects, Eng. Optim., 57 (2025), 1828–1848. https://doi.org/10.1080/0305215X.2024.2372633 doi: 10.1080/0305215X.2024.2372633
    [13] X. Wang, W. Liu, Delivery scheduling with variable processing times and due date assignments, Bull. Malays. Math. Sci. Soc., 48 (2025), 76. https://doi.org/10.1007/s40840-025-01856-y doi: 10.1007/s40840-025-01856-y
    [14] N. Yin, H. He, Y. Zhao, Y. Chang, N. Wang, Integrating group setup time deterioration effects and job processing time learning effects with group technology in single-machine green scheduling, Axioms, 14 (2025), 480. https://doi.org/10.3390/axioms14070480 doi: 10.3390/axioms14070480
    [15] H. R. Song, J. K. Yang, J. B. Wang, Study on multiple due-windows assignment scheduling with learning and deteriorating effects, Asia-Pac. J. Oper. Res., (2026), 2650001. https://doi.org/10.1142/S0217595926500016 doi: 10.1142/S0217595926500016
    [16] L. Y. Wang, Due-window assignment scheduling problems with position-dependent weights, truncated learning effects and past-sequence-dependent setup-times, Symmetry, 18 (2026), 396. https://doi.org/10.3390/sym18030396 doi: 10.3390/sym18030396
    [17] E. Nowicki, S. Zdrzalka, A survey of results for sequencing problems with controllable processing times, Discret. Appl. Math., 26 (1990), 271–287. https://doi.org/10.1016/0166-218X(90)90105-L doi: 10.1016/0166-218X(90)90105-L
    [18] X. H. Guan, Q. Z. Zhai, F. Lai, New lagrangian relaxation based algorithm for resource scheduling with homogeneous subproblems, J. Optim. Theory Appl., 113 (2002), 65–82. https://doi.org/10.1023/A:1014805213554 doi: 10.1023/A:1014805213554
    [19] D. Shabtay, G. Steiner, A survey of scheduling with controllable processing times, Discret. Appl. Math., 155 (2007), 1643–1666. https://doi.org/10.1016/j.dam.2007.02.003 doi: 10.1016/j.dam.2007.02.003
    [20] D. Oron, Scheduling controllable processing time jobs in a deteriorating environment, J. Oper. Res. Soc., 64 (2014), 49–56. https://doi.org/10.1057/jors.2013.5 doi: 10.1057/jors.2013.5
    [21] Y. Q. Yin, D. J. Wang, T. C. E. Cheng, C. C. Wu, Bi-criterion single-machine scheduling and due-window assignment with common flow allowances and resource-dependent processing times, J. Oper. Res. Soc., 67 (2016), 1169–1183. https://doi.org/10.1057/jors.2016.14 doi: 10.1057/jors.2016.14
    [22] D. J. Wang, Y. G. Yu, H. X. Qiu, Y. Q. Yin, T. C. E. Cheng, Two-agent scheduling with linear resource-dependent processing times, Nav. Res. Logist., 67 (2020), 573–591. https://doi.org/10.1002/nav.21936 doi: 10.1002/nav.21936
    [23] J. S. Gao, X. M. Zhu, K. Y. Bai, R. T. Zhang, New controllable processing time scheduling with subcontracting strategy for no-wait job shop problem, Int. J. Prod. Res., 60 (2022), 2254–2274. https://doi.org/10.1080/00207543.2021.1886368 doi: 10.1080/00207543.2021.1886368
    [24] J. F. Ren, Y. Yang, Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine, Eng. Optim., 54 (2022), 1819–1834. https://doi.org/10.1080/0305215X.2021.1961761 doi: 10.1080/0305215X.2021.1961761
    [25] Z. C. Geng, J. J. Yuan, Single-machine scheduling of multiple projects with controllable processing times, Eur. J. Oper. Res., 308 (2023), 1074–1090. https://doi.org/10.1016/j.ejor.2023.01.026 doi: 10.1016/j.ejor.2023.01.026
    [26] M. Geurtsen, J. B. H. C. Didden, J. Adan, Z. Atan, I. Adan, Production, maintenance and resource scheduling: A review, Eur. J. Oper. Res., 305 (2023), 501–529. https://doi.org/10.1016/j.ejor.2022.03.045 doi: 10.1016/j.ejor.2022.03.045
    [27] N. S. Pang, Q. C. Meng, Resource allocation in robust scheduling, J. Oper. Res. Soc., 74 (2023), 125–142. https://doi.org/10.1080/01605682.2022.2029593 doi: 10.1080/01605682.2022.2029593
    [28] M. H. Li, D. Y. Lv, Z. G. Lv, L. H. Zhang, J. B. Wang, A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function, Comput. Appl. Math., 43 (2024), 229. https://doi.org/10.1007/s40314-024-02753-z doi: 10.1007/s40314-024-02753-z
    [29] X. Sun, X. N. Geng, J. Y. Wang, L. Pan, Slack due window assignment scheduling in the single-machine with controllable processing times, J. Ind. Manag. Optim., 20 (2024), 15–35. https://doi.org/10.3934/jimo.2023067 doi: 10.3934/jimo.2023067
    [30] X. Wang, W. Liu, Single machine group scheduling jobs with resource allocations subject to unrestricted due date assignments, J. Appl. Math. Comput., 70 (2024), 6283–6308. https://doi.org/10.1007/s12190-024-02216-y doi: 10.1007/s12190-024-02216-y
    [31] J. B. Wang, Y. C. Wang, C. Wan, D. Y. Lv, L. Zhang, Controllable processing time scheduling with total weighted completion time objective and deteriorating jobs, Asia-Pac. J. Oper. Res., 41 (2024), 2350026. https://doi.org/10.1142/S0217595923500264 doi: 10.1142/S0217595923500264
    [32] W. Weng, C. Chu, P. Wu, Resource allocation to minimize the makespan with multi-resource operations, J. Syst. Sci. Complex., 37 (2024), 2054–2070. https://doi.org/10.1007/s11424-024-3284-z doi: 10.1007/s11424-024-3284-z
    [33] D. Y. Lv, J. B. Wang, Single-machine group technology scheduling with resource allocation and slack due window assignment including minmax criterion, J. Oper. Res. Soc., 76 (2025), 1696–1712. https://doi.org/10.1080/01605682.2024.2430351 doi: 10.1080/01605682.2024.2430351
    [34] J. B. Wang, Z. W. Sun, M. Gao, Research on single-machine scheduling with due-window assignment and resource allocation under total resource consumption cost is bounded, J. Appl. Math. Comput., 71 (2025), 7905–7927. https://doi.org/10.1007/s12190-025-02599-6 doi: 10.1007/s12190-025-02599-6
    [35] L. H. Zhang, J. B. Wang, Resource allocation and minmax scheduling under group technology and different due-window assignments, Axioms, 14 (2025), 827. https://doi.org/10.3390/axioms14110827 doi: 10.3390/axioms14110827
    [36] L. Zhang, S. S. Li, Z. C. Geng, R. X. Chen, J. R. Xu, Multiple parallel-batch machines scheduling with additive resource assignment and machine available times, Discret. Appl. Math., 379 (2026), 675–684. https://doi.org/10.1016/j.dam.2025.09.035 doi: 10.1016/j.dam.2025.09.035
    [37] L. H. Zhang, M. H. Li, L. Lin, Study on controllable processing time and minmax group scheduling with common due-window assignment, Symmetry, 18 (2026), 358. https://doi.org/10.3390/sym18020358 doi: 10.3390/sym18020358
    [38] L. H. Zhang, N. Yin, Study on single-machine group scheduling with convex resource allocations and different due-date assignments, Bull. Malays. Math. Sci. Soc., 49 (2026), 33. https://doi.org/10.1007/s40840-025-02031-z doi: 10.1007/s40840-025-02031-z
    [39] D. Wang, M. Z. Wang, J. B. Wang, Single-Machine scheduling with learning effect and resource-dependent processing times, Comput. Ind. Eng., 59 (2010), 458–462. https://doi.org/10.1016/j.cie.2010.06.002 doi: 10.1016/j.cie.2010.06.002
    [40] Y. Y. Lu, J. B. Wang, P. Ji, H. He, A note on resource allocation scheduling with group technology and learning effects on a single machine, Eng. Optim., 49 (2017), 1621–1632. https://doi.org/10.1080/0305215X.2016.1265305 doi: 10.1080/0305215X.2016.1265305
    [41] N. Yin, Single-machine due-window assignment resource allocation scheduling with job-dependent learning effect, J. Appl. Math. Comput., 56 (2018), 715–725. https://doi.org/10.1007/s12190-017-1091-6 doi: 10.1007/s12190-017-1091-6
    [42] S. Zhao, Resource allocation flowshop scheduling with learning effect and slack due window assignment, J. Ind. Manag. Optim., 17 (2021), 2817–2835. https://doi.org/10.3934/jimo.2020096 doi: 10.3934/jimo.2020096
    [43] J. B. Wang, D. Y. Lv, J. Xu, P. Ji, F. Li, Bicriterion scheduling with truncated learning effects and convex controllable processing times, Int. Trans. Oper. Res., 28 (2021), 1573–1593. https://doi.org/10.1111/itor.12888 doi: 10.1111/itor.12888
    [44] J. Qian, G. Chang, X. Zhang, Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations, J. Appl. Math. Comput., 70 (2024), 1965–1994. https://doi.org/10.1007/s12190-024-02023-5 doi: 10.1007/s12190-024-02023-5
    [45] J. Qian, Z. Y. Guo, Common due window assignment and single machine scheduling with delivery time, resource allocation, and job-dependent learning effect, J. Appl. Math. Comput., 70 (2024), 4441–4471. https://doi.org/10.1007/s12190-024-02090-8 doi: 10.1007/s12190-024-02090-8
    [46] Y. Zhang, X. Sun, T. Liu, J. Wang, X. N. Geng, Single-machine scheduling simultaneous consideration of resource allocations and exponential time-dependent learning effects, J. Oper. Res. Soc., 76 (2025), 528–540. https://doi.org/10.1080/01605682.2024.2371527 doi: 10.1080/01605682.2024.2371527
    [47] X. Huang, H. He, H. Bei, Y. Zhao, N. Wang, Y. Chang, Group-scheduling with simultaneous learning effects and convex resource allocations, Oper. Res. Perspect., 15 (2025), 100370. https://doi.org/10.1016/j.orp.2025.100370 doi: 10.1016/j.orp.2025.100370
    [48] Y. Sun, D. Y. Lv, X. Huang, Properties for due window assignment scheduling on a two-machine no-wait proportionate flow shop with learning effects and resource allocation, J. Oper. Res. Soc., 77 (2026), 599–615. https://doi.org/10.1080/01605682.2025.2492817 doi: 10.1080/01605682.2025.2492817
    [49] Y. Y. Lu, M. H. Li, A unified analysis for single-machine scheduling with resource allocations, learning and deteriorating effects simultaneously, Comput. Appl. Math., 45 (2026), 388. https://doi.org/10.1007/s40314-026-03784-4 doi: 10.1007/s40314-026-03784-4
    [50] X. F. Wu, L. Lin, J. B. Wang, Total weighted completion time scheduling under resource allocation and time-dependent learning effects, J. Ind. Manag. Optim., 22 (2026), 3219–3251. https://doi.org/10.3934/jimo.2026118 doi: 10.3934/jimo.2026118
    [51] D. Y. Bai, W. J. Zheng, C. B. Zang, J. Yang, C. C. Wu, H. Qin, Discrete optimization algorithms for distributed bi-agent flowshop scheduling with release dates, Swarm Evol. Comput., 98 (2025), 102101. https://doi.org/10.1016/j.swevo.2025.102101 doi: 10.1016/j.swevo.2025.102101
    [52] Q. F. Kong, C. M. Wei, J. B. Wang, Minmax delivery completion time scheduling with delivery times and deteriorating jobs, Comput. Appl. Math., 45 (2026), 276. https://doi.org/10.1007/s40314-026-03684-7 doi: 10.1007/s40314-026-03684-7
    [53] Y. Y. Lu, S. Zhang, J. Y. Tao, Earliness-tardiness scheduling with delivery times and deteriorating jobs, Asia-Pac. J. Oper. Res., 42 (2025), 1–17. https://doi.org/10.1142/S021759592450009X doi: 10.1142/S021759592450009X
    [54] D. Biskup, Single-machine scheduling with learning considerations, Eur. J. Oper. Res., 115 (1999), 173–178. https://doi.org/10.1016/S0377-2217(98)00246-X doi: 10.1016/S0377-2217(98)00246-X
    [55] W. H. Kuo, D. L. Yang, Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect, Eur. J. Oper. Res., 174 (2006), 1184–1190. https://doi.org/10.1016/j.ejor.2005.03.020 doi: 10.1016/j.ejor.2005.03.020
    [56] M. Ji, D. Yao, Q. Yang, T. C. E. Cheng, Machine scheduling with Dejong's learning effect, Comput. Ind. Eng., 80 (2015), 195–200. https://doi.org/10.1016/j.cie.2014.12.009 doi: 10.1016/j.cie.2014.12.009
    [57] K. F. Zhang, J. B. Wang, Y. Y. Lu, On flowshop scheduling with the DeJong's learning effect, Asia-Pac. J. Oper. Res., (2026), 2650029. https://doi.org/10.1142/S0217595926500296 doi: 10.1142/S0217595926500296
    [58] M. L. Pinedo, Scheduling Theory, Algorithms, and Systems, Springer Cham. https://doi.org/10.1007/978-3-031-05921-6
    [59] A. Agnetis, J. C. Billaut, M. Pinedo, D. Shabtay, Fifty years of research in scheduling-Theory and applications, Eur. J. Oper. Res., 327 (2025), 367–393. https://doi.org/10.1016/j.ejor.2025.01.034 doi: 10.1016/j.ejor.2025.01.034
    [60] M. Nawaz, E. E. Enscore Jr, I. Ham, A heuristic algorithm for the $m$-machine, $n$-job flow-shop sequencing problem, Omega, 11 (1983), 91–95. https://doi.org/10.1016/0305-0483(83)90088-9 doi: 10.1016/0305-0483(83)90088-9
    [61] F. Liu, J. Yang, Y. Y. Lu, Solution algorithms for single-machine group scheduling with ready times and deteriorating jobs, Eng. Optim., 51 (2019), 862–874. https://doi.org/10.1080/0305215X.2018.1500562 doi: 10.1080/0305215X.2018.1500562
    [62] X. Y. Qiu, J. B. Wang, Single-machine scheduling with mixed due-windows and deterioration effects, J. Appl. Math. Comput., 71 (2025), 2527–2542. https://doi.org/10.1007/s12190-024-02306-x doi: 10.1007/s12190-024-02306-x
    [63] Z. W. Sun, D. Y. Lv, P. Ji, J. B. Wang, Minimizing total completion time scheduling problem with ready times and linear deterioration functions of processing times, J. Appl. Math. Comput., 72 (2026), 42. https://doi.org/10.1007/s12190-025-02694-8 doi: 10.1007/s12190-025-02694-8
    [64] L. Q. Zhang, L. F. Lu, J. J. Yuan, Single machine scheduling with release dates and rejection, Eur. J. Oper. Res., 198 (2009), 975–978. https://doi.org/10.1016/j.ejor.2008.10.006 doi: 10.1016/j.ejor.2008.10.006
    [65] D. Shabtay, N. Gaspar, M. Kaspi, A survey on offline scheduling with rejection, J. Sched., 16 (2013), 3–28. https://doi.org/10.1007/s10951-012-0303-z doi: 10.1007/s10951-012-0303-z
    [66] X. N. Geng, X. Y. Sun, J. Wang, L. Pan, Scheduling on proportionate flow shop with job rejection and common due date assignment, Comput. Ind. Eng., 181 (2023), 109317. https://doi.org/10.1016/j.cie.2023.109317 doi: 10.1016/j.cie.2023.109317
    [67] B. Bai, C. M. Wei, H. Y. He, J. B. Wang, Study on single-machine common/slack due-window assignment scheduling with delivery times, variable processing times and outsourcing, Mathematics, 12 (2024), 2883. https://doi.org/10.3390/math12182883 doi: 10.3390/math12182883
    [68] J. X. Song, C. X. Miao, F. Y. Kong, Scheduling with step learning and job rejection, Oper. Res., 25 (2025), 6. https://doi.org/10.1007/s12351-024-00887-w doi: 10.1007/s12351-024-00887-w
    [69] B. C. Choi, M. J. Park, Minimizing total completion time in single-machine scheduling with convex resource consumption and job rejection, Theor. Comput. Sci., 1064 (2026), 115708. https://doi.org/10.1016/j.tcs.2025.115708 doi: 10.1016/j.tcs.2025.115708
    [70] C. C. Wu, J. Y. Chen, W. C. Lin, K. Lai, D. Bai, S. Y. Lai, A two-stage three-machine assembly scheduling flowshop problem with both two-agent and learning phenomenon, Comput. Ind. Eng., 130 (2019), 485–499. https://doi.org/10.1016/j.cie.2019.02.047 doi: 10.1016/j.cie.2019.02.047
    [71] D. Y. Lv, J. B. Wang, No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines, Asia-Pac. J. Oper. Res., 41 (2024), 1–19. https://doi.org/10.1142/S0217595924500039 doi: 10.1142/S0217595924500039
    [72] N. Li, R. Ma, Y. Z. Zhang, Single-machine scheduling with the learning effect of processing time and the deterioration effect of delivery time for prefabricated components, J. Comb. Optim., 49 (2025), 37. https://doi.org/10.1007/s10878-025-01271-w doi: 10.1007/s10878-025-01271-w
    [73] C. X. Miao, H. R. Wu, J. M. Hu, Two-agent scheduling with time-dependent and position-dependent in a flow-shop system, RAIRO-Oper. Res., 59 (2025), 3253–3265. https://doi.org/10.1051/ro/2025126 doi: 10.1051/ro/2025126
    [74] J. B. Wang, D. Y. Lv, C. Wan, Proportionate flow shop scheduling with job-dependent due windows and position-dependent weights, Asia-Pac. J. Oper. Res., 42 (2025), 1–17. https://doi.org/10.1142/S0217595924500118 doi: 10.1142/S0217595924500118
  • Reader Comments
  • © 2026 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
Journal of Industrial and Management Optimization
1.4 3.4

Metrics

Article views(498) PDF downloads(20) Cited by(0)

Preview PDF
Download XML
Export Citation
Article outline

Figures and Tables

Tables(14)

Other Articles By Authors

Related pages

Tools

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog