{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T11:32:23Z","timestamp":1774870343298,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"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_35","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T13:45:16Z","timestamp":1735652716000},"page":"400-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Population Local Search for\u00a0Single Processor Energy Efficient Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4791-7011","authenticated-orcid":false,"given":"Yulia V.","family":"Zakharova","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,1]]},"reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10951-013-0312-6","volume":"16","author":"A Antoniadis","year":"2013","unstructured":"Antoniadis, A., Huang, C.: Non-preemptive speed scaling. J. Sched. 16, 385\u2013394 (2013). https:\/\/doi.org\/10.1007\/s10951-013-0312-6","journal-title":"J. Sched."},{"issue":"1","key":"35_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10951-016-0500-2","volume":"21","author":"E Bampis","year":"2016","unstructured":"Bampis, E., Kononov, A., Letsios, D., Lucarelli, G., Sviridenko, M.: Energy-efficient scheduling and routing via randomized rounding. J. Sched. 21(1), 35\u201351 (2016). https:\/\/doi.org\/10.1007\/s10951-016-0500-2","journal-title":"J. Sched."},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.dam.2014.10.007","volume":"181","author":"E Bampis","year":"2015","unstructured":"Bampis, E., Kononov, A., Letsios, D., Lucarelli, G., Nemparis, I.: From preemptive to non-preemptive speed-scaling scheduling. Discret. Appl. Math. 181, 11\u201320 (2015). https:\/\/doi.org\/10.1016\/j.dam.2014.10.007","journal-title":"Discret. Appl. Math."},{"issue":"1\u20132","key":"35_CR4","first-page":"387","volume":"24","author":"A Eremeev","year":"2014","unstructured":"Eremeev, A., Kovalenko, Y.: Optimal recombination in genetic algorithms for combinatorial optimization problems. Yugoslav J. Oper. Res. 24(1\u20132), 387\u2013401 (2014)","journal-title":"Yugoslav J. Oper. Res."},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-319-30698-8_10","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"AV Eremeev","year":"2016","unstructured":"Eremeev, A.V., Kovalenko, J.V.: Experimental evaluation of two approaches to optimal recombination for permutation problems. In: Chicano, F., Hu, B., Garc\u00eda-S\u00e1nchez, P. (eds.) EvoCOP 2016. LNCS, vol. 9595, pp. 138\u2013153. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30698-8_10"},{"issue":"1","key":"35_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s12293-019-00291-4","volume":"12","author":"AV Eremeev","year":"2020","unstructured":"Eremeev, A.V., Kovalenko, Y.V.: A memetic algorithm with optimal recombination for the asymmetric travelling salesman problem. Memetic Comput. 12(1), 23\u201336 (2020)","journal-title":"Memetic Comput."},{"issue":"3","key":"35_CR7","first-page":"13","volume":"19","author":"A Eremeev","year":"2012","unstructured":"Eremeev, A., Kovalenko, Y.: On complexity of optimal recombination for one scheduling problem with setup times. Diskretn. Anal. Issled. Oper. 19(3), 13\u201326 (2012)","journal-title":"Diskretn. Anal. Issled. Oper."},{"key":"35_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)"},{"key":"35_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4","volume-title":"Handbook of Metaheuristics","author":"M Gendreau","year":"2010","unstructured":"Gendreau, M., Potvin, J.Y.: Handbook of Metaheuristics. Springer, New York (2010). https:\/\/doi.org\/10.1007\/978-3-319-91086-4"},{"issue":"1","key":"35_CR10","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":"35_CR11","doi-asserted-by":"publisher","first-page":"1845","DOI":"10.1007\/s10586-022-03713-0","volume":"26","author":"A Katal","year":"2023","unstructured":"Katal, A., Dahiya, S., Choudhury, T.: Energy efficiency in cloud computing data centers: a survey on software technologies. Cluster Comput. 26, 1845\u20131875 (2023). https:\/\/doi.org\/10.1007\/s10586-022-03713-0","journal-title":"Cluster Comput."},{"key":"35_CR12","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"},{"issue":"2","key":"35_CR13","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1134\/S1990478919020054","volume":"13","author":"P Kononova","year":"2019","unstructured":"Kononova, P., Kochetov, Y.: A local search algorithm for the single machine scheduling problem with setups and a storage. J. Appl. Industr. Math. 13(2), 239\u2013249 (2019)","journal-title":"J. Appl. Industr. Math."},{"issue":"2","key":"35_CR14","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1134\/S1990478916020071","volume":"10","author":"YV Kovalenko","year":"2016","unstructured":"Kovalenko, Y.V.: On complexity of optimal recombination for flowshop scheduling problems. J. Appl. Ind. Math. 10(2), 220\u2013231 (2016). https:\/\/doi.org\/10.1134\/S1990478916020071","journal-title":"J. Appl. Ind. Math."},{"key":"35_CR15","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":"35_CR16","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":"35_CR17","doi-asserted-by":"publisher","unstructured":"Lourenco, H., Martin, O., Stutzle, T.: Iterated Local Search: Framework and Applications, vol.\u00a0272, pp. 1845\u20131875. North Holland, Amsterdam (1977). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_5","DOI":"10.1007\/978-3-319-91086-4_5"},{"issue":"4","key":"35_CR18","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF01531276","volume":"10","author":"N Radcliffe","year":"1994","unstructured":"Radcliffe, N.: The algebra of genetic algorithms. Ann. Math. Artif. Intell. 10(4), 339\u2013384 (1994)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"2","key":"35_CR19","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.dam.2014.10.007","volume":"28","author":"R Tinos","year":"2020","unstructured":"Tinos, R., Whitley, D., Ochoa, G.: A new generalized partition crossover for the traveling salesman problem: tunneling between local optima. Evol. Comput. 28(2), 255\u2013288 (2020). https:\/\/doi.org\/10.1016\/j.dam.2014.10.007","journal-title":"Evol. Comput."},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Wang, X., Tang, L.: A population-based variable neighborhood search for the single machine total weighted tardiness problem. Comput. Oper. Res. 2105\u20132110 (2009)","DOI":"10.1016\/j.cor.2008.07.009"},{"key":"35_CR21","doi-asserted-by":"publisher","unstructured":"Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: Proceedings of IEEE 36th Annual Foundations of Computer Science, pp. 374\u2013382. Milwaukee, WI, USA (1995). https:\/\/doi.org\/10.1109\/SFCS.1995.492493","DOI":"10.1109\/SFCS.1995.492493"},{"key":"35_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-031-35305-5_15","volume-title":"Mathematical Optimization Theory and Operations Research - MOTOR 2023","author":"Y Zakharova","year":"2023","unstructured":"Zakharova, Y.: Hybrid evolutionary algorithm with optimized operators for total weighted tardiness problem. In: Khachay, M., Kochetov, Y., Eremeev, A., Khamisov, O., Mazalov, V., Pardalos, P. (eds.) MOTOR 2023. LNCS, vol. 13930, pp. 224\u2013238. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-35305-5_15"}],"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_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T14:05:34Z","timestamp":1735653934000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81241-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031812408","9783031812415"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81241-5_35","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"}}]}}