{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T11:32:21Z","timestamp":1774870341631,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031812408","type":"print"},{"value":"9783031812415","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-81241-5_17","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T13:45:45Z","timestamp":1735652745000},"page":"241-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Heuristics with\u00a0Local Improvements for\u00a0Two-Processor Scheduling Problem with\u00a0Energy Constraint and\u00a0Parallelization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4791-7011","authenticated-orcid":false,"given":"Yulia V.","family":"Zakharova","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1548-0804","authenticated-orcid":false,"given":"M.Yu.","family":"Sakhno","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,1]]},"reference":[{"key":"17_CR1","unstructured":"Intel. OneAPI Math Kernel Library. https:\/\/github.com\/oneapi-src\/oneMKL"},{"key":"17_CR2","unstructured":"Scheduling seminar. https:\/\/schedulingseminar.com\/"},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Bampis, E., Letsios, D., Lucarelli, G.: A note on multiprocessor speed scaling with precedence constraints. In: Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, pp. 138\u2013142. ACM (2014). https:\/\/doi.org\/10.1145\/2612669.2612672","DOI":"10.1145\/2612669.2612672"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s10951-009-0123-y","volume":"12","author":"D Bunde","year":"2009","unstructured":"Bunde, D.: Power-aware scheduling for makespan and flow. J. Sched. 12, 489\u2013500 (2009). https:\/\/doi.org\/10.1007\/s10951-009-0123-y","journal-title":"J. Sched."},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Cai, X., Lee, C.Y., Li, C.L.: Minimizing total completion time in two-processor task systems with prespecified processor allocation. Nav. Res. Logist. 45(2), 231\u2013242 (1998)","DOI":"10.1002\/(SICI)1520-6750(199803)45:2<231::AID-NAV7>3.3.CO;2-0"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BFb0027029","volume-title":"Artificial Neural Networks","author":"Y Crama","year":"1995","unstructured":"Crama, Y., Kolen, A.W.J., Pesch, E.J.: Local search in combinatorial optimization. In: Braspenning, P.J., Thuijsman, F., Weijters, A.J.M.M. (eds.) Neural Network School 1999. LNCS, vol. 931, pp. 157\u2013174. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0027029"},{"key":"17_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-310-5","volume-title":"Scheduling for Parallel Processing","author":"M Drozdowski","year":"2009","unstructured":"Drozdowski, M.: Scheduling for Parallel Processing. Springer London, London (2009)"},{"key":"17_CR8","volume-title":"Computers and Intractability","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. A Guide to the Theory of NP-completeness. W.H. Freeman and Company, San Francisco, CA (1979)"},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-015-0463-8","volume":"19","author":"MET Gerards","year":"2016","unstructured":"Gerards, M.E.T., Hurink, J.L., H\u00f6lzenspies, P.K.F.: A survey of offline algorithms for energy minimization under deadline constraints. J. Sched. 19(1), 3\u201319 (2016). https:\/\/doi.org\/10.1007\/s10951-015-0463-8","journal-title":"J. Sched."},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Kong, F., Guan, N., Deng, Q., Yi, W.: Energy-efficient scheduling for parallel real-time tasks based on level-packing. In: Proceedings of the 2011 ACM Symposium on Applied Computing, pp. 635\u2013640 (2011). https:\/\/doi.org\/10.1145\/1982185.1982326","DOI":"10.1145\/1982185.1982326"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-021-01115-x","volume":"1","author":"A Kononov","year":"2021","unstructured":"Kononov, A., Zakharova, Y.: Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion. J. Global Optim. 1, 1\u201326 (2021). https:\/\/doi.org\/10.1007\/s10898-021-01115-x","journal-title":"J. Global Optim."},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Kononov, A., Kovalenko, Y.: Minimizing total completion time in multiprocessor job systems with energy constraint. In: Mathematical Optimization Theory and Operations Research. vol.\u00a04128, pp. 267\u2013279. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-77876-7_18","DOI":"10.1007\/978-3-030-77876-7_18"},{"issue":"2","key":"17_CR13","first-page":"109","volume":"21","author":"AV Kononov","year":"2023","unstructured":"Kononov, A.V., Zakharova, Y.V.: Speed scaling scheduling of multiprocessor jobs with energy constraint and total completion time criterion. Int. J. Artif. Intell. 21(2), 109\u2013129 (2023)","journal-title":"Int. J. Artif. Intell."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Kuhn, H., Tucker, A.: Nonlinear programming. In: Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, pp. 481\u2013492 (1951)","DOI":"10.1525\/9780520411586-036"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1023\/A:1007501324572","volume":"31","author":"C Lee","year":"1999","unstructured":"Lee, C., Cai, X.: Scheduling one and two-processor tasks on two parallel processors. IIE Trans. 31, 445\u2013455 (1999). https:\/\/doi.org\/10.1023\/A:1007501324572","journal-title":"IIE Trans."},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s11227-010-0416-0","volume":"60","author":"K Li","year":"2012","unstructured":"Li, K.: Energy efficient scheduling of parallel tasks on multiprocessor computers. J. Supercomput 60, 223\u2013247 (2012). https:\/\/doi.org\/10.1007\/s11227-010-0416-0","journal-title":"J. Supercomput"},{"issue":"12","key":"17_CR17","doi-asserted-by":"publisher","first-page":"1668","DOI":"10.1109\/TC.2012.120","volume":"61","author":"K Li","year":"2012","unstructured":"Li, K.: Scheduling precedence constrained tasks with reduced processor energy on multiprocessor computers. IEEE Trans. Comput. 61(12), 1668\u20131681 (2012). https:\/\/doi.org\/10.1109\/TC.2012.120","journal-title":"IEEE Trans. Comput."},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/11671411_24","volume-title":"Approximation and Online Algorithms","author":"K Pruhs","year":"2006","unstructured":"Pruhs, K., van Stee, R., Uthaisombut, P.: Speed scaling of tasks with precedence constraints. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 307\u2013319. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11671411_24"},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Pruhs, K., Uthaisombut, P., Woeginger, G.: Getting the best response for your erg. In: Algorithm Theory - SWAT 2004. vol.\u00a04128, pp. 14\u201325. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-27810-8_3","DOI":"10.1007\/978-3-540-27810-8_3"},{"key":"17_CR20","unstructured":"Rojas, R. (ed.): Neural Networks: A Systematic Introduction. Springer (2013)"},{"issue":"1","key":"17_CR21","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.ejor.2004.12.008","volume":"173","author":"D Shabtay","year":"2006","unstructured":"Shabtay, D., Kaspi, M.: Parallel machine scheduling with a convex resource consumption function. EJOR 173(1), 92\u2013107 (2006). https:\/\/doi.org\/10.1016\/j.ejor.2004.12.008","journal-title":"EJOR"}],"container-title":["Lecture Notes in Computer Science","Numerical Computations: Theory and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81241-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T14:03:56Z","timestamp":1735653836000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81241-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031812408","9783031812415"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81241-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NUMTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Numerical Computations: Theory and Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pizzo Calabro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"14 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"numta2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.numta.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}