{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:05:05Z","timestamp":1753880705323,"version":"3.41.2"},"reference-count":29,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01n02","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11501171"],"award-info":[{"award-number":["11501171"]}],"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":["11771251"],"award-info":[{"award-number":["11771251"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Province Natural Science Foundation of Shandong","award":["ZR2020MA028"],"award-info":[{"award-number":["ZR2020MA028"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:p> In the production scheduling of prefabricated components, we study an online [Formula: see text] parallel-batch machines scheduling model considering learning effect jobs with [Formula: see text] incompatible job families to minimize the makespan in this paper, where the capacity of batch is unbounded. Job families indicate that a job must belong to some job family and jobs of distinct job families are incapable to be executed in the same batch. The information of each job including its basic processing time [Formula: see text] and release time [Formula: see text] is unknown in advance and is revealed at the instant of its arrival. Moreover, the actual processing time of job [Formula: see text] with learning effect is [Formula: see text], where [Formula: see text] and [Formula: see text] are non-negative parameters and [Formula: see text] denotes the starting time of prefabricated job [Formula: see text], respectively. When [Formula: see text], we propose an online algorithm with a competitive ratio of [Formula: see text]. Furthermore, the performance of the online algorithm is demonstrated by numerical experiments. <\/jats:p>","DOI":"10.1142\/s0129626423400030","type":"journal-article","created":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T05:38:17Z","timestamp":1673415497000},"source":"Crossref","is-referenced-by-count":0,"title":["Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components"],"prefix":"10.1142","volume":"33","author":[{"given":"Na","family":"Li","sequence":"first","affiliation":[{"name":"School of Management Engineering, Qingdao University of Technology, Qingdao, Shandong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Management Engineering, Qingdao University of Technology, Qingdao, Shandong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2023,1,13]]},"reference":[{"key":"S0129626423400030BIB001","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1111\/j.1467-8667.2010.00666.x","volume":"25","author":"Al-Bazi A.","year":"2010","journal-title":"Comput-Aided Civ. Inf."},{"key":"S0129626423400030BIB002","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.autcon.2016.05.015","volume":"68","author":"Chen J. H.","year":"2016","journal-title":"Autom. Constr."},{"key":"S0129626423400030BIB003","first-page":"1","volume":"38","author":"Du J.","year":"2020","journal-title":"Expert Syst."},{"key":"S0129626423400030BIB004","doi-asserted-by":"crossref","first-page":"04017013","DOI":"10.1061\/(ASCE)CP.1943-5487.0000667","volume":"31","author":"Wang Z.","year":"2017","journal-title":"J. Comput. Civ. Eng."},{"key":"S0129626423400030BIB005","first-page":"1","volume":"144","author":"Wang Z.","year":"2018","journal-title":"J. Comput. Civ. Eng."},{"key":"S0129626423400030BIB006","first-page":"1","volume":"257","author":"Kim T.","year":"2020","journal-title":"J. Clean. Prod."},{"key":"S0129626423400030BIB007","doi-asserted-by":"crossref","first-page":"103575","DOI":"10.1016\/j.autcon.2021.103575","volume":"125","author":"Dan Y.","year":"2021","journal-title":"Autom. Constr."},{"key":"S0129626423400030BIB008","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1016\/S0377-2217(03)00436-3","volume":"159","author":"Jaber M. Y.","year":"2004","journal-title":"Eur. J. Oper. Res."},{"key":"S0129626423400030BIB009","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.ejor.2021.02.029","volume":"295","author":"Dong Y.","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"S0129626423400030BIB010","doi-asserted-by":"crossref","first-page":"36995","DOI":"10.1109\/ACCESS.2021.3061454","volume":"9","author":"Zhang Y. T.","year":"2021","journal-title":"IEEE Access."},{"key":"S0129626423400030BIB011","first-page":"1041","volume":"12","author":"Ibrahim I. M.","year":"2021","journal-title":"Tur. J. Comput. Math. Edu."},{"key":"S0129626423400030BIB012","doi-asserted-by":"crossref","first-page":"440","DOI":"10.2105\/AJPH.2020.305570","volume":"110","author":"Samorani M.","year":"2020","journal-title":"Am. J. Public Health."},{"key":"S0129626423400030BIB013","first-page":"126","volume":"9","author":"Ling H. F.","year":"2021","journal-title":"Struct. Multidiscipl. Optim."},{"key":"S0129626423400030BIB014","doi-asserted-by":"crossref","first-page":"2050002","DOI":"10.1142\/S0129626420500024","volume":"30","author":"Fernandez C.","year":"2020","journal-title":"Parallel Process. Lett."},{"key":"S0129626423400030BIB015","doi-asserted-by":"crossref","first-page":"2150019","DOI":"10.1142\/S0129626421500195","volume":"31","author":"Hamdi-Larbi O.","year":"2021","journal-title":"Parallel Process. Lett."},{"key":"S0129626423400030BIB016","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"Karlin A. R.","year":"1988","journal-title":"Algorithmica"},{"key":"S0129626423400030BIB017","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","volume":"1","author":"Brucker P.","year":"1998","journal-title":"J. Scheduling"},{"key":"S0129626423400030BIB018","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.orl.2013.01.003","volume":"41","author":"Fu R. Y.","year":"2013","journal-title":"Oper. Res. Lett."},{"key":"S0129626423400030BIB019","doi-asserted-by":"crossref","first-page":"2380","DOI":"10.1016\/j.tcs.2011.01.023","volume":"412","author":"Tian J.","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"S0129626423400030BIB020","doi-asserted-by":"crossref","first-page":"170","DOI":"10.3390\/math8020170","volume":"8","author":"Li W. H.","year":"2020","journal-title":"Math."},{"key":"S0129626423400030BIB021","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","volume":"115","author":"Biskup D.","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"S0129626423400030BIB022","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/S0377-2217(00)00175-2","volume":"132","author":"Mosheiov G.","year":"2001","journal-title":"Eur. J. Oper. Res."},{"key":"S0129626423400030BIB023","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.cor.2016.04.021","volume":"74","author":"Xu J. Y.","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"S0129626423400030BIB024","doi-asserted-by":"crossref","first-page":"1573","DOI":"10.1111\/itor.12888","volume":"28","author":"Wang J.-B.","year":"2021","journal-title":"Int. T. Oper. Res."},{"key":"S0129626423400030BIB025","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0020-0190(93)90175-9","volume":"48","author":"Ho I. J.","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"S0129626423400030BIB026","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.ipl.2004.12.018","volume":"94","author":"Wang J.-B.","year":"2005","journal-title":"Inform. Process. Lett."},{"key":"S0129626423400030BIB027","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-69446-5_5","volume-title":"Time-Dependent Scheduling","author":"Gawiejnowicz S.","year":"2008"},{"key":"S0129626423400030BIB028","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10951-019-00630-w","volume":"23","author":"Gawiejnowicz S.","year":"2020","journal-title":"J. Scheduling."},{"key":"S0129626423400030BIB029","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"Graham R. L.","year":"1979","journal-title":"Ann. Discrete Math."}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626423400030","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T06:43:52Z","timestamp":1685083432000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129626423400030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,13]]},"references-count":29,"journal-issue":{"issue":"01n02","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["10.1142\/S0129626423400030"],"URL":"https:\/\/doi.org\/10.1142\/s0129626423400030","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"type":"print","value":"0129-6264"},{"type":"electronic","value":"1793-642X"}],"subject":[],"published":{"date-parts":[[2023,1,13]]},"article-number":"2340003"}}