83545

Автор(ы): 

Куприянов Б. В. (ИПУ РАН, Лаборатория 49)
Рощин А. А. (ИПУ РАН, Лаборатория 49)

Автор(ов): 

2

Параметры публикации

Тип публикации: 

Доклад

Название: 

Application of Approximate Methods to Solve Problems of Schedule Optimization Presented in Recursive Form

ISBN/ISSN: 

979-8-3315-6801-6

DOI: 

10.1109/ICCT67028.2025.11427420

Наименование конференции: 

  • 9th International Conference on Information, Control, and Communication Technologies (ICCT 2025)

Наименование источника: 

  • Proceedings of 9th International Conference on Information, Control, and Communication Technologies (ICCT 2025)

Город: 

  • Gomel, Belarus

Издательство: 

  • IEEE

Год издания: 

2025

Страницы: 

https://ieeexplore.ieee.org/document/11427420
Аннотация
The paper considers the application of two approximate optimization methods for some problems of scheduling theory: ant colony and simulated annealing. The apparatus of recursive functions is used to describe the problems. Test problems are created by a pseudorandom directed acyclic graph generator, which allows obtaining a large amount of generated statistical data.

Библиографическая ссылка: 

Куприянов Б.В., Рощин А.А. Application of Approximate Methods to Solve Problems of Schedule Optimization Presented in Recursive Form / Proceedings of 9th International Conference on Information, Control, and Communication Technologies (ICCT 2025). Gomel, Belarus: IEEE, 2025. С. https://ieeexplore.ieee.org/document/11427420.