{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T10:46:56Z","timestamp":1774867616594,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T00:00:00Z","timestamp":1767830400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T00:00:00Z","timestamp":1767830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Special Project B for Initiating Scientific Research and Innovation for Young Teachers at Hefei University of Technology","award":["JZ2024HGQB0089"],"award-info":[{"award-number":["JZ2024HGQB0089"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["W2411063, 72331004, 72371095, 72071056, 72101077, 71922009, 72271077"],"award-info":[{"award-number":["W2411063, 72331004, 72371095, 72071056, 72101077, 71922009, 72271077"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018925","name":"111 center","doi-asserted-by":"crossref","award":["B17014"],"award-info":[{"award-number":["B17014"]}],"id":[{"id":"10.13039\/501100018925","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s12293-025-00487-x","type":"journal-article","created":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T09:33:20Z","timestamp":1767864800000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel machine group scheduling with time-dependent setup time and combined effects of deterioration and learning"],"prefix":"10.1007","volume":"18","author":[{"given":"Chaoming","family":"Hu","sequence":"first","affiliation":[]},{"given":"Yanhui","family":"Zhai","sequence":"additional","affiliation":[]},{"given":"Shaojun","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Xinbao","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,8]]},"reference":[{"key":"487_CR1","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s10845-020-01678-8","volume":"32","author":"Q Yu","year":"2021","unstructured":"Yu Q, Yang H, Lin KY, Li L (2021) A self-organized approach for scheduling semiconductor manufacturing systems. J Intell Manuf 32:689\u2013706","journal-title":"J Intell Manuf"},{"issue":"3","key":"487_CR2","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi A, Ng CT, Cheng TE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187(3):985\u20131032","journal-title":"Eur J Oper Res"},{"issue":"4","key":"487_CR3","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0360-8352(88)90041-1","volume":"14","author":"JN Gupta","year":"1988","unstructured":"Gupta JN, Gupta SK (1988) Single facility scheduling with nonlinear processing times. Comput Ind Eng 14(4):387\u2013393","journal-title":"Comput Ind Eng"},{"issue":"3","key":"487_CR4","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1287\/opre.38.3.495","volume":"38","author":"S Browne","year":"1990","unstructured":"Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38(3):495\u2013498","journal-title":"Oper Res"},{"issue":"1","key":"487_CR5","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(1):173\u2013178","journal-title":"Eur J Oper Res"},{"key":"487_CR6","volume-title":"Scientific principles of group technology","author":"SP Mitrofanov","year":"1966","unstructured":"Mitrofanov SP, Harris E, Grayson TJ (1966) Scientific principles of group technology. National Lending Library for Science and Technology, Boston"},{"issue":"6","key":"487_CR7","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(6):386","journal-title":"Comput Appl Math"},{"issue":"3","key":"487_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.3390\/axioms14030153","volume":"14","author":"JD Miao","year":"2025","unstructured":"Miao JD, Lv DY, Wei CM, Wang JB (2025) Research on group scheduling with general logarithmic deterioration subject to maximal completion time cost. Axioms 14(3):153","journal-title":"Axioms"},{"key":"487_CR9","doi-asserted-by":"publisher","first-page":"109750","DOI":"10.1016\/j.cie.2023.109750","volume":"186","author":"J Qian","year":"2023","unstructured":"Qian J (2023) Note on single machine common flow allowance group scheduling with learning effect and resource allocation. Comput Ind Eng 186:109750","journal-title":"Comput Ind Eng"},{"key":"487_CR10","doi-asserted-by":"publisher","first-page":"106126","DOI":"10.1016\/j.cie.2019.106126","volume":"139","author":"L Sun","year":"2020","unstructured":"Sun L, Yu AJ, Wu B (2020) Single machine common flow allowance group scheduling with learning effect and resource allocation. Comput Ind Eng 139:106126","journal-title":"Comput Ind Eng"},{"issue":"6","key":"487_CR11","doi-asserted-by":"publisher","first-page":"3807","DOI":"10.3934\/jimo.2021124","volume":"18","author":"A Goli","year":"2022","unstructured":"Goli A, Keshavarz T (2022) Just-in-time scheduling in identical parallel machine sequence-dependent group scheduling problem J. Ind Manag Optim 18(6):3807\u20133830","journal-title":"Ind Manag Optim"},{"key":"487_CR12","doi-asserted-by":"publisher","first-page":"106432","DOI":"10.1016\/j.cor.2023.106432","volume":"161","author":"B Zhang","year":"2024","unstructured":"Zhang B, Meng LL, Lu C, Han YY, Sang HY (2024) Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem. Comput Oper Res 161:106432","journal-title":"Comput Oper Res"},{"key":"487_CR13","doi-asserted-by":"publisher","first-page":"106750","DOI":"10.1016\/j.engappai.2023.106750","volume":"125","author":"H Zhao","year":"2023","unstructured":"Zhao H, Pan QK, Gao KZ (2023) A cooperative population-based iterated greedy algorithm for distributed permutation flowshop group scheduling problem. Eng Appl Artif Intell 125:106750","journal-title":"Eng Appl Artif Intell"},{"key":"487_CR14","doi-asserted-by":"publisher","first-page":"119082","DOI":"10.1109\/ACCESS.2019.2936004","volume":"7","author":"C Miao","year":"2019","unstructured":"Miao C (2019) Parallel-batch scheduling with deterioration and group technology. IEEE Access 7:119082\u2013119086","journal-title":"IEEE Access"},{"issue":"2","key":"487_CR15","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.cie.2009.11.008","volume":"58","author":"TE Cheng","year":"2010","unstructured":"Cheng TE, Lee WC, Wu CC (2010) Scheduling problems with deteriorating jobs and learning effects including proportional setup times. Comput Ind Eng 58(2):326\u2013331","journal-title":"Comput Ind Eng"},{"key":"487_CR16","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10898-015-0320-5","volume":"67","author":"J Pei","year":"2017","unstructured":"Pei J, Liu X, Pardalos PM, Migdalas A, Yang S (2017) Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine. J Glob Optim 67:251\u2013262","journal-title":"J Glob Optim"},{"issue":"7","key":"487_CR17","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1007\/s11590-016-1074-9","volume":"11","author":"J Pei","year":"2017","unstructured":"Pei J, Liu X, Pardalos PM, Li K, Fan W, Migdalas A (2017) Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time. Optim Lett 11(7):1257\u20131271","journal-title":"Optim Lett"},{"issue":"4","key":"487_CR18","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":"2","key":"487_CR19","doi-asserted-by":"publisher","first-page":"281","DOI":"10.15388\/Informatica.2018.168","volume":"29","author":"B Liao","year":"2018","unstructured":"Liao B, Pei J, Yang S, Pardalos PM, Lu S (2018) Single-machine and parallel-machine parallel-batching scheduling considering deteriorating jobs, various group, and time-dependent setup time. Informatica 29(2):281\u2013301","journal-title":"Informatica"},{"key":"487_CR20","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.omega.2017.12.003","volume":"82","author":"J Pei","year":"2019","unstructured":"Pei J, Liu X, Fan W, Pardalos PM, Lu S (2019) A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers. Omega 82:55\u201369","journal-title":"Omega"},{"issue":"5","key":"487_CR21","first-page":"5405","volume":"22","author":"S Lu","year":"2022","unstructured":"Lu S, Kong M, Zhou Z, Liu X, Liu S (2022) A hybrid metaheuristic for a semiconductor production scheduling problem with deterioration effect and resource constraints. Oper Res 22(5):5405\u20135440","journal-title":"Oper Res"},{"key":"487_CR22","doi-asserted-by":"publisher","first-page":"113445","DOI":"10.1016\/j.eswa.2020.113445","volume":"156","author":"D Bai","year":"2020","unstructured":"Bai D, Xue H, Wang L, Wu CC, Lin WC, Abdulkadir DH (2020) Effective algorithms for single-machine learning-effect scheduling to minimize completion-time-based criteria with release dates. Expert Syst Appl 156:113445","journal-title":"Expert Syst Appl"},{"issue":"2","key":"487_CR23","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1007\/s00500-020-05234-7","volume":"25","author":"OA Ar\u0131k","year":"2021","unstructured":"Ar\u0131k OA (2021) Population-based tabu search with evolutionary strategies for permutation flow shop scheduling problems under effects of position-dependent learning and linear deterioration. Soft Comput 25(2):1501\u20131518","journal-title":"Soft Comput"},{"issue":"6","key":"487_CR24","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1080\/00207543.2022.2049911","volume":"61","author":"J Pei","year":"2023","unstructured":"Pei J, Zhou Y, Yan P, Pardalos PM (2023) A concise guide to scheduling with learning and deteriorating effects. Int J Prod Res 61(6):2010\u20132031","journal-title":"Int J Prod Res"},{"issue":"3","key":"487_CR25","doi-asserted-by":"publisher","first-page":"2285","DOI":"10.1007\/s12190-024-02052-0","volume":"70","author":"RR Mao","year":"2024","unstructured":"Mao RR, Lv DY, Ren N, Wang JB (2024) Supply chain scheduling with deteriorating jobs and delivery times. J Appl Math Comput 70(3):2285\u20132312","journal-title":"J Appl Math Comput"},{"issue":"2","key":"487_CR26","doi-asserted-by":"publisher","first-page":"2527","DOI":"10.1007\/s12190-024-02306-x","volume":"71","author":"XY Qiu","year":"2025","unstructured":"Qiu XY, Wang JB (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"},{"issue":"4","key":"487_CR27","doi-asserted-by":"publisher","first-page":"2907","DOI":"10.1007\/s12190-024-02080-w","volume":"70","author":"MH Li","year":"2024","unstructured":"Li MH, Lv DY, Zhang LH, Wang JB (2024) Permutation flow shop scheduling with makespan objective and truncated learning effects. J Appl Math Comput 70(4):2907\u20132939","journal-title":"J Appl Math Comput"},{"issue":"03","key":"487_CR28","doi-asserted-by":"publisher","first-page":"2350026","DOI":"10.1142\/S0217595923500264","volume":"41","author":"JB Wang","year":"2024","unstructured":"Wang JB, Wang YC, Wan C, Lv DY, Zhang L (2024) Controllable processing time scheduling with total weighted completion time objective and deteriorating jobs. Asia Pac J Oper Res 41(03):2350026","journal-title":"Asia Pac J Oper Res"},{"issue":"16","key":"487_CR29","doi-asserted-by":"publisher","first-page":"2522","DOI":"10.3390\/math12162522","volume":"12","author":"Z Liu","year":"2024","unstructured":"Liu Z, Wang JB (2024) Single-machine scheduling with simultaneous learning effects and delivery times. Mathematics 12(16):2522","journal-title":"Mathematics"},{"issue":"7","key":"487_CR30","doi-asserted-by":"publisher","first-page":"1828","DOI":"10.1080\/0305215X.2024.2372633","volume":"57","author":"DY Lv","year":"2025","unstructured":"Lv DY, Wang JB (2025) 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":"1","key":"487_CR31","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.cie.2011.09.014","volume":"62","author":"SJ Yang","year":"2012","unstructured":"Yang SJ (2012) Single-machine scheduling problems simultaneously with deterioration and learning effects under deteriorating multi-maintenance activities consideration. Comput Ind Eng 62(1):271\u2013275","journal-title":"Comput Ind Eng"},{"issue":"1","key":"487_CR32","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.ijpe.2008.05.004","volume":"115","author":"CC Wu","year":"2008","unstructured":"Wu CC, Lee WC (2008) Single-machine group-scheduling problems with deteriorating setup times and job-processing times. Int J Prod Econ 115(1):128\u2013133","journal-title":"Int J Prod Econ"},{"key":"487_CR33","doi-asserted-by":"crossref","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan AR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Annals of discrete mathematics, Vol. 5, pp. 287\u2013326. Elsevier.","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"487_CR34","volume-title":"Inequalities","author":"GH Hardy","year":"1952","unstructured":"Hardy GH, Littlewood JE, P\u00f3lya G (1952) Inequalities. Cambridge University Press, London"},{"issue":"4","key":"487_CR35","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1287\/moor.2.4.320","volume":"2","author":"R Sethi","year":"1977","unstructured":"Sethi R (1977) On the complexity of mean flow time scheduling. Math Oper Res 2(4):320\u2013330","journal-title":"Math Oper Res"},{"issue":"10","key":"487_CR36","doi-asserted-by":"publisher","first-page":"9021","DOI":"10.1016\/j.eswa.2012.02.032","volume":"39","author":"MA Bozorgirad","year":"2012","unstructured":"Bozorgirad MA, Logendran R (2012) Sequence-dependent group scheduling problem on unrelated-parallel machines. Expert Syst Appl 39(10):9021\u20139030","journal-title":"Expert Syst Appl"},{"issue":"5","key":"487_CR37","first-page":"5055","volume":"22","author":"MR Hosseinzadeh","year":"2022","unstructured":"Hosseinzadeh MR, Heydari M, Mahdavi Mazdeh M (2022) Mathematical modeling and two metaheuristic algorithms for integrated process planning and group scheduling with sequence-dependent setup time. Oper Res 22(5):5055\u20135105","journal-title":"Oper Res"},{"key":"487_CR38","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10845-020-01580-3","volume":"32","author":"S Yuan","year":"2021","unstructured":"Yuan S, Li T, Wang B (2021) A discrete differential evolution algorithm for flow shop group scheduling problem with sequence-dependent setup and transportation times. J Intell Manuf 32:427\u2013439","journal-title":"J Intell Manuf"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00487-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-025-00487-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00487-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T09:47:31Z","timestamp":1774864051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-025-00487-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,8]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["487"],"URL":"https:\/\/doi.org\/10.1007\/s12293-025-00487-x","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,8]]},"assertion":[{"value":"12 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2026","order":3,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"8"}}