{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T23:07:19Z","timestamp":1772752039972,"version":"3.50.1"},"update-to":[{"DOI":"10.1007\/s00779-021-01622-4","type":"retraction","label":"Retraction","source":"retraction-watch","updated":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"record-id":"34490"},{"DOI":"10.1007\/s00779-021-01622-4","type":"retraction","label":"Retraction","source":"publisher","updated":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T00:00:00Z","timestamp":1628640000000}}],"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T00:00:00Z","timestamp":1628640000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T00:00:00Z","timestamp":1628640000000},"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":["Pers Ubiquit Comput"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s00779-021-01622-4","type":"journal-article","created":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T15:04:46Z","timestamp":1628694286000},"page":"19-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["RETRACTED ARTICLE: Edge computing and financial service industry financing risk innovation based on data mining technology"],"prefix":"10.1007","volume":"25","author":[{"given":"Qiaoping","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengze","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bae","family":"Ki-Hyung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"issue":"1","key":"1622_CR1","first-page":"115","volume":"30","author":"A Mahmood","year":"2001","unstructured":"Mahmood A (2001) Task allocation algorithms for maximizing reliability of heterogeneous distributed computing systems. Control Cybern 30(1):115\u2013130","journal-title":"Control Cybern"},{"key":"1622_CR2","doi-asserted-by":"crossref","unstructured":"RA. Na\u2019mnch and KA. Darabkh (2013) A new genetic-based algorithm for scheduling static tasks in homogeneous parallel systems. In: International conference on robotics, biomimetics, intelligent computational systems (ROBIONETICS) 59(6):46\u201350.","DOI":"10.1109\/ROBIONETICS.2013.6743576"},{"issue":"10","key":"1622_CR3","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1016\/j.jpdc.2013.04.007","volume":"73","author":"M Naderam","year":"2012","unstructured":"Naderam M, Dehgham M, Goddard S (2012) Upper and lower bounds for dynamic cluster assignment for multi-agent tracking in heterogeneous WSNs. J Parallel Distrib Comput 73(10):1389\u20131399","journal-title":"J Parallel Distrib Comput"},{"issue":"5","key":"1622_CR4","doi-asserted-by":"publisher","first-page":"1876","DOI":"10.1109\/TII.2017.2757606","volume":"14","author":"P Neamatollahi","year":"2018","unstructured":"Neamatollahi P, Abrishami S, Naghibzadeh M, Moghaddam MHY (2018) Hierarchical clustering-task scheduling policy in cluster-based wireless sensor networks. IEEE Trans Ind Inf 14(5):1876\u20131886","journal-title":"IEEE Trans Ind Inf"},{"issue":"1","key":"1622_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.asoc.2009.07.001","volume":"10","author":"T Niknam","year":"2010","unstructured":"Niknam T, Amiri B (2010) An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis. Appl Soft Comput 10(1):183\u2013197","journal-title":"Appl Soft Comput"},{"issue":"4","key":"1622_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0164-1212(02)00147-4","volume":"71","author":"J Oh","year":"2004","unstructured":"Oh J, Wu C (2004) Genetic-algorithm-based real-time task scheduling with multiple goals. J Syst Softw 71(4):245\u2013258","journal-title":"J Syst Softw"},{"issue":"1","key":"1622_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.jpdc.2009.09.009","volume":"70","author":"FA Omara","year":"2010","unstructured":"Omara FA, Arafa MM (2010) Genetic algorithms for task scheduling problem. J Parallel Distrib Comput 70(1):13\u201322","journal-title":"J Parallel Distrib Comput"},{"key":"1622_CR8","doi-asserted-by":"crossref","unstructured":"Peng DT and Shin KG (1989) Static allocation of periodic tasks with precedence constraints in distributed real-time system. In: Proceedings of 9th international conference on distributed computing systems 69(7) 1587-1593.","DOI":"10.1109\/ICDCS.1989.37947"},{"issue":"12","key":"1622_CR9","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1109\/32.637388","volume":"23","author":"DT Peng","year":"1997","unstructured":"Peng DT, Shin KG, Abdelzaher TF (1997) Assignment and scheduling communicating periodic tasks in distributed real-time systems. IEEE Trans Softw Eng 23(12):745\u2013758","journal-title":"IEEE Trans Softw Eng"},{"key":"1622_CR10","doi-asserted-by":"crossref","unstructured":"Rahman MM and Chowdhury MFI (2009) Examining branch and bound strategy on multiprocessor task scheduling. In: Proceedings of 12th international conference on computer and information technology (ICCIT) 25(7):162\u2013167.","DOI":"10.1109\/ICCIT.2009.5407146"},{"issue":"2","key":"1622_CR11","first-page":"58","volume":"7","author":"AM Rahmani","year":"2008","unstructured":"Rahmani AM, Vahedi MA (2008) A novel task scheduling in multiprocessor systems with genetic algorithm by using elitism stepping method. INFOCOMP J Comput Sci 7(2):58\u201364","journal-title":"INFOCOMP J Comput Sci"},{"issue":"1","key":"1622_CR12","first-page":"263","volume":"10","author":"R Raikwar","year":"2018","unstructured":"Raikwar R, Upadhyay V, Shukla MK (2018) A heuristic tasks allocation algorithm. Int J Theor Appl Sci 10(1):263\u2013268","journal-title":"Int J Theor Appl Sci"},{"issue":"4","key":"1622_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.5121\/ijdps.2012.3412","volume":"3","author":"P Roy","year":"2012","unstructured":"Roy P, Alam MMU, Das N (2012) Heuristic based task scheduling in multiprocessor systems with genetic algorithm by choosing the eligible processor. Int J Distrib Parallel Syst (IJDPS) 3(4):111\u2013121","journal-title":"Int J Distrib Parallel Syst (IJDPS)"},{"issue":"6","key":"1622_CR14","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.swevo.2013.10.002","volume":"14","author":"AK Samal","year":"2014","unstructured":"Samal AK, Mall R, Tripathy C (2014) Fault tolerant scheduling of hard real-time tasks on multiprocessor system using a hybrid genetic algorithm. Swarm Evol Comput 14(6):92\u2013105","journal-title":"Swarm Evol Comput"},{"issue":"5","key":"1622_CR15","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1049\/ip-e.1991.0043","volume":"138","author":"AK Sarje","year":"1991","unstructured":"Sarje AK, Sagar G (1991a) Heuristic model for task allocation in distributed computer systems. IEEE Proc Eng Comput Digit Tech 138(5):313\u2013318","journal-title":"IEEE Proc Eng Comput Digit Tech"},{"issue":"9","key":"1622_CR16","doi-asserted-by":"publisher","first-page":"1671","DOI":"10.1080\/00207729108910740","volume":"22","author":"AK Sarje","year":"1991","unstructured":"Sarje AK, Sagar AK (1991b) Task allocation model for distributed systems. Int J Syst Sci 22(9):1671\u20131678","journal-title":"Int J Syst Sci"},{"issue":"6","key":"1622_CR17","first-page":"11116","volume":"4","author":"U Sharma","year":"2016","unstructured":"Sharma U, Sharma PS (2016) Task allocation technique in distributed computing system for utilization of processors by reducing inter task communication cost. Int J Innov Res Comput Commun Eng 4(6):11116\u201311124","journal-title":"Int J Innov Res Comput Commun Eng"},{"issue":"2","key":"1622_CR18","first-page":"67","volume":"4","author":"S Sharma","year":"2011","unstructured":"Sharma S, Singh KR, Yadav PK (2011) A general approach for proper mapping of task for efficient utilization of processor in distributed processing system. Int J Comput Sci Inf Technol 4(2):67\u201373","journal-title":"Int J Comput Sci Inf Technol"},{"issue":"9","key":"1622_CR19","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1109\/12.165396","volume":"41","author":"SM Shatz","year":"1992","unstructured":"Shatz SM, Wang JP, Goto M (1992) Task allocation for maximizing reliability of distributed computing system. IEEE Trans Comput 41(9):1156\u20131168","journal-title":"IEEE Trans Comput"},{"issue":"5","key":"1622_CR20","doi-asserted-by":"publisher","first-page":"10","DOI":"10.9790\/0661-16521018","volume":"16","author":"S Singh","year":"2014","unstructured":"Singh S, Garg ML (2014) Task allocation in heterogeneous distributed real time system for optimal utilization of processor\u2019s capacity. IOSR J Comput Eng (IOSR-JCE) 16(5):10\u201318","journal-title":"IOSR J Comput Eng (IOSR-JCE)"}],"updated-by":[{"DOI":"10.1007\/s00779-021-01622-4","type":"retraction","label":"Retraction","source":"retraction-watch","updated":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"record-id":"34490"},{"DOI":"10.1007\/s00779-021-01656-8","type":"expression_of_concern","label":"Expression of concern","source":"retraction-watch","updated":{"date-parts":[[2021,9,28]],"date-time":"2021-09-28T00:00:00Z","timestamp":1632787200000},"record-id":"34491"},{"DOI":"10.1007\/s00779-021-01622-4","type":"expression_of_concern","label":"Expression of concern","source":"publisher","updated":{"date-parts":[[2021,9,28]],"date-time":"2021-09-28T00:00:00Z","timestamp":1632787200000}},{"DOI":"10.1007\/s00779-021-01622-4","type":"retraction","label":"Retraction","source":"publisher","updated":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T00:00:00Z","timestamp":1628640000000}},{"DOI":"10.1007\/s00779-021-01656-8","type":"expression_of_concern","label":"Expression of concern","source":"publisher","updated":{"date-parts":[[2021,9,28]],"date-time":"2021-09-28T00:00:00Z","timestamp":1632787200000}}],"container-title":["Personal and Ubiquitous Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00779-021-01622-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00779-021-01622-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00779-021-01622-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T11:12:06Z","timestamp":1772709126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00779-021-01622-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,11]]},"references-count":20,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["1622"],"URL":"https:\/\/doi.org\/10.1007\/s00779-021-01622-4","relation":{},"ISSN":["1617-4909","1617-4917"],"issn-type":[{"value":"1617-4909","type":"print"},{"value":"1617-4917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,11]]},"assertion":[{"value":"11 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2021","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"ExpressionOfConcern","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"An Editorial Expression of Concern to this paper has been published:","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s00779-021-01656-8","URL":"https:\/\/doi.org\/10.1007\/s00779-021-01656-8","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}