{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T09:42:18Z","timestamp":1778319738598,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T00:00:00Z","timestamp":1538611200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100007519","name":"Shiraz University of Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007519","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s12652-018-1071-1","type":"journal-article","created":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T02:07:57Z","timestamp":1538618877000},"page":"3469-3479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":114,"title":["An efficient Swarm-Intelligence approach for task scheduling in cloud-based internet of things applications"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0278-3649","authenticated-orcid":false,"given":"Hamid Reza","family":"Boveiri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raouf","family":"Khayami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Elhoseny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Gunasekaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,4]]},"reference":[{"issue":"12","key":"1071_CR1","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/361604.361619","volume":"17","author":"TL Adam","year":"1974","unstructured":"Adam TL, Chandy KM, Dickson JR (1974) A comparison of list schedules for parallel processing systems. Commun ACM 17(12):685\u2013690","journal-title":"Commun ACM"},{"key":"1071_CR2","unstructured":"Baxter J, PATEL J (1989) The LAST algorithm- A heuristic-based static task allocation algorithm. In: 1989 International Conference on Parallel Processing, University Park, PA"},{"key":"1071_CR3","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1016\/j.future.2015.09.021","volume":"56","author":"A Botta","year":"2016","unstructured":"Botta A, De Donato W, Persico V, Pescap\u00e9 A (2016) Integration of cloud computing and internet of things: a survey. Future Generation Computer Systems 56:684\u2013700","journal-title":"Future Generation Computer Systems"},{"key":"1071_CR4","doi-asserted-by":"crossref","unstructured":"Boveiri HR (2014) Assigning tasks to the processors for task-graph scheduling in parallel systems using learning and cellular learning automata. In Proc. 1st National Conf. on Computer Engineering and Information Technology, 2014, pp.\u00a01\u20138 (in Farsi)","DOI":"10.14257\/ijgdc.2015.8.1.05"},{"issue":"1","key":"1071_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.14257\/ijgdc.2015.8.1.05","volume":"8","author":"HR Boveiri","year":"2015","unstructured":"Boveiri HR (2015a) Multiprocessor task graph scheduling using a novel graph-like learning automata. Int J Grid Distribut Comput 8(1):41\u201354","journal-title":"Int J Grid Distribut Comput"},{"issue":"4","key":"1071_CR6","first-page":"123","volume":"9","author":"HR Boveiri","year":"2015","unstructured":"Boveiri HR (2015b) List-Scheduling Techniques in Homogeneous Multiprocessor Environments: A Survey. Int J Softw Eng Appl 9(4):123\u2013132","journal-title":"Int J Softw Eng Appl"},{"issue":"5","key":"1071_CR7","first-page":"233","volume":"9","author":"HR Boveiri","year":"2015","unstructured":"Boveiri HR (2015c) An efficient task priority measurement for list-scheduling in multiprocessor environments. Int J Softw Eng Appl 9(5):233\u2013246","journal-title":"Int J Softw Eng Appl"},{"issue":"12","key":"1071_CR8","first-page":"303","volume":"9","author":"HR Boveiri","year":"2015","unstructured":"Boveiri HR (2015d) Task Assigning Techniques for List-Scheduling in Homogeneous Multiprocessor Environments: A Survey. Int J Softw Eng Appl 9(12):303\u2013312","journal-title":"Int J Softw Eng Appl"},{"issue":"5","key":"1071_CR9","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1080\/18756891.2016.1237181","volume":"9","author":"HR Boveiri","year":"2016","unstructured":"Boveiri HR (2016) A Novel ACO-Based Static Task Scheduling Approach for Multiprocessor Environments. Int J Computat Intell Syst 9(5):800\u2013811","journal-title":"Int J Computat Intell Syst"},{"issue":"4","key":"1071_CR10","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1631\/FITEE.1500394","volume":"18","author":"HR Boveiri","year":"2017","unstructured":"Boveiri HR (2017) An incremental ant colony optimization based approach to task assignment to processors for multiprocessor scheduling. Front Inform Technol Electron Eng 18(4):498\u2013510","journal-title":"Front Inform Technol Electron Eng"},{"key":"1071_CR11","doi-asserted-by":"publisher","DOI":"10.17632\/4fycv9td56.2","author":"HR Boveiri","year":"2018","unstructured":"Boveiri HR (2018) 125 random task-graphs for multiprocessor task scheduling. Mendeley Data. \n                    https:\/\/doi.org\/10.17632\/4fycv9td56.2","journal-title":"Mendeley Data"},{"issue":"6","key":"1071_CR12","first-page":"3046","volume":"11","author":"HR Boveiri","year":"2017","unstructured":"Boveiri HR, Khayami R (2017) Static homogeneous multiprocessor task graph scheduling using ant colony optimization. KSII Trans Int Inform Syst (TIIS) 11(6):3046\u20133070","journal-title":"KSII Trans Int Inform Syst (TIIS)"},{"issue":"3","key":"1071_CR13","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s12652-016-0361-8","volume":"7","author":"GW Cassales","year":"2016","unstructured":"Cassales GW, Char\u00e3o AS, Kirsch-Pinheiro M, Souveyet C, Steffenel LA (2016) Improving the performance of Apache Hadoop on pervasive environments through context-aware scheduling. J Ambient Intell Humaniz Comput 7(3):333\u2013345","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"1071_CR14","volume-title":"Scheduling Theory and Its Application","author":"P Chretienne","year":"1995","unstructured":"Chretienne P et al (1995) Scheduling Theory and Its Application. Wiley, New York"},{"key":"1071_CR15","first-page":"91","volume-title":"Positive feedback as a search strategy. Final report","author":"M Dorigo","year":"1991","unstructured":"Dorigo M, Maniezzo V, Colorni A (1991) Positive feedback as a search strategy. Final report. Politecnico di Milano, Milan, pp. 91\u2013016"},{"issue":"2","key":"1071_CR16","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M Dorigo","year":"1999","unstructured":"Dorigo M, Caro GD, Gambardella LM (1999) Ant algorithms for discrete optimization. Artif Life 5(2):137\u2013172","journal-title":"Artif Life"},{"key":"1071_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-018-0914-0","author":"C Guerrero","year":"2018","unstructured":"Guerrero C, Lera I, Juiz C (2018) A lightweight decentralized service placement policy for performance optimization in fog computing. J Ambient Intell Humaniz Comput. \n                    https:\/\/doi.org\/10.1007\/s12652-018-0914-0","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"1071_CR18","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.jnca.2017.09.002","volume":"98","author":"P Hu","year":"2017","unstructured":"Hu P, Dhelim S, Ning H, Qiu T (2017) Survey on fog computing: architecture, key technologies, applications and open issues. J Netw Comput Appl 98:27\u201342. \n                    https:\/\/doi.org\/10.1016\/j.jnca.2017.09.002","journal-title":"J Netw Comput Appl"},{"issue":"2","key":"1071_CR19","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1137\/0218016","volume":"18","author":"JJ Hwang","year":"1989","unstructured":"Hwang JJ, Chow YC, Anger FD, Lee CY (1989) Scheduling precedence graphs in systems with interprocessor communication times. SIAM J Comput 18(2):244\u2013257","journal-title":"SIAM J Comput"},{"issue":"3","key":"1071_CR20","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1016\/j.cor.2006.05.013","volume":"35","author":"R Hwang","year":"2008","unstructured":"Hwang R, Gen M, Katayama H (2008) A comparison of multiprocessor task scheduling algorithms with communication costs. Comput Oper Res 35(3):976\u2013993","journal-title":"Comput Oper Res"},{"key":"1071_CR21","unstructured":"Kruatrachue B, Lewis TG. Duplication Scheduling Heuristics (DSH): A New Precedence Task Scheduler for Parallel Processor Systems. Final report. Oregon State University, Corvallis; 1987. Report No.: OR 97331"},{"issue":"9","key":"1071_CR22","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1145\/66451.66454","volume":"32","author":"C McCreary","year":"1989","unstructured":"McCreary C, Gill H (1989) Automatic determination of grain size for efficient parallel processing. Commun ACM 32(9):1073\u20131078","journal-title":"Commun ACM"},{"issue":"2","key":"1071_CR23","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1109\/71.207593","volume":"4","author":"GC Sih","year":"1993","unstructured":"Sih GC, Lee EA (1993) A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Trans Parallel Distrib Syst 4(2):175\u2013187","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1071_CR24","doi-asserted-by":"crossref","unstructured":"Stutzle T, Hoos H (1997) MAX-MIN ant system and local search for the traveling salesman problem. In: IEEE International Conference on Evolutionary Computation, 1997, pp.\u00a0309\u2013314","DOI":"10.1109\/ICEC.1997.592327"},{"key":"1071_CR25","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-7091-6492-1_54","volume-title":"Artificial Neural Nets and Genetic Algorithms","author":"T St\u00fctzle","year":"1998","unstructured":"St\u00fctzle T, Hoos H (1998) Improvements on the ant-system: Introducing the MAX-MIN ant system. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna, 1998, pp.\u00a0245\u2013249"},{"issue":"12","key":"1071_CR26","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1109\/JPROC.2017.2761740","volume":"105","author":"V Sze","year":"2017","unstructured":"Sze V, Chen YH, Yang TJ, Emer JS (2017) Efficient processing of deep neural networks: a tutorial and survey. Proc IEEE 105(12):2295\u20132329","journal-title":"Proc IEEE"},{"key":"1071_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-018-0926-9","author":"H Wang","year":"2018","unstructured":"Wang H, Wang Y (2018) Maximizing reliability and performance with reliability-driven task scheduling in heterogeneous distributed computing systems. J Ambient Intell Humaniz Comput. \n                    https:\/\/doi.org\/10.1007\/s12652-018-0926-9","journal-title":"J Ambient Intell Humaniz Comput"},{"issue":"3","key":"1071_CR28","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1109\/71.80160","volume":"1","author":"MY Wu","year":"1990","unstructured":"Wu MY, Gajski DD (1990) Hypertool: a programming aid for message-passing systems. IEEE Trans Parallel Distrib Syst 1(3):330\u2013343","journal-title":"IEEE Trans Parallel Distrib Syst"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-018-1071-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-018-1071-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-018-1071-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T19:04:59Z","timestamp":1570129499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-018-1071-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,4]]},"references-count":28,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["1071"],"URL":"https:\/\/doi.org\/10.1007\/s12652-018-1071-1","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,4]]},"assertion":[{"value":"4 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}