1. 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

  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

Previous 1 2 Next

ID: 3439233