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

Ilya Chernykh, Alexander Kononov, Sergey Sevastyanov

We consider the routing flow shop problem with two machines on an asymmetric network. For this problem we discuss properties of an optimal schedule and present a polynomial time al…