Publications in Math-Net.Ru
-
Makespan minimization in reentrant flow shop problem with identical jobs
Prikl. Diskr. Mat., 2024, no. 64, 99–111
-
Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints
Diskretn. Anal. Issled. Oper., 26:4 (2019), 56–73
-
Effective algorithms for one scheduling problem on two machines with makespan minimization
Diskretn. Anal. Issled. Oper., 22:4 (2015), 63–79
-
The complexity of cyclic scheduling for identical jobs
Diskretn. Anal. Issled. Oper., 20:4 (2013), 3–14
-
Optimization of identical jobs production on the base of cyclic schedules
Diskretn. Anal. Issled. Oper., 15:5 (2008), 47–60
-
Approximation solution of the supply management problem
Diskretn. Anal. Issled. Oper., Ser. 2, 13:1 (2006), 27–39
© , 2024