Zhichao Geng

Orcid: 0000-0002-1443-9554

According to our database1, Zhichao Geng authored at least 17 papers between 2015 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work.
Int. J. Prod. Res., November, 2023

Single-machine scheduling of multiple projects with controllable processing times.
Eur. J. Oper. Res., August, 2023

Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost.
Inf. Process. Lett., 2023

2022
Pareto-scheduling of two competing agents with their own equal processing times.
Eur. J. Oper. Res., 2022

TURNER: The Uncertainty-based Retrieval Framework for Chinese NER.
CoRR, 2022

Improving Abstractive Dialogue Summarization with Speaker-Aware Supervised Contrastive Learning.
Proceedings of the 29th International Conference on Computational Linguistics, 2022

A Simple Hash-Based Early Exiting Approach For Language Understanding and Generation.
Proceedings of the Findings of the Association for Computational Linguistics: ACL 2022, 2022

2021
RetrievalSum: A Retrieval Enhanced Framework for Abstractive Summarization.
CoRR, 2021

CPT: A Pre-Trained Unbalanced Transformer for Both Chinese Language Understanding and Generation.
CoRR, 2021

fastHan: A BERT-based Multi-Task Toolkit for Chinese NLP.
Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, 2021

2020
Single machine batch scheduling with two non-disjoint agents and splitable jobs.
J. Comb. Optim., 2020

fastHan: A BERT-based Joint Many-Task Toolkit for Chinese NLP.
CoRR, 2020

ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost.
Appl. Math. Comput., 2020

2018
Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost.
Appl. Math. Comput., 2018

2015
Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness.
Theor. Comput. Sci., 2015

A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints.
J. Sched., 2015

A note on unbounded parallel-batch scheduling.
Inf. Process. Lett., 2015


  Loading...