PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Tian, Ji"

Author of the publication

copydeleteadd this publication to your clipboard
Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time.

, , , and . Theor. Comput. Sci., (2016)

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.

Yanjun Ji University of Stuttgart

Jun. -Prof. Chengzhe Tian University of Stuttgart

Carlos Eduardo Jimenez University of Stuttgart

Chuhan Jiao University of Stuttgart

Tian Qiu University of Stuttgart

 

Other publications of authors with the same name

A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times., , , and . J. Comb. Optim., 17 (2): 206-213 (2009)A best online algorithm for scheduling on two parallel batch machines., , and . Theor. Comput. Sci., 410 (21-23): 2291-2294 (2009)A Model Based Load-Balancing Method in IaaS Cloud., , , , , and . ICPP, page 808-816. IEEE Computer Society, (2013)Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan., , , and . Inf. Process. Lett., 114 (4): 179-184 (2014)On-line scheduling with delivery time on a single batch machine., , and . Theor. Comput. Sci., 374 (1-3): 49-57 (2007)Stable-Aware Traffic Assignment for Multi-path Routing in Cognitive Radio Ad Hoc Networks., and . CyberC, page 511-514. IEEE Computer Society, (2011)An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times., , and . Inf. Process. Lett., 111 (21-22): 1048-1053 (2011)Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time., , , and . Theor. Comput. Sci., (2016)Online scheduling on unbounded parallel-batch machines with incompatible job families., , , and . Theor. Comput. Sci., 412 (22): 2380-2386 (2011)Online scheduling on unbounded parallel-batch machines to minimize the makespan., , , and . Inf. Process. Lett., 109 (21-22): 1211-1215 (2009)