A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes - Доклады на конференциях | Sciact - Система учета научной деятельности ИМ СО РАН

A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes Доклады на конференциях

Язык

Английский

Тип доклада

Секционный

Конференция

Mathematical Optimization Theory and Operations Research
06-10 июл. 2020 , Новосибирск

Авторы

Chernykh Ilya ¹ , Kononov Alexandr ¹ , Sevastyanov Sergey ¹

Организации

1	Институт математики им. С.Л. Соболева СО РАН

Chernykh I. , Kononov A. , Sevastyanov S.
A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes
Mathematical Optimization Theory and Operations Research 06-10 Jul 2020