2 papers
cs.DM2020
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…
cs.CC2019
Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass
Ilya Chernykh, Ekaterina Lgotina
We consider two-machine routing open shop problem on a tree. In this problem a transportation network with a tree-like structure is given, and each node contains some jobs to be pr…