{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T22:24:36Z","timestamp":1781821476273,"version":"3.54.5"},"reference-count":96,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T00:00:00Z","timestamp":1778457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T00:00:00Z","timestamp":1778457600000},"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,10]]},"DOI":"10.1007\/s40314-026-03784-4","type":"journal-article","created":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T08:37:45Z","timestamp":1778488665000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A unified analysis for single-machine scheduling with resource allocations, learning and deteriorating effects simultaneously"],"prefix":"10.1007","volume":"45","author":[{"given":"Yuan-Yuan","family":"Lu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mei-Hang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,11]]},"reference":[{"key":"3784_CR1","first-page":"116","volume":"46","author":"R Armstrong","year":"1995","unstructured":"Armstrong R, Gu S, Lei L (1995) An algorithm for the two-resource allocation problem with a non-differentiable convex objective function. J Oper Res Soc 46:116\u2013122","journal-title":"J Oper Res Soc"},{"issue":"3","key":"3784_CR2","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10951-022-00763-5","volume":"27","author":"M Atsmony","year":"2024","unstructured":"Atsmony M, Mor B, Mosheiov G (2024) Single machine scheduling with step-learning. J Sched 27(3):227\u2013237","journal-title":"J Sched"},{"key":"3784_CR3","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1080\/00207543.2017.1355576","volume":"56","author":"A Azzouz","year":"2018","unstructured":"Azzouz A, Ennigrou M, Said LB (2018) Scheduling problems under learning effects: classification and cartography. Int J Prod Res 56:1642\u20131661","journal-title":"Int J Prod Res"},{"key":"3784_CR4","volume":"14","author":"S Babu","year":"2025","unstructured":"Babu S, Girish BS (2025) Neighbourhood search-based metaheuristics for the bi-objective Pareto optimization of total weighted earliness-tardiness and makespan in a JIT single machine scheduling problem. Oper Res Perspect 14:100335","journal-title":"Oper Res Perspect"},{"issue":"18","key":"3784_CR5","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(18):2833","journal-title":"Mathematics"},{"key":"3784_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","volume":"115","author":"D Biskup","year":"1999","unstructured":"Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115:173\u2013178","journal-title":"Eur J Oper Res"},{"issue":"7","key":"3784_CR7","doi-asserted-by":"publisher","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 (2024) Two-machine job shop scheduling with optional job rejection. Optim Lett 18(7):1593\u20131618","journal-title":"Optim Lett"},{"issue":"4","key":"3784_CR8","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. J Oper Res Soc 75(4):720\u2013730","journal-title":"J Oper Res Soc"},{"issue":"5","key":"3784_CR9","doi-asserted-by":"publisher","first-page":"2550003","DOI":"10.1142\/S0217595925500034","volume":"42","author":"B Cheng","year":"2025","unstructured":"Cheng B, Wang Y, Zhou M, Zhu XX (2025) Integrated scheduling of batch production and intermediate delivery with batch-position-based learning effect. Asia-Pac J Oper Res 42(5):2550003","journal-title":"Asia-Pac J Oper Res"},{"key":"3784_CR10","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, Berlin"},{"key":"3784_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109317","volume":"181","author":"X-N Geng","year":"2023","unstructured":"Geng X-N, Sun X, Wang JY, Pan L (2023) Scheduling on proportionate flow shop with job rejection and common due date assignment. Comput Ind Eng 181:109317","journal-title":"Comput Ind Eng"},{"key":"3784_CR12","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":"3784_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.cie.2016.04.010","volume":"97","author":"H He","year":"2016","unstructured":"He H (2016) Minimization of maximum lateness in an m-machine permutation flow shop with a general exponential learning effect. Comput Ind Eng 97:73\u201383","journal-title":"Comput Ind Eng"},{"issue":"6","key":"3784_CR14","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10951-024-00814-z","volume":"27","author":"J Hoffmann","year":"2024","unstructured":"Hoffmann J, Neufeld JS, Buscher U (2024) Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment. J Sched 27(6):525\u2013543","journal-title":"J Sched"},{"issue":"1","key":"3784_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s12532-024-00271-x","volume":"17","author":"JC Hu","year":"2025","unstructured":"Hu JC, Jin MZ (2025) Minimizing total tardiness for the single-machine identical-jobs order scheduling problem with a learning effect. Math Progr Comput 17(1):141\u2013171","journal-title":"Math Progr Comput"},{"key":"3784_CR16","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":"3784_CR17","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. Oper Res Perspect 15:100370","journal-title":"Oper Res Perspect"},{"issue":"12","key":"3784_CR18","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1287\/mnsc.27.12.1453","volume":"27","author":"JJ Kanet","year":"1981","unstructured":"Kanet JJ (1981) Minimizing variation of flow time in single machine systems. Manag Sci 27(12):1453\u20131459","journal-title":"Manag Sci"},{"issue":"5","key":"3784_CR19","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1080\/01605682.2021.1886616","volume":"73","author":"HJ Kim","year":"2022","unstructured":"Kim HJ, Kim ES, Lee JH (2022) Scheduling of step-improving jobs with an identical improving rate. J Oper Res Soc 73(5):1127\u20131136","journal-title":"J Oper Res Soc"},{"key":"3784_CR20","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/s40314-026-03684-7","volume":"45","author":"Q-F Kong","year":"2026","unstructured":"Kong Q-F, Wei C-M, Wang J-B (2026) Minmax delivery completion time scheduling with delivery times and deteriorating jobs. Comput Appl Math 45:276","journal-title":"Comput Appl Math"},{"key":"3784_CR21","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.cie.2017.04.040","volume":"109","author":"C Koulamas","year":"2017","unstructured":"Koulamas C (2017) Common due date assignment with generalized earliness\/tardiness penalties. Comput Ind Eng 109:79\u201383","journal-title":"Comput Ind Eng"},{"key":"3784_CR22","doi-asserted-by":"publisher","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 (2015) Single-machine due-window assignment scheduling based on common flow allowance, learning effect and resource allocation. Int J Prod Res 53:1228\u20131241","journal-title":"Int J Prod Res"},{"key":"3784_CR23","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1007\/s00521-016-2638-4","volume":"29","author":"L Li","year":"2018","unstructured":"Li L, Yan P, Ji P, Wang J-B (2018) Scheduling jobs with simultaneous considerations of controllable processing times and learning effect. Neural Comput Appl 29:1155\u20131162","journal-title":"Neural Comput Appl"},{"issue":"4","key":"3784_CR24","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 (2024a) A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function. Comput Appl Math 43(4):229","journal-title":"Comput Appl Math"},{"issue":"7","key":"3784_CR25","doi-asserted-by":"publisher","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 (2024b) Scheduling with group technology, resource allocation, and learning effect simultaneously. Mathematics 12(7):1029","journal-title":"Mathematics"},{"key":"3784_CR26","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 (2024c) 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":"3784_CR27","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1057\/palgrave.jors.2600601","volume":"49","author":"SD Liman","year":"1998","unstructured":"Liman SD, Panwalkar SS, Thongmee S (1998) Common due window size and location determination in a single machine scheduling problem. J Oper Res Soc 49:1007\u20131010","journal-title":"J Oper Res Soc"},{"key":"3784_CR28","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1051\/ro\/2021030","volume":"55","author":"S-S Lin","year":"2021","unstructured":"Lin S-S (2021) A note on parallel-machine scheduling with controllable processing times and job-dependent learning effects. RAIRO-Oper Res 55:561\u2013569","journal-title":"RAIRO-Oper Res"},{"key":"3784_CR29","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"},{"issue":"4","key":"3784_CR30","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1080\/0305215X.2016.1197611","volume":"49","author":"WG Liu","year":"2017","unstructured":"Liu WG, Hu XP, Wang XY (2017) Single machine scheduling with slack due dates assignment. Eng Optim 49(4):709\u2013717","journal-title":"Eng Optim"},{"issue":"5","key":"3784_CR31","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(5):862\u2013874","journal-title":"Eng Optim"},{"issue":"4","key":"3784_CR32","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1080\/0305215X.2019.1608980","volume":"52","author":"W-W Liu","year":"2020","unstructured":"Liu W-W, Yao Y, Jiang C (2020) Single machine resource allocation scheduling with due-date assignment, deterioration effect and position-dependent weights. Eng Optim 52(4):701\u2013714","journal-title":"Eng Optim"},{"issue":"4","key":"3784_CR33","doi-asserted-by":"publisher","first-page":"2366","DOI":"10.1111\/itor.13431","volume":"31","author":"G Liu","year":"2024","unstructured":"Liu G, Wang HW, Xie Y (2024) Just-in-time scheduling problem with due windows and release dates for precast bridge girders. Int Trans Oper Res 31(4):2366\u20132398","journal-title":"Int Trans Oper Res"},{"issue":"10","key":"3784_CR34","doi-asserted-by":"publisher","first-page":"1810","DOI":"10.1080\/0305215X.2017.1414207","volume":"50","author":"Y Lu","year":"2018","unstructured":"Lu Y, Liu J-Y (2018) Anote on resource allocation scheduling with position-dependent workloads. Eng Optim 50(10):1810\u20131827","journal-title":"Eng Optim"},{"issue":"2","key":"3784_CR35","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-Pac J Oper Res 42(2):2450009","journal-title":"Asia-Pac J Oper Res"},{"issue":"3","key":"3784_CR36","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10878-025-01355-7","volume":"50","author":"YC Luo","year":"2025","unstructured":"Luo YC (2025) Stochastic single-machine scheduling problems with both time-dependent deterioration and position-dependent learning effect. J Comb Optim 50(3):31","journal-title":"J Comb Optim"},{"issue":"6","key":"3784_CR37","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 (2024a) No-idle flow shop scheduling-with deteriorating jobs and common due date under dominating machines. Asia-Pac J Oper Res 41(6):2450003","journal-title":"Asia-Pac J Oper Res"},{"key":"3784_CR38","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 (2024b) Considering the peak power consumption problem with learning and deterioration effect in flow shop scheduling. Comput Ind Eng 197:110599","journal-title":"Comput Ind Eng"},{"issue":"8","key":"3784_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 (2025a) Single-machine group technology scheduling with resource allocation and slack due window assignment including minmax criterion. J Oper Res Soc 76(8):1696\u20131712","journal-title":"J Oper Res Soc"},{"issue":"7","key":"3784_CR40","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 (2025b) Research on two-machine flow shop scheduling problem with release dates and truncated learning effects. Eng Optim 57(7):1828\u20131848","journal-title":"Eng Optim"},{"issue":"3","key":"3784_CR41","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(3):2285\u20132312","journal-title":"J Appl Math Comput"},{"key":"3784_CR42","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1080\/01605682.2022.2064781","volume":"74","author":"JR Montoya-Torres","year":"2023","unstructured":"Montoya-Torres JR, Moreno-Camacho CA, Velez-Gallego MC (2023) Variable neighbourhood search for job scheduling with position-dependent deteriorating processing times. J Oper Res Soc 74:873\u2013887","journal-title":"J Oper Res Soc"},{"key":"3784_CR43","doi-asserted-by":"publisher","first-page":"2173","DOI":"10.1007\/s10479-025-06471-5","volume":"346","author":"B Mor","year":"2025","unstructured":"Mor B, Berlinska J (2025) Scheduling problems on parallel dedicated machines with non-renewable resource. Ann Oper Res 346:2173\u20132193","journal-title":"Ann Oper Res"},{"issue":"11","key":"3784_CR44","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1080\/01605682.2018.1506540","volume":"70","author":"B Mor","year":"2019","unstructured":"Mor B, Shapira D (2019) Improved algorithms for scheduling on proportionate flowshop with job-rejection. J Oper Res Soc 70(11):1997\u20132003","journal-title":"J Oper Res Soc"},{"key":"3784_CR45","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/S0377-2217(00)00175-2","volume":"132","author":"G Mosheiov","year":"2001","unstructured":"Mosheiov G (2001) Scheduling problems with a learning effect. Eur J Oper Res 132:687\u2013693","journal-title":"Eur J Oper Res"},{"key":"3784_CR46","first-page":"185","volume":"35","author":"G Mosheiov","year":"2010","unstructured":"Mosheiov G, Oron D (2010) Job-dependent due-window assignment based on a common flow allowance. Fund Comput Decis Sci 35:185\u2013195","journal-title":"Fund Comput Decis Sci"},{"key":"3784_CR47","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1080\/01605682.2022.2029593","volume":"74","author":"NS Pang","year":"2023","unstructured":"Pang NS, Meng QC (2023) Resource allocation in robust scheduling. J Oper Res Soc 74:125\u2013142","journal-title":"J Oper Res Soc"},{"key":"3784_CR48","doi-asserted-by":"publisher","first-page":"9651","DOI":"10.1007\/s13762-024-05595-8","volume":"21","author":"M Parichehreh","year":"2024","unstructured":"Parichehreh M, Gholizadeh H, Fathollahi-Fard AM, Wong KY (2024) An energy-efficient unrelated parallel machine scheduling problem with learning effect of operators and deterioration of jobs. Int J Environ Sci Technol 21:9651\u20139676","journal-title":"Int J Environ Sci Technol"},{"key":"3784_CR49","doi-asserted-by":"publisher","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 PM, Kong M (2018) Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production. Appl Math Model 58:245\u2013253","journal-title":"Appl Math Model"},{"issue":"11","key":"3784_CR50","doi-asserted-by":"publisher","first-page":"2185","DOI":"10.1080\/01605682.2024.2310042","volume":"75","author":"YF Peng","year":"2024","unstructured":"Peng YF, Wu CT, Shao WQ, Xia BX (2024) Collaborative optimization of route planning and just-in-time scheduling for mixed-model assembly lines. J Oper Res Soc 75(11):2185\u20132199","journal-title":"J Oper Res Soc"},{"issue":"3","key":"3784_CR51","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1016\/j.ejor.2024.09.042","volume":"321","author":"J Phosavanh","year":"2025","unstructured":"Phosavanh J, Oron D (2025) Minimizing the number of late jobs and total late work with step-learning. Eur J Oper Res 321(3):734\u2013749","journal-title":"Eur J Oper Res"},{"key":"3784_CR52","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2025.106989","volume":"177","author":"BD Prata","year":"2025","unstructured":"Prata BD, de Abreu LR, Fernandez-Viagas V (2025) A systematic review of permutation flow shop scheduling with due-date-related objectives. Comput Oper Res 177:106989","journal-title":"Comput Oper Res"},{"issue":"5","key":"3784_CR53","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"},{"issue":"3","key":"3784_CR54","doi-asserted-by":"publisher","first-page":"1965","DOI":"10.1007\/s12190-024-02023-5","volume":"70","author":"J Qian","year":"2024","unstructured":"Qian J, Chang G, Zhang X (2024) 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","journal-title":"J Appl Math Comput"},{"issue":"2","key":"3784_CR55","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(2):2527\u20132542","journal-title":"J Appl Math Comput"},{"key":"3784_CR56","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":"3784_CR57","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D Shabtay","year":"2007","unstructured":"Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discret Appl Math 155:1643\u20131666","journal-title":"Discret Appl Math"},{"issue":"1","key":"3784_CR58","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/s12351-024-00887-w","volume":"25","author":"JX Song","year":"2025","unstructured":"Song JX, Miao CX, Kong FY (2025) Scheduling with step learning and job rejection. Oper Res Int J 25(1):6","journal-title":"Oper Res Int J"},{"key":"3784_CR59","doi-asserted-by":"publisher","unstructured":"Song H-R, Yang J-K, Wang J-B (2026) Study on multiple due-windows assignment scheduling with learning and deteriorating effects. Asia-Pac J Oper Res 2650001. https:\/\/doi.org\/10.1142\/S0217595926500016","DOI":"10.1142\/S0217595926500016"},{"issue":"12","key":"3784_CR60","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1080\/01605682.2020.1806746","volume":"72","author":"XY Sun","year":"2021","unstructured":"Sun XY, Geng X-N, Liu F (2021) Flow shop scheduling with general position weighted learning effects to minimise total weighted completion time. J Oper Res Soc 72(12):2674\u20132689","journal-title":"J Oper Res Soc"},{"key":"3784_CR61","doi-asserted-by":"publisher","first-page":"15","DOI":"10.3934\/jimo.2023067","volume":"20","author":"XY Sun","year":"2024","unstructured":"Sun XY, Geng X-N, Wang J, Pan L (2024) Slack due window assignment scheduling in the single-machine with controllable processing times. J Ind Manag Optim 20:15\u201335","journal-title":"J Ind Manag Optim"},{"issue":"4","key":"3784_CR62","doi-asserted-by":"publisher","first-page":"290","DOI":"10.3390\/axioms14040290","volume":"14","author":"Y Sun","year":"2025","unstructured":"Sun Y, He HY, Zhao YZ, Wang J-B (2025a) Minimizing makespan scheduling on a single machine with general positional deterioration effects. Axioms 14(4):290","journal-title":"Axioms"},{"key":"3784_CR63","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2025.2560511","author":"Y Sun","year":"2025","unstructured":"Sun Y, Lu Y-Y, Lv D-Y, Wang J-B (2025b) Single-machine setup time scheduling with general linear deterioration subject to makespan and total completion time minimization. J Oper Res Soc. https:\/\/doi.org\/10.1080\/01605682.2025.2560511","journal-title":"J Oper Res Soc"},{"issue":"2","key":"3784_CR64","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1080\/01605682.2025.2492817","volume":"77","author":"Y Sun","year":"2026","unstructured":"Sun Y, Lv D-Y, Huang X (2026a) 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(2):599\u2013615","journal-title":"J Oper Res Soc"},{"issue":"1","key":"3784_CR65","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 (2026b) 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"},{"issue":"2","key":"3784_CR66","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278\u2013285","journal-title":"Eur J Oper Res"},{"issue":"5","key":"3784_CR67","doi-asserted-by":"publisher","first-page":"2150041","DOI":"10.1142\/S021759592150041X","volume":"39","author":"Y Tian","year":"2022","unstructured":"Tian Y (2022) Single-machine due-window assignment scheduling with resource allocation and generalized earliness\/tardiness penalties. Asia-Pac J Oper Res 39(5):2150041","journal-title":"Asia-Pac J Oper Res"},{"issue":"3","key":"3784_CR68","doi-asserted-by":"publisher","first-page":"396","DOI":"10.3390\/sym18030396","volume":"18","author":"L-Y Wang","year":"2026","unstructured":"Wang L-Y (2026) Due-window assignment scheduling problems with position-dependent weights, truncated learning effects and past-sequence-dependent setup-times. Symmetry 18(3):396","journal-title":"Symmetry"},{"issue":"2","key":"3784_CR69","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1080\/0305215X.2018.1454442","volume":"51","author":"J-B Wang","year":"2019","unstructured":"Wang J-B, Liang X-X (2019) Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint. Eng Optim 51(2):231\u2013246","journal-title":"Eng Optim"},{"key":"3784_CR70","doi-asserted-by":"publisher","first-page":"6283","DOI":"10.1007\/s12190-024-02216-y","volume":"70","author":"XY Wang","year":"2024","unstructured":"Wang XY, Liu WG (2024) Single machine group scheduling jobs with resource allocations subject to unrestricted due date assignments. J Appl Math Comput 70:6283\u20136308","journal-title":"J Appl Math Comput"},{"key":"3784_CR71","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/s40840-025-01856-y","volume":"48","author":"XY Wang","year":"2025","unstructured":"Wang XY, Liu WG (2025) Delivery scheduling with variable processing times and due date assignments. Bull Malays Math Sci Soc 48:76","journal-title":"Bull Malays Math Sci Soc"},{"key":"3784_CR72","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/s11590-012-0579-0","volume":"8","author":"X-R Wang","year":"2014","unstructured":"Wang X-R, Jin J, Wang J-B, Ji P (2014) Single machine scheduling with truncated job-dependent learning effect. Optim Lett 8:669\u2013677","journal-title":"Optim Lett"},{"issue":"2","key":"3784_CR73","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.3934\/jimo.2016060","volume":"13","author":"J-B Wang","year":"2017","unstructured":"Wang J-B, Liu M, Yin N, Ji P (2017) Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects. J Ind Manag Optim 13(2):1025\u20131039","journal-title":"J Ind Manag Optim"},{"issue":"2","key":"3784_CR74","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1080\/0305215X.2019.1577411","volume":"52","author":"J-B Wang","year":"2020","unstructured":"Wang J-B, Zhang B, Li L, Bai D, Feng Y-B (2020) Due window assignment scheduling problems with position-dependent weights on a single machine. Eng Optim 52(2):185\u2013193","journal-title":"Eng Optim"},{"issue":"3","key":"3784_CR75","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1080\/0305215X.2020.1740921","volume":"53","author":"J-B Wang","year":"2021","unstructured":"Wang J-B, Hu Y, Zhang B (2021a) Common due-window assignment for single-machine scheduling with generalized earliness\/tardiness penalties and a rate-modifying activity. Eng Optim 53(3):496\u2013512","journal-title":"Eng Optim"},{"issue":"3","key":"3784_CR76","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1111\/itor.12888","volume":"28","author":"J-B Wang","year":"2021","unstructured":"Wang J-B, Lv D-Y, Xu J, Ji P, Li F (2021b) Bicriterion scheduling with truncated learning effects and convex controllable processing times. Int Trans Oper Res 28(3):1573\u20131593","journal-title":"Int Trans Oper Res"},{"issue":"5","key":"3784_CR77","doi-asserted-by":"publisher","first-page":"2350039","DOI":"10.1142\/S0217595923500392","volume":"41","author":"J-B Wang","year":"2024","unstructured":"Wang J-B, Bao H, Wan C (2024a) Research on multiple slack due-date assignments scheduling with position-dependent weights. Asia-Pac J Oper Res 41(5):2350039","journal-title":"Asia-Pac J Oper Res"},{"issue":"3","key":"3784_CR78","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 (2024b) Controllable processing time scheduling with total weighted completion time objective and deteriorating jobs. Asia-Pac J Oper Res 41(3):2350026","journal-title":"Asia-Pac J Oper Res"},{"issue":"2","key":"3784_CR79","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 (2025a) Proportionate flow shop scheduling with job-dependent due windows and position-dependent weights. Asia-Pac J Oper Res 42(2):2450011","journal-title":"Asia-Pac J Oper Res"},{"issue":"6","key":"3784_CR80","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 (2025b) Research on single-machine scheduling with due-window assignment and resource allocation under total resource consumption cost is bounded. J Appl Math Comput 71(6):7905\u20137927","journal-title":"J Appl Math Comput"},{"key":"3784_CR81","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.ijpe.2015.04.005","volume":"165","author":"Y-B Wu","year":"2015","unstructured":"Wu Y-B, Wan L, Wang X-Y (2015) Study on due-window assignment scheduling based on common flow allowance. Int J Prod Econ 165:155\u2013157","journal-title":"Int J Prod Econ"},{"key":"3784_CR82","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108469","volume":"171","author":"C-C Wu","year":"2022","unstructured":"Wu C-C, Lin W-C, Azzouz A, Xu JY, Chiu Y-L, Tsai Y-W, Shen PY (2022) A bicriterion single-machine scheduling problem with step-improving processing times. Comput Ind Eng 171:108469","journal-title":"Comput Ind Eng"},{"key":"3784_CR83","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.cie.2009.06.016","volume":"58","author":"D-L Yang","year":"2010","unstructured":"Yang D-L, Kuo W-H (2010) Some scheduling problems with deteriorating jobs and learning effects. Comput Ind Eng 58:25\u201328","journal-title":"Comput Ind Eng"},{"issue":"2","key":"3784_CR84","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1016\/j.ejor.2017.03.004","volume":"261","author":"L Yedidsion","year":"2017","unstructured":"Yedidsion L, Shabtay D (2017) The resource dependent assignment problem with a convex agent cost function. Eur J Oper Res 261(2):486\u2013502","journal-title":"Eur J Oper Res"},{"key":"3784_CR85","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":"3784_CR86","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":"3784_CR87","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/s00170-010-2973-z","volume":"54","author":"N Yin","year":"2011","unstructured":"Yin N, Wang X-Y (2011) Single-machine scheduling with controllable processing times and learning effect. Int J Adv Manuf Technol 54:743\u2013748","journal-title":"Int J Adv Manuf Technol"},{"issue":"7","key":"3784_CR88","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(7):480","journal-title":"Axioms"},{"issue":"11","key":"3784_CR89","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(11):827","journal-title":"Axioms"},{"issue":"1","key":"3784_CR90","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. Bull Malays Math Sci Soc 49(1):33","journal-title":"Bull Malays Math Sci Soc"},{"issue":"3","key":"3784_CR91","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1080\/01605682.2024.2371527","volume":"76","author":"Y Zhang","year":"2025","unstructured":"Zhang Y, Sun XY, Liu T, Wang JY, Geng X-N (2025a) Single-machine scheduling simultaneous consideration of resource allocations and exponential time-dependent learning effects. J Oper Res Soc 76(3):528\u2013540","journal-title":"J Oper Res Soc"},{"issue":"1","key":"3784_CR92","doi-asserted-by":"publisher","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 (2025b) Research on convex resource allocation scheduling with exponential time-dependent learning effects. Comput J 68(1):97\u2013108","journal-title":"Comput J"},{"key":"3784_CR93","doi-asserted-by":"publisher","first-page":"358","DOI":"10.3390\/sym18020358","volume":"18","author":"L-H Zhang","year":"2026","unstructured":"Zhang L-H, Li M-H, Lin L (2026) Study on controllable processing time and minmax group scheduling with common due-window assignment. Symmetry 18:358","journal-title":"Symmetry"},{"issue":"5","key":"3784_CR94","doi-asserted-by":"publisher","first-page":"2817","DOI":"10.3934\/jimo.2020096","volume":"17","author":"S Zhao","year":"2021","unstructured":"Zhao S (2021) Resource allocation flowshop scheduling with learning effect and slack due window assignment. J Ind Manag Optim 17(5):2817\u20132835","journal-title":"J Ind Manag Optim"},{"issue":"4","key":"3784_CR95","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/s40314-022-01851-0","volume":"41","author":"S Zhao","year":"2022","unstructured":"Zhao S (2022) Scheduling jobs with general truncated learning effects including proportional setup times. Comput Appl Math 41(4):146","journal-title":"Comput Appl Math"},{"issue":"1","key":"3784_CR96","doi-asserted-by":"publisher","first-page":"4146871","DOI":"10.1155\/jom\/4146871","volume":"2025","author":"T Zhao","year":"2025","unstructured":"Zhao T (2025) Research on group scheduling with effects of learning and resource allocations. J Math 2025(1):4146871","journal-title":"J Math"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03784-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-026-03784-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03784-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T16:05:42Z","timestamp":1778688342000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-026-03784-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,11]]},"references-count":96,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["3784"],"URL":"https:\/\/doi.org\/10.1007\/s40314-026-03784-4","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,11]]},"assertion":[{"value":"13 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"388"}}