( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time.

, , и . Inf. Sci., (2013)

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.

Zhiyi Ding

Zhiyi Lv

Dao Tan

Albert Tan

Vivien Tan

 

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

Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time., , и . Inf. Sci., (2013)Tight lower bounds for semi-online scheduling on two uniform machines with known optimum., , , , и . Central Eur. J. Oper. Res., 27 (4): 1107-1130 (2019)Two semi-online scheduling problems on two uniform machines., , , и . Theor. Comput. Sci., 410 (8-10): 776-792 (2009)Semi-on-line problems on two identical machines with combined partial information., и . Oper. Res. Lett., 30 (6): 408-414 (2002)On the machine scheduling problem with job delivery coordination., , и . Eur. J. Oper. Res., 182 (3): 1057-1072 (2007)Optimal Semi-online Scheduling Algorithms on a Small Number of Machines., , и . ESCAPE, том 4614 из Lecture Notes in Computer Science, стр. 504-515. Springer, (2007)Tighter bounds of the First Fit algorithm for the bin-packing problem., и . Discret. Appl. Math., 158 (15): 1668-1675 (2010)Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data., , и . Inf. Comput., 196 (1): 57-70 (2005)Editorial: In memoriam: Yong He (1969-2005)., и . J. Comb. Optim., 12 (4): 325-326 (2006)Pseudo lower bounds for online parallel machine scheduling., и . Oper. Res. Lett., 43 (5): 489-494 (2015)