{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:43:49Z","timestamp":1742957029686,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789811981517"},{"type":"electronic","value":"9789811981524"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-19-8152-4_16","type":"book-chapter","created":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T16:04:02Z","timestamp":1670601842000},"page":"216-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Improved ACS Algorithm by CA for Task Scheduling in Heterogeneous Multiprocessing Environments"],"prefix":"10.1007","author":[{"given":"Ningbo","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liangli","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muyuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,10]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"101704","DOI":"10.1016\/j.sysarc.2019.101704","volume":"105","author":"S Chang","year":"2020","unstructured":"Chang, S., Zhao, X., Liu, Z., Deng, Q.: Real-Time scheduling and analysis of parallel tasks on heterogeneous multi-cores. J. Syst. Arch. 105, 101704 (2020). https:\/\/doi.org\/10.1016\/j.sysarc.2019.101704","journal-title":"J. Syst. Arch."},{"key":"16_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-27477-4_5","volume-title":"The Theory of NP-Completeness","author":"I Wegener","year":"2005","unstructured":"Wegener, I.: The Theory of NP-Completeness. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/3-540-27477-4_5"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Dorigo, M.E.: Ant colony optimization and swarm intelligence. In: International Workshop (2006)","DOI":"10.1007\/11839088"},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Jangra, R., Kait, R.: Analysis and comparison among ant system; ant colony system and max-min ant system with different parameters setting. In: International Conference on Computational Intelligence & Communication Technology. IEEE (2017)","DOI":"10.1109\/CIACT.2017.7977376"},{"issue":"8","key":"16_CR6","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T Stutzle","year":"2000","unstructured":"Stutzle, T., Hoos, H.H.: Max-min ant system. Future Gener. Comput. Syst. 16(8), 889\u2013914 (2000)","journal-title":"Future Gener. Comput. Syst."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Dorostkar, F., Mirzakuchaki, S.: List scheduling for heterogeneous computing systems introducing a performance-effective definition for critical path. In: 2019 9TH International Conference on Computer and Knowledge Engineering (ICCKE 2019), Ferdowsi Univ Mashhad, Dept Comp Engn, 2019, 9th International Conference on Computer and Knowledge Engineering(ICCKE), Ferdowsi Univ Mashhad, Mashhad, Iran, 24\u201325 October 2019, pp. 356\u2013362 (2019)","DOI":"10.1109\/ICCKE48569.2019.8964738"},{"key":"16_CR8","unstructured":"Topcuoglu, H., Hariri, S., Wu, M.Y.: Task scheduling algorithms for heterogeneous processors, In: Heterogeneous Computing Workshop, 1999, (HCW 1999) Proceedings, Eighth (1999)"},{"issue":"3","key":"16_CR9","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/71.993206","volume":"13","author":"H Topcuoglu","year":"2002","unstructured":"Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance-effective and low-complex task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 13(3), 260\u2013260 (2002)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"6","key":"16_CR10","doi-asserted-by":"publisher","first-page":"4475","DOI":"10.1007\/s40747-021-00479-7","volume":"8","author":"H Zhang","year":"2022","unstructured":"Zhang, H., Wu, Y., Sun, Z.: EHEFT-R: multi-objective task scheduling scheme in cloud computing. Complex Intell. Syst. 8(6), 4475\u20134482 (2022). https:\/\/doi.org\/10.1007\/s40747-021-00479-7","journal-title":"Complex Intell. Syst."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Yuan, H., Zhao, Y., Kang, H.: The research and implementation of the criticalpath on a processor (cpop) algorithm based on pi calculus. In: Ma, Z.L., Fang, Z.G., Ke, J.F. (eds.) Proceedings of the 2016 International Conference on Computer Engineering, Information Science & Application Technology (ICCIA 2016), Vol. 56 of ACSR-Advances in Computer Science Research, 2016, International Conference on Computer Engineering, Information Science & Application Technology (ICCIA), Guilin, Peoples R China, 24\u201325 September 2016, pp. 337\u2013345 (2016)","DOI":"10.2991\/iccia-16.2016.62"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.jpdc.2019.12.012","volume":"138","author":"Q Tang","year":"2020","unstructured":"Tang, Q., Zhu, L.-H., Zhou, L., Xiong, J., Wei, J.-B.: Scheduling directed acyclic graphs with optimal duplication strategy on homogeneous multiprocessor systems. J. Parallel Distrib. Comput. 138, 115\u2013127 (2020). https:\/\/doi.org\/10.1016\/j.jpdc.2019.12.012","journal-title":"J. Parallel Distrib. Comput."},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"37262","DOI":"10.1109\/ACCESS.2021.3063456","volume":"9","author":"F Yao","year":"2021","unstructured":"Yao, F., Pu, C., Zhang, Z.: Task duplication-based scheduling algorithm for budget-constrained workflows in cloud computing. IEEE Access 9, 37262\u201337272 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3063456","journal-title":"IEEE Access"},{"issue":"10","key":"16_CR14","doi-asserted-by":"publisher","first-page":"1627","DOI":"10.1109\/JAS.2021.1004129","volume":"8","author":"J Tang","year":"2021","unstructured":"Tang, J., Liu, G., Pan, Q.: A review on representative swarm intelligence algorithms for solving optimization problems: applications and trends. IEEE-CAA J. Automatica Sinica 8(10), 1627\u20131643 (2021). https:\/\/doi.org\/10.1109\/JAS.2021.1004129","journal-title":"IEEE-CAA J. Automatica Sinica"},{"issue":"9\u201312","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1007\/s00170-014-5906-4","volume":"73","author":"AH Kashan","year":"2014","unstructured":"Kashan, A.H., Karimi, B., Noktehdan, A.: A novel discrete particle swarm optimization algorithm for the manufacturing cell formation problem. Int. J. Adv. Manuf. Technol. 73(9\u201312), 1543\u20131556 (2014)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Qamar, M.S., et al.: Improvement of traveling salesman problem solution using hybrid algorithm based on best-worst ant system and particle swarm optimization. Appl. Sci.-Basel 11(11) (2021). https:\/\/doi.org\/10.3390\/app11114780","DOI":"10.3390\/app11114780"},{"issue":"5","key":"16_CR17","doi-asserted-by":"publisher","first-page":"633","DOI":"10.15837\/ijccc.2014.5.1280","volume":"9","author":"X Wei","year":"2014","unstructured":"Wei, X., Han, L., Hong, L.: A modified ant colony algorithm for traveling salesman problem. Int. J. Comput. Commun. Control 9(5), 633\u2013643 (2014)","journal-title":"Int. J. Comput. Commun. Control"},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"Zhao, R., Liu, Q., Li, C., Wang, Y., Dong, D.: Performance comparison and application of swarm intelligence algorithms in crowd evacuation. In: 2020 the 4th International Conference on Management Engineering, Software Engineering and Service Sciences (ICMSS 2020), pp. 47\u201351, 4th International Conference on Management Engineering, Software Engineering and Service Sciences (ICMSS), Wuhan, Peoples R China, 17\u201319 January 2020 (2020). https:\/\/doi.org\/10.1145\/3380625.3380646","DOI":"10.1145\/3380625.3380646"},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"100846","DOI":"10.1016\/j.swevo.2021.100846","volume":"62","author":"A Maheri","year":"2021","unstructured":"Maheri, A., Jalili, S., Hosseinzadeh, Y., Khani, R., Miryahyavi, M.: A comprehensive survey on cultural algorithms. Swarm Evol. Comput. 62, 100846 (2021). https:\/\/doi.org\/10.1016\/j.swevo.2021.100846","journal-title":"Swarm Evol. Comput."},{"key":"16_CR20","doi-asserted-by":"publisher","unstructured":"Mojab, S.Z.M., Ebrahimi, M., Reynolds, R.G., Lu, S.: iCATS: scheduling big data workflows in the cloud using cultural algorithms. In: 2019 IEEE Fifth International Conference on Big Data Computing Service and Applications (IEEE Big Data Service 2019). IEEE; IEEE Comp Soc, 2019, 5th IEEE International Conference on Big Data Computing Service and Applications (IEEE BigDataService)\/Workshop on Big Data in Water Resources, Environment, and Hydraulic Engineering\/Workshop on Medical, Healthcare, Using Big Data Technologies, San Francisco, CA, 04\u201309 April 2019, pp. 99\u2013106 (2019). https:\/\/doi.org\/10.1109\/BigDataService.2019.00020","DOI":"10.1109\/BigDataService.2019.00020"},{"key":"16_CR21","doi-asserted-by":"publisher","unstructured":"Ying, W., Yan, T.: Research on network course setting based on the topological sort and activity on edge network. In: 2013 Fourth International Conference on Intelligent Systems Design and Engineering Applications, Cent S Univ; St Johns Univ; Hunan Univ Technol, Dept Elect Sci & Technol; Natl Univ Defense Technol; Intelligent Computat Technol & Automat Soci, 2013, 4th International Conference on Intelligent Systems Design and Engineering Applications (ISDEA), Zhangjiajie, Peoples R China, 06\u201307 November 2013, pp. 507\u2013510. https:\/\/doi.org\/10.1109\/ISDEA.2013.520","DOI":"10.1109\/ISDEA.2013.520"},{"key":"16_CR22","doi-asserted-by":"publisher","unstructured":"Lang, C.G.: Research on expanded critical path algorithm and its application. In: Wunsch, D.C., Tan, H.H., Zeng, D.H., Luo, Q. (eds.) Nanotechnology and Computer Engineering, vol. 121\u2013122 of Advanced Materials Research, Intelligent Informat Technol Applicat Res Assoc; Int Ind Elect Ctr; Wuhan Inst Technol, 2010, International Conference on Advances in Computer Science and Engineering, Qingdao, Peoples R China, 20\u201321 July 2010, pp. 300\u2013303 (2010). https:\/\/doi.org\/10.4028\/www.scientific.net\/AMR.121-122.300","DOI":"10.4028\/www.scientific.net\/AMR.121-122.300"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Akbari, M., Rashidi, H., Alizadeh, S.H.: An enhanced genetic algorithm with new operators for task scheduling in heterogeneous computing systems. In: Engineering Applications of Artificial Intelligence (2017)","DOI":"10.1016\/j.engappai.2017.02.013"}],"container-title":["Communications in Computer and Information Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-8152-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T16:14:28Z","timestamp":1670602468000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-8152-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811981517","9789811981524"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-8152-4_16","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NCTCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"National Conference of Theoretical Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changchun","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nctcs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.ccf.org.cn\/TCS2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"https:\/\/conf.ccf.org.cn\/TCS2022","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","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":"13","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":"6","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":"22% - 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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}