{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T17:08:56Z","timestamp":1771952936453,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T00:00:00Z","timestamp":1667520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T00:00:00Z","timestamp":1667520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003213","name":"Beijing Municipal Education Commission","doi-asserted-by":"publisher","award":["KZ202210017024"],"award-info":[{"award-number":["KZ202210017024"]}],"id":[{"id":"10.13039\/501100003213","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Interdisciplinary Research Exploration Program of Beijing Institute of Petrochemical Technology","award":["BIPTCSF-008"],"award-info":[{"award-number":["BIPTCSF-008"]}]},{"DOI":"10.13039\/501100003213","name":"Beijing Municipal Education Commission","doi-asserted-by":"publisher","award":["KM201810017006"],"award-info":[{"award-number":["KM201810017006"]}],"id":[{"id":"10.13039\/501100003213","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10489-022-04213-9","type":"journal-article","created":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T07:03:27Z","timestamp":1667545407000},"page":"14876-14891","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Flexible job-shop scheduling method based on interval grey processing time"],"prefix":"10.1007","volume":"53","author":[{"given":"Wenxing","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wentong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunliang","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4158-0585","authenticated-orcid":false,"given":"Zhimei","family":"Lei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,4]]},"reference":[{"key":"4213_CR1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.compchemeng.2014.02.023","volume":"72","author":"Y Chu","year":"2015","unstructured":"Chu Y, You F, Wassick J M et al (2015) Integrated planning and scheduling under production uncertainties: bi-level model formulation and hybrid solution method. Comput Chem Eng 72:255\u2013272. https:\/\/doi.org\/10.1016\/j.compchemeng.2014.02.023","journal-title":"Comput Chem Eng"},{"issue":"1","key":"4213_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson S M (1954) Optimal two- and three-stage production schedules with setup times included. Nav Res Logist Q 1(1):61\u201368. https:\/\/doi.org\/10.1002\/nav.3800010110","journal-title":"Nav Res Logist Q"},{"issue":"4","key":"4213_CR3","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"B Giffler","year":"1960","unstructured":"Giffler B, Thompson GL (1960) Algorithms for solving production-scheduling problems. Oper Res 8(4):487\u2013503. https:\/\/doi.org\/10.1287\/opre.8.4.487https:\/\/doi.org\/10.1287\/opre.8.4.487","journal-title":"Oper Res"},{"key":"4213_CR4","doi-asserted-by":"publisher","unstructured":"Cook SA (1971) The complexity of theorem-proving procedures. In: Proceedings of the third annual ACM symposium on Theory of computing - STOC \u201971, ACM Press. https:\/\/doi.org\/10.1145\/800157.805047https:\/\/doi.org\/10.1145\/800157.805047","DOI":"10.1145\/800157.805047 10.1145\/800157.805047"},{"issue":"2","key":"4213_CR5","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1287\/ijoc.6.2.118","volume":"6","author":"EHL Aarts","year":"1994","unstructured":"Aarts EHL, van Laarhoven PJM, Lenstra JK et al (1994) A computational study of local search algorithms for job shop scheduling. ORSA J Comput 6(2):118\u2013125. https:\/\/doi.org\/10.1287\/ijoc.6.2.118https:\/\/doi.org\/10.1287\/ijoc.6.2.118","journal-title":"ORSA J Comput"},{"issue":"2","key":"4213_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01471219","volume":"2","author":"M Laguna","year":"1991","unstructured":"Laguna M, Barnes J W, Glover F W (1991) Tabu search methods for a single machine scheduling problem. J Intell Manuf 2(2):63\u201373. https:\/\/doi.org\/10.1007\/bf01471219","journal-title":"J Intell Manuf"},{"key":"4213_CR7","unstructured":"Nakano R, Yamada T (1991) Conventional genetic algorithm for job shop problems. In: Proceedings of the 4th international conference on genetic algorithms (ICGA), pp 474\u2013479"},{"issue":"4","key":"4213_CR8","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1990","unstructured":"Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45 (4):369\u2013375. https:\/\/doi.org\/10.1007\/bf02238804https:\/\/doi.org\/10.1007\/bf02238804","journal-title":"Computing"},{"issue":"2","key":"4213_CR9","doi-asserted-by":"publisher","first-page":"261","DOI":"10.23919\/JSEE.2021.000023","volume":"32","author":"C Wang","year":"2021","unstructured":"Wang C, Li Y, Li X (2021) Solving flexible job shop scheduling problem by a multi-swarm collaborative genetic algorithm. J Syst Eng Electron 32(2):261\u2013271. https:\/\/doi.org\/10.23919\/jsee.2021.000023https:\/\/doi.org\/10.23919\/jsee.2021.000023","journal-title":"J Syst Eng Electron"},{"key":"4213_CR10","doi-asserted-by":"publisher","first-page":"104,951","DOI":"10.1016\/j.cor.2020.104951","volume":"121","author":"H Ding","year":"2020","unstructured":"Ding H, Gu X (2020) Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem. Comput Oper Res 121:104,951. https:\/\/doi.org\/10.1016\/j.cor.2020.104951","journal-title":"Comput Oper Res"},{"issue":"10","key":"4213_CR11","doi-asserted-by":"publisher","first-page":"3020","DOI":"10.1080\/00207543.2018.1524165","volume":"57","author":"MS Zadeh","year":"2018","unstructured":"Zadeh MS, Katebi Y, Doniavi A (2018) A heuristic model for dynamic flexible job shop scheduling problem considering variable processing times. Int J Prod Res 57(10):3020\u20133035. https:\/\/doi.org\/10.1080\/00207543.2018.1524165","journal-title":"Int J Prod Res"},{"issue":"2","key":"4213_CR12","doi-asserted-by":"publisher","first-page":"272","DOI":"10.23919\/JSEE.2021.000024","volume":"32","author":"X Wu","year":"2021","unstructured":"Wu X, Peng J, Xie Z, et al. (2021) An improved multi-objective optimization algorithm for solving flexible job shop scheduling problem with variable batches. J Syst Eng Electron 32(2):272\u2013285. https:\/\/doi.org\/10.23919\/jsee.2021.000024","journal-title":"J Syst Eng Electron"},{"key":"4213_CR13","unstructured":"Chen XZ (2018) Process planning technology of mechanical machining system for generalized energy efficiency. PhD thesis Chongqing University, Chongqing, China"},{"issue":"2","key":"4213_CR14","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0377-2217(94)00162-6","volume":"87","author":"H Ishii","year":"1995","unstructured":"Ishii H, Tada M (1995) Single machine scheduling problem with fuzzy precedence relation. Eur J Oper Res 87(2):284\u2013288. https:\/\/doi.org\/10.1016\/0377-2217(94)00162-6","journal-title":"Eur J Oper Res"},{"issue":"2","key":"4213_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0360-8352(99)00135-7","volume":"36","author":"M Sakawa","year":"1999","unstructured":"Sakawa M, Mori T (1999) An efficient genetic algorithm for job-shop scheduling problems with fuzzy processing time and fuzzy duedate. Comput Ind Eng 36(2):325\u2013341. https:\/\/doi.org\/10.1016\/s0360-8352(99)00135-7https:\/\/doi.org\/10.1016\/s0360-8352(99)00135-7","journal-title":"Comput Ind Eng"},{"key":"4213_CR16","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.eswa.2016.07.046","volume":"65","author":"KZ Gao","year":"2016","unstructured":"Gao KZ, Suganthan PN, Pan QK et al (2016) An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time. Expert Syst Appl 65:52\u201367. https:\/\/doi.org\/10.1016\/j.eswa.2016.07.046","journal-title":"Expert Syst Appl"},{"key":"4213_CR17","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1016\/j.asoc.2016.07.004","volume":"56","author":"JJ Palacios","year":"2017","unstructured":"Palacios JJ, Gonza\u0307lez-rodr\u00edguez I, Vela CR et al (2017) Robust multiobjective optimisation for fuzzy job shop problems. Appl Soft Comput 56:604\u2013616. https:\/\/doi.org\/10.1016\/j.asoc.2016.07.004https:\/\/doi.org\/10.1016\/j.asoc.2016.07.004","journal-title":"Appl Soft Comput"},{"key":"4213_CR18","doi-asserted-by":"publisher","unstructured":"Gen M, Lin L, Ohwada H (2021) Advances in hybrid evolutionary algorithms for fuzzy flexible job-shop scheduling: state-of-the-art survey. In: Proceedings of the 13th international conference on agents and artificial intelligence. SCITEPRESS - science and technology publications. https:\/\/doi.org\/10.5220\/0010429605620573","DOI":"10.5220\/0010429605620573"},{"key":"4213_CR19","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.asoc.2018.06.004","volume":"70","author":"N Xie","year":"2018","unstructured":"Xie N, Chen N (2018) Flexible job shop scheduling problem with interval grey processing time. Appl Soft Comput 70:513\u2013524. https:\/\/doi.org\/10.1016\/j.asoc.2018.06.004","journal-title":"Appl Soft Comput"},{"issue":"5","key":"4213_CR20","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/S0167-6911(82)80025-X","volume":"1","author":"JL Deng","year":"1982","unstructured":"Deng JL (1982) Control problems of grey systems. Syst Control Lett 1 (5):288\u2013294. https:\/\/doi.org\/10.1016\/s0167-6911(82)80025-xhttps:\/\/doi.org\/10.1016\/s0167-6911(82)80025-x","journal-title":"Syst Control Lett"},{"issue":"4","key":"4213_CR21","doi-asserted-by":"publisher","first-page":"598","DOI":"10.3969\/j.issn.1004-4132.2010.04.011","volume":"21","author":"B Zeng","year":"2010","unstructured":"Zeng B, Liu S, Xie N (2010) Prediction model of interval grey number based on DGM(1,1). J Syst Eng Electron 21(4):598\u2013603. https:\/\/doi.org\/10.3969\/j.issn.1004-4132.2010.04.011","journal-title":"J Syst Eng Electron"},{"issue":"1-2","key":"4213_CR22","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10479-021-04103-2","volume":"304","author":"TV Garcez","year":"2021","unstructured":"Garcez TV, Cavalcanti HT, de Almeida AT (2021) A hybrid decision support model using grey relational analysis and the additive-veto model for solving multicriteria decision-making problems: an approach to supplier selection. Ann Oper Res 304(1-2):199\u2013231. https:\/\/doi.org\/10.1007\/s10479-021-04103-2","journal-title":"Ann Oper Res"},{"key":"4213_CR23","doi-asserted-by":"publisher","unstructured":"Tirkolaee EB, Torkayesh AE (2022) A cluster-based stratified hybrid decision support model under uncertainty: sustainable healthcare landfill location selection. Appl Intell. https:\/\/doi.org\/10.1007\/s10489-022-03335-4","DOI":"10.1007\/s10489-022-03335-4"},{"key":"4213_CR24","doi-asserted-by":"publisher","unstructured":"Li B, Gu X (2006) Grey chance constrained programming for finite intermediate storage flow shop scheduling under uncertainty. In: 2006 6th world congress on intelligent control and automation, IEEE. https:\/\/doi.org\/10.1109\/wcica.2006.1713269","DOI":"10.1109\/wcica.2006.1713269"},{"key":"4213_CR25","doi-asserted-by":"publisher","first-page":"106,781","DOI":"10.1016\/j.cie.2020.106781","volume":"149","author":"Z Zhu","year":"2020","unstructured":"Zhu Z, Zhou X (2020) Flexible job-shop scheduling problem with job precedence constraints and interval grey processing time. Comput Ind Eng 149:106,781. https:\/\/doi.org\/10.1016\/j.cie.2020.106781https:\/\/doi.org\/10.1016\/j.cie.2020.106781","journal-title":"Comput Ind Eng"},{"issue":"3","key":"4213_CR26","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41(3):157\u2013183. https:\/\/doi.org\/10.1007\/bf02023073https:\/\/doi.org\/10.1007\/bf02023073","journal-title":"Ann Oper Res"},{"issue":"1","key":"4213_CR27","doi-asserted-by":"publisher","first-page":"123","DOI":"10.2507\/IJSIMM19-1-CO1","volume":"19","author":"DL Shi","year":"2020","unstructured":"Shi DL, Zhang BB, Li Y (2020) A multi-objective flexible job-shop scheduling model based on fuzzy theory and immune genetic algorithm. Int J Simul Model 19(1):123\u2013133. https:\/\/doi.org\/10.2507\/ijsimm19-1-co1","journal-title":"Int J Simul Model"},{"issue":"11","key":"4213_CR28","doi-asserted-by":"publisher","first-page":"3234","DOI":"10.1109\/TFUZZ.2020.3016225","volume":"29","author":"Jq Li","year":"2021","unstructured":"Li J q, Zm Liu, Li C, et al. (2021) Improved artificial immune system algorithm for type-2 fuzzy flexible job shop scheduling problem. IEEE Trans Fuzzy Syst 29(11):3234\u20133248. https:\/\/doi.org\/10.1109\/tfuzz.2020.3016225","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"8","key":"4213_CR29","doi-asserted-by":"publisher","first-page":"5295","DOI":"10.1109\/TSMC.2021.3120702","volume":"52","author":"Z Pan","year":"2022","unstructured":"Pan Z, Lei D, Wang L (2022) A bi-population evolutionary algorithm with feedback for energy-efficient fuzzy flexible job shop scheduling. IEEE Trans Syst Man Cybern Syst 52(8):5295\u20135307. https:\/\/doi.org\/10.1109\/tsmc.2021.3120702","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"4213_CR30","doi-asserted-by":"publisher","first-page":"117,380","DOI":"10.1016\/j.eswa.2022.117380","volume":"203","author":"R Li","year":"2022","unstructured":"Li R, Gong W, Lu C (2022) A reinforcement learning based RMOEA\/D for bi-objective fuzzy flexible job shop scheduling. Expert Syst Appl 203:117,380. https:\/\/doi.org\/10.1016\/j.eswa.2022.117380https:\/\/doi.org\/10.1016\/j.eswa.2022.117380","journal-title":"Expert Syst Appl"},{"key":"4213_CR31","doi-asserted-by":"publisher","first-page":"115,214","DOI":"10.1016\/j.eswa.2021.115214","volume":"182","author":"Z Zhu","year":"2021","unstructured":"Zhu Z, Zhou X (2021) A multi-objective multi-micro-swarm leadership hierarchy-based optimizer for uncertain flexible job shop scheduling problem with job precedence constraints. Expert Syst Appl 182:115,214. https:\/\/doi.org\/10.1016\/j.eswa.2021.115214","journal-title":"Expert Syst Appl"},{"issue":"1","key":"4213_CR32","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/TSM.2017.2758380","volume":"31","author":"T Jamrus","year":"2018","unstructured":"Jamrus T, Chien C F, Gen M et al (2018) Hybrid particle swarm optimization combined with genetic operators for flexible job-shop scheduling under uncertain processing time for semiconductor manufacturing. IEEE Trans Semicond Manuf 31(1):32\u201341. https:\/\/doi.org\/10.1109\/tsm.2017.2758380","journal-title":"IEEE Trans Semicond Manuf"},{"key":"4213_CR33","doi-asserted-by":"publisher","unstructured":"Yao L, Liu Y, Zhao H et al (2019) An improved UKPK-PSO algorithm inspired from block chain technology for flexible job shop scheduling problem. In: 2019 Chinese control conference (CCC). https:\/\/doi.org\/10.23919\/chicc.2019.8866111https:\/\/doi.org\/10.23919\/chicc.2019.8866111. IEEE, China, pp 2260\u20132265","DOI":"10.23919\/chicc.2019.8866111 10.23919\/chicc.2019.8866111"},{"issue":"12","key":"4213_CR34","doi-asserted-by":"publisher","first-page":"2873","DOI":"10.1108\/K-06-2019-0430","volume":"49","author":"Y Zhang","year":"2020","unstructured":"Zhang Y, Zhu H, Tang D (2020) An improved hybrid particle swarm optimization for multi-objective flexible job-shop scheduling problem. Kybernetes 49(12):2873\u20132892. https:\/\/doi.org\/10.1108\/k-06-2019-0430https:\/\/doi.org\/10.1108\/k-06-2019-0430","journal-title":"Kybernetes"},{"key":"4213_CR35","volume-title":"Research on methods for flexible job shop scheduling problems. PhD thesis","author":"GH Zhang","year":"2009","unstructured":"Zhang GH (2009) Research on methods for flexible job shop scheduling problems. PhD thesis. Huazhong University of Science and Technology, China"},{"issue":"3","key":"4213_CR36","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.11949\/j.issn.0438-1157.20161625 10.11949\/j.issn.0438-1157.20161625","volume":"68","author":"WX Xu","year":"2017","unstructured":"Xu WX, Wang Q, Bian WB et al (2017) Improved GA and global random machine selection based on key operation to solve FJSP. CIESC Journal 68(3):1073\u20131080. https:\/\/doi.org\/10.11949\/j.issn.0438-1157.20161625https:\/\/doi.org\/10.11949\/j.issn.0438-1157.20161625","journal-title":"CIESC Journal"},{"key":"4213_CR37","doi-asserted-by":"publisher","first-page":"323","DOI":"10.13196\/j.cims.2007.02.117.panqk.019","volume":"2","author":"QK Pan","year":"2007","unstructured":"Pan QK, Wang WH, Zhu JY et al (2007) Hybrid heuristics based on particle swarm optimization and variable neighborhood search for job shop scheduling. Comput Integr Manuf 2:323\u2013328. https:\/\/doi.org\/10.13196\/j.cims.2007.02.117.panqk.019","journal-title":"Comput Integr Manuf"},{"issue":"21","key":"4213_CR38","doi-asserted-by":"publisher","first-page":"2084","DOI":"10.1016\/j.tcs.2010.03.002","volume":"411","author":"D Sudholt","year":"2010","unstructured":"Sudholt D, Witt C (2010) Runtime analysis of a binary particle swarm optimizer. Theor Comput Sci 411(21):2084\u20132100. https:\/\/doi.org\/10.1016\/j.tcs.2010.03.002","journal-title":"Theor Comput Sci"},{"issue":"5","key":"4213_CR39","doi-asserted-by":"publisher","first-page":"3105","DOI":"10.1002\/app.25464","volume":"103","author":"W Cui","year":"2007","unstructured":"Cui W, Li X, Zhou S et al (2007) Investigation on process parameters of electrospinning system through orthogonal experimental design. J Appl Polym Sci 103(5):3105\u20133112. https:\/\/doi.org\/10.1002\/app.25464https:\/\/doi.org\/10.1002\/app.25464","journal-title":"J Appl Polym Sci"},{"issue":"2","key":"4213_CR40","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.eswa.2005.12.002","volume":"32","author":"BW Cheng","year":"2007","unstructured":"Cheng BW, Chang CL (2007) A study on flowshop scheduling problem combining taguchi experimental design and genetic algorithm. Expert Syst Appl 32(2):415\u2013421. https:\/\/doi.org\/10.1016\/j.eswa.2005.12.002https:\/\/doi.org\/10.1016\/j.eswa.2005.12.002","journal-title":"Expert Syst Appl"},{"issue":"2","key":"4213_CR41","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10845-014-0869-8","volume":"27","author":"KZ Gao","year":"2014","unstructured":"Gao KZ, Suganthan PN, Pan QK et al (2014) Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives. J Intell Manuf 27(2):363\u2013374. https:\/\/doi.org\/10.1007\/s10845-014-0869-8","journal-title":"J Intell Manuf"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-04213-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-04213-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-04213-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T03:46:59Z","timestamp":1685591219000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-04213-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,4]]},"references-count":41,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["4213"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-04213-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,4]]},"assertion":[{"value":"26 September 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}