{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T16:28:21Z","timestamp":1772209701089,"version":"3.50.1"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672461"],"award-info":[{"award-number":["61672461"]}],"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":["61672463"],"award-info":[{"award-number":["61672463"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2914261","type":"journal-article","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T20:09:32Z","timestamp":1556741372000},"page":"58602-58610","source":"Crossref","is-referenced-by-count":25,"title":["An Improved Chaotic Bat Swarm Scheduling Learning Model on Edge Computing"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5231-690X","authenticated-orcid":false,"given":"Chengfeng","family":"Jian","sequence":"first","affiliation":[]},{"given":"Jiawei","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Ping","sequence":"additional","affiliation":[]},{"given":"Meiyu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"287","article-title":"Job scheduling with adaptable computing levels for edge computing","author":"huiwen","year":"2018","journal-title":"Proc Int Conf Algorithms Architectures Parallel Process"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"1797","DOI":"10.1007\/s10586-018-2811-x","article-title":"A novel task scheduling approach based on dynamic queues and hybrid meta-heuristic algorithms for cloud computing environment","volume":"21","author":"hicham","year":"2018","journal-title":"Cluster Comput"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/EDGE.2018.00016"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.05.033"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1166\/jctn.2016.4864"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.5815\/ijisa.2014.05.02"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2593903"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/SEC.2018.00043"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2886757"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2019.03.005"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/WCICA.2012.6358305"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2716782"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SCC.2018.00017"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MCC.2017.30"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2018.2851241"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CYBERNETICSCOM.2017.8311689"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2016.145"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2015.2451649"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2018.1700202"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/j.future.2018.07.040","article-title":"Opportunistic edge computing: Concepts, opportunities and research challenges","volume":"89","author":"richard","year":"2018","journal-title":"Future Gener Comput Syst"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2507\/IJSIMM13(1)CO2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2780087"},{"key":"ref20","first-page":"21","article-title":"Chaotic harmony search optimizer for solving numerical integration","volume":"16","author":"el-santawy","year":"2012","journal-title":"Comput Inf Syst"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.03.054"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.02.050"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2017.2706085"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2871821"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2705720"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2875978"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08704178.pdf?arnumber=8704178","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:40:03Z","timestamp":1628624403000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8704178\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2914261","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}