{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T22:24:38Z","timestamp":1781821478184,"version":"3.54.5"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T00:00:00Z","timestamp":1755043200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T00:00:00Z","timestamp":1755043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s12190-025-02599-6","type":"journal-article","created":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T10:21:22Z","timestamp":1755080482000},"page":"7905-7927","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Research on single-machine scheduling with due-window assignment and resource allocation under total resource consumption cost is bounded"],"prefix":"10.1007","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2271-6459","authenticated-orcid":false,"given":"Ji-Bo","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zheng-Wei","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ming","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,13]]},"reference":[{"key":"2599_CR1","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D. Shabtay","year":"2007","unstructured":"Shabtay, D., Steiner: G.: a survey of scheduling with controllable processing times. Discrete Appl. Math. 155, 1643\u20131666 (2007)","journal-title":"Discrete Appl. Math."},{"key":"2599_CR2","doi-asserted-by":"crossref","unstructured":"Wang, J.B., Wang, Y.-C., Wan, C., Lv, D.-Y., Zhang, L.: Controllable processing time scheduling with total weighted completion time objective and deteriorating jobs. Asia-Pac. J. Oper. Res. 41(3), 2350026 (2024)","DOI":"10.1142\/S0217595923500264"},{"issue":"1","key":"2599_CR3","doi-asserted-by":"crossref","first-page":"2362516","DOI":"10.1080\/08839514.2024.2362516","volume":"38","author":"L.J. Bu","year":"2024","unstructured":"Bu, L.J.: Logistic resource allocation based on multi-agent supply chain scheduling using meta-heuristic optimization algorithms. Appl. Artif. Intell. 38(1), 2362516 (2024)","journal-title":"Appl. Artif. Intell."},{"issue":"1","key":"2599_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/comjnl\/bxae095","volume":"68","author":"L.-H. Zhang","year":"2025","unstructured":"Zhang, L.-H., Yang, S.-H., Lv, D.-Y., Wang, J.-B.: Research on convex resource allocation scheduling with exponential time-dependent learning effects. Comput. J. 68(1), 97\u2013108 (2025)","journal-title":"Comput. J."},{"key":"2599_CR5","doi-asserted-by":"crossref","first-page":"126275","DOI":"10.1016\/j.eswa.2024.126275","volume":"268","author":"Y.Q. Liu","year":"2025","unstructured":"Liu, Y.Q., Sun, S.D., Shen, G.P., Wang, X.V., Wang, L.H.: Designing a double auction mechanism for parallel machines scheduling with multiple consumer agents and resource agents. Expert Syst. With Applications 268, 126275 (2025)","journal-title":"Expert Syst. With Applications"},{"issue":"2","key":"2599_CR6","first-page":"37","volume":"8","author":"A. Janiak","year":"1989","unstructured":"Janiak, A.: Minimization of the blooming mill standstills-mathematical model, suboptimal algorithms. Mechanika 8(2), 37\u201349 (1989)","journal-title":"Mechanika"},{"key":"2599_CR7","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1287\/opre.42.2.234","volume":"42","author":"M. Trick","year":"1994","unstructured":"Trick, M.: Scheduling multiple variable-speed machines. Operations Res. 42, 234\u2013248 (1994)","journal-title":"Operations Res."},{"issue":"2","key":"2599_CR8","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1016\/j.ejor.2017.03.004","volume":"261","author":"L. Yedidsion","year":"2017","unstructured":"Yedidsion, L., Shabtay, D.: The resource dependent assignment problem with a convex agent cost function. Eur J Oper Res 261(2), 486\u2013502 (2017)","journal-title":"Eur J Oper Res"},{"key":"2599_CR9","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/moor.15.4.736","volume":"15","author":"C.L. Monma","year":"1990","unstructured":"Monma, C.L., Schrijver, A., Todd, M.J., Wei, V.K.: Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases and extensions. Math. Oper. Res. 15, 736\u2013748 (1990)","journal-title":"Math. Oper. Res."},{"key":"2599_CR10","first-page":"116","volume":"46","author":"R. Armstrong","year":"1995","unstructured":"Armstrong, R., Gu, S., Lei, L.: An algorithm for the two-resource allocation problem with a non-differentiable convex objective function. J Oper Res Soc 46, 116\u2013122 (1995)","journal-title":"J Oper Res Soc"},{"issue":"3","key":"2599_CR11","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1007\/s40305-023-00511-2","volume":"12","author":"D.-Y. Lv","year":"2024","unstructured":"Lv, D.-Y., Xue, J., Wang, J.-B.: Minmax common due-window assignment scheduling with deteriorating jobs. J. Oper. Res. Soc. China 12(3), 681\u2013693 (2024)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"4","key":"2599_CR12","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.3934\/jimo.2023136","volume":"20","author":"L.-H. Zhang","year":"2024","unstructured":"Zhang, L.-H., Geng, X.-N., Xue, J., Wang, J.-B.: Single machine slack due window assignment and deteriorating jobs. J. Ind. Manage. Optim. 20(4), 1593\u20131614 (2024)","journal-title":"J. Ind. Manage. Optim."},{"key":"2599_CR13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Of Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Of Discrete Math."},{"key":"2599_CR14","doi-asserted-by":"crossref","first-page":"2522","DOI":"10.3390\/math12162522","volume":"12","author":"Z. Liu","year":"2024","unstructured":"Liu, Z., Wang, J.-B.: Single-machine scheduling with simultaneous learning effects and delivery times. Mathematics 12, 2522 (2024)","journal-title":"Mathematics"},{"issue":"4","key":"2599_CR15","doi-asserted-by":"crossref","first-page":"290","DOI":"10.3390\/axioms14040290","volume":"14","author":"Y. Sun","year":"2025","unstructured":"Sun, Y., He, H.Y., Zhao, Y.Z., Wang, J.-B.: Minimizing makespan scheduling on a single machine with general positional deterioration effects. Axioms 14(4), 290 (2025)","journal-title":"Axioms"},{"issue":"1","key":"2599_CR16","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.disopt.2012.10.003","volume":"10","author":"Y. Yin","year":"2013","unstructured":"Yin, Y., Cheng, T.C.E., Wang, J., Wu, C.-C.: Single machine common due window assignment and scheduling to minimize the total cost. Discrete Optim. 10(1), 42\u201353 (2013)","journal-title":"Discrete Optim."},{"issue":"5","key":"2599_CR17","doi-asserted-by":"crossref","first-page":"1450036","DOI":"10.1142\/S0217595914500365","volume":"31","author":"J.-B. Wang","year":"2014","unstructured":"Wang, J.-B., Wang, M.-Z.: Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times. Asia-Pac. J. Oper. Res. 31(5), 1450036 (2014)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"2599_CR18","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1080\/00207543.2014.954057","volume":"53","author":"G. Li","year":"2015","unstructured":"Li, G., Luo, M.-L., Zhang, W.-J., Wang, X.-Y.: Single-machine due-window assignment scheduling based on common flow allowance, learning effect and resource allocation. Int. J. Production Res. 53, 1228\u20131241 (2015)","journal-title":"Int. J. Production Res."},{"key":"2599_CR19","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.ejor.2014.09.043","volume":"242","author":"A. Janiak","year":"2015","unstructured":"Janiak, A., Janiak, W.A., Krysiak, T., Kwiatkowski: T.: a survey on scheduling problems with due windows. Eur J Oper Res 242, 347\u2013357 (2015)","journal-title":"Eur J Oper Res"},{"key":"2599_CR20","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.apm.2017.07.028","volume":"58","author":"J. Pei","year":"2018","unstructured":"Pei, J., Liu, X., Liao, B., Pardalos, P.M., Kong, M.: Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production. Appl. Math. Model. 58, 245\u2013253 (2018)","journal-title":"Appl. Math. Model."},{"key":"2599_CR21","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1007\/s12190-017-1091-6","volume":"56","author":"N. Yin","year":"2018","unstructured":"Yin, N.: Single-machine due-window assignment resource allocation scheduling with job-dependent learning effect. J. Appl. Math. Comput. 56, 715\u2013725 (2018)","journal-title":"J. Appl. Math. Comput."},{"key":"2599_CR22","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10479-020-03653-1","volume":"292","author":"X.Y. Sun","year":"2020","unstructured":"Sun, X.Y., Geng, X.-N., Liu, T.: Due-window assignment scheduling in the proportionate flow shop setting. Ann. Oper. Res. 292, 113\u2013131 (2020)","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"2599_CR23","doi-asserted-by":"crossref","first-page":"2817","DOI":"10.3934\/jimo.2020096","volume":"17","author":"S. Zhao","year":"2021","unstructured":"Zhao, S.: Resource allocation flowshop scheduling with learning effect and slack due window assignment. J. Ind. Manage. Optim. 17(5), 2817\u20132835 (2021)","journal-title":"J. Ind. Manage. Optim."},{"issue":"4","key":"2599_CR24","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/s40314-022-01851-0","volume":"41","author":"S. Zhao","year":"2022","unstructured":"Zhao, S.: Scheduling jobs with general truncated learning effects including proportional setup times. Comput. Appl. Math. 41(4), 146 (2022)","journal-title":"Comput. Appl. Math."},{"key":"2599_CR25","doi-asserted-by":"crossref","first-page":"107024","DOI":"10.1016\/j.cie.2020.107024","volume":"153","author":"B. Mor","year":"2021","unstructured":"Mor, B., Shabtay, D., Yedidsion, L.: Heuristic algorithms for solving a set of NP-hard single-machine scheduling problems with resource-dependent processing times. Comput. Ind. Eng. 153, 107024 (2021)","journal-title":"Comput. Ind. Eng."},{"issue":"5","key":"2599_CR26","doi-asserted-by":"crossref","first-page":"2350039","DOI":"10.1142\/S0217595923500392","volume":"41","author":"J.-B. Wang","year":"2024","unstructured":"Wang, J.-B., Bao, H., Wan, C.: Research on multiple slack due-date assignments scheduling with position-dependent weights. Asia-Pac. J. Oper. Res. 41(5), 2350039 (2024)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"6","key":"2599_CR27","doi-asserted-by":"crossref","first-page":"2450003","DOI":"10.1142\/S0217595924500039","volume":"41","author":"D.-Y. Lv","year":"2024","unstructured":"Lv, D.-Y., Wang, J.-B.: No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines. Asia-Pac. J. Oper. Res. 41(6), 2450003 (2024)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"11","key":"2599_CR28","doi-asserted-by":"crossref","first-page":"2185","DOI":"10.1080\/01605682.2024.2310042","volume":"75","author":"Y.F. Peng","year":"2024","unstructured":"Peng, Y.F., Wu, C.T., Shao, W.Q., Xia, B.X.: Collaborative optimization of route planning and just-in-time scheduling for mixed-model assembly lines. J Oper Res Soc 75(11), 2185\u20132199 (2024)","journal-title":"J Oper Res Soc"},{"key":"2599_CR29","doi-asserted-by":"crossref","first-page":"106989","DOI":"10.1016\/j.cor.2025.106989","volume":"177","author":"B.D. Prata","year":"2025","unstructured":"Prata, B.D., de Abreu, L.R., Fernandez-Viagas, V.: A systematic review of permutation flow shop scheduling with due-date-related objectives. Comput. Operations Res. 177, 106989 (2025)","journal-title":"Comput. Operations Res."},{"key":"2599_CR30","doi-asserted-by":"crossref","first-page":"6283","DOI":"10.1007\/s12190-024-02216-y","volume":"70","author":"X.Y. Wang","year":"2024","unstructured":"Wang, X.Y., Liu, W.G.: Single machine group scheduling jobs with resource allocations subject to unrestricted due date assignments. J. Appl. Math. Comput. 70, 6283\u20136308 (2024)","journal-title":"J. Appl. Math. Comput."},{"issue":"4","key":"2599_CR31","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s40314-024-02753-z","volume":"43","author":"M.-H. Li","year":"2024","unstructured":"Li, M.-H., Lv, D.-Y., Lv, Z.-G., Zhang, L.-H., Wang: J.-B.: a two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function. Comput. Appl. Math. 43(4), 229 (2024)","journal-title":"Comput. Appl. Math."},{"issue":"18","key":"2599_CR32","doi-asserted-by":"crossref","first-page":"2833","DOI":"10.3390\/math12182833","volume":"12","author":"B. Bai","year":"2024","unstructured":"Bai, B., Wei, C.-M., He, H.-Y., Wang, J.-B.: Study on single-machine common\/slack due-window assignment scheduling with delivery times, variable processing times and outsourcing. Mathematics 12(18), 2833 (2024)","journal-title":"Mathematics"},{"issue":"6","key":"2599_CR33","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s10951-024-00814-z","volume":"27","author":"J. Hoffmann","year":"2024","unstructured":"Hoffmann, J., Neufeld, J.S., Buscher, U.: Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment. J. Sched. 27(6), 525\u2013543 (2024)","journal-title":"J. Sched."},{"issue":"3","key":"2599_CR34","doi-asserted-by":"crossref","first-page":"1965","DOI":"10.1007\/s12190-024-02023-5","volume":"70","author":"J. Qian","year":"2024","unstructured":"Qian, J., Chang, G., Zhang, X.: Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations. J. Appl. Math. Comput. 70(3), 1965\u20131994 (2024)","journal-title":"J. Appl. Math. Comput."},{"issue":"5","key":"2599_CR35","doi-asserted-by":"crossref","first-page":"4441","DOI":"10.1007\/s12190-024-02090-8","volume":"70","author":"J. Qian","year":"2024","unstructured":"Qian, J., Guo, Z.Y.: Common due window assignment and single machine scheduling with delivery time, resource allocation, and job-dependent learning effect. J. Appl. Math. Comput. 70(5), 4441\u20134471 (2024)","journal-title":"J. Appl. Math. Comput."},{"issue":"4","key":"2599_CR36","doi-asserted-by":"crossref","first-page":"2366","DOI":"10.1111\/itor.13431","volume":"31","author":"G. Liu","year":"2024","unstructured":"Liu, G., Wang, H.W., Xie, Y.: Just-in-time scheduling problem with due windows and release dates for precast bridge girders. Int. Trans. Oper. Res. 31(4), 2366\u20132398 (2024)","journal-title":"Int. Trans. Oper. Res."},{"key":"2599_CR37","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/s40840-025-01856-y","volume":"48","author":"X.Y. Wang","year":"2025","unstructured":"Wang, X.Y., Liu, W.G.: Delivery scheduling with variable processing times and due date assignments. Bull. Malays. Math. Sci. Soc. 48, 76 (2025)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"issue":"2","key":"2599_CR38","doi-asserted-by":"crossref","first-page":"2527","DOI":"10.1007\/s12190-024-02306-x","volume":"71","author":"X.-Y. Qiu","year":"2025","unstructured":"Qiu, X.-Y., Wang, J.-B.: Single-machine scheduling with mixeddue-windows and deterioration effects. J. Appl. Math. Comput. 71(2), 2527\u20132542 (2025)","journal-title":"J. Appl. Math. Comput."},{"issue":"8","key":"2599_CR39","doi-asserted-by":"publisher","first-page":"1696","DOI":"10.1080\/01605682.2024.2430351","volume":"76","author":"D.-Y. Lv","year":"2025","unstructured":"Lv, D.-Y., Wang, J.-B.: Single-machine group technology scheduling with resource allocation and slack due window assignment including minmax criterion. J. Oper. Res. Soc. 76(8), 1696\u20131712 (2025)","journal-title":"J Oper Res Soc"},{"issue":"3","key":"2599_CR40","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1080\/01605682.2024.2371527","volume":"76","author":"Y. Zhang","year":"2025","unstructured":"Zhang, Y., Sun, X.Y., Liu, T., Wang, J.Y., Geng, X.-N.: Single-machine scheduling simultaneous consideration of resource allocations and exponential time-dependent learning effects. J Oper Res Soc 76(3), 528\u2013540 (2025)","journal-title":"J Oper Res Soc"},{"issue":"2","key":"2599_CR41","doi-asserted-by":"crossref","first-page":"2450011","DOI":"10.1142\/S0217595924500118","volume":"42","author":"J.-B. Wang","year":"2025","unstructured":"Wang, J.-B., Lv, D.-Y., Wan, C.: Proportionate flow shop scheduling with job-dependent due windows and position-dependent weights. Asia-Pac. J. Oper. Res. 42(2), 2450011 (2025)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"3","key":"2599_CR42","doi-asserted-by":"crossref","first-page":"2173","DOI":"10.1007\/s10479-025-06471-5","volume":"346","author":"B. Mor","year":"2025","unstructured":"Mor, B., Berlinska, J.: Scheduling problems on parallel dedicated machines with non-renewable resource. Ann. Oper. Res. 346(3), 2173\u20132193 (2025)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"2599_CR43","doi-asserted-by":"crossref","first-page":"2450009","DOI":"10.1142\/S021759592450009X","volume":"42","author":"Y.-Y. Lu","year":"2025","unstructured":"Lu, Y.-Y., Zhang, S., Tao, J.-Y.: Earliness-tardiness scheduling with delivery times and deteriorating jobs. Asia-Pac. J. Oper. Res. 42(2), 2450009 (2025)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"2599_CR44","doi-asserted-by":"crossref","first-page":"100335","DOI":"10.1016\/j.orp.2025.100335","volume":"14","author":"S. Babu","year":"2025","unstructured":"Babu, S., Girish, B.S.: Neighbourhood search-based metaheuristics for the bi-objective Pareto optimization of total weighted earliness-tardiness and makespan in a JIT single machine scheduling problem. Operations Res. Perspectives 14, 100335 (2025)","journal-title":"Operations Res. Perspectives"},{"issue":"5","key":"2599_CR45","doi-asserted-by":"crossref","first-page":"2150041","DOI":"10.1142\/S021759592150041X","volume":"39","author":"Y. Tian","year":"2022","unstructured":"Tian, Y.: Single-machine due-window assignment scheduling with resource allocation and generalized earliness\/tardiness penalties. Asia-Pac. J. Oper. Res. 39(5), 2150041 (2022)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"2599_CR46","volume-title":"Inequalities","author":"G.H. Hardy","year":"1967","unstructured":"Hardy, G.H., Littlewood, J.E., Polya, G.: Inequalities. Cambridge University Press, Cambridge (1967)"},{"issue":"4","key":"2599_CR47","doi-asserted-by":"crossref","first-page":"610","DOI":"10.3390\/math12040610","volume":"12","author":"Z.-G. Lv","year":"2024","unstructured":"Lv, Z.-G., Zhang, L.-H., Wang, X.-Y., Wang, J.-B.: Single machine scheduling proportionally deteriorating jobs with ready times subject to the total weighted completion time minimization. Mathematics 12(4), 610 (2024)","journal-title":"Mathematics"},{"issue":"2","key":"2599_CR48","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1002\/hfm.20365","volume":"24","author":"K. Lai","year":"2014","unstructured":"Lai, K., Hsu, P.-H., Ting, P.-H., Wu, C.-C.: A truncated sum of processing-times-based learning model for a two-machine flowshop scheduling problem. Hum. Factors Ergon. Manuf. Serv. Ind. 24(2), 152\u2013160 (2014)","journal-title":"Hum. Factors Ergon. Manuf. Serv. Ind."},{"issue":"3","key":"2599_CR49","doi-asserted-by":"crossref","first-page":"2285","DOI":"10.1007\/s12190-024-02052-0","volume":"70","author":"R.-R. Mao","year":"2024","unstructured":"Mao, R.-R., Lv, D.-Y., Ren, N., Wang, J.-B.: Supply chain scheduling with deteriorating jobs and delivery times. J. Appl. Math. Comput. 70(3), 2285\u20132312 (2024)","journal-title":"J. Appl. Math. Comput."},{"issue":"12","key":"2599_CR50","doi-asserted-by":"crossref","first-page":"2674","DOI":"10.1080\/01605682.2020.1806746","volume":"72","author":"X.Y. Sun","year":"2021","unstructured":"Sun, X.Y., Geng, X.-N., Liu, F.: Flow shop scheduling with general position weighted learning effects to minimise total weighted completion time. J Oper Res Soc 72(12), 2674\u20132689 (2021)","journal-title":"J Oper Res Soc"},{"key":"2599_CR51","doi-asserted-by":"crossref","first-page":"2907","DOI":"10.1007\/s12190-024-02080-w","volume":"70","author":"M.-H. Li","year":"2024","unstructured":"Li, M.-H., Lv, D.-Y., Zhang, L.-H., Wang, J.-B.: Permutation flow shop scheduling with makespan objective and truncated learning effects. J. Appl. Math. Comput. 70, 2907\u20132939 (2024)","journal-title":"J. Appl. Math. Comput."},{"key":"2599_CR52","doi-asserted-by":"crossref","first-page":"363","DOI":"10.3390\/math13030363","volume":"13","author":"Z.-W. Sun","year":"2025","unstructured":"Sun, Z.-W., Lv, D.-Y., Wei, C.-M., Wang, J.-B.: Flow shop scheduling with shortening jobs for makespan minimization. Mathematics 13, 363 (2025)","journal-title":"Mathematics"},{"issue":"7","key":"2599_CR53","doi-asserted-by":"publisher","first-page":"1828","DOI":"10.1080\/0305215X.2024.2372633","volume":"57","author":"D.-Y. Lv","year":"2025","unstructured":"Lv, D.-Y., Wang, J.-B.: Research on two-machine flow shop scheduling problem with release dates and truncated learning effects. Eng. Optim. 57(7), 1828\u20131848 (2025)","journal-title":"Eng. Optim."},{"key":"2599_CR54","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2025.2492817","author":"Y. Sun","year":"2025","unstructured":"Sun, Y., Lv, D.-Y., Huang, X.: 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 (2025). 10.1080\/01605682.2025.2492817","journal-title":"J Oper Res Soc"},{"key":"2599_CR55","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s12190-018-01222-1","volume":"60","author":"X. Huang","year":"2019","unstructured":"Huang, X.: Bicriterion scheduling with group technology and deterioration effect. J. Appl. Math. Comput. 60, 455\u2013464 (2019)","journal-title":"J. Appl. Math. Comput."},{"key":"2599_CR56","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1007\/s40314-024-02881-6","volume":"43","author":"N. Yin","year":"2024","unstructured":"Yin, N., Gao, M.: Single-machine group scheduling with general linear deterioration and truncated learning effects. Comput. Appl. Math. 43, 386 (2024)","journal-title":"Comput. Appl. Math."},{"issue":"7","key":"2599_CR57","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.3390\/math12071029","volume":"12","author":"M.-H. Li","year":"2024","unstructured":"Li, M.-H., Lv, D.-Y., Lu, Y.-Y., Wang, J.-B.: Scheduling with group technology, resource allocation, and learning effect simultaneously. Mathematics 12(7), 1029 (2024)","journal-title":"Mathematics"},{"issue":"3","key":"2599_CR58","doi-asserted-by":"crossref","first-page":"153","DOI":"10.3390\/axioms14030153","volume":"14","author":"J.-D. Miao","year":"2025","unstructured":"Miao, J.-D., Lv, D.-Y., Wei, C.-M., Wang, J.-B.: Research on group scheduling with general logarithmic deterioration subject to maximal completion time cost. Axioms 14(3), 153 (2025)","journal-title":"Axioms"},{"issue":"11","key":"2599_CR59","doi-asserted-by":"crossref","first-page":"1997","DOI":"10.1080\/01605682.2018.1506540","volume":"70","author":"B. Mor","year":"2019","unstructured":"Mor, B., Shapira, D.: Improved algorithms for scheduling on proportionate flowshop with job-rejection. J Oper Res Soc 70(11), 1997\u20132003 (2019)","journal-title":"J Oper Res Soc"},{"issue":"1","key":"2599_CR60","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/s10878-022-00845-2","volume":"44","author":"B. Mor","year":"2022","unstructured":"Mor, B., Shapira, D.: Single machine scheduling with non-availability interval and optional job rejection. J. Comb. Optim. 44(1), 480\u2013497 (2022)","journal-title":"J. Comb. Optim."},{"key":"2599_CR61","doi-asserted-by":"crossref","first-page":"109317","DOI":"10.1016\/j.cie.2023.109317","volume":"181","author":"X.-N. Geng","year":"2023","unstructured":"Geng, X.-N., Sun, X., Wang, J.Y., Pan, L.: Scheduling on proportionate flow shop with job rejection and common due date assignment. Comput. Ind. Eng. 181, 109317 (2023)","journal-title":"Comput. Ind. Eng."},{"issue":"7","key":"2599_CR62","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.1007\/s11590-023-02077-7","volume":"18","author":"R.-X. Chen","year":"2024","unstructured":"Chen, R.-X., Li, S.-S.: Two-machine job shop scheduling with optional job rejection. Optim. Lett 18(7), 1593\u20131618 (2024)","journal-title":"Optim. Lett"},{"issue":"6","key":"2599_CR63","doi-asserted-by":"crossref","first-page":"6063","DOI":"10.1007\/s12190-024-02198-x","volume":"70","author":"B. Mor","year":"2024","unstructured":"Mor, B., Mor, D., Shani, N., Shapira, D.: Single machine scheduling with generalized due-dates, learning effect, and job-rejection. J. Appl. Math. Comput. 70(6), 6063\u20136083 (2024)","journal-title":"J. Appl. Math. Comput."},{"issue":"1","key":"2599_CR64","first-page":"6","volume":"25","author":"J.X. Song","year":"2025","unstructured":"Song, J.X., Miao, C.X., Kong, F.Y.: Scheduling with step learning and job rejection. Oper. Res. 25(1), 6 (2025)","journal-title":"Oper. Res."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02599-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-025-02599-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02599-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T18:11:17Z","timestamp":1761847877000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-025-02599-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,13]]},"references-count":64,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2599"],"URL":"https:\/\/doi.org\/10.1007\/s12190-025-02599-6","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,13]]},"assertion":[{"value":"30 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}