( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||Cmax.

, , и . Theor. Comput. Sci., (2019)

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.

Mikhail Dobrynin

Mikhail Salzmann

Mikhail Karnevskiy

Mikhail Filippov

Mikhail Sofin

 

Другие публикации лиц с тем же именем

A Transfer Line Design Problem with Setup Times and Costs., , , , и . MIM, стр. 778-783. International Federation of Automatic Control, (2013)Minimizing the total weighted completion time of deteriorating jobs., , и . Inf. Process. Lett., 81 (2): 81-84 (2002)A polynomial approximation scheme for problem F2/rj/Cmax., и . Oper. Res. Lett., 20 (2): 75-79 (1997)A parallel machine schedule updating game with compensations and clients averse to uncertain loss., , , и . Comput. Oper. Res., (2019)Scheduling with controllable release dates and processing times: Makespan minimization., , и . Eur. J. Oper. Res., 175 (2): 751-768 (2006)A single-item economic lot-sizing problem with a non-uniform resource: Approximation., , и . Eur. J. Oper. Res., 189 (3): 877-889 (2008)Batch scheduling of deteriorating reworkables., , и . Eur. J. Oper. Res., 189 (3): 1317-1326 (2008)Minimizing the number of workers in a paced mixed-model assembly line., , , и . Eur. J. Oper. Res., 272 (1): 188-194 (2019)Fast fully polynomial approximation schemes for minimizing completion time variance., , и . Eur. J. Oper. Res., 137 (2): 303-309 (2002)Scheduling with batching: A review., и . Eur. J. Oper. Res., 120 (2): 228-249 (2000)