1 - 10 out of 19Page size: 10
  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 journal › Article › peer-review

  3. An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements

    Kononov, A. & Pakulich, M., Apr 2024, In: Journal of Combinatorial Optimization. 47, 3, 15 p., 45.

    Research output: Contribution to journal › Article › peer-review

  4. A Learning-Augmented Algorithm for the Parking Permit Problem with Three Permit Types

    Yaroslav, K. & Alexander, K., 2024, 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. 116-126 11 p. 8. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14766 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  5. 2023

  6. Non-Clairvoyant Makespan Minimization Scheduling with Predictions

    Bampis, E., Кононов, А. В., Lucarelli, G. & Pascual, F., Dec 2023, Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 283. 15 p. 9. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 283).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  7. A 4/3 OPT+2/3 Approximation for Big Two-Bar Charts Packing Problem

    Ерзин, А. И., Кононов, А. В., Мелиди, Г. Е. & Назаренко, С. А., Feb 2023, In: Journal of Mathematical Sciences (United States). 269, 6, p. 813–822 10 p.

    Research output: Contribution to journal › Article › peer-review

  8. An O(nlogn)-Time Algorithm for Linearly Ordered Packing of 2-Bar Charts into OPT+1 Bins

    Ерзин, А. И., Кононов, А. В., Назаренко, С. А. & Шаранхаев, К. И., 2023, Mathematical Optimization Theory and Operations Research - 22nd International Conference, MOTOR 2023, Proceedings. Goos, G. & Hartmanis, J. (eds.). Springer Science and Business Media Deutschland GmbH, p. 122-133 12 p. (Communications in Computer and Information Science; vol. 1881 CCIS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  9. 2022

  10. A simple rounding scheme for multistage optimization

    Bampis, E., Christou, D., Escoffier, B., Kononov, A. & Nguyen, K. T., 12 Mar 2022, In: Theoretical Computer Science. 907, p. 1-10 10 p.

    Research output: Contribution to journal › Article › peer-review

  11. Scheduling with Untrusted Predictions

    Bampis, E., Dogeas, K., Kononov, A., Lucarelli, G. & Pascual, F., 2022, Proceedings of the 31st International Joint Conference on Artificial Intelligence, IJCAI 2022. De Raedt, L. (ed.). International Joint Conferences on Artificial Intelligence, p. 4581-4587 7 p. (IJCAI International Joint Conference on Artificial Intelligence).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  12. 2021

  13. Two-machine flow shop with dynamic storage space

    Berlińska, J., Kononov, A. & Zinder, Y., Oct 2021, In: Optimization Letters. 15, 7, p. 2433-2454 22 p.

    Research output: Contribution to journal › Article › peer-review

  14. Speed scaling with explorable uncertainty

    Bampis, E., Dogeas, K., Kononov, A., Lucarelli, G. & Pascual, F., 6 Jul 2021, SPAA 2021 - Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 83-93 11 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Previous 1 2 Next

ID: 3438341