Heuristic Algorithms for Scheduling Multi-mode Jobs with Resource Constraints | Sciact - Система учета научной деятельности ИМ СО РАН

Heuristic Algorithms for Scheduling Multi-mode Jobs with Resource Constraints Научная публикация

Конференция

Mathematical Optimization Theory and Operations Research 2026
06-11 июл. 2026 , Иркутск

Журнал

Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349

Вых. Данные

Год: 2026, Том: 16687, Страницы: 231-246 Страниц : 16 DOI: 10.1007/978-3-032-31390-4_15

Авторы

Zakharova Yulia ¹ , Sakhno Maria ¹

Организации

1	Sobolev Institute of Mathematics, Omsk Department, Omsk, Russia

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

Российский научный фонд

22-71-10015-П

We consider a problem of scheduling multi-mode jobs on processor cores, where job durations depend on data bus utilization, while memory capacity and the number of available processor cores are treated as additional resource constraints. Each job can be executed in several modes corresponding to different degrees of parallelism, affecting its processing time and resource consumption. The objective is to minimize the makespan. We investigate the computational complexity of the problem and propose greedy heuristics, several variants of the (1+1) evolutionary strategy, and an adaptive genetic algorithm. The algorithms are experimentally evaluated on synthetic and well-known PSPLIB benchmark instances, and the results are statistically validated.

Zakharova Y. , Sakhno M.
Heuristic Algorithms for Scheduling Multi-mode Jobs with Resource Constraints
Lecture Notes in Computer Science. 2026. V.16687. P.231-246. DOI: 10.1007/978-3-032-31390-4_15 Scopus OpenAlex

Опубликована online:

4 июл. 2026 г.

≡ Scopus:	2-s2.0-105045591937
≡ OpenAlex:	W7167457223