|
|
Publications in Math-Net.Ru
-
Models and local search algorithms for vehicle routing with returns and time windows
Bulletin of Irkutsk State University. Series Mathematics, 48 (2024), 95–110
-
Minimizing makespan for parallelizable jobs with energy constraint
Sib. Èlektron. Mat. Izv., 19:2 (2022), 586–600
-
The reduction of the Pareto set of a special structure in bicriteria discrete problems
Diskretn. Anal. Issled. Oper., 28:4 (2021), 90–116
-
Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems
Sib. Èlektron. Mat. Izv., 16 (2019), 249–257
-
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
-
On complexity of optimal recombination for flowshop scheduling problems
Diskretn. Anal. Issled. Oper., 23:2 (2016), 41–62
-
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
-
On the calendar planning problem with renewable resource
Avtomat. i Telemekh., 2012, no. 6, 140–153
-
On complexity of optimal recombination for one scheduling problem with setup times
Diskretn. Anal. Issled. Oper., 19:3 (2012), 13–26
-
On scheduling with technology based machines grouping
Diskretn. Anal. Issled. Oper., 18:5 (2011), 54–79
© , 2024