{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T22:24:37Z","timestamp":1781821477092,"version":"3.54.5"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T00:00:00Z","timestamp":1772496000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T00:00:00Z","timestamp":1772496000000},"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":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1007\/s40314-026-03684-7","type":"journal-article","created":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T05:13:03Z","timestamp":1772514783000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Minmax delivery completion time scheduling with delivery times and deteriorating jobs"],"prefix":"10.1007","volume":"45","author":[{"given":"Qi-Fan","family":"Kong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cai-Min","family":"Wei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2271-6459","authenticated-orcid":false,"given":"Ji-Bo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,3,3]]},"reference":[{"key":"3684_CR1","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1080\/0951192X.2016.1145808","volume":"30","author":"A Azadeh","year":"2017","unstructured":"Azadeh A, Habibnejad-Ledari H, Zadeh SA, Farahani MH (2017) A single-machine scheduling problem with learning effect, deterioration and non-monotonic time-dependent processing times. Int J Comput Integr Manuf 30:292\u2013304","journal-title":"Int J Comput Integr Manuf"},{"key":"3684_CR2","doi-asserted-by":"publisher","first-page":"2833","DOI":"10.3390\/math12182883","volume":"12","author":"B Bai","year":"2024","unstructured":"Bai B, Wei C-M, He H-Y, Wang J-B (2024) Study on single-machine common\/slack due-window assignment scheduling with delivery times, variable processing times and outsourcing. Mathematics 12:2833","journal-title":"Mathematics"},{"key":"3684_CR3","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1080\/01605682.2023.2203150","volume":"75","author":"TCE Cheng","year":"2024","unstructured":"Cheng TCE, Kravchenko SA, Lin BMT (2024) On scheduling of step-improving jobs to minimize the total weighted completion time. Journal of the Operational Research Society 75:720\u2013730","journal-title":"Journal of the Operational Research Society"},{"issue":"8","key":"3684_CR4","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1080\/01605682.2024.2419979","volume":"76","author":"BC Choi","year":"2025","unstructured":"Choi BC, Kim ES, Lee JH (2025) Scheduling step-deteriorating jobs on a single machine with multiple critical dates. Journal of the Operational Research Society 76(8):1553\u20131563","journal-title":"Journal of the Operational Research Society"},{"key":"3684_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-59362-2","volume-title":"Models and Algorithms of Time-Dependent Scheduling","author":"S Gawiejnowicz","year":"2020","unstructured":"Gawiejnowicz S (2020) Models and Algorithms of Time-Dependent Scheduling. Springer-Verlag, Berlin"},{"key":"3684_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"key":"3684_CR7","volume":"30","author":"LJ He","year":"2022","unstructured":"He LJ, Chiong R, Li WF (2022) Energy-efficient open-shop scheduling with multiple automated guided vehicles and deteriorating jobs. J Ind Inf Integr 30:100387","journal-title":"J Ind Inf Integr"},{"key":"3684_CR8","doi-asserted-by":"publisher","first-page":"2070","DOI":"10.1080\/0305215X.2020.1844194","volume":"53","author":"H He","year":"2021","unstructured":"He H, Hu Y, Liu W-W (2021) Scheduling with deteriorating effect and maintenance activities under parallel processors. Eng Optim 53:2070\u20132087","journal-title":"Eng Optim"},{"key":"3684_CR9","doi-asserted-by":"publisher","first-page":"1759","DOI":"10.1057\/jors.2008.123","volume":"60","author":"C-C He","year":"2009","unstructured":"He C-C, Wu C-C, Lee W-C (2009) Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs. Journal of the Operational Research Society 60:1759\u20131766","journal-title":"Journal of the Operational Research Society"},{"key":"3684_CR10","doi-asserted-by":"crossref","unstructured":"He, H., Zhao, Y., Ma, X., Lu, Y.Y., Ren, N., Wang, J.B. (2023) Study on scheduling problems with learning effects and past sequence delivery times. Mathematics 11(19)","DOI":"10.3390\/math11194135"},{"key":"3684_CR11","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s12190-018-01222-1","volume":"60","author":"X Huang","year":"2019","unstructured":"Huang X (2019) Bicriterion scheduling with group technology and deterioration effect. J Appl Math Comput 60:455\u2013464","journal-title":"J Appl Math Comput"},{"key":"3684_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2025.100370","volume":"15","author":"X Huang","year":"2025","unstructured":"Huang X, He H, Bei H, Zhao Y, Wang N, Chang Y (2025) Group-scheduling with simultaneous learning effects and convex resource allocations. Operations Research Perspectives 15:100370","journal-title":"Operations Research Perspectives"},{"key":"3684_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10951-020-00675-2","volume":"24","author":"M Khatami","year":"2021","unstructured":"Khatami M, Salehipour A (2021) Coupled task scheduling with time-dependent processing times. J Sched 24:223\u2013236","journal-title":"J Sched"},{"key":"3684_CR14","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.ejor.2006.03.066","volume":"187","author":"C Koulamas","year":"2008","unstructured":"Koulamas C, Kyparisis GJ (2008) Single-machine scheduling problems with past-sequence-dependent setup times. Eur J Oper Res 187:1045\u20131049","journal-title":"Eur J Oper Res"},{"key":"3684_CR15","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1057\/palgrave.jors.2602396","volume":"59","author":"W-H Kuo","year":"2008","unstructured":"Kuo W-H, Yang D-L (2008) A note on due-date assignment and single-machine scheduling with deteriorating jobs. Journal of the Operational Research Society 59:857\u2013859","journal-title":"Journal of the Operational Research Society"},{"key":"3684_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.111593","volume":"159","author":"M Li","year":"2024","unstructured":"Li M, Chang C-T, Liu Z (2024) A discrete artificial bee colony algorithm and its application in flexible flow shop scheduling with assembly and machine deterioration effect. Appl Soft Comput 159:111593","journal-title":"Appl Soft Comput"},{"key":"3684_CR17","doi-asserted-by":"publisher","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 (2024) A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function. Comput Appl Math 43:229","journal-title":"Comput Appl Math"},{"key":"3684_CR18","doi-asserted-by":"publisher","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 (2024) Permutation flow shop scheduling with makespan objective and truncated learning effects. J Appl Math Comput 70:2907\u20132939","journal-title":"J Appl Math Comput"},{"key":"3684_CR19","doi-asserted-by":"publisher","first-page":"2522","DOI":"10.3390\/math12162522","volume":"12","author":"Z Liu","year":"2024","unstructured":"Liu Z, Wang J-B (2024) Single-machine scheduling with simultaneous learning effects and delivery times. Mathematics 12:2522","journal-title":"Mathematics"},{"key":"3684_CR20","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1080\/0305215X.2018.1500562","volume":"51","author":"F Liu","year":"2019","unstructured":"Liu F, Yang J, Lu Y (2019) Solution algorithms for single-machine group scheduling with ready times and deteriorating jobs. Eng Optim 51:862\u2013874","journal-title":"Eng Optim"},{"key":"3684_CR21","doi-asserted-by":"publisher","unstructured":"Lu SJ, Chen YB, Zheng R, Yan BX, Liu XB (2025) Distributed maintenance task scheduling for multiple technician teams considering uncertain durations and deterioration effects towards Industry 5.0. Int J Prod Res. https:\/\/doi.org\/10.1080\/00207543.2025.2461146","DOI":"10.1080\/00207543.2025.2461146"},{"key":"3684_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2024.109413","volume":"278","author":"SJ Lu","year":"2024","unstructured":"Lu SJ, Hu CW, Kong M, Fathollahi-Fard AM, Dulebenets MA (2024) Scheduling of memory chips for final testing on parallel machines considering power constraints and deteriorating effects. Int J Prod Econ 278:109413","journal-title":"Int J Prod Econ"},{"key":"3684_CR23","doi-asserted-by":"publisher","first-page":"2450009","DOI":"10.1142\/S021759592450009X","volume":"42","author":"Y-Y Lu","year":"2025","unstructured":"Lu Y-Y, Zhang S, Tao J-Y (2025) Earliness-tardiness scheduling with delivery times and deteriorating jobs. Asia-Pacific J Oper Res 42:2450009","journal-title":"Asia-Pacific J Oper Res"},{"key":"3684_CR24","doi-asserted-by":"publisher","first-page":"2450003","DOI":"10.1142\/S0217595924500039","volume":"41","author":"D-Y Lv","year":"2024","unstructured":"Lv D-Y, Wang J-B (2024) No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines. Asia-Pacific J Oper Res 41:2450003","journal-title":"Asia-Pacific J Oper Res"},{"key":"3684_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2024.110599","volume":"197","author":"D-Y Lv","year":"2024","unstructured":"Lv D-Y, Wang J-B (2024) Considering the peak power consumption problem with learning and deterioration effect in flow shop scheduling. Computers & Industrial Engineering 197:110599","journal-title":"Computers & Industrial Engineering"},{"key":"3684_CR26","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 (2025) Research on two-machine flow shop scheduling problem with release dates and truncated learning effects. Eng Optim 57:1828\u20131848","journal-title":"Eng Optim"},{"key":"3684_CR27","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 (2025) Single-machine group technology scheduling with resource allocation and slack due window assignment including minmax criterion. Journal of the Operational Research Society 76:1696\u20131712","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"3684_CR28","doi-asserted-by":"publisher","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 (2024) Minmax common due-window assignment scheduling with deteriorating jobs. Journal of the Operations Research Society of China 12(3):681\u2013693","journal-title":"Journal of the Operations Research Society of China"},{"key":"3684_CR29","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1080\/01605682.2024.2366537","volume":"76","author":"R Ma","year":"2025","unstructured":"Ma R, Meng LM, Zhang YZ (2025) Online scheduling problem of incompatible batch processing with deterioration effect and delivery time in the steel rolling process. Journal of the Operational Research Society 76:454\u2013465","journal-title":"Journal of the Operational Research Society"},{"key":"3684_CR30","first-page":"1337","volume":"42","author":"C Miao","year":"2018","unstructured":"Miao C (2018) Complexity of scheduling with proportional deterioration and release dates. Iranian Journal of Science and Technology. Transaction A Science 42:1337\u20131342","journal-title":"Transaction A Science"},{"issue":"04","key":"3684_CR31","doi-asserted-by":"publisher","first-page":"2240015","DOI":"10.1142\/S0217595922400152","volume":"40","author":"CX Miao","year":"2023","unstructured":"Miao CX, Song JX, Zhang YZ (2023) Single-machine time-dependent scheduling with proportional and delivery times. Asia-Pacific J Oper Res 40(04):2240015","journal-title":"Asia-Pacific J Oper Res"},{"key":"3684_CR32","doi-asserted-by":"publisher","first-page":"1955","DOI":"10.3934\/jimo.2018131","volume":"15","author":"C Miao","year":"2019","unstructured":"Miao C, Zhang Y (2019) Scheduling with step-deteriorating jobs to minimize the makespan. Journal of Industrial and Management Optimization 15:1955\u20131964","journal-title":"Journal of Industrial and Management Optimization"},{"key":"3684_CR33","doi-asserted-by":"publisher","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 (2024) Supply chain scheduling with deteriorating jobs and delivery times. J Appl Math Comput 70:2285\u20132312","journal-title":"J Appl Math Comput"},{"issue":"1","key":"3684_CR34","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore EEJ, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91\u201395","journal-title":"Omega"},{"key":"3684_CR35","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1080\/01605682.2018.1464428","volume":"70","author":"J Pei","year":"2019","unstructured":"Pei J, Wang X, Fan W, Pardalos PM, Liu X (2019) Scheduling step-deteriorating jobs on bounded parallel-batching machines to maximise the total net revenue. Journal of the Operational Research Society 70:1830\u20131847","journal-title":"Journal of the Operational Research Society"},{"issue":"5","key":"3684_CR36","doi-asserted-by":"publisher","first-page":"4441","DOI":"10.1007\/s12190-024-02090-8","volume":"70","author":"J Qian","year":"2024","unstructured":"Qian J, Guo ZY (2024) 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","journal-title":"J Appl Math Comput"},{"key":"3684_CR37","doi-asserted-by":"publisher","first-page":"2173","DOI":"10.1007\/s12190-021-01607-9","volume":"68","author":"J Qian","year":"2022","unstructured":"Qian J, Han H (2022) The due date assignment scheduling problem with the deteriorating jobs and delivery time. J Appl Math Comput 68:2173\u20132186","journal-title":"J Appl Math Comput"},{"key":"3684_CR38","doi-asserted-by":"publisher","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 (2025) Single-machine scheduling with mixed due-windows and deterioration effects. J Appl Math Comput 71:2527\u20132542","journal-title":"J Appl Math Comput"},{"key":"3684_CR39","doi-asserted-by":"crossref","unstructured":"Qu, J.Y., Tian, J., Fu, Y.R., Ge, K.-J. (2024) A best possible online algorithm for single-machine scheduling with non-delayed processing constraint and bounded delivery times. Journal of the Operations Research Society of China, https:\/\/doi.org\/10.1007\/s40305-024-00541-4","DOI":"10.1007\/s40305-024-00541-4"},{"key":"3684_CR40","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10479-024-06430-6","volume":"345","author":"HF Rahman","year":"2025","unstructured":"Rahman HF, Servranckx T, Chakrabortty RK, Vanhoucke M, El Sawah S (2025) Synchronizing production and delivery in flow shops with time-of-use electricity pricing. Ann Oper Res 345:371\u2013403","journal-title":"Ann Oper Res"},{"key":"3684_CR41","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s40314-023-02379-7","volume":"42","author":"N Ren","year":"2023","unstructured":"Ren N, Wang J-B, Wang E (2023) Research on delivery times scheduling with truncated learning effects. Comput Appl Math 42:243","journal-title":"Comput Appl Math"},{"key":"3684_CR42","doi-asserted-by":"crossref","unstructured":"Rudek, R. (2025) A fast local search for the identical parallel machine scheduling problem with the position-based deteriorating effect and maintenance. International Transactions in Operational Research, https:\/\/doi.org\/10.1111\/itor.13623","DOI":"10.1111\/itor.13623"},{"key":"3684_CR43","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/s10951-020-00665-4","volume":"23","author":"HA Sedding","year":"2020","unstructured":"Sedding HA (2020) Scheduling jobs with a V-shaped time-dependent processing time. J Sched 23:751\u2013768","journal-title":"J Sched"},{"key":"3684_CR44","doi-asserted-by":"publisher","first-page":"3186","DOI":"10.1080\/00207543.2019.1566675","volume":"57","author":"X Sun","year":"2019","unstructured":"Sun X, Geng X-N (2019) Single-machine scheduling with deteriorating effects and machine maintenance. Int J Prod Res 57:3186\u20133199","journal-title":"Int J Prod Res"},{"issue":"12","key":"3684_CR45","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1080\/01605682.2020.1806746","volume":"72","author":"X Sun","year":"2021","unstructured":"Sun X, Geng X-N, Liu F (2021) Flow shop scheduling with general position weighted learning effects to minimise total weighted completion time. Journal of the Operational Research Society 72(12):2674\u20132689","journal-title":"Journal of the Operational Research Society"},{"key":"3684_CR46","doi-asserted-by":"publisher","first-page":"3101","DOI":"10.1080\/0305215X.2024.2425724","volume":"57","author":"XP Sun","year":"2025","unstructured":"Sun XP, Gong YC, Kang HW, Lei W, Jin ZY, Li ZH, Shen Y, Chen QY (2025) A multi-objective differential evolution algorithm for the distributed hybrid flowshop scheduling problem with deteriorating jobs. Eng Optim 57:3101\u20133133","journal-title":"Eng Optim"},{"key":"3684_CR47","doi-asserted-by":"publisher","first-page":"290","DOI":"10.3390\/axioms14040290","volume":"14","author":"Y Sun","year":"2025","unstructured":"Sun Y, He H, Zhao Y, Wang J-B (2025) Minimizing makespan scheduling on a single machine with general positional deterioration effects. Axioms 14:290","journal-title":"Axioms"},{"key":"3684_CR48","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10951-022-00756-4","volume":"26","author":"X Sun","year":"2023","unstructured":"Sun X, Liu T, Geng X-N, Hu Y, Xu J-X (2023) Optimization of scheduling problems with deterioration effects and an optional maintenance activity. J Sched 26:251\u2013266","journal-title":"J Sched"},{"key":"3684_CR49","doi-asserted-by":"crossref","unstructured":"Sun, Y., Lu, Y.-Y., Lv, D.-Y., Wang, J.-B. (2025c) Single-machine setup time scheduling with general linear deterioration subject to makespan and total completion time minimization. Journal of the Operational Research Society, https:\/\/doi.org\/10.1080\/01605682.2025.2560511","DOI":"10.1080\/01605682.2025.2560511"},{"key":"3684_CR50","doi-asserted-by":"publisher","unstructured":"Sun, Y., Lv, D.-Y., Huang, X. (2025d) Properties for due window assignment scheduling on a two-machine no-wait proportionate flow shop with learning effects and resource allocation. Journal of the Operational Research Society, https:\/\/doi.org\/10.1080\/01605682.2025.2492817","DOI":"10.1080\/01605682.2025.2492817"},{"issue":"1","key":"3684_CR51","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/s12190-025-02694-8","volume":"72","author":"Z-W Sun","year":"2026","unstructured":"Sun Z-W, Lv D-Y, Ji P, Wang J-B (2026) Minimizing total completion time scheduling problem with ready times and linear deterioration functions of processing times. J Appl Math Comput 72(1):42","journal-title":"J Appl Math Comput"},{"key":"3684_CR52","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/s10878-020-00676-z","volume":"41","author":"J-B Wang","year":"2021","unstructured":"Wang J-B, Cui B, Ji P, Liu W-W (2021) Research on scheduling with position-dependent weights and past-sequence-dependent delivery times. J Comb Optim 41:290\u2013303","journal-title":"J Comb Optim"},{"key":"3684_CR53","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/s40840-025-01856-y","volume":"48","author":"X Wang","year":"2025","unstructured":"Wang X, Liu W (2025) Delivery scheduling with variable processing times and due date assignments. Bulletin of the Malaysian Mathematical Sciences Society 48:76","journal-title":"Bulletin of the Malaysian Mathematical Sciences Society"},{"issue":"2","key":"3684_CR54","doi-asserted-by":"publisher","first-page":"2450011","DOI":"10.1142\/S0217595924500118","volume":"42","author":"J-B Wang","year":"2025","unstructured":"Wang J-B, Lv D-Y, Wan C-Y (2025) Proportionate flow shop scheduling with job-dependent due windows and position-dependent weights. Asia-Pacific J Oper Res 42(2):2450011","journal-title":"Asia-Pacific J Oper Res"},{"key":"3684_CR55","doi-asserted-by":"publisher","first-page":"7905","DOI":"10.1007\/s12190-025-02599-6","volume":"71","author":"J-B Wang","year":"2025","unstructured":"Wang J-B, Sun Z-W, Gao M (2025) Research on single-machine scheduling with due-window assignment and resource allocation under total resource consumption cost is bounded. J Appl Math Comput 71:7905\u20137927","journal-title":"J Appl Math Comput"},{"issue":"4","key":"3684_CR56","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/s40314-024-02717-3","volume":"43","author":"X-Y Wang","year":"2024","unstructured":"Wang X-Y, Lv D-Y, Ji P, Yin N, Wang J-B, Jin Q (2024) Single machine scheduling problems with truncated learning effects and exponential past-sequence-dependent delivery times. Comput Appl Math 43(4):194","journal-title":"Comput Appl Math"},{"key":"3684_CR57","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2025.110949","volume":"202","author":"YZ Wang","year":"2025","unstructured":"Wang YZ, Wang YT, Han YY, Li JQ, Gao KZ (2025) A rapid population-based iterated greedy for distributed blocking group flowshop scheduling with delivery time windows under multiple processing time scenarios. Computers & Industrial Engineering 202:110949","journal-title":"Computers & Industrial Engineering"},{"key":"3684_CR58","doi-asserted-by":"publisher","first-page":"2350026","DOI":"10.1142\/S0217595923500264","volume":"41","author":"J-B Wang","year":"2024","unstructured":"Wang J-B, Wang Y-C, Wan C, Lv D-Y, Zhang L (2024) Controllable processing time scheduling with total weighted completion time objective and deteriorating jobs. Asia-Pacific J Oper Res 41:2350026","journal-title":"Asia-Pacific J Oper Res"},{"key":"3684_CR59","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.cor.2014.04.005","volume":"49","author":"Y Wu","year":"2014","unstructured":"Wu Y, Dong M, Zheng Z (2014) Patient scheduling with periodic deteriorating maintenance on single medical device. Comput Oper Res 49:107\u2013116","journal-title":"Comput Oper Res"},{"key":"3684_CR60","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1007\/s00521-015-1910-3","volume":"27","author":"Y-B Wu","year":"2016","unstructured":"Wu Y-B, Wang J-J (2016) Single-machine scheduling with truncated sum-of-processing-times based learning effect including proportional delivery times. Neural Comput Appl 27:937\u2013943","journal-title":"Neural Comput Appl"},{"key":"3684_CR61","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s12190-017-1091-6","volume":"56","author":"N Yin","year":"2018","unstructured":"Yin N (2018) Single-machine due-window assignment resource allocation scheduling with job-dependent learning effect. J Appl Math Comput 56:715\u2013725","journal-title":"J Appl Math Comput"},{"key":"3684_CR62","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/s40314-024-02881-6","volume":"43","author":"N Yin","year":"2024","unstructured":"Yin N, Gao M (2024) Single-machine group scheduling with general linear deterioration and truncated learning effects. Comput Appl Math 43:386","journal-title":"Comput Appl Math"},{"key":"3684_CR63","doi-asserted-by":"publisher","first-page":"480","DOI":"10.3390\/axioms14070480","volume":"14","author":"N Yin","year":"2025","unstructured":"Yin N, He H, Zhao Y, Chang Y, Wang N (2025) Integrating group setup time deterioration effects and job processing time learning effects with group technology in single-machine green scheduling. Axioms 14:480","journal-title":"Axioms"},{"issue":"2","key":"3684_CR64","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/s10878-014-9739-8","volume":"30","author":"S Yu","year":"2015","unstructured":"Yu S (2015) An optimal single-machine scheduling with linear deterioration rate and rate-modifying activities. J Comb Optim 30(2):242\u2013252","journal-title":"J Comb Optim"},{"key":"3684_CR65","doi-asserted-by":"publisher","first-page":"827","DOI":"10.3390\/axioms14110827","volume":"14","author":"L-H Zhang","year":"2025","unstructured":"Zhang L-H, Wang J-B (2025) Resource allocation and minmax scheduling under group technology and different due-window assignments. Axioms 14:827","journal-title":"Axioms"},{"key":"3684_CR66","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1007\/s10878-015-9852-3","volume":"30","author":"X Zhang","year":"2015","unstructured":"Zhang X, Wang H, Wang X (2015) Patients scheduling problems with deferred deteriorated functions. J Comb Optim 30:1027\u20131041","journal-title":"J Comb Optim"},{"key":"3684_CR67","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s40840-025-02031-z","volume":"49","author":"L-H Zhang","year":"2026","unstructured":"Zhang L-H, Yin N (2026) Study on single-machine group scheduling with convex resource allocations and different due-date assignments. Bulletin of the Malaysian Mathematical Sciences Society 49:33","journal-title":"Bulletin of the Malaysian Mathematical Sciences Society"},{"key":"3684_CR68","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2025.110863","volume":"201","author":"JL Zheng","year":"2025","unstructured":"Zheng JL, Zhao YX, Li JF, She WC, Li YY (2025) Integrated scheduling of material delivery and processing. Computers & Industrial Engineering 201:110863","journal-title":"Computers & Industrial Engineering"},{"key":"3684_CR69","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2025.102035","volume":"97","author":"C Zhao","year":"2025","unstructured":"Zhao C, Wu LH, Tan WH, Zuo CL (2025) A knowledge-based two-population optimization algorithm for distributed heterogeneous assembly permutation flowshop scheduling with batch delivery and setup times. Swarm Evol Comput 97:102035","journal-title":"Swarm Evol Comput"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03684-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-026-03684-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03684-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T06:01:44Z","timestamp":1772517704000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-026-03684-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,3]]},"references-count":69,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["3684"],"URL":"https:\/\/doi.org\/10.1007\/s40314-026-03684-7","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,3]]},"assertion":[{"value":"4 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2026","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 there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"276"}}