Citation profile for Alexander Alekseevich Lazarev

Alexander Alekseevich Lazarev : Citation Profile

M. V. Lomonosov Moscow State University (11% share)

H index

i10 index

Citations

RESEARCH PRODUCTION:

Articles

RESEARCH ACTIVITY:

   3 years (2011 - 2014). See details.
   Cites by year: 4
   Journals where Alexander Alekseevich Lazarev has often published
   Relations with other researchers
   Recent citing documents: 2.    Total self citations: 0 (0 %)

MORE DETAILS IN:

EconPapers Author's homepage

ABOUT THIS REPORT:

   Permalink: http://citec.repec.org/pla649
   Updated: 2026-03-28    RAS profile: 2023-03-11
   Missing citations? Add them    Incorrect content? Let us know

Relations with other researchers

Works with:

Authors registered in RePEc who have co-authored more than one work in the last five years with Alexander Alekseevich Lazarev.

Is cited by:

Cites to:

Padman, Rema (2)

Main data

Where Alexander Alekseevich Lazarev has published?

Journals with more than one article published	# docs
Annals of Operations Research	3
Mathematical Social Sciences	2

Recent works citing Alexander Alekseevich Lazarev (2025 and 2024)

Year	Title of citing document
2026	Fifty years of research on resource-constrained project scheduling explored from different perspectives. (2026). Hartmann, Snke ; Vanhoucke, Mario ; Artigues, Christian. In: European Journal of Operational Research. RePEc:eee:ejores:v:328:y:2026:i:2:p:367-389. Full description at Econpapers \|\| Download paper
2024	Scheduling with non-renewable resources: minimizing the sum of completion times. (2024). Omlor, Simon ; Kirly, Tams ; Brczi, Kristf. In: Journal of Scheduling. RePEc:spr:jsched:v:27:y:2024:i:2:d:10.1007_s10951-024-00807-y. Full description at Econpapers \|\| Download paper

Works by Alexander Alekseevich Lazarev:

Year	Title	Type	Cited
2011	Single machine scheduling problems with financial resource constraints: Some complexity results and properties In: Mathematical Social Sciences. [Full Text][Citation analysis]	article	8
2013	A note on the paper ‘Single machine scheduling problems with financial resource constraints: Some complexity results and properties’ by E.R. Gafarov et al. In: Mathematical Social Sciences. [Full Text][Citation analysis]	article	0
2012	Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one In: Annals of Operations Research. [Full Text][Citation analysis]	article	0
2013	Single machine total tardiness maximization problems: complexity and algorithms In: Annals of Operations Research. [Full Text][Citation analysis]	article	3
2014	Approximability results for the resource-constrained project scheduling problem with a single type of resources In: Annals of Operations Research. [Full Text][Citation analysis]	article	3