Alexander Alekseevich Lazarev
Personal Details
First Name: | Alexander |
Middle Name: | Alekseevich |
Last Name: | Lazarev |
Suffix: | |
RePEc Short-ID: | pla649 |
[This author has chosen not to make the email address public] | |
http://www.hse.ru/org/persons/10586198 | |
Affiliation
(11%) Faculty of Economics
M. V. Lomonosov Moscow State University
Moscow, Russiahttp://www.econ.msu.ru/
RePEc:edi:femsuru (more details at EDIRC)
Research output
Jump to: ArticlesArticles
- Evgeny Gafarov & Alexander Lazarev & Frank Werner, 2014. "Approximability results for the resource-constrained project scheduling problem with a single type of resources," Annals of Operations Research, Springer, vol. 213(1), pages 115-130, February.
- Evgeny Gafarov & Alexander Lazarev & Frank Werner, 2013. "Single machine total tardiness maximization problems: complexity and algorithms," Annals of Operations Research, Springer, vol. 207(1), pages 121-136, August.
- Gafarov, Evgeny R. & Lazarev, Alexander A. & Werner, Frank, 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," Mathematical Social Sciences, Elsevier, vol. 65(3), pages 232-232.
- Evgeny Gafarov & Alexander Lazarev & Frank Werner, 2012. "Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one," Annals of Operations Research, Springer, vol. 196(1), pages 247-261, July.
- Gafarov, Evgeny R. & Lazarev, Alexander A. & Werner, Frank, 2011. "Single machine scheduling problems with financial resource constraints: Some complexity results and properties," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 7-13, July.
Citations
Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.Articles
- Evgeny Gafarov & Alexander Lazarev & Frank Werner, 2014.
"Approximability results for the resource-constrained project scheduling problem with a single type of resources,"
Annals of Operations Research, Springer, vol. 213(1), pages 115-130, February.
Cited by:
- Péter Györgyi & Tamás Kis, 2015. "Approximability of scheduling problems with resource consuming jobs," Annals of Operations Research, Springer, vol. 235(1), pages 319-336, December.
- Zdeněk Hanzálek & Přemysl Šůcha, 2017. "Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources," Annals of Operations Research, Springer, vol. 248(1), pages 209-237, January.
- Evgeny Gafarov & Alexander Lazarev & Frank Werner, 2013.
"Single machine total tardiness maximization problems: complexity and algorithms,"
Annals of Operations Research, Springer, vol. 207(1), pages 121-136, August.
Cited by:
- Alexander A. Lazarev & Nikolay Pravdivets & Frank Werner, 2020. "On the Dual and Inverse Problems of Scheduling Jobs to Minimize the Maximum Penalty," Mathematics, MDPI, vol. 8(7), pages 1-15, July.
- Lin-Hui Sun & Kai Cui & Ju-Hong Chen & Jun Wang & Xian-Chen He, 2013. "Research on permutation flow shop scheduling problems with general position-dependent learning effects," Annals of Operations Research, Springer, vol. 211(1), pages 473-480, December.
- Sergey Kovalev, 2015. "Maximizing total tardiness on a single machine in $$O(n^2)$$ O ( n 2 ) time via a reduction to half-product minimization," Annals of Operations Research, Springer, vol. 235(1), pages 815-819, December.
- Gafarov, Evgeny R. & Lazarev, Alexander A. & Werner, Frank, 2011.
"Single machine scheduling problems with financial resource constraints: Some complexity results and properties,"
Mathematical Social Sciences, Elsevier, vol. 62(1), pages 7-13, July.
Cited by:
- Péter Györgyi & Tamás Kis, 2019. "Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints," Journal of Scheduling, Springer, vol. 22(6), pages 623-634, December.
- Lidong Wu & Cong-Dian Cheng, 2016. "On single machine scheduling with resource constraint," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 491-505, February.
- Györgyi, Péter & Kis, Tamás, 2017. "Approximation schemes for parallel machine scheduling with non-renewable resources," European Journal of Operational Research, Elsevier, vol. 258(1), pages 113-123.
- Péter Györgyi & Tamás Kis, 2015. "Approximability of scheduling problems with resource consuming jobs," Annals of Operations Research, Springer, vol. 235(1), pages 319-336, December.
- Susumu Hashimoto & Shinji Mizuno, 2021. "A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource," Journal of Scheduling, Springer, vol. 24(3), pages 259-267, June.
- Pei, Jun & Liu, Xinbao & Fan, Wenjuan & Pardalos, Panos M. & Lu, Shaojun, 2019. "A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers," Omega, Elsevier, vol. 82(C), pages 55-69.
- Davari, Morteza & Ranjbar, Mohammad & De Causmaecker, Patrick & Leus, Roel, 2020. "Minimizing makespan on a single machine with release dates and inventory constraints," European Journal of Operational Research, Elsevier, vol. 286(1), pages 115-128.
More information
Research fields, statistics, top rankings, if available.Statistics
Access and download statistics for all items
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.
To update listings or check citations waiting for approval, Alexander Alekseevich Lazarev should log into the RePEc Author Service.
To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.
To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.
Please note that most corrections can take a couple of weeks to filter through the various RePEc services.