{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T06:20:06Z","timestamp":1778739606484,"version":"3.51.4"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T00:00:00Z","timestamp":1741824000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T00:00:00Z","timestamp":1741824000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371319"],"award-info":[{"award-number":["12371319"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271295"],"award-info":[{"award-number":["12271295"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s10878-025-01271-w","type":"journal-article","created":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T21:20:51Z","timestamp":1741900851000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Single-machine scheduling with the learning effect of processing time and the deterioration effect of delivery time for prefabricated components"],"prefix":"10.1007","volume":"49","author":[{"given":"Na","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,13]]},"reference":[{"key":"1271_CR1","doi-asserted-by":"publisher","first-page":"2316","DOI":"10.1111\/itor.12901","volume":"29","author":"MM Ahmadian","year":"2022","unstructured":"Ahmadian MM, Salehipour A (2022) Heuristics for flights arrival scheduling at airports. Int Trans Oper Res 29:2316\u20132345","journal-title":"Int Trans Oper Res"},{"key":"1271_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1002\/1099-1425(200011\/12)3:6<333::AID-JOS53>3.0.CO;2-8","volume":"3","author":"MVD Akker","year":"2000","unstructured":"Akker MVD, Hoogeveen H, Vakhania N (2000) Restarts can help in the on-line minimization of the maximum delivery time on a single machine. J Sched 3:333\u2013341","journal-title":"J Sched"},{"key":"1271_CR3","doi-asserted-by":"publisher","first-page":"107867","DOI":"10.1016\/j.cie.2021.107867","volume":"163","author":"M Atsmony","year":"2022","unstructured":"Atsmony M, Mosheiov G (2022) Minimizing total completion time with linear deterioration: a new lower bound. Comput Ind Eng 163:107867","journal-title":"Comput Ind Eng"},{"key":"1271_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.omega.2017.10.002","volume":"78","author":"DY Bai","year":"2018","unstructured":"Bai DY, Tang MQ, Zhang ZH, Santibanez-Gonzalez ED (2018) Flow shop learning effect scheduling problem with release dates. Omega 78:21\u201338","journal-title":"Omega"},{"key":"1271_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:173\u2013178","journal-title":"Eur J Oper Res"},{"key":"1271_CR6","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.ejor.2021.02.029","volume":"295","author":"Y Dong","year":"2021","unstructured":"Dong Y, Maravelias CT (2021) Terminal inventory level constraints for online production scheduling. Eur J Oper Res 295:102\u2013117","journal-title":"Eur J Oper Res"},{"key":"1271_CR7","unstructured":"Gawieinowicz S (2008) Time-dependent scheduling. Springer, Berlin"},{"key":"1271_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-019-00630-w","volume":"23","author":"S Gawiejnowicz","year":"2020","unstructured":"Gawiejnowicz S (2020) A review of four decades of time-dependent scheduling: main results, new topics, and open problems. J Sched 23:3\u201347","journal-title":"J Sched"},{"key":"1271_CR9","first-page":"287","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan AR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Math 5:287\u2013326","journal-title":"Ann Math"},{"key":"1271_CR10","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0020-0190(93)90175-9","volume":"48","author":"IJ Ho","year":"1993","unstructured":"Ho IJ, Leung YT, Wei WD (1993) Complexity of scheduling tasks with time-dependent execution times. Inform Process Lett 48:315\u2013320","journal-title":"Inform Process Lett"},{"key":"1271_CR11","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/S0895480196296823","volume":"13","author":"JA Hoogeveen","year":"2000","unstructured":"Hoogeveen JA, Vestjean APA (2000) A best possible deterministic online algorithm for minimizing maximum delivery times on a single machine. SIAM J Discrete Math 13:56\u201363","journal-title":"SIAM J Discrete Math"},{"key":"1271_CR12","first-page":"1041","volume":"12","author":"IM Ibrahim","year":"2021","unstructured":"Ibrahim IM (2021) Task scheduling algorithms in cloud computing: a review. Tur J Comput and Math Edu 12:1041\u20131053","journal-title":"Tur J Comput and Math Edu"},{"key":"1271_CR13","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1016\/S0377-2217(03)00436-3","volume":"159","author":"MY Jaber","year":"2004","unstructured":"Jaber MY, Guiffrida AL (2004) Learning curves for processes generating defects requiring reworks. Eur J Oper Res 159:663\u2013672","journal-title":"Eur J Oper Res"},{"key":"1271_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"AR Karlin","year":"1988","unstructured":"Karlin AR, Manasse MS, Rudolph L, Sleator DD (1988) Competitive snoopy caching. Algorithmica 3:79\u2013119","journal-title":"Algorithmica"},{"key":"1271_CR15","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s11590-022-01889-3","volume":"17","author":"WJ Li","year":"2023","unstructured":"Li WJ, Liu HL (2023) Online NDP-constraint scheduling of jobs with delivery times or weights. Optim Lett 17:591\u2013612","journal-title":"Optim Lett"},{"key":"1271_CR16","first-page":"126","volume":"9","author":"HF Ling","year":"2021","unstructured":"Ling HF, Su ZL, Jiang XL, Zheng YJ (2021) Multi-objective optimization of integrated civilian-military scheduling of medical supplies for epidemic prevention and control. Struct Multidiscipl Optim 9:126","journal-title":"Struct Multidiscipl Optim"},{"key":"1271_CR17","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ejor.2009.03.028","volume":"201","author":"M Liu","year":"2010","unstructured":"Liu M, Chu CB, Xu YF, Zheng FF (2010) An optimal online algorithm for single machine scheduling with bounded delivery times. Eur J Oper Res 201:693\u2013700","journal-title":"Eur J Oper Res"},{"key":"1271_CR18","doi-asserted-by":"publisher","first-page":"104770","DOI":"10.1016\/j.autcon.2023.104770","volume":"148","author":"WL Liu","year":"2023","unstructured":"Liu WL, Tao XY, Mao C, He WJ (2023) Scheduling optimization for production of prefabricated components with parallel work of serial machines. Autom Constr 148:104770","journal-title":"Autom Constr"},{"key":"1271_CR19","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1007\/s11590-020-01618-8","volume":"15","author":"HL Liu","year":"2021","unstructured":"Liu HL, Lu XW, Li WJ (2021) A best possible online algorithm for parallel batch scheduling with delivery times and limited restart. Optim Lett 15:1155\u20131173","journal-title":"Optim Lett"},{"key":"1271_CR20","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/j.amc.2015.10.058","volume":"273","author":"R Ma","year":"2016","unstructured":"Ma R, Tao JP, Yuan JJ (2016) Online scheduling with linear deteriorating jobs to minimize the total weighted completion time. Appl Math Comput 273:570\u2013583","journal-title":"Appl Math Comput"},{"key":"1271_CR21","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/0305-0548(94)90080-9","volume":"21","author":"G Mosheiov","year":"1994","unstructured":"Mosheiov G (1994) Scheduling jobs under simple linear deterioration. Comput Oper Res 21:653\u2013659","journal-title":"Comput Oper Res"},{"key":"1271_CR22","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":"1271_CR23","first-page":"103935","volume":"48","author":"S Navaratnam","year":"2022","unstructured":"Navaratnam S, Satheeskumar A, Zhang G, Nguyen K, Venkatesan S, Poologanathan K (2022) The challenges confronting the growth of sustainable prefabricated building construction in Australia: construction industry views. J Build 48:103935","journal-title":"J Build"},{"key":"1271_CR24","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10479-017-2481-8","volume":"272","author":"J Pei","year":"2019","unstructured":"Pei J, Cheng B, Liu X, Pardalos PM, Kong M (2019) Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time. Ann Oper Res 272:217\u2013241","journal-title":"Ann Oper Res"},{"key":"1271_CR25","doi-asserted-by":"publisher","first-page":"440","DOI":"10.2105\/AJPH.2020.305570","volume":"110","author":"M Samorani","year":"2020","unstructured":"Samorani M, Blount LG (2020) Machine learning and medical appointment scheduling: creating and perpetuating inequalities in access to health care. Am J Public Health 110:440\u2013441","journal-title":"Am J Public Health"},{"issue":"10","key":"1271_CR26","doi-asserted-by":"publisher","first-page":"3186","DOI":"10.1080\/00207543.2019.1566675","volume":"57","author":"X Sun","year":"2019","unstructured":"Sun X, Geng XN (2019) Single-machine scheduling with deteriorating effects and machine maintenance. Int J Prod Res 57(10):3186\u20133199","journal-title":"Int J Prod Res"},{"key":"1271_CR27","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.tcs.2007.11.006","volume":"393","author":"J Tian","year":"2008","unstructured":"Tian J, Fu RY, Yuan JJ (2008) A best on-line algorithm for single machine scheduling with small delivery times. Theoret Comput Sci 393:287\u2013293","journal-title":"Theoret Comput Sci"},{"key":"1271_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1061\/(ASCE)CO.1943-7862.0001556","volume":"144","author":"ZJ Wang","year":"2018","unstructured":"Wang ZJ, Hu H, Gong J (2018) Modeling worker competence to advance precast production scheduling optimization. J Constr Eng Manag 144:1\u201314","journal-title":"J Constr Eng Manag"},{"key":"1271_CR29","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.ipl.2004.12.018","volume":"94","author":"J-B Wang","year":"2005","unstructured":"Wang J-B, Xia ZX (2005) Scheduling jobs under decreasing linear deterioration. Inf Process Lett 94:63\u201369","journal-title":"Inf Process Lett"},{"key":"1271_CR30","doi-asserted-by":"publisher","first-page":"105028","DOI":"10.1016\/j.autcon.2023.105028","volume":"154","author":"LL Xie","year":"2023","unstructured":"Xie LL, Wu SS, Chen YJ, Chang RD, Chen XY (2023) A case-based reasoning approach for solving schedule delay problems in prefabricated construction projects. Autom Constr 154:105028","journal-title":"Autom Constr"},{"key":"1271_CR31","doi-asserted-by":"crossref","unstructured":"Yin J, Huang R, Sun H, Cai SY (2024) Multi-objective optimization for coordinated production and transportation in prefabricated construction with on-site lifting requirements. Comput Ind Eng 189:110017","DOI":"10.1016\/j.cie.2024.110017"},{"issue":"2","key":"1271_CR32","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/s10878-021-00773-7","volume":"43","author":"Y Yuan","year":"2022","unstructured":"Yuan Y, Lan Y, Ding N, Han X (2022) A PTAS for non-resumable open shop scheduling with an availability constraint. J Combin Optim 43(2):350\u2013362","journal-title":"J Combin Optim"},{"key":"1271_CR33","doi-asserted-by":"publisher","first-page":"36995","DOI":"10.1109\/ACCESS.2021.3061454","volume":"9","author":"YT Zhang","year":"2021","unstructured":"Zhang YT, Liu J (2021) Emergency logistics scheduling under uncertain transportation time using online optimization methods. IEEE Access 9:36995\u201337010","journal-title":"IEEE Access"},{"key":"1271_CR34","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1080\/0305215X.2016.1163629","volume":"49","author":"X Zhang","year":"2017","unstructured":"Zhang X, Yin Y, Wu CC (2017) Scheduling with non-decreasing deterioration jobs and variable maintenance activities on a single machine. Eng Optim 49:84\u201397","journal-title":"Eng Optim"},{"key":"1271_CR35","doi-asserted-by":"crossref","unstructured":"Zhang L, Zhang Y, Bai Q (2020) An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time. J Combin Optim 44:2167\u20132179","DOI":"10.1007\/s10878-020-00594-0"},{"issue":"3","key":"1271_CR36","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s10878-019-00507-w","volume":"39","author":"Q Zhao","year":"2020","unstructured":"Zhao Q, Yuan JJ (2020) Bicriteria scheduling of equal length jobs on uniform parallel machines. J Combin Optim 39(3):637\u2013661","journal-title":"J Combin Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01271-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-025-01271-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01271-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T07:55:29Z","timestamp":1745308529000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-025-01271-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,13]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["1271"],"URL":"https:\/\/doi.org\/10.1007\/s10878-025-01271-w","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,13]]},"assertion":[{"value":"3 February 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"37"}}