11 - 12 out of 12Page size: 10
  1. 2023

  2. 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, 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 proceeding › Conference contribution › Research › peer-review

  3. 2024

  4. 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 journal › Article › peer-review

Previous 1 2 Next

ID: 3439233