Ji Tian
Orcid: 0000-0002-6894-3940
According to our database1,
Ji Tian
authored at least 23 papers
between 2007 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2022
Numerical Analysis and Experimental Study of the Laser Cleaning of Ceramic Insulator Contamination.
IEEE Access, 2022
2020
An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown.
J. Comb. Optim., 2020
2019
Application of Improved Collaborative Filtering in the Recommendation of E-commerce Commodities.
Int. J. Comput. Commun. Control, 2019
2017
Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs.
Theor. Comput. Sci., 2017
An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities.
J. Comb. Optim., 2017
2016
Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time.
Theor. Comput. Sci., 2016
Proceedings of the International Conference on Logistics, Informatics and Service Sciences, 2016
Proceedings of the 2016 IEEE Global Communications Conference, 2016
2014
Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan.
Inf. Process. Lett., 2014
2013
Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan.
Central Eur. J. Oper. Res., 2013
Proceedings of the 42nd International Conference on Parallel Processing, 2013
2012
An improved on-line algorithm for single parallel-batch machine scheduling with delivery times.
Discret. Appl. Math., 2012
2011
Online scheduling on unbounded parallel-batch machines with incompatible job families.
Theor. Comput. Sci., 2011
An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times.
Inf. Process. Lett., 2011
Stable-Aware Traffic Assignment for Multi-path Routing in Cognitive Radio Ad Hoc Networks.
Proceedings of the 2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, 2011
2009
Theor. Comput. Sci., 2009
On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs.
J. Sched., 2009
A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times.
J. Comb. Optim., 2009
Inf. Process. Lett., 2009
2008
Theor. Comput. Sci., 2008
Oper. Res. Lett., 2008
2007
Theor. Comput. Sci., 2007
Online scheduling in a parallel batch processing system to minimize makespan using restarts.
Theor. Comput. Sci., 2007