Birthdate

28.11.1959

Organization

United Institute of Informatics Problems of the National Academy of Sciences of Belarus, State Scientific Institution

Position

Deputy Director

Research specialization

Research area

Algorithms & Discrete Mathematics

Research specialization

Operational Research, Scheduling, Logistics

Career

Belarusian State University (student), United Institute of Informatics Problems (junior researcher-principal researcher), Belarusian State University (professor), United Institute of Informatics Problems (deputy director)

Scientific activities

Projects

Several INTAS, NTSC, PICS (France) and other bilateral international projects (Hong Kong, Germany, Poland, Norway, Canada).

Publications

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 $F2/r_j/C_{max}.$ 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 flow 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 flowshop 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 $F2||C_{\max}$ with jobs forbidden in the first 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. 299--300.

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 flexible 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. Simplified 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 flow 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. 803--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. Janiak A., Kovalyov M.Y. Scheduling in a contaminated area: a model and heuristic algorithms. Journal of the Operational Research Society. V. 59. 2008. 977--987.

83. 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.

84. Blazewicz J., Burke E., Kasprzak M., Kovalev A., Kovalyov M.Y. On the approximability of the Simplified Partial Digest Problem. Discrete Applied Mathematics. 2009. Vol. 157. 3586--3592.

85. 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.

86. 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

87. 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.

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. Blazewicz J., Burke E., Kasprzak M., Kovalev A., Kovalyov M.Y. The simplified partial digest problem: Approximation and a graph-theoretic model. European Journal of Operational Research. 2011. Vol. 208. 142--152.

93. Dolgui A., Kovalyov M.Y., Shchamialiova K. Multi-product lot-sizing and sequencing on a single imperfect machine. Computational Optimization and Applications. Computational Optimization and Applications. 2011. V. 50(3). 465--482

94. 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. 2011. Vol. 14. N 4. 351-360.

95. Gordon V.S., Kovalyov M.Y., Levin G.M., Shafransky Y.M.,
Sotskov Yu.N., Strusevich V.A., Tuzikov A.V. Vyacheslav Tanaev: Contributions to scheduling and related areas. Journal of Scheduling. 2011. DOI: 10.1007/s10951-011-0230-4

96. Delorme X., Dolgui A., Kovalyov M.Y. Combinatorial design of a minimum cost transfer line. OMEGA. 2012. V. 40. 31--41.

97. Bellanger A., Janiak A., Kovalyov M.Y., Oulamara A., Scheduling an unbounded batching machine with job processing time compatibilities. Discrete Applied Mathematics. 2012. V. 160. 15--23.

98. Blazewicz, J., Burke, E.K., Gordon, V.S., Kovalyov, M.Y., Shafransky, Y.M., Strusevich, V.A., Editorial: new branches, old roots. Journal of Scheduling. 2011. DOI: 10.1007/s10951-011-0262-9

99. Hwang, F.J., Kovalyov, M.Y., Lin, B.M.T., Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence. Discrete Optimization. 2012. V. 9. 29--39.

Patents

Contact data

Associate Editor for OMEGA - The International Journal of Management Science, Journal of Scheduling, 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.