informИнформатикаInformatics1816-03012617-6963UIIP NASBinform-1334Research ArticleСтатьиИсследование операцийГущинскийН. Н.

Гущинский Николай Николаевич - ведущий научный сотрудник лаборатории математической кибернетики, кандидат физико-математических наук

gyshin@newman.bas-net.byКовалевМ. Я.

Ковалев Михаил Яковлевич - главный научный сотрудник лаборатории математической кибернетики, доктор физико-математических наук

kovalyov_my@newman.bas-net.byРозинБ. М.

Розин Борис Матвеевич - ведущий научный сотрудник лаборатории математической кибернетики, кандидат технических наук

rozin@newman.bas-net.byСотсковЮ. Н.

Сотсков Юрий Назарович - главный научный сотрудник лаборатории математической кибернетики, доктор физико-математических наук

sotskov48@mail.ruШафранскийЯ. М.

Шафранский Яков Михайлович - ведущий научный сотрудник лаборатории математической кибернетики, кандидат физико-математических наук, доцент

shafr-04@yandex.by20250502202500Специальный выпуск6576Copyright © Гущинский Н.Н., Ковалев М.Я., Розин Б.М., Сотсков Ю.Н., Шафранский Я.М., 20252025Гущинский Н.Н., Ковалев М.Я., Розин Б.М., Сотсков Ю.Н., Шафранский Я.М.Гущинский Н.Н., Ковалев М.Я., Розин Б.М., Сотсков Ю.Н., Шафранский Я.М.Данная работа распространяется под лицензией Creative Commons Attribution 4.0.This work is licensed under a Creative Commons Attribution 4.0 License.https://inf.grid.by/jour/article/view/1334

Создание научной школы исследования операций в Беларуси связано с заслуженным деятелем науки Республики Беларусь, лауреатом Государственной премии Республики Беларусь, академиком В. С. Танаевым. С 1970-х гг. представителями этой школы из ОИПИ НАН Беларуси и под их руководством защищено 6 докторских и 32 кандидатские диссертации, опубликовано 16 монографий, свыше 1400 научных статей, более 60 брошюр и сборников научных статей. Выполнено 18 международных научных проектов с участием партнеров из Австрии, Великобритании, Германии, Китая, Нидерландов, Норвегии, Польши, России и Франции.

В последние 10 лет участники школы получили наиболее значимые научные результаты по следующим направлениям исследования операций и его приложений: планирование и построение расписаний, проектирование производственных линий, оптимизация инфраструктуры и функционирования электротранспорта, логистика и цены в Интернете.

ReferencesKovalyov, M. Y. Scientific school of academician V. S. Tanaev: Results on the scheduling theory / M. Y. Kovalyov, Y. N. Sotskov, Y. M. Shafransky // Automation and Remote Control. – 2014. – Vol. 75, no. 7. – P. 12411256.Kovalyov, M. Y. Scientific school of academician V. S. Tanaev: Results on the scheduling theory / M. Y. Kovalyov, Y. N. Sotskov, Y. M. Shafransky // Automation and Remote Control. – 2014. – Vol. 75, no. 7. – P. 12411256.Aloulou, M. A. A bibliography of non-deterministic lot-sizing models / M. A. Aloulou, A. Dolgui, M. Y. Kovalyov // International Journal of Production Research. – 2014. – Vol. 52, no. 8. – P. 22932310.Aloulou, M. A. A bibliography of non-deterministic lot-sizing models / M. A. Aloulou, A. Dolgui, M. Y. Kovalyov // International Journal of Production Research. – 2014. – Vol. 52, no. 8. – P. 22932310.Kovalyov, M. Y. An O(nlogn) algorithm for a single-item capacitated lot-sizing problem with linear costs and no backlogging / M. Y. Kovalyov, E. Pesch // International Journal of Production Research. – 2014. – Vol. 52, no. 13. – P. 37583761.Kovalyov, M. Y. An O(nlogn) algorithm for a single-item capacitated lot-sizing problem with linear costs and no backlogging / M. Y. Kovalyov, E. Pesch // International Journal of Production Research. – 2014. – Vol. 52, no. 13. – P. 37583761.Kovalyov, M. Y. A batching machine model for lot scheduling on a single machine / M. Y. Kovalyov // Foundations of Computing and Decision Sciences. – 2018. – Vol. 43, no. 1. – P. 3740.Kovalyov, M. Y. A batching machine model for lot scheduling on a single machine / M. Y. Kovalyov // Foundations of Computing and Decision Sciences. – 2018. – Vol. 43, no. 1. – P. 3740.Kovalyov, M. Y. Two-agent scheduling with agent specific batches on an unbounded serial batching machine / M. Y. Kovalyov, A. Oulamara, A. Soukhal // Journal of Scheduling. – 2014. – Vol. 18. – P. 423434.Kovalyov, M. Y. Two-agent scheduling with agent specific batches on an unbounded serial batching machine / M. Y. Kovalyov, A. Oulamara, A. Soukhal // Journal of Scheduling. – 2014. – Vol. 18. – P. 423434.Kovalyov, M. Y. Two-agent scheduling with deteriorating jobs on a singleparallel-batching machine: refining computational complexity / M. Y. Kovalyov, D. Sesok // Journal of Scheduling. – 2019. – Vol. 22, no. 5. – P. 603606.Kovalyov, M. Y. Two-agent scheduling with deteriorating jobs on a singleparallel-batching machine: refining computational complexity / M. Y. Kovalyov, D. Sesok // Journal of Scheduling. – 2019. – Vol. 22, no. 5. – P. 603606.Eremeev, A. V. Lot-size scheduling of a single product on unrelated parallel machines / A. V. Eremeev, M. Y. Kovalyov, P. M. Kuznetsov // Optimization Letters. – 2020. – Vol. 14, no. 3. – P. 557568.Eremeev, A. V. Lot-size scheduling of a single product on unrelated parallel machines / A. V. Eremeev, M. Y. Kovalyov, P. M. Kuznetsov // Optimization Letters. – 2020. – Vol. 14, no. 3. – P. 557568.Janiak, A. Due window assignment and scheduling on parallel machines: a FPTAS for a bottleneck criterion / A. Janiak, W. Janiak, M. Y. Kovalyov // Bulletin of the Polish Academy of Sciences Technical Sciences. – 2014. – Vol. 62, no. 4. – P. 805808.Janiak, A. Due window assignment and scheduling on parallel machines: a FPTAS for a bottleneck criterion / A. Janiak, W. Janiak, M. Y. Kovalyov // Bulletin of the Polish Academy of Sciences Technical Sciences. – 2014. – Vol. 62, no. 4. – P. 805808.Single machine scheduling with assignable due dates to minimize maximum and total late work / J.-E. Justkowiak, S. Kovalev, M. Y. Kovalyov, E. Pesch // European Journal of Operational Research. – 2023. – Vol. 308, no. 1. – P. 7683.Single machine scheduling with assignable due dates to minimize maximum and total late work / J.-E. Justkowiak, S. Kovalev, M. Y. Kovalyov, E. Pesch // European Journal of Operational Research. – 2023. – Vol. 308, no. 1. – P. 7683.Fixed interval scheduling with third-party machines / I. Fridman, M. Y. Kovalyov, E. Pesch, A. Ryzhikov // Networks. – 2021. – Vol. 77. – P. 361371.Fixed interval scheduling with third-party machines / I. Fridman, M. Y. Kovalyov, E. Pesch, A. Ryzhikov // Networks. – 2021. – Vol. 77. – P. 361371.No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines / N. Brauner, M. Y. Kovalyov, A. Quilliot, H. Toussaint // Computers and Operations Research. – 2021. – Vol. 132. – Art. 105315.No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines / N. Brauner, M. Y. Kovalyov, A. Quilliot, H. Toussaint // Computers and Operations Research. – 2021. – Vol. 132. – Art. 105315.Alternative algorithms for identical machines scheduling to maximize total early work with a common due date / X. Chen, X. Shen, M. Y. Kovalyov [et al.] // Computers and Industrial Engineering. – 2022.  Vol. 171. – Art. 108386.Alternative algorithms for identical machines scheduling to maximize total early work with a common due date / X. Chen, X. Shen, M. Y. Kovalyov [et al.] // Computers and Industrial Engineering. – 2022.  Vol. 171. – Art. 108386.Kress, D. Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines / D. Kress, M. S. Barketau, E. Pesch // Journal of Scheduling. – 2018. – Vol. 21. – P. 595–606. 14. Kovalyov, M. Y. A game mechanism for single machine sequencing with zero risk / M. Y. Kovalyov, E. Pesch // OMEGA. – 2014. – Vol. 44. – P. 104110.Kress, D. Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines / D. Kress, M. S. Barketau, E. Pesch // Journal of Scheduling. – 2018. – Vol. 21. – P. 595–606. 14. Kovalyov, M. Y. A game mechanism for single machine sequencing with zero risk / M. Y. Kovalyov, E. Pesch // OMEGA. – 2014. – Vol. 44. – P. 104110.A parallel machine schedule updating game with compensations and clients averse to uncertain loss / M. Y. Kovalyov, D. Kress, S. Meiswinkel, E. Pesch // Computers and Operations Research. – 2019. – Vol. 103. – P. 148157.A parallel machine schedule updating game with compensations and clients averse to uncertain loss / M. Y. Kovalyov, D. Kress, S. Meiswinkel, E. Pesch // Computers and Operations Research. – 2019. – Vol. 103. – P. 148157.Kovalyov, M. Y. Provision-after-wait with preferences ordered by difference: Tighter complexity and better approximation / M. Y. Kovalyov, E. Pesch, A. Quilliot // European Journal of Operational Research. – 2021. – Vol. 289. – P. 10081012.Kovalyov, M. Y. Provision-after-wait with preferences ordered by difference: Tighter complexity and better approximation / M. Y. Kovalyov, E. Pesch, A. Quilliot // European Journal of Operational Research. – 2021. – Vol. 289. – P. 10081012.Gurevsky, E. Min-max controllable risk problems/ E. Gurevsky, S. Kovalev, M. Y. Kovalyov // 4OR.  2021.  Vol. 19.  P. 93101.Gurevsky, E. Min-max controllable risk problems/ E. Gurevsky, S. Kovalev, M. Y. Kovalyov // 4OR.  2021.  Vol. 19.  P. 93101.Min-sum controllable risk problems with concave risk functions of the same value range / E. Gurevsky, D. Kopelevich, S. Kovalev, M. Y. Kovalyov // Networks.  2022.  Vol. 79.  P. 105116.Min-sum controllable risk problems with concave risk functions of the same value range / E. Gurevsky, D. Kopelevich, S. Kovalev, M. Y. Kovalyov // Networks.  2022.  Vol. 79.  P. 105116.Halman, N. Max–max, max–min, min–max and min–min knapsack problems with a parametric constraint / N. Halman, M. Y. Kovalyov, A. Quilliot // 4OR.  2023.  Vol. 21.  P. 235246.Halman, N. Max–max, max–min, min–max and min–min knapsack problems with a parametric constraint / N. Halman, M. Y. Kovalyov, A. Quilliot // 4OR.  2023.  Vol. 21.  P. 235246.Brauner, N. A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty / N. Brauner, E. Gurevsky, M. Y. Kovalyov // Discrete Applied Mathematics.  2024.  Vol. 349.  P. 106112.Brauner, N. A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty / N. Brauner, E. Gurevsky, M. Y. Kovalyov // Discrete Applied Mathematics.  2024.  Vol. 349.  P. 106112.Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom // O. G. Czibula, H. Gu, F.-J. Hwang [et al.] // Computers and Operations Research.  2016.  Vol. 65.  P. 5363.Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom // O. G. Czibula, H. Gu, F.-J. Hwang [et al.] // Computers and Operations Research.  2016.  Vol. 65.  P. 5363.Matsveichuk, N. M. A stability approach to two-stage scheduling problems with uncertain processing times / N. M. Matsveichuk, Yu. N. Sotskov // Sequencing and Scheduling with Inaccurate Data / ed.: Yu. N. Sotskov, F. Werner. – NY, Hauppauge: Nova Science Publishers, 2014. – P. 377–407.Matsveichuk, N. M. A stability approach to two-stage scheduling problems with uncertain processing times / N. M. Matsveichuk, Yu. N. Sotskov // Sequencing and Scheduling with Inaccurate Data / ed.: Yu. N. Sotskov, F. Werner. – NY, Hauppauge: Nova Science Publishers, 2014. – P. 377–407.Sotskov, Yu. N. A stability approach in sequencing and scheduling / Yu. N. Sotskov // Sequencing and Scheduling with Inaccurate Data / ed.: Yu. N. Sotskov, F. Werner. – NY, Hauppauge: Nova Science Publishers, 2014. – P. 283–344.Sotskov, Yu. N. A stability approach in sequencing and scheduling / Yu. N. Sotskov // Sequencing and Scheduling with Inaccurate Data / ed.: Yu. N. Sotskov, F. Werner. – NY, Hauppauge: Nova Science Publishers, 2014. – P. 283–344.Sotskov, Y. N. Sequencing and Scheduling with Inaccurate Data / Y. N. Sotskov, F. Werner. – NY, Hauppauge: Nova Science Publishers, 2014. – 433 p.Sotskov, Y. N. Sequencing and Scheduling with Inaccurate Data / Y. N. Sotskov, F. Werner. – NY, Hauppauge: Nova Science Publishers, 2014. – 433 p.Sotskov, Yu. N. Stability of a schedule minimising the makespan for processing jobs on identical machines / Yu. N. Sotskov // International Journal of Production Research. – 2023. – Vol. 61, no. 19. – P. 6434–6450.Sotskov, Yu. N. Stability of a schedule minimising the makespan for processing jobs on identical machines / Yu. N. Sotskov // International Journal of Production Research. – 2023. – Vol. 61, no. 19. – P. 6434–6450.Sotskov, Yu. N. Stability polyhedra of optimal permutation of jobs servicing / Yu. N. Sotskov, N. G. Egorova // Automation and Remote Control. – 2014. – Vol. 75, no. 7. – P. 1267–1282.Sotskov, Yu. N. Stability polyhedra of optimal permutation of jobs servicing / Yu. N. Sotskov, N. G. Egorova // Automation and Remote Control. – 2014. – Vol. 75, no. 7. – P. 1267–1282.Lawler’s minmax cost algorithm: optimality conditions and uncertainty / N. Brauner, G. Finke, Y.•Shafransky, D. Sledneu // Journal of Scheduling. – 2016. – Vol. 19. – P. 401–408.Lawler’s minmax cost algorithm: optimality conditions and uncertainty / N. Brauner, G. Finke, Y.•Shafransky, D. Sledneu // Journal of Scheduling. – 2016. – Vol. 19. – P. 401–408.Brauner, N. Lawler’s minmax cost problem under uncertainty / N. Brauner, G. Finke, Y.•Shafransky // Journal of Combinatorial Optimization. – 2017. – Vol. 34 (1). – P. 31–46.Brauner, N. Lawler’s minmax cost problem under uncertainty / N. Brauner, G. Finke, Y.•Shafransky // Journal of Combinatorial Optimization. – 2017. – Vol. 34 (1). – P. 31–46.The optimality box in uncertain data for minimizing the sum of the weighted job completion times / T.-C. Lai, Yu. N. Sotskov, N. G. Egorova, F. Werner // International Journal of Production Research. – 2018. – Vol. 56, no. 19. – Р. 6336–6362.The optimality box in uncertain data for minimizing the sum of the weighted job completion times / T.-C. Lai, Yu. N. Sotskov, N. G. Egorova, F. Werner // International Journal of Production Research. – 2018. – Vol. 56, no. 19. – Р. 6336–6362.Sotskov, Yu. N. Single machine scheduling problem with interval processing times and total completion time objective / Yu. N. Sotskov, N. G. Egorova // Algorithms. – 2018. – Vol. 11. – P. 21–40.Sotskov, Yu. N. Single machine scheduling problem with interval processing times and total completion time objective / Yu. N. Sotskov, N. G. Egorova // Algorithms. – 2018. – Vol. 11. – P. 21–40.Sotskov, Yu. N. The optimality region for a single-machine scheduling problem with bounded durations of the jobs and the total completion time objective / Yu. N. Sotskov, N. G. Egorova // Mathematics. – 2019. – Vol. 7, no. 382. – P. 1–21.Sotskov, Yu. N. The optimality region for a single-machine scheduling problem with bounded durations of the jobs and the total completion time objective / Yu. N. Sotskov, N. G. Egorova // Mathematics. – 2019. – Vol. 7, no. 382. – P. 1–21.Сотсков, Ю. Н. Алгоритмы планирования рабочего времени в условиях интервальной неопределенности / Ю. Н. Сотсков, Н. Г. Егорова, Н. М. Матвейчук // Информатика. – 2019. – Т. 17, № 2. – С. 86–102.Сотсков, Ю. Н. Алгоритмы планирования рабочего времени в условиях интервальной неопределенности / Ю. Н. Сотсков, Н. Г. Егорова, Н. М. Матвейчук // Информатика. – 2019. – Т. 17, № 2. – С. 86–102.Shafransky, Y. On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty / Y. Shafransky, V. Shinkarevich // Journal of Scheduling. – 2020. – Vol. 23. – P. 745–749.Shafransky, Y. On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty / Y. Shafransky, V. Shinkarevich // Journal of Scheduling. – 2020. – Vol. 23. – P. 745–749.Fridman, I. Minimizing maximum cost for a single machine under uncertainty of processing times / I. Fridman, E. Pesch, Y. Shafransky // European Journal of Operational Research. – 2020 – Vol. 286(2). – P. 444–457.Fridman, I. Minimizing maximum cost for a single machine under uncertainty of processing times / I. Fridman, E. Pesch, Y. Shafransky // European Journal of Operational Research. – 2020 – Vol. 286(2). – P. 444–457.Sotskov, Yu. N. Schedule execution for two-machine job-shop to minimize makespan with uncertain processing times / Yu. N. Sotskov, N. M. Matsveichuk, V. D. Hatsura // Mathematics. – 2020. – Vol. 8, no. 1314. – P. 1–51.Sotskov, Yu. N. Schedule execution for two-machine job-shop to minimize makespan with uncertain processing times / Yu. N. Sotskov, N. M. Matsveichuk, V. D. Hatsura // Mathematics. – 2020. – Vol. 8, no. 1314. – P. 1–51.Sotskov, Yu. N. Optimality region for job permutation in single-machine scheduling with uncertain processing times / Yu. N. Sotskov // Automation and Remote Control. – 2020. – Vol. 81, no. 5. – P. 819–842.Sotskov, Yu. N. Optimality region for job permutation in single-machine scheduling with uncertain processing times / Yu. N. Sotskov // Automation and Remote Control. – 2020. – Vol. 81, no. 5. – P. 819–842.Sotskov, Yu. N. Two-machine job-shop scheduling problem to minimize the makespan with uncertain job durations / Yu. N. Sotskov, N. M. Matsveichuk, V. D. Hatsura // Algorithms. – 2020. – Vol. 13, no. 4. – P. 1–45.Sotskov, Yu. N. Two-machine job-shop scheduling problem to minimize the makespan with uncertain job durations / Yu. N. Sotskov, N. M. Matsveichuk, V. D. Hatsura // Algorithms. – 2020. – Vol. 13, no. 4. – P. 1–45.Sotskov, Yu. N. Optimal selection and scheduling of jobs with uncertain durations for two employees / Yu. N. Sotskov, N. M. Matsveichuk // Журнал Белорусского государственного университета. Математика. Информатика. – 2024. – № 2. – C. 65–80.Sotskov, Yu. N. Optimal selection and scheduling of jobs with uncertain durations for two employees / Yu. N. Sotskov, N. M. Matsveichuk // Журнал Белорусского государственного университета. Математика. Информатика. – 2024. – № 2. – C. 65–80.Матвейчук, Н. М. Модели и методы календарного планирования и контроля выплавки и непрерывной разливки стали в условиях неопределенности данных / Н. М. Матвейчук, Ю. Н. Сотсков // Вестник Фонда фундаментальных исследований. – 2024. – № 2. – C. 176–191.Матвейчук, Н. М. Модели и методы календарного планирования и контроля выплавки и непрерывной разливки стали в условиях неопределенности данных / Н. М. Матвейчук, Ю. Н. Сотсков // Вестник Фонда фундаментальных исследований. – 2024. – № 2. – C. 176–191.Barketau, M. S. Evaluation of solution of discrete optimization problem with incomplete input / M. S. Barketau // Optimization Letters. – 2021. – Vol. 15. – P. 431–440.Barketau, M. S. Evaluation of solution of discrete optimization problem with incomplete input / M. S. Barketau // Optimization Letters. – 2021. – Vol. 15. – P. 431–440.Scheduling arbitrary number of malleable tasks on multiprocessor systems / M. S. Barketau, M. Y. Kovalyov, J. Weglarz, M. Machowiak // Bulletin of the Polish Academy of Sciences Technical Sciences. – 2014. – Vol. 62, no. 2. – P. 255261.Scheduling arbitrary number of malleable tasks on multiprocessor systems / M. S. Barketau, M. Y. Kovalyov, J. Weglarz, M. Machowiak // Bulletin of the Polish Academy of Sciences Technical Sciences. – 2014. – Vol. 62, no. 2. – P. 255261.Hwang, F. J. Scheduling for fabrication and assembly in a two-machineflowshop with a fixed job sequence / F. J. Hwang, M. Y. Kovalyov, B. M. T. Lin // Annals of Operations Research. – 2014. – Vol. 217, no. 1. – P. 263–279.Hwang, F. J. Scheduling for fabrication and assembly in a two-machineflowshop with a fixed job sequence / F. J. Hwang, M. Y. Kovalyov, B. M. T. Lin // Annals of Operations Research. – 2014. – Vol. 217, no. 1. – P. 263–279.Janiak, A. On a single machine-scheduling problem with separated position and resource effects / A. Janiak, M. Y. Kovalyov, M. Lichtenstein // Optimization. – 2015. – Vol. 64, no. 4. – P. 909–911.Janiak, A. On a single machine-scheduling problem with separated position and resource effects / A. Janiak, M. Y. Kovalyov, M. Lichtenstein // Optimization. – 2015. – Vol. 64, no. 4. – P. 909–911.Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion / S. Kovalev, M.Y. Kovalyov, G. Mosheiov, E. Gerstl // International Journal of Production Research. – 2019. – Vol. 57, no. 2. – P. 560–566.Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion / S. Kovalev, M.Y. Kovalyov, G. Mosheiov, E. Gerstl // International Journal of Production Research. – 2019. – Vol. 57, no. 2. – P. 560–566.Kononov, A. V. Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||Cmax / A. V. Kononov, M. Y. Kovalyov, B. M. T. Lin // Theoretical Computer Science. – 2019. – Vol. 793. – P. 70–78.Kononov, A. V. Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||Cmax / A. V. Kononov, M. Y. Kovalyov, B. M. T. Lin // Theoretical Computer Science. – 2019. – Vol. 793. – P. 70–78.Three parallel task assignment problems with shared resources / A. Diabat, A. Dolgui, W. Janiak, M. Y. Kovalyov // IISE Transactions. – 2020. – Vol. 52, no. 4. – P. 478–485.Three parallel task assignment problems with shared resources / A. Diabat, A. Dolgui, W. Janiak, M. Y. Kovalyov // IISE Transactions. – 2020. – Vol. 52, no. 4. – P. 478–485.A note on scheduling identical parallel machines with preemptions and setup times / M. Boudhar, A. Dolgui, A. Haned [et al.] // International Journal of Production Research. – 2024. – Vol. 62. – Art. 2362414. – DOI: 10.1080/00207543.2024.2362414.A note on scheduling identical parallel machines with preemptions and setup times / M. Boudhar, A. Dolgui, A. Haned [et al.] // International Journal of Production Research. – 2024. – Vol. 62. – Art. 2362414. – DOI: 10.1080/00207543.2024.2362414.Рубанов, И. В. Модель построения расписания непрерывного движения объектов по сети пересекающихся маршрутов / И. В. Рубанов, М. С. Баркетов, М. Я. Ковалев // Информатика. – 2018. – № 1(15). – C. 21–33.Рубанов, И. В. Модель построения расписания непрерывного движения объектов по сети пересекающихся маршрутов / И. В. Рубанов, М. С. Баркетов, М. Я. Ковалев // Информатика. – 2018. – № 1(15). – C. 21–33.Рубанов, И. В. Методы поиска нескольких решений системы разностных и интервальных ограничений / И. В. Рубанов, М. С. Баркетов, М. Я. Ковалев // Информатика. – 2016. – № 3(51). – С. 67–79.Рубанов, И. В. Методы поиска нескольких решений системы разностных и интервальных ограничений / И. В. Рубанов, М. С. Баркетов, М. Я. Ковалев // Информатика. – 2016. – № 3(51). – С. 67–79.Barketau, M. S. An approximation algorithm for a special case of the asymmetric travelling salesman problem / M. S. Barketau, E. Pesch // International Journal of Production Research. – 2016. – Vol. 54, iss. 14. – P. 4205–4212.Barketau, M. S. An approximation algorithm for a special case of the asymmetric travelling salesman problem / M. S. Barketau, E. Pesch // International Journal of Production Research. – 2016. – Vol. 54, iss. 14. – P. 4205–4212.Баркетов, М. С. Полиномиальный рандомизированный алгоритм для задачи «Асимметричный коммивояжер» / М. С. Баркетов // Доклады Национальной академии наук Беларуси. – 2022. – Т. 66, № 5. – С. 489–494.Баркетов, М. С. Полиномиальный рандомизированный алгоритм для задачи «Асимметричный коммивояжер» / М. С. Баркетов // Доклады Национальной академии наук Беларуси. – 2022. – Т. 66, № 5. – С. 489–494.Баркетов, М. С. Определение параметров заявок клиентов в цепи производства и поставок / М. С. Баркетов // Экономика, моделирование, прогнозирование: сб. тр. / Науч.-исслед. эконом. ин-т М-ва экономики Респ. Беларусь. – 2015. – С. 105–112.Баркетов, М. С. Определение параметров заявок клиентов в цепи производства и поставок / М. С. Баркетов // Экономика, моделирование, прогнозирование: сб. тр. / Науч.-исслед. эконом. ин-т М-ва экономики Респ. Беларусь. – 2015. – С. 105–112.Шафранский, Я. М. Построение расписания работы отделочной фабрики / Я. М. Шафранский, В. И. Романов // Танаевские чтения: докл. Девятой Междунар. науч. конф., Минск, 30 марта 2021 г. – Минск: ОИПИ НАН Беларуси, 2021. – С. 137–141.Шафранский, Я. М. Построение расписания работы отделочной фабрики / Я. М. Шафранский, В. И. Романов // Танаевские чтения: докл. Девятой Междунар. науч. конф., Минск, 30 марта 2021 г. – Минск: ОИПИ НАН Беларуси, 2021. – С. 137–141.Шафранский, Я. М. Особенности построения расписания работы отделочной фабрики (на примере ОАО «Моготекс») / Я. М. Шафранский, В. И. Романов // Информационные технологии в промышленности, логистике и социальной сфере: докл. XII Междунар. науч.-техн. конф., Минск, 21–22 сент. 2023 г. – Минск: ОИПИ НАН Беларуси, 2023. – С. 169–172.Шафранский, Я. М. Особенности построения расписания работы отделочной фабрики (на примере ОАО «Моготекс») / Я. М. Шафранский, В. И. Романов // Информационные технологии в промышленности, логистике и социальной сфере: докл. XII Междунар. науч.-техн. конф., Минск, 21–22 сент. 2023 г. – Минск: ОИПИ НАН Беларуси, 2023. – С. 169–172.Hasani, K. Minimizing interference for scheduling two parallel machines with a single server / K. Hasani, S. A. Kravchenko, F. Werner // International Journal of Production Research.  2014.  Vol. 52, no 24.  P. 71487158.Hasani, K. Minimizing interference for scheduling two parallel machines with a single server / K. Hasani, S. A. Kravchenko, F. Werner // International Journal of Production Research.  2014.  Vol. 52, no 24.  P. 71487158.Hasani, K. Block Models for Scheduling Jobs on Two Parallel Machines with a Single Server / K. Hasani, S. A. Kravchenko, F. Werner // Computers & Operations Research. – Vol. 41. – 2014. – P. 9497.Hasani, K. Block Models for Scheduling Jobs on Two Parallel Machines with a Single Server / K. Hasani, S. A. Kravchenko, F. Werner // Computers & Operations Research. – Vol. 41. – 2014. – P. 9497.Hasani, K. Simulated Annealing and Genetic Algorithms for the Two-Machine Scheduling Problem with a Single Server / K. Hasani, S.A. Kravchenko, F. Werner // International Journal of Production Research.  2014. – Vol. 52, no. 13.  P. 3778–3792.Hasani, K. Simulated Annealing and Genetic Algorithms for the Two-Machine Scheduling Problem with a Single Server / K. Hasani, S.A. Kravchenko, F. Werner // International Journal of Production Research.  2014. – Vol. 52, no. 13.  P. 3778–3792.Hasani, K. Minimizing total weighted completion time approximately for the parallel machine problem with a single server / K. Hasani, S. A. Kravchenko, F. Werner // Information Processing Letters. – 2014. – Vol. 114. – P. 500–503.Hasani, K. Minimizing total weighted completion time approximately for the parallel machine problem with a single server / K. Hasani, S. A. Kravchenko, F. Werner // Information Processing Letters. – 2014. – Vol. 114. – P. 500–503.Hasani, K. A hybridization of harmony search and simulated annealing to minimize mean flow time for the two-machine scheduling problem with a single server / K. Hasani, S. A. Kravchenko, F. Werner // International Journal of Operational Research Nepal (IJORN). – 2014. – Vol. 3, no. 1.  P. 926.Hasani, K. A hybridization of harmony search and simulated annealing to minimize mean flow time for the two-machine scheduling problem with a single server / K. Hasani, S. A. Kravchenko, F. Werner // International Journal of Operational Research Nepal (IJORN). – 2014. – Vol. 3, no. 1.  P. 926.Вернер, Ф. Минимизация суммарного времени обслуживания для системы с двумя приборами и одним / Ф. Вернер, С. А. Кравченко, К. Хасани // Информатика. – 2014. – T. 41, № 1.  P. 15–24.Вернер, Ф. Минимизация суммарного времени обслуживания для системы с двумя приборами и одним / Ф. Вернер, С. А. Кравченко, К. Хасани // Информатика. – 2014. – T. 41, № 1.  P. 15–24.Hasani, K. Minimizing the makespan for the two-machine scheduling problem with a single server: Two algorithms for very large instances / K. Hasani, S. A. Kravchenko, F. Werner // Engineering Optimization.  2016. – Vol. 48, no. 1.  P. 173183.Hasani, K. Minimizing the makespan for the two-machine scheduling problem with a single server: Two algorithms for very large instances / K. Hasani, S. A. Kravchenko, F. Werner // Engineering Optimization.  2016. – Vol. 48, no. 1.  P. 173183.Cheng, T. C. E. Preemptive parallel-machine scheduling with a common server to minimize makespan / T. C. E. Cheng, S. A. Kravchenko, B. M. T. Lin // Naval Research Logistics. – 2017. – Vol. 64, no. 5. – P. 388398.Cheng, T. C. E. Preemptive parallel-machine scheduling with a common server to minimize makespan / T. C. E. Cheng, S. A. Kravchenko, B. M. T. Lin // Naval Research Logistics. – 2017. – Vol. 64, no. 5. – P. 388398.Cheng, T. C. E. Server scheduling on parallel dedicated machines with fixed job sequences / T. C. E. Cheng, S. A. Kravchenko, B. M. T. Lin // Naval Research Logistics.  2019.  Vol. 66, no. 4.  P. 321–332.Cheng, T. C. E. Server scheduling on parallel dedicated machines with fixed job sequences / T. C. E. Cheng, S. A. Kravchenko, B. M. T. Lin // Naval Research Logistics.  2019.  Vol. 66, no. 4.  P. 321–332.Gholami, O. A neural network algorithm for servicing jobs with sequential and parallel machines / O. Gholami, Yu. N. Sotskov // Automation and Remote Control.  2014.  Vol. 75, no. 7. – P. 1203–1220.Gholami, O. A neural network algorithm for servicing jobs with sequential and parallel machines / O. Gholami, Yu. N. Sotskov // Automation and Remote Control.  2014.  Vol. 75, no. 7. – P. 1203–1220.Gholami, O. Solving parallel machines job-shop scheduling problems by an adaptive algorithm / O. Gholami, Yu. N. Sotskov // International Journal of Production Research.  2014.  Vol. 52, no. 13.  P. 3888–3904.Gholami, O. Solving parallel machines job-shop scheduling problems by an adaptive algorithm / O. Gholami, Yu. N. Sotskov // International Journal of Production Research.  2014.  Vol. 52, no. 13.  P. 3888–3904.Gholami, O. A fast heuristic algorithm for solving parallel-machine job-shop scheduling problems / O. Gholami, Yu. N. Sotskov // International Journal of Advanced Manufacturing Technology.  2014.  Vol. 70, no. 1–4.  P. 531–546.Gholami, O. A fast heuristic algorithm for solving parallel-machine job-shop scheduling problems / O. Gholami, Yu. N. Sotskov // International Journal of Advanced Manufacturing Technology.  2014.  Vol. 70, no. 1–4.  P. 531–546.Gholami, O. Scheduling algorithm with controllable train speeds and departure times to decrease the total train tardiness / O. Gholami, Yu. N. Sotskov // International Journal of Industrial Engineering Computations.  2014.  Vol. 5.  P. 281–294.Gholami, O. Scheduling algorithm with controllable train speeds and departure times to decrease the total train tardiness / O. Gholami, Yu. N. Sotskov // International Journal of Industrial Engineering Computations.  2014.  Vol. 5.  P. 281–294.Gholami, O. Mixed graph model and algorithms for parallel-machine job-shop scheduling problems / O. Gholami, Yu. N. Sotskov // International Journal of Production Research.  2017.  Vol. 55, no. 6.  P. 1549–1564.Gholami, O. Mixed graph model and algorithms for parallel-machine job-shop scheduling problems / O. Gholami, Yu. N. Sotskov // International Journal of Production Research.  2017.  Vol. 55, no. 6.  P. 1549–1564.Gholami, O. A genetic algorithm for hybrid job-shop scheduling problems with minimizing the makespan or mean flow time / O. Gholami, Yu. N. Sotskov, F. Werner // Journal of Advanced Manufacturing Systems.  2018.  Vol. 17, no. 4.  P. 461–486.Gholami, O. A genetic algorithm for hybrid job-shop scheduling problems with minimizing the makespan or mean flow time / O. Gholami, Yu. N. Sotskov, F. Werner // Journal of Advanced Manufacturing Systems.  2018.  Vol. 17, no. 4.  P. 461–486.Sotskov, Yu. N. Mixed graph colorings: A historical review / Yu. N. Sotskov // Mathematics.  2020.  Vol. 8, no. 385.  P. 1–24.Sotskov, Yu. N. Mixed graph colorings: A historical review / Yu. N. Sotskov // Mathematics.  2020.  Vol. 8, no. 385.  P. 1–24.Sotskov, Y. N. Mixed graph coloring as scheduling multi-processor tasks with equal processing times / Y. N. Sotskov // Журнал Белорусского государственного университета. Математика. Информатика.  2021.  № 2. – С. 67–81.Sotskov, Y. N. Mixed graph coloring as scheduling multi-processor tasks with equal processing times / Y. N. Sotskov // Журнал Белорусского государственного университета. Математика. Информатика.  2021.  № 2. – С. 67–81.Sotskov, Yu. N. Scheduling multiprocessor tasks with equal processing times as a mixed graph coloring problem / Yu. N. Sotskov, E. I. Mihova // Algorithms.  2021.  Vol. 14, no. 246.  P. 1–22.Sotskov, Yu. N. Scheduling multiprocessor tasks with equal processing times as a mixed graph coloring problem / Yu. N. Sotskov, E. I. Mihova // Algorithms.  2021.  Vol. 14, no. 246.  P. 1–22.Sotskov, Yu. N. A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring. / Yu. N. Sotskov // Automation and Remote Control.  2023.  Vol. 84, no. 2.  P. 167–186.Sotskov, Yu. N. A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring. / Yu. N. Sotskov // Automation and Remote Control.  2023.  Vol. 84, no. 2.  P. 167–186.Mihova, E. I. Mixed graph coloring as scheduling a partially ordered set of interruptible multi-processor tasks with integer due dates / E. I. Mihova, Yu. N. Sotskov // Algorithms.  2024.  Vol. 17, no. 299.  P. 1–33.Mihova, E. I. Mixed graph coloring as scheduling a partially ordered set of interruptible multi-processor tasks with integer due dates / E. I. Mihova, Yu. N. Sotskov // Algorithms.  2024.  Vol. 17, no. 299.  P. 1–33.Cheng, T. C. E. An alternative approach for proving the NP-hardness of optimization problems / T. C. E. Cheng, Y. Shafransky, C. T. Ng // European Journal of Operational Research. – 2016. – Vol. 248. – P. 52–58.Cheng, T. C. E. An alternative approach for proving the NP-hardness of optimization problems / T. C. E. Cheng, Y. Shafransky, C. T. Ng // European Journal of Operational Research. – 2016. – Vol. 248. – P. 52–58.Profitability of a multi-model manufacturing line versus multiple dedicated lines / A. Dolgui, S. E. Hashemi-Petroodi, S. Kovalev, M. Y. Kovalyov // International Journal of Production Economics. – 2021. – Vol. 236. – Art. 108113.Profitability of a multi-model manufacturing line versus multiple dedicated lines / A. Dolgui, S. E. Hashemi-Petroodi, S. Kovalev, M. Y. Kovalyov // International Journal of Production Economics. – 2021. – Vol. 236. – Art. 108113.Minimizing the number of workers in a paced mixed-model assembly line / X. Delorme, A. Dolgui, S. Kovalev, M. Y. Kovalyov // European Journal of Operational Research. – 2019. – Vol. 272, no. 1. – P. 188194.Minimizing the number of workers in a paced mixed-model assembly line / X. Delorme, A. Dolgui, S. Kovalev, M. Y. Kovalyov // European Journal of Operational Research. – 2019. – Vol. 272, no. 1. – P. 188194.Minimizing setup costs in a transfer line design problem with sequential operation processing / A. Dolgui, S. Kovalev, M. Y. Kovalyov [et al.] // International Journal of Production Economics. – 2014. – Vol. 151. – P. 186194.Minimizing setup costs in a transfer line design problem with sequential operation processing / A. Dolgui, S. Kovalev, M. Y. Kovalyov [et al.] // International Journal of Production Economics. – 2014. – Vol. 151. – P. 186194.Workforce reconfiguration strategies in manufacturing systems: a state of the art / S. E. HashemiPetroodi, A. Dolgui, S. Kovalev [et al.] // International Journal of Production Research. – 2021. – Vol. 59, no. 22. – P. 67216744.Workforce reconfiguration strategies in manufacturing systems: a state of the art / S. E. HashemiPetroodi, A. Dolgui, S. Kovalev [et al.] // International Journal of Production Research. – 2021. – Vol. 59, no. 22. – P. 67216744.Optimal workforce assignment to operations of a paced assembly line / A. Dolgui, S. Kovalev, M. Y. Kovalyov [et al.] // European Journal of Operational Research. – 2018. – Vol. 264. – P. 200211.Optimal workforce assignment to operations of a paced assembly line / A. Dolgui, S. Kovalev, M. Y. Kovalyov [et al.] // European Journal of Operational Research. – 2018. – Vol. 264. – P. 200211.Sotskov, Y. N. Assembly and production line designing, balancing and scheduling with inaccurate data: a survey and perspectives / Y. N. Sotskov // Algorithms. – 2023. – Vol. 16, no. 100. – P. 143.Sotskov, Y. N. Assembly and production line designing, balancing and scheduling with inaccurate data: a survey and perspectives / Y. N. Sotskov // Algorithms. – 2023. – Vol. 16, no. 100. – P. 143.Guschinsky, N. N. On optimization of processes for sequential batch machining / N. N. Guschinsky, O. Battaia, A. Dolgui // Весці Нацыянальнай акадэміі навук Беларусі. Серыя фізіка-матэматычных навук. – 2016. – № 4. – С. 106–115.Guschinsky, N. N. On optimization of processes for sequential batch machining / N. N. Guschinsky, O. Battaia, A. Dolgui // Весці Нацыянальнай акадэміі навук Беларусі. Серыя фізіка-матэматычных навук. – 2016. – № 4. – С. 106–115.Battaia, O. Decision support for design of reconfigurable rotary machining systems for family part production / O. Battaia, A. Dolgui, N. Guschinsky // International Journal of Production Research.  2017.  Vol. 55, no. 5.  P. 1368–1385.Battaia, O. Decision support for design of reconfigurable rotary machining systems for family part production / O. Battaia, A. Dolgui, N. Guschinsky // International Journal of Production Research.  2017.  Vol. 55, no. 5.  P. 1368–1385.Battaia, O. Integrated process planning and system configuration for mixed-model machining on rotary transfer machine / O. Battaia, A. Dolgui, N. Guschinsky // International Journal of Computer Integrated manufacturing.  2017.  Vol. 30, no. 9.  P. 910–925.Battaia, O. Integrated process planning and system configuration for mixed-model machining on rotary transfer machine / O. Battaia, A. Dolgui, N. Guschinsky // International Journal of Computer Integrated manufacturing.  2017.  Vol. 30, no. 9.  P. 910–925.Battaia, O. MIP-based heuristics for combinatorial design of reconfigurable rotary transfer machines for production of multiple parts / O. Battaia, A. Dolgui, N. Guschinsky // International Journal of Production Economics.  2023.  Vol. 262(1).  Art. 108904. – DOI: 10.1016/j.ijpe.2023.108904.Battaia, O. MIP-based heuristics for combinatorial design of reconfigurable rotary transfer machines for production of multiple parts / O. Battaia, A. Dolgui, N. Guschinsky // International Journal of Production Economics.  2023.  Vol. 262(1).  Art. 108904. – DOI: 10.1016/j.ijpe.2023.108904.Combinatorial techniques to optimally customize an automated production line with rotary transfer and turrets // O. Battaia, A. Dolgui, N. Guschinsky, G. Levin // IIE Transactions.  2014.  Vol. 46, no. 9.  P. 867879.Combinatorial techniques to optimally customize an automated production line with rotary transfer and turrets // O. Battaia, A. Dolgui, N. Guschinsky, G. Levin // IIE Transactions.  2014.  Vol. 46, no. 9.  P. 867879.Integrated configurable equipment selection and line balancing for mass production with serial–parallel machining systems // O. Battaia, A. Dolgui, N. Guschinsky, G. Levin // Engineering Optimization. – 2014. – Vol. 46, no. 10. – P. 13691388.Integrated configurable equipment selection and line balancing for mass production with serial–parallel machining systems // O. Battaia, A. Dolgui, N. Guschinsky, G. Levin // Engineering Optimization. – 2014. – Vol. 46, no. 10. – P. 13691388.Variety-oriented design of rotary production systems / O. Battaia, D. Brissaud, A. Dolgui, N. Guschinsky // CIRP Annals-Manufacturing Technology.  2015.  Vol. 64, no. 1.  P. 411–414.Variety-oriented design of rotary production systems / O. Battaia, D. Brissaud, A. Dolgui, N. Guschinsky // CIRP Annals-Manufacturing Technology.  2015.  Vol. 64, no. 1.  P. 411–414.Гущинский, Н. Н. Модели и методы синтеза структуры технологического процесса обработки деталей на поточной линии из станков со стационарным приспособлением / Н. Н. Гущинский, О. Баттайа, А. Долгий // Информатика. – 2015. – № 3. – С. 72–80.Гущинский, Н. Н. Модели и методы синтеза структуры технологического процесса обработки деталей на поточной линии из станков со стационарным приспособлением / Н. Н. Гущинский, О. Баттайа, А. Долгий // Информатика. – 2015. – № 3. – С. 72–80.Battaia, O. Optimal cost design of flow lines with reconfigurable machines for batch production / O. Battaia, A. Dolgui, N. Guschinsky // International Journal of Production Research.  2020.  Vol. 58, no. 10.  P. 2937–2952.Battaia, O. Optimal cost design of flow lines with reconfigurable machines for batch production / O. Battaia, A. Dolgui, N. Guschinsky // International Journal of Production Research.  2020.  Vol. 58, no. 10.  P. 2937–2952.Battaia, О. Design of reconfigurable machining lines: A novel comprehensive / O. Battaia, A. Dolgui, N. Guschinsky // CIRP Annalas  Manufactoring Technology.  2021.  Vol. 70, no. 1.  P. 393398.Battaia, О. Design of reconfigurable machining lines: A novel comprehensive / O. Battaia, A. Dolgui, N. Guschinsky // CIRP Annalas  Manufactoring Technology.  2021.  Vol. 70, no. 1.  P. 393398.Гущинский, Н. Н. Оптимизация размещения детали на многопозиционном поворотном столе агрегатного станка / Н. Н. Гущинский, В. Е. Зданович, Б. М. Розин // Информатика. – 2015. – № 4. – С. 57–72.Гущинский, Н. Н. Оптимизация размещения детали на многопозиционном поворотном столе агрегатного станка / Н. Н. Гущинский, В. Е. Зданович, Б. М. Розин // Информатика. – 2015. – № 4. – С. 57–72.Гущинский, Н. Н. Оптимизация размещения группы деталей на многопозиционном поворотном столе агрегатного станка / Н. Н. Гущинский, Б. М. Розин // Информатика. – 2017. – № 1. – С. 53–69.Гущинский, Н. Н. Оптимизация размещения группы деталей на многопозиционном поворотном столе агрегатного станка / Н. Н. Гущинский, Б. М. Розин // Информатика. – 2017. – № 1. – С. 53–69.Cost optimization for series-parallel execution of a collection of intersecting operation sets / A. Dolgui, G. Levin, B. Rozin, I. Kasabutski // Engineering Optimization.  2016.  Vol. 48, no. 5.  P. 756–771.Cost optimization for series-parallel execution of a collection of intersecting operation sets / A. Dolgui, G. Levin, B. Rozin, I. Kasabutski // Engineering Optimization.  2016.  Vol. 48, no. 5.  P. 756–771.Левин, Г. М. Линейная аппроксимация задачи оптимизации интенсивностей последовательнопараллельного выполнения пересекающихся множеств операций / Г. М. Левин, Б. М. Розин, А.Б. Долгий // Информатика.  2014.  № 3.  C. 4451.Левин, Г. М. Линейная аппроксимация задачи оптимизации интенсивностей последовательнопараллельного выполнения пересекающихся множеств операций / Г. М. Левин, Б. М. Розин, А.Б. Долгий // Информатика.  2014.  № 3.  C. 4451.Левин, Г. М. Оптимизация агрегирования и режимов последовательно-параллельного выполнения пересекающихся множеств операций / Г. М. Левин, Б. М. Розин, А. Б. Долгий // Информатика.  2016. – № 1. – С. 5–13.Левин, Г. М. Оптимизация агрегирования и режимов последовательно-параллельного выполнения пересекающихся множеств операций / Г. М. Левин, Б. М. Розин, А. Б. Долгий // Информатика.  2016. – № 1. – С. 5–13.Левин, Г. М. Оптимизация выпуска и интенсивностей обработки группы деталей при нестационарном спросе / Г. М. Левин, Б. М. Розин, А. Б. Долгий // Весці Нацыянальнай акадэміі навук Беларусі. Серыя фізіка-матэматычных навук.  2016. № 3.  C. 102–109.Левин, Г. М. Оптимизация выпуска и интенсивностей обработки группы деталей при нестационарном спросе / Г. М. Левин, Б. М. Розин, А. Б. Долгий // Весці Нацыянальнай акадэміі навук Беларусі. Серыя фізіка-матэматычных навук.  2016. № 3.  C. 102–109.Левин, Г. М. Оптимизация выпуска комплектов изделий и интенсивностей их изготовления в условиях случайного спроса / Г. М. Левин, Б. М. Розин // Весці Нацыянальнай акадэміі навук Беларусі. Серыя фізіка-матэматычных навук.  2017.  № 2.  C. 110–118.Левин, Г. М. Оптимизация выпуска комплектов изделий и интенсивностей их изготовления в условиях случайного спроса / Г. М. Левин, Б. М. Розин // Весці Нацыянальнай акадэміі навук Беларусі. Серыя фізіка-матэматычных навук.  2017.  № 2.  C. 110–118.Dolgui, A. Optimisation of the aggregation and execution rates for intersecting operation sets: an example of machining process design / A. Dolgui, G. Levin, B. Rozin // International Journal of Production Research. – 2020. – Vol. 58, no 9. – P. 2658–2676.Dolgui, A. Optimisation of the aggregation and execution rates for intersecting operation sets: an example of machining process design / A. Dolgui, G. Levin, B. Rozin // International Journal of Production Research. – 2020. – Vol. 58, no 9. – P. 2658–2676.Dolgui, A. Structural-Parametric Optimization of a Complex of Intersecting Sets of Operations under Nonstationary Demand / A. Dolgui, G. Levin, B. Rozin // Automation and Remote Control.  2020.  Vol. 81, no. 5.  P. 791–802.Dolgui, A. Structural-Parametric Optimization of a Complex of Intersecting Sets of Operations under Nonstationary Demand / A. Dolgui, G. Levin, B. Rozin // Automation and Remote Control.  2020.  Vol. 81, no. 5.  P. 791–802.Левин, Г. М. Оптимизация динамически изменяемых режимов групповой обработки резанием на многопозиционном многоинструментальном оборудовании / Г. М. Левин, Б. М. Розин, О. И. Стеблинская // Информатика. – 2014. – № 4. – С. 90–99.Левин, Г. М. Оптимизация динамически изменяемых режимов групповой обработки резанием на многопозиционном многоинструментальном оборудовании / Г. М. Левин, Б. М. Розин, О. И. Стеблинская // Информатика. – 2014. – № 4. – С. 90–99.Designing fast-charge urban electric bus services: An Integer Linear Programming model / O. Battaia, A. Dolgui, N. Guschinsky, M. Y. Kovalev // Transportation Research Part E: Logistics and Transportation Review.  2023.  Vol. 171.  Art. 103065. – DOI: 10.1016/j.tre.2023.103065.Designing fast-charge urban electric bus services: An Integer Linear Programming model / O. Battaia, A. Dolgui, N. Guschinsky, M. Y. Kovalev // Transportation Research Part E: Logistics and Transportation Review.  2023.  Vol. 171.  Art. 103065. – DOI: 10.1016/j.tre.2023.103065.MILP model for fleet and charging infrastructure decisions for fast-charging city electric bus services / O. Battaia, A. Dolgui, N. Guschinsky, B. Rozin // Computers and Industrial Engineering.  2023.  Vol. 182.  Art. 109336. – DOI: 10.1016/j.cie.2023.109336.MILP model for fleet and charging infrastructure decisions for fast-charging city electric bus services / O. Battaia, A. Dolgui, N. Guschinsky, B. Rozin // Computers and Industrial Engineering.  2023.  Vol. 182.  Art. 109336. – DOI: 10.1016/j.cie.2023.109336.Fleet and charging infrastructure decisions for fast-charging city electric bus service / N. Guschinsky, M. Y. Kovalyov, B. Rozin, N. Brauner // Computers and Operations Research.  2021.  Vol. 135.  Art. 105449. – DOI: 10.1016/j.cor.2021.105449.Fleet and charging infrastructure decisions for fast-charging city electric bus service / N. Guschinsky, M. Y. Kovalyov, B. Rozin, N. Brauner // Computers and Operations Research.  2021.  Vol. 135.  Art. 105449. – DOI: 10.1016/j.cor.2021.105449.Kovalyov, M. Y. Mathematical Model and Random Search Algorithm for the Optimal Planning Problem of Replacing Traditional Public Transport with Electric / M. Y. Kovalyov, B. M. Rozin, N. N. Guschinsky // Automation and Remote Control.  2020.  Vol. 81, no. 5.  P. 803–818.Kovalyov, M. Y. Mathematical Model and Random Search Algorithm for the Optimal Planning Problem of Replacing Traditional Public Transport with Electric / M. Y. Kovalyov, B. M. Rozin, N. N. Guschinsky // Automation and Remote Control.  2020.  Vol. 81, no. 5.  P. 803–818.Cost minimizing decisions on equipment and charging schedule for electric buses in a single depot / N. Guschinsky, M. Y. Kovalyov, E. Pesch, B. Rozin // Transportation Research Part E.  2023.  Vol. 180.  Art. 103337. – DOI: 10.1016/j.tre.2023.103337.Cost minimizing decisions on equipment and charging schedule for electric buses in a single depot / N. Guschinsky, M. Y. Kovalyov, E. Pesch, B. Rozin // Transportation Research Part E.  2023.  Vol. 180.  Art. 103337. – DOI: 10.1016/j.tre.2023.103337.Ковалев, М. Я. Подход к оптимизации зарядной инфраструктуры автономных троллейбусов для городских маршрутов / М. Я. Ковалев, Б. М. Розин, И. А. Шатерник // Информатика.  2021. – Т. 18, № 4.  C. 79–95.Ковалев, М. Я. Подход к оптимизации зарядной инфраструктуры автономных троллейбусов для городских маршрутов / М. Я. Ковалев, Б. М. Розин, И. А. Шатерник // Информатика.  2021. – Т. 18, № 4.  C. 79–95.Kovalyov, M. Y. A note on scheduling container storage operations of two non-passing stacking cranes / M. Y. Kovalyov, E. Pesch, A. Ryzhikov // Networks. – 2018. – Vol. 71, no. 3. – P. 271–280.Kovalyov, M. Y. A note on scheduling container storage operations of two non-passing stacking cranes / M. Y. Kovalyov, E. Pesch, A. Ryzhikov // Networks. – 2018. – Vol. 71, no. 3. – P. 271–280.Planning container inspection and repair: A case study / M. Y. Kovalyov, K. A. Kuzmicz, M. N. Lukashevich, E. Pesch // Computers and Operations Research. – 2024. – Vol. 164. – Art. 106555.Planning container inspection and repair: A case study / M. Y. Kovalyov, K. A. Kuzmicz, M. N. Lukashevich, E. Pesch // Computers and Operations Research. – 2024. – Vol. 164. – Art. 106555.Kovalyov, M. Y. Cost minimizing planning of container inspection and repair in multiple facilities / M. Y. Kovalyov, M. N. Lukashevich, E. Pesch // OR Spectrum. – 2023. – Vol. 45, no. 1. – P. 181–204.Kovalyov, M. Y. Cost minimizing planning of container inspection and repair in multiple facilities / M. Y. Kovalyov, M. N. Lukashevich, E. Pesch // OR Spectrum. – 2023. – Vol. 45, no. 1. – P. 181–204.Barketau, M. S. Minimizing maximum weight of subsets of a maximum matching in a bipartite graph / M. S. Barketau, E. Pesch, Y. M. Shafransky // Discrete Applied Mathematics. – 2015. – Vol. 196. – P. 4–19.Barketau, M. S. Minimizing maximum weight of subsets of a maximum matching in a bipartite graph / M. S. Barketau, E. Pesch, Y. M. Shafransky // Discrete Applied Mathematics. – 2015. – Vol. 196. – P. 4–19.Barketau, M. S. Scheduling dedicated jobs with variative processing times / M. S. Barketau, E. Pesch, Y. M. Shafransky // Journal of Combinatorial Optimization. – 2016. – Vol. 31. – P. 774–785.Barketau, M. S. Scheduling dedicated jobs with variative processing times / M. S. Barketau, E. Pesch, Y. M. Shafransky // Journal of Combinatorial Optimization. – 2016. – Vol. 31. – P. 774–785.Gribkovskaia, I. Minimizing takeoff and landing risk in helicopter pickup and delivery operations / I. Gribkovskaia, O. Halskau, M. Y. Kovalyov // Omega. – 2015. – Vol. 55. – P. 73–80.Gribkovskaia, I. Minimizing takeoff and landing risk in helicopter pickup and delivery operations / I. Gribkovskaia, O. Halskau, M. Y. Kovalyov // Omega. – 2015. – Vol. 55. – P. 73–80.Dolgui, A. Simple paths with exact and forbidden lengths / A. Dolgui, M. Y. Kovalyov, A. Quilliot // Naval Research Logistics. – 2018. – Vol. 65, no. 1. – P. 78–85.Dolgui, A. Simple paths with exact and forbidden lengths / A. Dolgui, M. Y. Kovalyov, A. Quilliot // Naval Research Logistics. – 2018. – Vol. 65, no. 1. – P. 78–85.Bi-criteria path problem with minimum length and maximum survival probability / N. Halman, M. Y. Kovalyov, A. Quilliot [et al.] // OR Spectrum. – 2019. – Vol. 41, no. 2. – P. 469–489.Bi-criteria path problem with minimum length and maximum survival probability / N. Halman, M. Y. Kovalyov, A. Quilliot [et al.] // OR Spectrum. – 2019. – Vol. 41, no. 2. – P. 469–489.Naumann, S. Pedestrian route search based on OpenStreet Map / S. Naumann, M. Y. Kovalyov // Advances in Intelligent Systems and Computing. – 2016. – Vol. 505. – P. 87–96.Naumann, S. Pedestrian route search based on OpenStreet Map / S. Naumann, M. Y. Kovalyov // Advances in Intelligent Systems and Computing. – 2016. – Vol. 505. – P. 87–96.A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines / C. T. Ng, T. C. E. Cheng, A. Bandalouski [et al.] // Journal of the Operational Research Society. – 2014. – Vol. 65, no. 14. – P. 1571–1579.A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines / C. T. Ng, T. C. E. Cheng, A. Bandalouski [et al.] // Journal of the Operational Research Society. – 2014. – Vol. 65, no. 14. – P. 1571–1579.An overview of revenue management and dynamic pricing models in hotel business / A. M. Bandalouski, M. Y. Kovalyov, E. Pesch, S. A. Tarim // RAIRO – Operations Research. – 2018. – Vol. 52, no. 1. – P. 119–141.An overview of revenue management and dynamic pricing models in hotel business / A. M. Bandalouski, M. Y. Kovalyov, E. Pesch, S. A. Tarim // RAIRO – Operations Research. – 2018. – Vol. 52, no. 1. – P. 119–141.Dynamic pricing with demand disaggregation for hotel revenue management / A. M. Bandalouski, N. G. Egorova, M. Y. Kovalyov [et al.] // Journal of Heuristics. – 2021. – Vol. 27. – P. 869–885.Dynamic pricing with demand disaggregation for hotel revenue management / A. M. Bandalouski, N. G. Egorova, M. Y. Kovalyov [et al.] // Journal of Heuristics. – 2021. – Vol. 27. – P. 869–885.Internet shopping with price sensitive discounts / J. Blazewicz, P. Bouvry, M. Y. Kovalyov, J. Musial // 4OR – Quarterly Journal of Operational Research. – 2014. – Vol. 12. – P. 35–48.Internet shopping with price sensitive discounts / J. Blazewicz, P. Bouvry, M. Y. Kovalyov, J. Musial // 4OR – Quarterly Journal of Operational Research. – 2014. – Vol. 12. – P. 35–48.

The authors declare that there are no conflicts of interest present.