( en | de | ru )

 

Disambiguation of "Tan, Zhiyi"

Author of the publication

copydeleteadd this publication to your clipboard
Online parallel machines scheduling with two hierarchies.

, , and . Theor. Comput. Sci., 410 (38-40): 3597-3605 (2009)

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.

Zhiyi Ding

Zhiyi Lv

Dao Tan

Albert Tan

Vivien Tan

 

Other publications of authors with the same name

Pseudo lower bounds for online parallel machine scheduling., and . Oper. Res. Lett., 43 (5): 489-494 (2015)Minimizing Total Completion Time of Batch Scheduling with Nonidentical Job Sizes., , and . COCOA (1), volume 10627 of Lecture Notes in Computer Science, page 165-179. Springer, (2017)Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data., , and . Inf. Comput., 196 (1): 57-70 (2005)Editorial: In memoriam: Yong He (1969-2005)., and . J. Comb. Optim., 12 (4): 325-326 (2006)Tighter bounds of the First Fit algorithm for the bin-packing problem., and . Discret. Appl. Math., 158 (15): 1668-1675 (2010)Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system., and . Sci. China Ser. F Inf. Sci., 47 (2): 161-169 (2004)Linear Time Algorithms for Parallel Machine Scheduling., and . AAIM, volume 3521 of Lecture Notes in Computer Science, page 172-182. Springer, (2005)A Mathematical Programming Approach for Online Hierarchical Scheduling., and . COCOA, volume 5573 of Lecture Notes in Computer Science, page 438-450. Springer, (2009)Semi-online Problems on Identical Machines with Inexact Partial Information., and . COCOON, volume 3595 of Lecture Notes in Computer Science, page 297-307. Springer, (2005)PRM-KGED: paper recommender model using knowledge graph embedding and deep neural network., , , , , and . Appl. Intell., 53 (24): 30482-30496 (December 2023)