{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T00:08:27Z","timestamp":1744157307920,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030336066"},{"type":"electronic","value":"9783030336073"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-33607-3_47","type":"book-chapter","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T00:05:28Z","timestamp":1573085128000},"page":"437-445","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Artificial Flora Optimization Algorithm for Task Scheduling in Cloud Computing Environment"],"prefix":"10.1007","author":[{"given":"Nebojsa","family":"Bacanin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eva","family":"Tuba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timea","family":"Bezdan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivana","family":"Strumberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milan","family":"Tuba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,18]]},"reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"Mell, P.M., Grance, T.: Sp 800\u2013145. The NIST definition of cloud computing. Technical report, Gaithersburg, MD, United States (2011)","DOI":"10.6028\/NIST.SP.800-145"},{"key":"47_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.3390\/app8030329","volume":"8","author":"L Cheng","year":"2018","unstructured":"Cheng, L., Wu, X.-H., Wang, Y.: Artificial flora (AF) optimization algorithm. Appl. Sci. 8, 329 (2018)","journal-title":"Appl. Sci."},{"issue":"11","key":"47_CR3","doi-asserted-by":"publisher","first-page":"2515","DOI":"10.3390\/s19112515","volume":"19","author":"I Strumberger","year":"2019","unstructured":"Strumberger, I., Minovic, M., Tuba, M., Bacanin, N.: Performance of elephant herding optimization and tree growth algorithm adapted for node localization in wireless sensor networks. Sensors 19(11), 2515 (2019)","journal-title":"Sensors"},{"issue":"2","key":"47_CR4","first-page":"167","volume":"28","author":"RC Hrosik","year":"2019","unstructured":"Hrosik, R.C., Tuba, E., Dolicanin, E., Jovanovic, R., Tuba, M.: Brain image segmentation based on firefly algorithm combined with k-means clustering. Stud. Inf. Control 28(2), 167\u2013176 (2019)","journal-title":"Stud. Inf. Control"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Bacanin, N., Tuba, M.: Firefly algorithm for cardinality constrained mean-variance portfolio optimization problem with entropy diversity constraint. Sci. World J. Spec. Issue Comput. Intell. Metaheuristic Algorithms Appl. 2014, 16 (2014). Article ID 721521","DOI":"10.1155\/2014\/721521"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Tuba, E., Strumberger, I., Zivkovic, D., Bacanin, N., Tuba, M.: Mobile robot path planning by improved brain storm optimization algorithm. In: 2018 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138, July 2018","DOI":"10.1109\/CEC.2018.8477928"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Strumberger, I., Tuba, E., Bacanin, N., Beko, M., Tuba, M.: Modified monarch butterfly optimization algorithm for RFID network planning. In: 2018 6th International Conference on Multimedia Computing and Systems, pp. 1\u20136 (2018)","DOI":"10.1109\/ICMCS.2018.8525930"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Strumberger, I., Tuba, E., Bacanin, N., Zivkovic, M., Beko, M., Tuba, M.: Designing convolutional neural network architecture by the firefly algorithm. In: 2019 International Young Engineers Forum (YEF-ECE), pp. 59\u201365, May 2019","DOI":"10.1109\/YEF-ECE.2019.8740818"},{"issue":"3","key":"47_CR9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.eij.2015.07.001","volume":"16","author":"M Kalra","year":"2015","unstructured":"Kalra, M., Singh, S.: A review of metaheuristic scheduling techniques in cloud computing. Egypt. Inf. J. 16(3), 275\u2013295 (2015)","journal-title":"Egypt. Inf. J."},{"key":"47_CR10","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1186\/s13638-018-1259-2","volume":"2018","author":"J Li","year":"2018","unstructured":"Li, J., et al.: Task scheduling algorithm based on fireworks algorithm. EURASIP J. Wireless Commun. Netw. 2018, 256 (2018)","journal-title":"EURASIP J. Wireless Commun. Netw."},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"Sreenu, K., Sreelatha, M.: W-scheduler: whale optimization for task scheduling in cloud computing. Cluster Comput. (2017)","DOI":"10.1007\/s10586-017-1055-5"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33607-3_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:59:03Z","timestamp":1710251943000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-33607-3_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030336066","9783030336073"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33607-3_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"18 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IDEAL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Data Engineering and Automated Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Manchester","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ideal2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.confercare.manchester.ac.uk\/events\/ideal2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"149","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"94","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}