{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T11:46:14Z","timestamp":1750938374851,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819708338"},{"type":"electronic","value":"9789819708345"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-0834-5_14","type":"book-chapter","created":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T02:02:48Z","timestamp":1710208968000},"page":"224-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Smart DAG Task Scheduling Based on\u00a0MCTS Method of\u00a0Multi-strategy Learning"],"prefix":"10.1007","author":[{"given":"Lang","family":"Shu","sequence":"first","affiliation":[]},{"given":"Guanyan","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Bei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Wenbing","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Minhui","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Yifei","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Fanding","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Songchen","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yuxia","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,12]]},"reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3306346.3322967","volume":"38","author":"A Adams","year":"2019","unstructured":"Adams, A., et al.: Learning to optimize halide with tree search and random programs. ACM Trans. Graph. (TOG) 38(4), 1\u201312 (2019)","journal-title":"ACM Trans. Graph. (TOG)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Ahmad, S.G., Munir, E.U., Nisar, W.: PEGA: a performance effective genetic algorithm for task scheduling in heterogeneous systems. In: 2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems, pp. 1082\u20131087. IEEE (2012)","DOI":"10.1109\/HPCC.2012.158"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1109\/TPDS.2013.57","volume":"25","author":"H Arabnejad","year":"2013","unstructured":"Arabnejad, H., Barbosa, J.G.: List scheduling algorithm for heterogeneous systems by an optimistic cost table. IEEE Trans. Parallel Distrib. Syst. 25(3), 682\u2013694 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"106506","DOI":"10.1109\/ACCESS.2020.2997812","volume":"8","author":"DI Arkhipov","year":"2020","unstructured":"Arkhipov, D.I., Wu, D., Wu, T., Regan, A.C.: A parallel genetic algorithm framework for transportation planning and logistics management. IEEE Access 8, 106506\u2013106515 (2020)","journal-title":"IEEE Access"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.future.2018.09.014","volume":"91","author":"A Arunarani","year":"2019","unstructured":"Arunarani, A., Manjula, D., Sugumaran, V.: Task scheduling techniques in cloud computing: a literature survey. Future Gener. Comput. Syst. 91, 407\u2013415 (2019)","journal-title":"Future Gener. Comput. Syst."},{"issue":"2\u20133","key":"14_CR6","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1177\/0278364918755924","volume":"38","author":"G Best","year":"2019","unstructured":"Best, G., Cliff, O.M., Patten, T., Mettu, R.R., Fitch, R.: DEC-MCTS: Decentralized planning for multi-robot active perception. Int. J. Rob. Res. 38(2\u20133), 316\u2013337 (2019)","journal-title":"Int. J. Rob. Res."},{"issue":"12","key":"14_CR7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.127.120502","volume":"127","author":"L Bittel","year":"2021","unstructured":"Bittel, L., Kliesch, M.: Training variational quantum algorithms is np-hard. Phys. Rev. Lett. 127(12), 120502 (2021)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"CB Browne","year":"2012","unstructured":"Browne, C.B., et al.: A survey of monte carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"issue":"7","key":"14_CR9","doi-asserted-by":"publisher","first-page":"1826","DOI":"10.3390\/su11071826","volume":"11","author":"Y Cheng","year":"2019","unstructured":"Cheng, Y., Wu, Z., Liu, K., Wu, Q., Wang, Y.: Smart dag tasks scheduling between trusted and untrusted entities using the mcts method. Sustainability 11(7), 1826 (2019)","journal-title":"Sustainability"},{"key":"14_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106605","volume":"147","author":"FM Defersha","year":"2020","unstructured":"Defersha, F.M., Rooyani, D.: An efficient two-stage genetic algorithm for a flexible job-shop scheduling problem with sequence dependent attached\/detached setup, machine release date and lag-time. Comput. Ind. Eng. 147, 106605 (2020)","journal-title":"Comput. Ind. Eng."},{"issue":"5","key":"14_CR11","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1109\/TPDS.2020.3041829","volume":"32","author":"H Djigal","year":"2020","unstructured":"Djigal, H., Feng, J., Lu, J., Ge, J.: IPPTS: an efficient algorithm for scientific workflow scheduling in heterogeneous computing systems. IEEE Trans. Parallel Distrib. Syst. 32(5), 1057\u20131071 (2020)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Hu, Z., Tu, J., Li, B.: Spear: optimized dependency-aware task scheduling with deep reinforcement learning. In: 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS), pp. 2037\u20132046. IEEE (2019)","DOI":"10.1109\/ICDCS.2019.00201"},{"issue":"6","key":"14_CR13","doi-asserted-by":"publisher","first-page":"4909","DOI":"10.1109\/TITS.2021.3054625","volume":"23","author":"BR Kiran","year":"2021","unstructured":"Kiran, B.R., et al.: Deep reinforcement learning for autonomous driving: a survey. IEEE Trans. Intell. Transp. Syst. 23(6), 4909\u20134926 (2021)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"14_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117796","volume":"205","author":"K Lei","year":"2022","unstructured":"Lei, K., et al.: A multi-action deep reinforcement learning framework for flexible job-shop scheduling problem. Expert Syst. Appl. 205, 117796 (2022)","journal-title":"Expert Syst. Appl."},{"key":"14_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107211","volume":"155","author":"K Li","year":"2021","unstructured":"Li, K., Deng, Q., Zhang, L., Fan, Q., Gong, G., Ding, S.: An effective mcts-based algorithm for minimizing makespan in dynamic flexible job shop scheduling problem. Comput. Ind. Eng. 155, 107211 (2021)","journal-title":"Comput. Ind. Eng."},{"key":"14_CR16","first-page":"429","volume":"2","author":"T Li","year":"2020","unstructured":"Li, T., Sahu, A.K., Zaheer, M., Sanjabi, M., Talwalkar, A., Smith, V.: Federated optimization in heterogeneous networks. Proc. Mach. Learn. Syst. 2, 429\u2013450 (2020)","journal-title":"Proc. Mach. Learn. Syst."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Mao, H., Schwarzkopf, M., Venkatakrishnan, S.B., Meng, Z., Alizadeh, M.: Learning scheduling algorithms for data processing clusters. In: Proceedings of the ACM Special Interest Group on Data Communication, pp. 270\u2013288 (2019)","DOI":"10.1145\/3341302.3342080"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Mirjalili, S., Mirjalili, S.: Genetic algorithm. In: Evolutionary Algorithms and Neural Networks: Theory and Applications, pp. 43\u201355 (2019)","DOI":"10.1007\/978-3-319-93025-1_4"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.jpdc.2017.05.001","volume":"117","author":"AI Orhean","year":"2018","unstructured":"Orhean, A.I., Pop, F., Raicu, I.: New scheduling approach using reinforcement learning for heterogeneous distributed systems. J. Parallel Distrib. Comput. 117, 292\u2013302 (2018)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"14_CR20","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10586-018-2858-8","volume":"22","author":"SK Panda","year":"2019","unstructured":"Panda, S.K., Jana, P.K.: An energy-efficient task scheduling algorithm for heterogeneous cloud computing systems. Clust. Comput. 22(2), 509\u2013527 (2019)","journal-title":"Clust. Comput."},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Prates, M., Avelar, P.H., Lemos, H., Lamb, L.C., Vardi, M.Y.: Learning to solve np-complete problems: a graph neural network for decision tsp. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 4731\u20134738 (2019)","DOI":"10.1609\/aaai.v33i01.33014731"},{"key":"14_CR22","first-page":"27580","volume":"34","author":"J Schrittwieser","year":"2021","unstructured":"Schrittwieser, J., Hubert, T., Mandhane, A., Barekatain, M., Antonoglou, I., Silver, D.: Online and offline reinforcement learning by planning with a learned model. Adv. Neural. Inf. Process. Syst. 34, 27580\u201327591 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"7676","key":"14_CR23","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1038\/nature24270","volume":"550","author":"D Silver","year":"2017","unstructured":"Silver, D., et al.: Mastering the game of go without human knowledge. Nature 550(7676), 354\u2013359 (2017)","journal-title":"Nature"},{"issue":"3","key":"14_CR24","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-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 13(3), 260\u2013274 (2002)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"14_CR25","first-page":"26","volume":"17","author":"J Wu","year":"2019","unstructured":"Wu, J., Chen, X.Y., Zhang, H., Xiong, L.D., Lei, H., Deng, S.H.: Hyperparameter optimization for machine learning models based on bayesian optimization. J. Electron. Sci. Technol. 17(1), 26\u201340 (2019)","journal-title":"J. Electron. Sci. Technol."},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.neucom.2020.07.061","volume":"415","author":"L Yang","year":"2020","unstructured":"Yang, L., Shami, A.: On hyperparameter optimization of machine learning algorithms: theory and practice. Neurocomputing 415, 295\u2013316 (2020)","journal-title":"Neurocomputing"},{"key":"14_CR27","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)","journal-title":"IEEE Access"},{"key":"14_CR28","first-page":"1621","volume":"33","author":"C Zhang","year":"2020","unstructured":"Zhang, C., Song, W., Cao, Z., Zhang, J., Tan, P.S., Chi, X.: Learning to dispatch for job shop scheduling via deep reinforcement learning. Adv. Neural. Inf. Process. Syst. 33, 1621\u20131632 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Cao, S., Yan, L.: List scheduling algorithm based on pre-scheduling for heterogeneous computing. In: 2019 IEEE International Conference on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA\/BDCloud\/SocialCom\/SustainCom), pp. 588\u2013595. IEEE (2019)","DOI":"10.1109\/ISPA-BDCloud-SustainCom-SocialCom48970.2019.00089"},{"issue":"12","key":"14_CR30","doi-asserted-by":"publisher","first-page":"1673","DOI":"10.1016\/j.jpdc.2013.07.019","volume":"73","author":"W Zheng","year":"2013","unstructured":"Zheng, W., Sakellariou, R.: Stochastic dag scheduling using a monte carlo approach. J. Parallel Distrib. Comput. 73(12), 1673\u20131689 (2013)","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0834-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T02:05:38Z","timestamp":1710209138000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0834-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819708338","9789819708345"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0834-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"12 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tjutanklab.com\/ica3pp2023\/","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":"Online submission system","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"439","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":"145","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":"33% - 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":"5","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)"}}]}}