( en | de | ru )

 

Disambiguation of "Kovalyov, Mikhail Y."

Author of the publication

copydeleteadd this publication to your clipboard
Scheduling with controllable release dates and processing times: Total completion time minimization.

, , and . Eur. J. Oper. Res., 175 (2): 769-781 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mikhail Salzmann

Mikhail Dobrynin

Mikhail Karnevskiy

Mikhail Shamonin

Mikhail Pletyukhov

 

Other publications of authors with the same name

Multi-product lot-sizing and sequencing on a single imperfect machine., , and . Comput. Optim. Appl., 50 (3): 465-482 (2011)Single machine group scheduling with ordered criteria., and . Ann. Oper. Res., 57 (1): 191-201 (1995)Single machine scheduling with a variable common due date and resource-dependent processing times., , , and . Comput. Oper. Res., 30 (8): 1173-1185 (2003)Complexity of Buffer Capacity Allocation Problems for Production Lines with Unreliable Machines., , , and . J. Math. Model. Algorithms Oper. Res., 12 (2): 155-165 (2013)Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs., , , , and . Inf. Sci., (2013)A polynomial approximation scheme for problem F2/rj/Cmax., and . Oper. Res. Lett., 20 (2): 75-79 (1997)Provision-after-wait with preferences ordered by difference: Tighter complexity and better approximation., , and . Eur. J. Oper. Res., 289 (3): 1008-1012 (2021)Single machine scheduling with assignable due dates to minimize maximum and total late work., , , and . Eur. J. Oper. Res., 308 (1): 76-83 (July 2023)On the approximability of the Simplified Partial Digest Problem., , , , and . Discret. Appl. Math., 157 (17): 3586-3592 (2009)Min-sum controllable risk problems with concave risk functions of the same value range., , , and . Networks, 79 (1): 105-116 (2022)