default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlya Chernykh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Ilya Chernykh, Alexander V. Kononov
, Sergey Sevastyanov:
An exact solution with an improved running time for the routing flow shop problem with two machines. J. Sched. 27(4): 329-340 (2024)- 2021
- [j8]Ilya Chernykh, Artem V. Pyatkin:
Irreducible bin packing and normality in routing open shop. Ann. Math. Artif. Intell. 89(8-9): 899-918 (2021) - [j7]Ilya Chernykh, Ekaterina Lgotina:
Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass. Optim. Methods Softw. 36(4): 821-841 (2021) - [j6]Antonina P. Khramova, Ilya Chernykh:
A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing. J. Sched. 24(4): 405-412 (2021) - [c8]Ilya Chernykh:
Two-Machine Routing Open Shop: How Long Is the Optimal Makespan? MOTOR 2021: 253-266 - 2020
- [c7]Ilya Chernykh, Olga Krivonogova:
On the Optima Localization for the Three-Machine Routing Open Shop. MOTOR 2020: 274-288 - [c6]Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov:
A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes. MOTOR 2020: 301-312 - [i2]Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov:
A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes. CoRR abs/2004.03942 (2020)
2010 – 2019
- 2019
- [c5]Ilya Chernykh, Artem V. Pyatkin:
Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop. LION 2019: 106-120 - [c4]Ilya Chernykh, Ekaterina Lgotina:
How the Difference in Travel Times Affects the Optima Localization for the Routing Open Shop. MOTOR 2019: 187-201 - [i1]Ilya Chernykh, Ekaterina Lgotina:
Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass. CoRR abs/1911.00236 (2019) - 2016
- [c3]Ilya Chernykh:
Routing Open Shop with Unrelated Travel Times. DOOR 2016: 272-283 - [c2]Ilya Chernykh, Ekaterina Lgotina:
The 2-Machine Routing Open Shop on a Triangular Transportation Network. DOOR 2016: 284-297 - 2014
- [j5]Sergey Sevastyanov, D. A. Chemisova, Ilya Chernykh:
On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion. Ann. Oper. Res. 213(1): 253-270 (2014) - 2013
- [j4]Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov:
Efficient approximation algorithms for the routing open shop problem. Comput. Oper. Res. 40(3): 841-847 (2013)
2000 – 2009
- 2009
- [c1]Ilya Chernykh, Nikita Dryuck, Alexander V. Kononov, Sergey Sevastyanov:
The Routing Open Shop Problem: New Approximation Algorithms. WAOA 2009: 75-85 - 2006
- [j3]Igor Averbakh, Oded Berman, Ilya Chernykh:
The routing open-shop problem on a network: Complexity and approximation. Eur. J. Oper. Res. 173(2): 531-539 (2006) - 2005
- [j2]Igor Averbakh, Oded Berman, Ilya Chernykh:
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network. Eur. J. Oper. Res. 166(1): 3-24 (2005) - [j1]Igor Averbakh, Oded Berman, Ilya Chernykh:
The m-machine flowshop problem with unit-time operations and intree precedence constraints. Oper. Res. Lett. 33(3): 263-266 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
