Sciact
  • EN
  • RU

Population Local Search for Single Processor Energy Efficient Scheduling Problem Научная публикация

Конференция The 4th international Сonference and Summer School “Numerical Computations: Theory and Algorithms”
14-20 июн. 2023 , CALABRIA
Сборник Numerical Computations: Theory and Algorithms : 4th International Conference, NUMTA 2023, Pizzo Calabro, Italy, June 14–20, 2023, Revised Selected Papers
Сборник, Springer Cham. 2024. 412 c. ISBN 978-3-031-81241-5.
Журнал Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349
Вых. Данные Год: 2024, Том: 14476, Страницы: 400–408 Страниц : 9 DOI: 10.1007/978-3-031-81241-5_35
Ключевые слова Local Search · Optimal Recombination · Scheduling · Energy
Авторы Zakharova Yu. 1,2
Организации
1 Sobolev Institute of Mathematics
2 Dostoevsky Omsk State University

Информация о финансировании (1)

1 Российский научный фонд 21-41-09017

Реферат: Energy consumption of computing devices is an important question at this day. One effective method for reducing energy consumption is dynamic speed scaling. The speeds are dynamically assigned to processors minimizing the total energy consumption and guaranteeing the required quality of schedules. The NP-hard offline energy-efficient scheduling of jobs on the single speed-scalable processor is considered in this work. We propose a population local search algorithm with two types of neighbourhoods. The first one is constructed based on one solution and uses swap and insert strategies with problem-specific adaptation. The second one is defined for pairs of solutions and it is based on the inheritance of values in positions of solution permutations. Experimental evaluation of instances of various structures shows that the algorithm demonstrates competitive results.
Библиографическая ссылка: Zakharova Y.
Population Local Search for Single Processor Energy Efficient Scheduling Problem
В сборнике Numerical Computations: Theory and Algorithms : 4th International Conference, NUMTA 2023, Pizzo Calabro, Italy, June 14–20, 2023, Revised Selected Papers. – Springer Cham., 2024. – Т.Part I. – C.400–408. – ISBN 978-3-031-81241-5. DOI: 10.1007/978-3-031-81241-5_35 Scopus OpenAlex
Даты:
Поступила в редакцию: 12 нояб. 2023 г.
Опубликована в печати: 31 дек. 2024 г.
Опубликована online: 1 янв. 2025 г.
Идентификаторы БД:
Scopus: 2-s2.0-85215687955
OpenAlex: W4405945060
Цитирование в БД: Пока нет цитирований
Альметрики: