1. 2024
  2. An exact solution with an improved running time for the routing flow shop problem with two machines

    Chernykh, I., Kononov, A. & Sevastyanov, S., Aug 2024, In: Journal of Scheduling. 27, 4, p. 329-340 12 p.

    Research output: Contribution to journalArticlepeer-review

  3. 2023
  4. Approximation Algorithms for Two-Machine Proportionate Routing Open Shop on a Tree

    Chernykh, I., Krivonogova, O. & Shmyrina, A., 2023, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Science and Business Media Deutschland GmbH, p. 197-211 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13930 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  5. 2022
  6. On the two-machine routing open shop on a tree with preemption allowed

    Agzyamova, P. M. & Chernykh, I. D., 2022, In: Siberian Electronic Mathematical Reports. 19, 2, p. 548-561 14 p.

    Research output: Contribution to journalArticlepeer-review

  7. 2021
  8. Irreducible bin packing and normality in routing open shop

    Chernykh, I. & Pyatkin, A., Sept 2021, In: Annals of Mathematics and Artificial Intelligence. 89, 8-9, p. 899-918 20 p.

    Research output: Contribution to journalArticlepeer-review

  9. Two-Machine Routing Open Shop: How Long Is the Optimal Makespan?

    Chernykh, I., 2021, Mathematical Optimization Theory and Operations Research - 20th International Conference, MOTOR 2021, Proceedings. Pardalos, P., Khachay, M. & Kazakov, A. (eds.). Springer Science and Business Media Deutschland GmbH, p. 253-266 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12755 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  10. Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass

    Chernykh, I. D. & Lgotina, E. V., 2021, In: Optimization Methods and Software. 36, 4, p. 821-841 21 p.

    Research output: Contribution to journalArticlepeer-review

  11. 2020
  12. Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop

    Chernykh, I. & Pyatkin, A., 22 Jan 2020, Learning and Intelligent Optimization - 13th International Conference, LION 13, Revised Selected Papers. Matsatsinis, N. F., Marinakis, Y. & Pardalos, P. (eds.). Springer Gabler, p. 106-120 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11968 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  13. A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes

    Chernykh, I., Kononov, A. & Sevastyanov, S., 1 Jan 2020, Mathematical Optimization Theory and Operations Research - 19th International Conference, MOTOR 2020, Proceedings. Kononov, A., Khachay, M., Kalyagin, V. A. & Pardalos, P. (eds.). Springer Gabler, p. 301-312 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12095 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  14. Efficient Algorithms for the Routing Open Shop with Unrelated Travel Times on Cacti

    Chernykh, I. & Krivonogova, O., 1 Jan 2020, Optimization and Applications - 10th International Conference, OPTIMA 2019, Revised Selected Papers. Jaćimović, M., Khachay, M., Malkova, V. & Posypkin, M. (eds.). Springer Gabler, p. 1-15 15 p. (Communications in Computer and Information Science; vol. 1145 CCIS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  15. On the Optima Localization for the Three-Machine Routing Open Shop

    Chernykh, I. & Krivonogova, O., 1 Jan 2020, Mathematical Optimization Theory and Operations Research - 19th International Conference, MOTOR 2020, Proceedings. Kononov, A., Khachay, M., Kalyagin, V. A. & Pardalos, P. (eds.). Springer Gabler, p. 274-288 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12095 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Previous 1 2 Next

ID: 3439233