Mikhail M. Kovalev
Personal Details
First Name: | Mikhail |
Middle Name: | M. |
Last Name: | Kovalev |
Suffix: | |
RePEc Short-ID: | pko587 |
| |
Affiliation
Faculty of Economics
Belarusian State University
Minsk, Belarushttp://www.bsu.by/en/main.aspx?guid=1431
RePEc:edi:febsuby (more details at EDIRC)
Research output
Jump to: ArticlesArticles
- Gribkovskaia, Irina V. & Kovalev, Sergey & Werner, Frank, 2010. "Batching for work and rework processes on dedicated facilities to minimize the makespan," Omega, Elsevier, vol. 38(6), pages 522-527, December.
- Kovalev, Alexandr & Ng, C.T., 2008. "A discrete EOQ problem is solvable in O(logn) time," European Journal of Operational Research, Elsevier, vol. 189(3), pages 914-919, September.
- Girlich, Eberhard & Kovalev, Michail M. & Vasilkov, Dmitri M., 1997. "Greedy sets and related problems," European Journal of Operational Research, Elsevier, vol. 101(1), pages 74-80, August.
- Kovalev, M. M. & Vasilkov, D. M., 1995. "The canonical order and greedy algorithms," European Journal of Operational Research, Elsevier, vol. 80(2), pages 446-450, January.
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
- Gribkovskaia, Irina V. & Kovalev, Sergey & Werner, Frank, 2010.
"Batching for work and rework processes on dedicated facilities to minimize the makespan,"
Omega, Elsevier, vol. 38(6), pages 522-527, December.
Cited by:
- A. Beynaghi & F. Moztarzadeh & A. Shahmardan & R. Alizadeh & J. Salimi & M. Mozafari, 2019. "Makespan minimization for batching work and rework process on a single facility with an aging effect: a hybrid meta-heuristic algorithm for sustainable production management," Journal of Intelligent Manufacturing, Springer, vol. 30(1), pages 33-45, January.
- Marvizadeh, S. Zamiri & Choobineh, F.F., 2013. "Reducing the number of setups for CNC punch presses," Omega, Elsevier, vol. 41(2), pages 226-235.
- Hazen, Benjamin T. & Overstreet, Robert E. & Jones-Farmer, L. Allison & Field, Hubert S., 2012. "The role of ambiguity tolerance in consumer perception of remanufactured products," International Journal of Production Economics, Elsevier, vol. 135(2), pages 781-790.
- Cheng, Bayi & Zhu, Huijun & Li, Kai & Li, Yongjun, 2019. "Optimization of batch operations with a truncated batch-position-based learning effect," Omega, Elsevier, vol. 85(C), pages 134-143.
- Sterna, Malgorzata, 2011. "A survey of scheduling problems with late work criteria," Omega, Elsevier, vol. 39(2), pages 120-129, April.
- Cheng, Bayi & Leung, Joseph Y.-T. & Li, Kai & Yang, Shanlin, 2019. "Integrated optimization of material supplying, manufacturing, and product distribution: Models and fast algorithms," European Journal of Operational Research, Elsevier, vol. 277(1), pages 100-111.
- Kovalev, Alexandr & Ng, C.T., 2008.
"A discrete EOQ problem is solvable in O(logn) time,"
European Journal of Operational Research, Elsevier, vol. 189(3), pages 914-919, September.
Cited by:
- Li, Chung-Lun, 2009. "A new solution method for the finite-horizon discrete-time EOQ problem," European Journal of Operational Research, Elsevier, vol. 197(1), pages 412-414, August.
- Meyer, Anne & Amberg, Boris, 2018. "Transport concept selection considering supplier milk runs – An integrated model and a case study from the automotive industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 113(C), pages 147-169.
- Kovalev, M. M. & Vasilkov, D. M., 1995.
"The canonical order and greedy algorithms,"
European Journal of Operational Research, Elsevier, vol. 80(2), pages 446-450, January.
Cited by:
- Girlich, Eberhard & Kovalev, Michail M. & Vasilkov, Dmitri M., 1997. "Greedy sets and related problems," European Journal of Operational Research, Elsevier, vol. 101(1), pages 74-80, August.
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, Mikhail M. Kovalev 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.