Chernykh Ilya

Ilya Chernykh

Information about the author Ilya Chernykh will soon be added to the site.
Found 4 papers in total
Efficient approximation algorithms for the routing open shop problem
Efficient approximation algorithms for the routing open shop problem
2013
We consider the routing open shop problem being a generalization of two classical...
The routing open-shop problem on a network: Complexity and approximation
The routing open-shop problem on a network: Complexity and approximation
2006
In the routing open-shop problem, jobs are located at nodes of an undirected...
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network
2005
In the routing open-shop problem, jobs are located at nodes of a transportation...
The m-machine flowshop problem with unit-time operations and intree precedence constraints
The m-machine flowshop problem with unit-time operations and intree precedence constraints
2005
We consider the flowshop problem with unit-time operations and intree precedence...
Papers per page: