{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T01:37:41Z","timestamp":1778549861087,"version":"3.51.4"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031304446","type":"print"},{"value":"9783031304453","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30445-3_21","type":"book-chapter","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T09:02:52Z","timestamp":1682499772000},"page":"248-259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Machine Learning-Based Online Scheduling in\u00a0Distributed Computing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1484-2255","authenticated-orcid":false,"given":"Victor","family":"Toporkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9359-8245","authenticated-orcid":false,"given":"Dmitry","family":"Yemelyanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artem","family":"Bulkhak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,27]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Bharathi, S., Chervenak, A.L., Deelman, E., Mehta, G., Su, M., Vahi, K.: Characterization of scientific workflows. In: 2008 Third Workshop on Workflows in Support of Large-Scale Science, pp. 1\u201310 (2008)","DOI":"10.1109\/WORKS.2008.4723958"},{"issue":"P2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1016\/j.future.2017.05.009","volume":"79","author":"MA Rodriguez","year":"2018","unstructured":"Rodriguez, M.A., Buyya, R.: Scheduling dynamic workloads in multi-tenant scientific workflow as a service platforms. Future Gener. Comput. Syst. 79(P2), 739\u2013750 (2018)","journal-title":"Future Gener. Comput. Syst."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Kurowski, K., Nabrzyski, J., Oleksiak, A., Weglarz, J.: multicriteria aspects of grid resource management. In: Nabrzyski, J., Schopf, J.M., Weglarz J. (eds.) Grid Resource Management. State of the Art and Future Trends, pp. 271\u2013293. Kluwer Academic Publishers. (2003)","DOI":"10.1007\/978-1-4615-0509-9_18"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Toporkov, V., Yemelyanov, D.: Coordinated and hindsight resources allocation in distributed computing. In: Proceedings - 2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT (2019)","DOI":"10.1109\/PDCAT46702.2019.00023"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"102228","DOI":"10.1016\/j.simpat.2020.102228","volume":"107","author":"V Toporkov","year":"2021","unstructured":"Toporkov, V., Yemelyanov, D., Toporkova, A.: Coordinated global and private job-flow scheduling in grid virtual organizations. J. Simul. Model. Pract. Theor. 107, 102228 (2021)","journal-title":"J. Simul. Model. Pract. Theor."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"7857","DOI":"10.1007\/s11227-018-2553-9","volume":"75","author":"O Sukhoroslov","year":"2019","unstructured":"Sukhoroslov, O., Nazarenko, A., Aleksandrov, R.: An experimental study of scheduling algorithms for many-task applications. J. Supercomput. 75, 7857\u20137871 (2019)","journal-title":"J. Supercomput."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Samimi, P., Teimouri, Y., Mukhtar M.: A combinatorial double auction resource allocation model in cloud computing. J. Inf. Sci. 357(C), 201\u2013216 (2016)","DOI":"10.1016\/j.ins.2014.02.008"},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10723-013-9252-9","volume":"11","author":"I Rodero","year":"2013","unstructured":"Rodero, I., Villegas, D., Bobroff, N., Liu, Y., Fong, L., Sadjadi, S.: Enabling interoperability among grid meta-schedulers. J. Grid Comput. 11(2), 311\u2013336 (2013)","journal-title":"J. Grid Comput."},{"issue":"9","key":"21_CR9","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1016\/j.jpdc.2005.05.003","volume":"65","author":"E Shmueli","year":"2005","unstructured":"Shmueli, E., Feitelson, D.G.: Backfilling with lookahead to optimize the packing of parallel jobs. J. Parallel Distrib. Comput. 65(9), 1090\u20131107 (2005)","journal-title":"J. Parallel Distrib. Comput."},{"key":"21_CR10","unstructured":"Khemka, B., et al.: Resource management in heterogeneous parallel computing environments with soft and hard deadlines. In: Proceedings of 11th Metaheuristics International Conference (MIC 2015) (2015)"},{"key":"21_CR11","unstructured":"Netto, M.A.S., Buyya, R.: A flexible resource co-allocation model based on advance reservations with rescheduling support. In: Technical Report, GRIDSTR-2007-17, Grid Computing and Distributed Systems Laboratory, The University of Melbourne, Australia (2007)"},{"key":"21_CR12","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-99626-4_4","volume-title":"Intelligent Distributed Computing XII","author":"V Toporkov","year":"2018","unstructured":"Toporkov, V., Toporkova, A., Yemelyanov, D.: Slot co-allocation optimization in\u00a0distributed computing with\u00a0heterogeneous resources. In: Del Ser, J., Osaba, E., Bilbao, M.N., Sanchez-Medina, J.J., Vecchio, M., Yang, X.-S. (eds.) IDC 2018. SCI, vol. 798, pp. 40\u201349. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99626-4_4"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/978-3-319-93701-4_45","volume-title":"Computational Science","author":"V Toporkov","year":"2018","unstructured":"Toporkov, V., Yemelyanov, D.: Optimization of resources selection for jobs scheduling in heterogeneous distributed computing environments. In: Shi, Y., et al. (eds.) ICCS 2018. LNCS, vol. 10861, pp. 574\u2013583. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93701-4_45"},{"key":"21_CR14","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-030-76773-0_43","volume-title":"Theory and Engineering of Dependable Computer Systems and Networks","author":"V Toporkov","year":"2021","unstructured":"Toporkov, V., Yemelyanov, D.: Scheduling optimization in heterogeneous computing environments with resources of different types. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds.) DepCoS-RELCOMEX 2021. AISC, vol. 1389, pp. 447\u2013456. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76773-0_43"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Xu, S., Panwar, S.S., Kodialam, M.S., Lakshman, T.V.: Deep neural network approximated dynamic programming for combinatorial optimization. In: AAAI Conference on Artificial Intelligence, pp. 1684\u20131691 (2020)","DOI":"10.1609\/aaai.v34i02.5531"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Nomer, H.A.A., Alnowibet, K.A., Elsayed, A., Mohamed, A.W.: Neural knapsack: a neural network based solver for the knapsack problem. In: IEEE Access, vol. 8, pp. 224200\u2013224210 (2020)","DOI":"10.1109\/ACCESS.2020.3044005"},{"key":"21_CR17","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural Combinatorial Optimization with Reinforcement Learning. In: International Conference on Learning Representations (2017)"},{"key":"21_CR18","unstructured":"Yang, F., Jin, T., Liu, T., Sun, X., Zhang, J.: Boosting dynamic programming with neural networks for solving NP-hard problems. In: Proceedings of The 10th Asian Conference on Machine Learning, PMLR, vol. 95, pp. 726\u2013739 (2018)"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"205","DOI":"10.3390\/a15060205","volume":"15","author":"X Yang","year":"2022","unstructured":"Yang, X., et al.: A review: machine learning for combinatorial optimization problems in energy areas. Algorithms 15, 205 (2022)","journal-title":"Algorithms"},{"issue":"2","key":"21_CR20","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30445-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T04:44:44Z","timestamp":1760071484000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30445-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031304446","9783031304453"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30445-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Processing and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gdansk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"11 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppam2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppam.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}