RUS  ENG
Full version
PEOPLE
Lazarev Alexander Alekseevich
Lazarev Alexander Alekseevich
Professor
Doctor of physico-mathematical sciences (2008)

Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
Phone: +79261539737
E-mail:
Website: https://www.orsot.ru/index.php/ru/blog/item/a-a-lazarev
Keywords: Scheduling theory, combinatorics, optimization methods, discrete programming, technical analysis of the securities market, parallel computing
UDC: 519.854.2, 519.853.6

Subject:

• Discrete optimization: combinatory problems, modeling, decomposition algorithms, applications to production planning and scheduling.

• Constraint Programming: combining with Integer Programming, applications to scheduling.

• Scheduling: complexity, exact and approached methods, practical scheduling problems, parallel calculations.


Main publications:
  1. A.A. Lazarev, Scheduling Theory. Methods and Algorithms., ISBN: 978-5-91450-236-9, ICS RAS, Moscow, 2019, 408 pp.
  2. D. Arkhipov, O. Battaia, A.A. Lazarev, “An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem”, European Journal of Operational Research, 275:1 (2018), 35-44
  3. A.A. Lazarev, D.I. Arkhipov, “Estimation of the Absolute Error and Polynomial Solvability for a Classical NP-Hard Scheduling Problem”, Doklady Mathematics, 97:3 (2018), 262-265
  4. A.A. Lazarev, N. Pravdivets, F. Werner, “On the Dual and Inverse Problems of Scheduling Jobs to Minimize the Maximum Penalty”, Mathematics, 8:7 (2020), 1131
  5. T.C.E. Cheng, A.A. Lazarev, E.R. Gafarov, “A hybrid algorithm for the single-machine total tardiness problem”, Computers & Operations Research, 36:2 (2009), 308-315

Publications in Math-Net.Ru

Presentations in Math-Net.Ru

Personal pages:

Organisations:

© Steklov Math. Inst. of RAS, 2024