|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
Lidia A. Zaozerskaya, Yulia V. Zakharova, “Models and local search algorithms for vehicle routing with returns and time windows”, Bulletin of Irkutsk State University. Series Mathematics, 48 (2024), 95–110  |
|
2022 |
| 2. |
A. Kononov, Yu. Zakharova, “Minimizing makespan for parallelizable jobs with energy constraint”, Sib. Èlektron. Mat. Izv., 19:2 (2022), 586–600  |
|
2021 |
| 3. |
A. O. Zakharov, Yu. V. Kovalenko, “The reduction of the Pareto set of a special structure in bicriteria discrete problems”, Diskretn. Anal. Issled. Oper., 28:4 (2021), 90–116 |
|
2019 |
| 4. |
A. Kononov, Yu. Kovalenko, “Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems”, Sib. Èlektron. Mat. Izv., 16 (2019), 249–257  |
|
2018 |
| 5. |
A. O. Zakharov, Yu. V. Kovalenko, “Construction and reduction of the Pareto set in asymmetric travelling salesman problem with two criteria”, Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 14:4 (2018), 378–392  |
3
|
|
2016 |
| 6. |
Yu. V. Kovalenko, “On complexity of optimal recombination for flowshop scheduling problems”, Diskretn. Anal. Issled. Oper., 23:2 (2016), 41–62 ; J. Appl. Industr. Math., 10:2 (2016), 220–231  |
2
|
|
2014 |
| 7. |
A. V. Eremeev, J. V. Kovalenko, “Polynomially Solvable Cases of the Project Scheduling Problem with Changing Consumption and Supply Rates of Nonaccumulative Resources”, Bulletin of Irkutsk State University. Series Mathematics, 9 (2014), 26–38 |
|
2012 |
| 8. |
Yu. V. Kovalenko, “On the calendar planning problem with renewable resource”, Avtomat. i Telemekh., 2012, no. 6, 140–153 ; Autom. Remote Control, 73:6 (2012), 1046–1055 |
1
|
| 9. |
A. V. Eremeev, Yu. V. Kovalenko, “On complexity of optimal recombination for one scheduling problem with setup times”, Diskretn. Anal. Issled. Oper., 19:3 (2012), 13–26 |
1
|
|
2011 |
| 10. |
A. V. Eremeev, Ju. V. Kovalenko, “On scheduling with technology based machines grouping”, Diskretn. Anal. Issled. Oper., 18:5 (2011), 54–79  |
2
|
|
| Organisations |
|
| |
|
|
Contact us: