On computational complexity of two-machine Open Shop variations with routing and resource constraints - Доклады на конференциях | Sciact - Система учета научной деятельности ИМ СО РАН

On computational complexity of two-machine Open Shop variations with routing and resource constraints Доклады на конференциях

Язык

Английский

Тип доклада

Секционный

Конференция

XV International Conference Optimization and Applications (OPTIMA-2024)
16-20 сент. 2024 , Petrovac

Авторы

Zakharova Yulia ¹ , Chernykh Ilya ¹ , Krivonogova Olga ¹

Организации

1	Омский филиал ФГБУН «Институт математики им. С.Л. Соболева СО РАН».

Zakharova Y. , Chernykh I. , Krivonogova O.
On computational complexity of two-machine Open Shop variations with routing and resource constraints
XV International Conference Optimization and Applications (OPTIMA-2024) 16-20 Sep 2024