Kovalyov Mikhail
Curriculum Vitae
1. Name (last name, other names): Kovalyov, Mikhail Y.
2. Working address: Prof. Mikhail Y. Kovalyov United Institute of Informatics Problems, National Academy of Sciences of Belarus, Surganova 6, 220012 Minsk, Belarus Tel.: +375 17 2842063 (office), +375 29 3842063 (mobile) Fax: +375 17 3318403 E-mail: kovalyov my@newman.bas-net.by
3. Nationality: Belarus
4. Date and place of birth: 28.11.1959, Mogilev region, USSR
5. Marital status: Married, 2 sons.
6. Language abilities: Russian, Byelorussian, English.
7. Education: Graduated from Belarusian State University (Minsk), Faculty of Applied
Mathematics, in 1982 (diploma with honor).
8. Academic Qualifications:
Scientific degrees:
1) Candidate of Sciences degree in mathematical cybernetics, 1986;
2) Doctor of Sciences degree in mathematical cybernetics, 1999.
Titles:
1) Senior researcher in mathematical cybernetics, 1991;
2) Professor in computer science, 2004.
9. Employment record and duties:
From 1982 to 2002, M.Y. Kovalyov has held the positions of junior researcher, researcher, senior researcher, leading researcher and principal researcher (the highest research position) in the Institute of Engineering Cybernetics, National Academy of Sciences of Belarus (Minsk). From 2002 to 2009, he was a professor in the Faculty of Economics, Belarusian State University, and a part-time leading researcher in the United Institute of Informatics Problems (former Institute of Engineering Cybernetics), National Academy of Sciences of Belarus. From 2009, he is Deputy General Director of the United Institute of Informatics Problems, and a part-time professor in the Faculty of Applied Mathematics and Informatics, Belarusian State University.
M.Y. Kovalyov has been a supervisor and a co-supervisor of seven defended Ph.D. dissertations by Maciej Lichtenstein, Marcin Marek, Tomasz Krysiak, Marcin Winczaszek, Radoslaw Rudek (all from Wroclaw University of Technology, Poland), Sergei Chubanov (University of Siegen, Germany) and Maxim Barketau (Belarusian State University, Minsk).
10. Research fellowships and international collaboration:
| University or Research Center | Year | Length of stay (months) |
| Erasmus University Rotterdam, The Netherlands | 1989 | 3 |
| The Hong Kong Polytechnic University, Hong Kong | 1993-1994 | 4 |
| — ” — | 1995 | 3 |
| — ” — ” — | 1997 | 3 |
| — ” — ” — | 2000 | 3 |
| — ” — ” — | 2001 | 2 |
| — ” — ” — | 2002 | 2 |
| — ” — ” — | 2003 | 2 |
| — ” — ” — | 2004 | 2 |
| — ” — ” — | 2005 | 2 |
| — ” — ” — | 2006 | 2 |
| — ” — ” — | 2007 | 2 |
| — ” — ” — | 2010 | 1 |
| York University, Canada | 1996 | 2 |
| Memorial University of Newfoundland, Canada | 1996 | 1 |
| — ” — ” — | 1998 | 3 |
| Greenwich University, UK | 1998 | 1.5 |
| Poznan University of Technology, Poland | 2000 | 1 |
| Ecole des Mines de Nancy (France) | 2000 | 1 |
| — ” — ” — | 2001 | 1.5 |
| — ” — ” —
| 2003 | 2 |
| — ” — ” — | 2006 | 2 |
| Ecole des Mines de Saint-Etienne (France) | 2007 | 2 |
| University Paris-Dauphine (France) | 2008 | 1 |
| Siegen University (Germany) | 2008-2009 | 4 |
Mikhail Y. Kovalyov was employed as Senior Research Fellow at The Hong Kong Polytechnic University, as Invited Professor of the 1st Class at Ecole des Mines de Nancy, Ecole des Mines de Saint-Etienne, University Paris-Dauphine and Siegen University. He has had short-term scientific visits to Wroclaw, Gdansk and Poznan Universities of Technology (Poland), Magdeburg, Osnabrueck, Saarbrucken and Siegen Universities (Germany), Twente and Eindhoven Universities, Mathematical Center Amsterdam (The Netherlands), Grenoble University and Ecole des Mines de Saint-Etienne (France), Southampton University (UK), Toronto University (Canada), Molde University College (Norway), Kuwait University.
11. International collaboration: Prof. Kovalyov has participated in seven international projects. Five of them were funded by the International Association for Promotion Cooperation with Scientists from Former Soviet Union (INTAS), and two were funded by the International Science and Technology Center (ISTC). He was one of the organizers of the international colloquium on scheduling theory and its applications (Minsk 1992), international conference on discrete optimization (Minsk 2000), international conferences “Tanaev’s readings” (Minsk 2003, 2005, 2007 and 2010), chaired sessions at the international conferences on operations research (Dresden, 2000, Bonn 2009, Lisbon 2010) and the workshop on discrete optimization (Wittenberg 2002). He was a member of the program committees of the conferences “Production management and scheduling” (Nancy 2004,
Poznan 2006, Istanbul 2008, Tours 2010) and “Discrete optimization methods” (Omsk 2004), an invited speaker for the conference ECCO (European Chapter on Combinatorial Optimization) XVII (Beirut 2004), the chairman of the program and organizing committees of the conference ECCO XVIII (Minsk 2005) and “Tanaev’s readings” (Minsk, 2010). M.Y. Kovalyov is an Associate Editor for OMEGA -The International Journal of Management Science, Advisory Board member for European Journal of Operational Research and Computers and Operations Research, a member of EURO working group on production management and scheduling, and a reviewer for many international journals on operations research, management science and computer science. He is Vice-president of the Byelorussian Operational Research Society.
12. Research interests: scheduling, production planning, line balancing, combinatorial optimization, logistics, inventory control, bioinformatics.
13. Awards:
Young Scientist Award of Belarus in the field of science and technology, 1990.
State Prize of Belarus in the field of science and technology, 1998.
Prize of the National Academy of Sciences of Belarus, 2001.
14. Publications:
|
Type of publication
|
in Russian
|
in English
|
Total
|
|
Book
Chapter in a book
Course of lectures
Paper in an international journal
Paper in a national journal
Paper in international conference proceedings
Paper in national conference proceedings
Industrial report
Government project report
Preprint or published working paper
Presentation at an international conference
Presentation at a national conference
|
1
–
1
–
21
–
–
4
31
5
–
10
|
–
1
–
92
–
4
3
–
–
37
30
–
|
1
1
1
92
21
4
3
4
31
42
30
10
|
M.Y. Kovalyov has published 111 scientific journal articles, a course of lectures “Theory of algorithms” (M.Y. Kovalyov, V.M. Kotov, V.V. Lepin, Belarusian State University Press, 2003, in Russian), a chapter in a book “Scheduling in computer and manufacturing systems” (Wydawnictwa Komunikacji i Lacznosci, Warszawa, Poland, 2006) and a monograph “Scheduling Theory. Group Technologies” (V.S.Tanaev, M.Y.Kovalyov, Y.M.Shafransky, Minsk, 1998, in Russian). The monograph studies batch scheduling problems. A unification of the existing terminology has been done, notation system has been developed. The problems have been classified with regard to the type of the processing systems. Analysis of their computational complexity has been provided. The most applicable and efficient solution methods have been described. The paper “Scheduling with batching: a review” (European Journal of Operational Research 120 (2000) 228-249) coauthored with C.N. Potts was selected for the list of 30 best papers published by European Journal of Operational Research in 1975-2005. M.Y. Kovalyov has been a guest editor for the special issues “Scheduling in batch processing industries and supply chains” of International Journal of Production Economics (2007) and “Combinatorics for modern manufacturing, logistics and supply chains” of European Journal of Operational Research (2008). The number of citations of his publications exceeds 1100 and his citation h-index is 16 according to Scopus.
15. Scientific journal articles in English:
1. Kovalyov M.Y., Shafransky Y.M. The construction of e-approximate algorithms for the optimization of functions in successively constructed sets. U.S.S.R. Comput. Maths. Math. Phys. (Pergamon Journals Ltd.) 1988. V. 26. N 4. P. 30-38.
2. Kovalyov M.Y., Shafransky Y.M., Strusevich V.A., Tanaev V.S., Tuzikov A.V. Approximation scheduling algorithms: a survey. Optimization (Berlin) 1989. N 6. 859-878.
3. Kovalyov M.Y., Potts C.N., Van Wassenhove L.N. A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work. Mathematics of Operations Research. 1994. V. 19. N 1. 86-94.
4. Kovalyov M.Y., Tuzikov A.V. Sequencing groups of jobs on a single machine subject to precedence constraints. Applied Mathematics and Computer Science 1994. V. 4. N 4. 635-641.
5. Kovalyov M.Y. Improving the complexities of approximation algorithms for optimization problems. Operations Research Letters. 1995. V. 17. 85-87.
6. Janiak A., Kovalyov M.Y. Single machine group scheduling with ordered criteria. Annals of Operations Research. 1995. V. 57. 191-201.
7. Cheng T.C.E., Kovalyov M.Y. Single machine batch scheduling with deadlines and resource dependent processing times. Operations Research Letters. 1995. V. 17. 243-249.
8. Brucker P., Kovalyov M.Y. Single machine batch scheduling to minimize the weighted number of late jobs. Mathematical Methods of Operations Research. 1996. V. 43. 1-8.
9. Cheng T.C.E., Kovalyov M.Y., Tuzikov A.V. Single machine group scheduling with two ordered criteria. Journal of the Operational Research Society. 1996. V. 47. 315-320.
10. Kovalyov M.Y. A rounding technique to construct approximation algorithms for knapsack and partition type problems. Applied Mathematics and Computer Science. 1996. V.6. N 4. 101-113.
11. Cheng T.C.E., Gordon V.S., Kovalyov M.Y. Single machine scheduling with batch deliveries. European Journal of Operations Research. 1996. V. 94. 277-283.
12. Janiak A., Kovalyov M.Y. Single machine scheduling subject to deadlines and resource dependent processing times. European Journal of Operations Research. 1996. V. 94. 284-291
13. Cheng T.C.E., Kovalyov M.Y. Batch scheduling and common due date assignment on a single machine. Discrete Applied Mathematics. 1996. V. 70. 231-245.
14. Cheng T.C.E., Chen Z.-L., Kovalyov M.Y., Lin B.M.T. Parallel-machine batching and scheduling to minimize total completion time. IIE Transactions. 1996. V. 28. 953-956.
15. Cheng T.C.E., Kovalyov M.Y., Lin B.M.T. Single machine scheduling to minimize batch delivery and job earliness penalties. SIAM Journal on Optimization. 1997. V. 7. 547-559.
17. Kovalyov M.Y., Werner F. A polynomial approximation scheme for problem F 2/rj/Cmax. Operations Research Letters. 1997. V. 20. 75–79.
18. Kovalyov M.Y., Shafransky Y.M. Batch scheduling with deadlines on parallel machines: an NP-hard case. Discrete Applied Mathematics. 1997. V. 64. 69–74.
19. Kovalyov M.Y. Batch scheduling and common due date assignment problem: an NP-hard case. Discrete Applied Mathematics. 1997. V. 80. 251–254.
20. Cheng T.C.E., Janiak A., Kovalyov M.Y. Bicriterion single machine scheduling with resource dependent processing times. SIAM Journal on Optimization. 1998. V. 8. N 2. 617-630.
21. Kovalyov M.Y., Kubiak W. A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs. Journal of Heuristics. 1998. V. 3. 287–297.
22. Kovalyov M.Y., Shafransky Y.M. Uniform machine scheduling of unit-time jobs subject to resource constraints. Discrete Applied Mathematics. 1998. V. 84. 253–257.
22. Brucker P., Gladky A., Hoogeveen H., Kovalyov M.Y., Potts C.N., Tautenhahn T., van de Velde S. Scheduling a batching machine. Journal of Scheduling. 1998. V. 1. 31–54.
23. Brucker P., Kovalyov M.Y., Shafransky Y.M., Werner F. Parallel machine batch scheduling with deadlines and sequence-independent setup times. Annals of Operations Research. 1998. V. 83. 23–40.
24. Cheng T.C.E., Kovalyov M.Y. An exact algorithm for batching and scheduling two part types in a mixed shop: a technical note. International Journal of Production Economics. 1998. V. 55. N 1. 53–56.
25. Cheng T.C.E., Kovalyov M.Y. Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness. European Journal of Operations Research. 1999. V. 114. N 2. 403-410.
26. Kovalyov M.Y., Kubiak W. A fully polynomial approximation scheme for the weighted earliness-tardiness problem. Operations Research. 1999. V. 47. N 5. 757-761.
27. Cheng T.C.E., Kovalyov M.Y. Parallel machine batching and scheduling with deadlines. Journal of Scheduling. 2000. V. 3. 109-123.
28. Potts C.N., Kovalyov M.Y. Scheduling with batching: a review. European Journal of Operational Research. 2000. V. 120. 228-249.
29. Cheng T.C.E., Kovalyov M.Y. Single machine batch scheduling with sequential job processing. IIE Transactions. 2001 V. 33. 413-420.
30. Kovalyov M.Y., Kubiak W., Yeomans J.S. A computational analysis of balanced JIT optimization algorithms. INFOR. 2001. V. 39. N 3. 299-316.
31. Pattloch M., Schmidt G., Kovalyov M.Y. Heuristic algorithms for lotsize scheduling with application in the tobacco industry. Computers and Industrial Engineering. 2001. V. 39. 235-253.
32. Cheng T.C.E., Janiak A., Kovalyov M.Y. Single machine batch scheduling with resource dependent setup and processing times. European Journal of Operations Research. 2001. V. 135. 177-183.
33. Cheng T.C.E., Kovalyov M.Y. Single supplier scheduling for multiple deliveries. Annals of Operations Research. 2001. V. 107. 51-63.
34. Kovalyov M.Y., Werner F. Approximation schemes for scheduling jobs with common due date to minimize total tardiness. Journal of Heuristics. 2002. V. 8. 415-428.
35. Kubiak W., Cheng J., Kovalyov M.Y. Fast fully polynomial approximation schemes for minimizing completion time variance. European Journal of Operations Research. 2002. V. 137. 303-309.
36. Kovalyov M.Y., Pattloch M., Schmidt G. A polynomial algorithm for lot-size scheduling of two task types. Information Processing Letters. 2002. V. 83. 229-235.
38. Bachman A., Janiak A., Kovalyov M.Y. Minimizing the total weighted completion time of deteriorating jobs. Information Processing Letters. 2002. V. 81. 81-84.
39. Blazewicz J., Kovalyov M.Y. Complexity of two group scheduling problems. Journal of Scheduling. 2002. V. 5. 477-485.
40. Cheng T.C.E., Kovalyov M.Y. An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note. Computers and Operations Research. 2002. V. 29. 2087-2091.
41. Cheng T.C.E., Ding Q., Kovalyov M.Y., Bachman A., Janiak A. Scheduling jobs with piecewise linear decreasing processing times. Naval Research Logistics. 2003. V. 50. 1-24.
42. Ng C.T., Cheng T.C.E., Kovalyov M.Y., Lam S.S. Single machine scheduling with a variable common due date and resource dependent processing times. Computers and Operations Research. 2003. V. 30. 1173-1185.
43. Ng C.T.D., Cheng T.C.E., Kovalyov M.Y. Batch scheduling with controllable setup and processing times to minimize total completion time. Journal of the Operational Research Society. 2003. V. 54. 499-506.
43. Cheng T.C.E., Kovalyov M.Y. Scheduling a single server in a two-machine .ow shop. Computing. 2003. V. 70. 167-180.
44. Ng C.T., Cheng T.C.E., Kovalyov M.Y. Single machine batch scheduling with jointly compressible setup and processing times. European Journal of Operational Research. 2004. V. 153. 211-219.
45. Cheng T.C.E., Kovalyov M.Y., Chakhlevich K.N. Batching in a two-stage .owshop with dedicated machines in the second stage. IIE Transactions. 2004. V. 36. 87-93.
46. Kovalyov M.Y., Potts C.N., Strusevich V.A. Batching decisions for assembly production systems. European Journal of Operational Research. 2004. V.157. 620-642.
47. Ng C.T., Kovalyov M.Y. An FPTAS for scheduling two-machine flowshop with one unavailability interval. Naval Research Logistics. 2004. V. 51. 307-315.
48. Aloulou M.A., Kovalyov M.Y., Portmann M.-C. Maximization problems in single machine scheduling. Annals of Operations Research. 2004. V. 129. 21-32.
49. Blazewicz J., Machowiak M., Weglarz J., Kovalyov M.Y., Trystram D. Scheduling malleable tasks on parallel processors to minimize the makespan. Annals of Operations Research. 2004. V. 129. 65-80.
50. Janiak A., Kovalyov M.Y., Kubiak W., Werner F. Positive half-products and scheduling with controllable processing times. European Journal of Operational Research. 2005. V. 165. 416-422.
51. Janiak A., Kovalyov M.Y., Portmann M.-C. Single machine group scheduling with resource dependent setup and processing times. European Journal of Operational Research. 2005. V. 162. 112-121.
52. Oulamara A., Kovalyov M.Y., Finke G. Scheduling a no-wait flow shop with unbounded batching machines. IIE Transactions. 2005. V. 37. 685-696.
53. Ng C.T., Cheng T.C.E., Janiak A., Kovalyov M.Y. Group scheduling with controllable setup and processing times: minimizing total weighted completion time. Annals of Operations Research. 2005. V. 133. 163-174.
54. Janiak A., Kovalyov M.Y. Scheduling in a contaminated area: a model and polynomial algorithms. European Journal of Operational Research. V. 173. 2006. 125-132.
55. Cheng T.C.E., Kovalyov M.Y., Shakhlevich N.V. Scheduling with controllable release dates and processing times: Makespan minimization. European Journal of Operational Research. V. 175. 2006. 751-768.
56. Cheng T.C.E., Kovalyov M.Y., Shakhlevich N.V. Scheduling with controllable release dates and processing times: Total completion time minimization. European Journal of Operational Research. V. 175. 2006. 769-781.
57. Blazewicz J., Machowiak M., Weglarz J., Kovalyov M.Y., Trystram D. Preemptable malleable task scheduling problem. IEEE Transactions on Computers. V. 55. 2006. 486-490.
58. Inderfurth K., Janiak A., Kovalyov M.Y., Werner F. Batching work and rework processes with limited deterioration of reworkables. Computers and Operations Research. V.33. 2006. 1595-1605.
59. Janiak A., Kovalyov M.Y. Job sequencing with exponential functions of processing times. Informatica. 2006. V. 17. 13-24.
60. Chubanov S., Kovalyov M.Y., Pesch E. An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure. Mathematical Programming Series A. 2006. V. 106. 453-466.
61. Kovalyov M.Y., Portmann M.-C., Oulamara A. Optimal testing and repairing a failed series system. Journal of Combinatorial Optimization. 2006. V. 12. 279-295.
62. Janiak A., Kovalyov M.Y. Scheduling deteriorating jobs. In: Scheduling in computer and manufacturing systems, Wydawnictwa Komunikacji i Lacznosci, Warszawa, Poland, 2006. pp. 12-22.
63. Kovalyov M.Y., Werner F. Problem F 2||Cmax with jobs forbidden in the .rst or last position is easy. European Journal of Operational Research. 2007. V. 177. 1310-1311.
64. Kovalyov M.Y., Ng C.T., Cheng T.C.E. Fixed interval scheduling: models, applications, computational complexity and algorithms. European Journal of Operational Research. 2007. V. 178. 331-342.
65. Cheng T.C.E., Ng C.T.D., Kovalyov M.Y. Special issue on scheduling in batch-processing industries and supply chains. International Journal of Production Economics. 2007. V. 105.
66. Inderfurth K., Kovalyov M.Y., Ng C.T., Werner F. Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables. International Journal of Production Economics. 2007. V. 105. 345-356.
67. Aloulou M.A., Kovalyov M.Y., Portmann M.-C. Evaluating .exible solutions in single machine scheduling via objective function maximization: the study of computational complexity. RAIRO. 2007. V. 41. 1-18.
68. Janiak A., Kovalyov M.Y., Marek M. Soft due window assignment and scheduling on parallel machines. IEEE Transactions on System, Man, and Cybernetics Part A: Systems and Humans. 2007. V. 37. N 5. 614-620.
69. Al-Anzi F.S., Allahverdi A., Kovalyov M.Y. Batching deteriorating items with applications in computer communication and reverse logistics. European Journal of Operational Research. 2007. V. 182. 1002-1011.
70. Blazewicz J., Burke E., Kasprzak M., Kovalev A., Kovalyov M.Y. Simpli.ed Partial Digest Problem: enumerative and dynamic programming algorithms. IEEE Transactions on Computational Biology and Bioinformatics. 2007. V.4. N.4. 668-680.
71. Ng C.T., Kovalyov M.Y. Batching and scheduling in a multi-machine .ow shop. Journal of Scheduling. 2007. V.10. N 6. 353-364.
72. Barketau M.S., Cheng T.C.E., Kovalyov M.Y., Ng C.T. Batch scheduling of deteriorating products. Decision Making in Manufacturing and Service. 2007. V.1. N 1-2. 25-34.
73. Barketau M.S., Cheng T.C.E., Ng C.T., Kotov V.M., Kovalyov M.Y. Batch scheduling of step deteriorating jobs. Journal of Scheduling. 2008. V. 11. N 1. 17-28.
74. Allahverdi A., Ng C.T., Cheng T.C.E., Kovalyov M.Y. A survey of scheduling problems with setup times or costs. European Journal of Operational Research. 2008. V. 187. 985-1032.
75. Kovalyov M.Y., Martello S. Special issue on combinatorics for modern manufacturing, logistics and supply chains. European Journal of Operational Research. 2008. V. 189. 803299-300. 806.
76. Chubanov S., Kovalyov M.Y., Pesch E. A single-item economic lot-sizing problem with a non-uniform resource: approximation. European Journal of Operational Research. 2008. V. 189. 877-889. 77.
Barketau M.S., Cheng T.C.E., Kovalyov M.Y. Batch scheduling of deteriorating reworkables. European Journal of Operational Research. 2008. Vol. 11. 17-28.
78. Ng C.T., Kovalyov M.Y., Cheng T.C.E. An FPTAS for a supply scheduling problem with non-monotone cost functions. Naval Research Logistics. 2008. V. 55. 194-199.
79. Cheng T.C.E., Kovalyov M.Y., Ng C.T., Lam S.S. Group sequencing around a common due date. Discrete Optimization. 2008. V. 5. 594-604.
80. Eremeev A.V., Kovalyov M.Y., Kuznetsov P.M. Approximate solution of the control problem of supplies with many intervals and concave cost functions. Automation and Remote Control. 2008. V. 69. 1181-1187.
81. Dolgui A., Kovalyov M.Y., Shchamialiova K. Lot-sizing and sequencing on a single imperfect machine. In: H.A. Le Thi, P. Bouvry, and T. Pham Dinh (Eds.), MCO 2008. Communications in Computer and Information Science. 2008. V. 14. 117-125.
82. Ng C.T., Cheng T.C.E., Kotov V., Kovalyov M.Y. The EOQ problem with decidable warehouse capacity: analysis, solution approaches and applications. Discrete Applied Mathematics. 2009. V. 157. 1806-1824.
83. Blazewicz J., Burke E., Kasprzak M., Kovalev A., Kovalyov M.Y. On the approximability of the Simpli.ed Partial Digest Problem. Discrete Applied Mathematics. 2009. Vol. 157. 3586-3592.
84. Ng C.T., Kovalyov M.Y., Cheng T.C.E. A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure. European Journal of Operational Research. 2010. Vol. 200. 621-624.
85. Dolgui A., Eremeev A.V., Kovalyov M.Y., Kuznetsov P.M., Multi-product lot-sizing and scheduling on unrelated parallel machines. IIE Transactions. 2010. V. 42. N 7. 514-524
86. Blazewicz J., Kovalyov M.Y., Musial J., Urbansky A.P., Wojciechowsky A. Internet shopping optimization problem. International Journal of Applied Mathematics and Computer Science. 2010. Vol. 20. N 2. 385-390.
87. Blazewicz J., Burke E., Kasprzak M., Kovalev A., Kovalyov M.Y. The simpli.ed partial digest problem: Approximation and a graph-theoretic model. European Journal of Operational Research. 2011. Vol. 208. 142-152.
88. Ng C.T., Barketau M.S., Cheng T.C.E., Kovalyov M.Y. “Product Partition” and related problems of scheduling and systems reliability: Computational complexity and approximation. European Journal of Operational Research. 2010. V. 207. 601-604.
89. Bellanger A., Oulamara A., Kovalyov M.Y. Minimizing total completion time on a batching machine with job processing time compatibilities. Electronic Notes in Discrete Mathematics. 2010. V. 36. 1295-1302.
90. Gordon V.S., Kovalyov M.Y., Levin G.M., Sotskov Y.N., Strusevich V.A., Tuzikov A.V., Shafransky Y.M. Creative heritage of Vyacheslav Sergeevich Tanaev: Seventieth anniversary. Automation and Remote Control. 2010. V. 71. 2021-2028.
91. Kovalyov M.Y, Pesch E. A generic approach to proving NP-hardness of partition type problems. Discrete Applied Mathematics. 2010. V. 158. 1908-1912.
92. Aissi H., Aloulou M.A., Kovalyov M.Y. Minimizing the number of late jobs on a single machine under due date uncertainty. Journal of Scheduling. 2010. Articles in press. DOI: 10.1007/s10951-010-0183-z
