A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes - Conference attendances

A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes Conference attendances

Language

Английский

Participant type

Секционный

Conference

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

Authors

Chernykh Ilya ¹ , Kononov Alexandr ¹ , Sevastyanov Sergey ¹

Affiliations

1	Sobolev Institute of Mathematics

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