教育经历：
工作经历：
2012.8- Xiamen University, School of Mathematical Sciences, Associate Professor
2017.8-2018.8 University of Alberta, Department of Computing Science, Visiting Professor
2009.7-2012.7 Xiamen University, School of Mathematical Sciences, Assistant Professor
研究方向：
· 运筹学 - 组合优化问题的算法设计与分析
社会兼职：
中国运筹学会排序分会第十届理事（2021-2025）
中国运筹学会 会员
中国工业与应用数学学会 会员
美国《Mathematical Reviews》 评论员（91304）
主持项目：
1. Fujian Provincial Natural Science Foundation of China (Grant No. 2021J01031), PI.
2. Fundamental Research Funds for the Central Universities (Grant No. 20720190068), PI.
3. Fundamental Research Funds for the Central Universities (Grant No. 20720160035), PI.
4. Fujian Provincial Natural Science Foundation of China (Grant No. 2012J01021), PI.
5. National Natural Science Foundation of China (Grant No. 11001232), PI.
6. Fundamental Research Funds for the Central Universities (Grant No. 2010121004), PI.
论文：
1. Yong Chen#, Yinhui Cai#, Longcheng Liu#, Guangting Chen, Randy Goebel, Guohui Lin*, Bing Su, and An Zhang, Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph, Journal of Combinatorial Optimization, Online First
2. Yong Jiang, Weifeng Lin, Longcheng Liu*, Anzhen Peng, Constrained inverse minimum flow problems under the weighted Hamming distance. Theoretical Computer Science, 883,59-68
3. Anzhen Peng, Longcheng Liu*, Weifeng Lin, Improved approximation algorithms for two-stage flexible flow shop scheduling, Journal of Combinatorial Optimization, 41, 28-42
4. Longcheng Liu*, Han Gao, Chao Li, Inverse maximum flow problem under the combination of the weighted l_2 norm and the weighted Hamming distance. Journal of the Operations Research Society of China, 9:465-474.
5. Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin*, Yue Luo, Guanqun Ni, Bing Su, Yao Xu, An Zhang, Approximation algorithms for the three-machine proportionate mixed shop scheduling, Theoretical Computer Science, 803, 57-70.
6. Yong Chen, Guangting Chen, Longcheng Liu, Yiwei Jiang, Zhiyi Tan, An Zhang*, Online scheduling with unit processing times and processing set restrictions, Journal of the Operations Research Society of China, 7, 475-484.
7. Longcheng Liu*, Wenhao Zheng, Chao Li, Inverse minimum flow problem under the weighted sum-type Hamming distance, Discrete Applied Mathematics, 229, 101-112.
8. Longcheng Liu*, Enyu Yao, Capacity inverse minimum cost flow problems under the weighted Hamming distance, Optimization Letters, 10(6), 1257-1268.
9. Xiaoyi Hu, Deqing Wang, Yurong Lin, Wei Su, Yongjun Xie, Longcheng Liu, Multi-channel time frequency shift keying in underwater acoustic communication, Applied Acoustics, 103, 54-63.
10. Longcheng Liu*, Yong Chen, Biao Wu, Enyu Yao, Some new results on inverse/reverse optimization problems under the weighted Hamming distance, Pacific Journal of Optimization, 11(4), 593-603 .
11. Yiwei Jiang, Jueliang Hu, Longcheng Liu, Yuqing Zhu, T.C.E. Cheng, Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost, Information Sciences, 269, 128-141.
12. Biao Wu, Longcheng Liu, Enyu Yao, Minizing the maximum bump cost in linear extensions of a poset, Journal of Combinatorial Optimization, 26, 509-519.
13. Longcheng Liu*, Enyu Yao, Weighted inverse maximum perfect matching problems under the Hamming distance, Journal of Global Optimization, 55, 549-557.
14. Longcheng Liu*, Biao Wu, Enyu Yao: Minimizing the sum cost in linear extensions of a poset, Journal of Combinatorial Optimization 21, 247-253.
15. Yiwei Jiang, Longcheng Liu*,Biao Wu, Enyu Yao: Inverse minimum cost flow problems under the weighted Hamming distance, European Journal of Operational Research, 207: 50-54.
16. Biao. Wu, Enyu Yao, Longcheng Liu: A polynomially solvable case of optimal linear extension problem of a poset. Journal of Combinatorial Optimization 20, 422-428.
17. Longcheng Liu*, Qin Wang: Constrained Inverse Min-Max Spanning Tree Problems under the Weighted Hamming Distance, Journal of Global Optimization, 43:83–95.
18. Longcheng Liu*, Enyu Yao: Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance, Theoretical Computer Science, 396, 28–34.
19. Longcheng Liu*, Enyu Yao: A weighted inverse minimum cut problem under the bottleneck type Hamming distance, Asia-Pacific Journal of Operational Research,24(5), 725–736.
20. Longcheng Liu*, Jianzhong Zhang: Inverse maximum flow problem under the weighted Hamming distance, Journal of Combinatorial Optimization, 12, 395-408.
21. Longcheng Liu*, Yong. He.: Inverse minimum spanning tree problem and reverse shortest path problem with discrete values, Progress in Natural Science, 16(6), 649-655.
学生培养：
硕士研究生
在读
2021 胡航源，唐经杰，于智超
2020 黄旻，杨启夏
2019 代宇波，段懿红
已毕业
2018 林伟丰，彭安镇
2017 孙晓惠，王廷鑫，郑啟豪
2016 常华飞，肖秋龙
2013 陈俞安，姜秀秀，李超
拔尖计划学生
崔佳(2013), 高寒(2014), 罗月(2015), 王子豪(2018)，扈驭枭（2018）， 王天润(2019)
授课情况：
高等数学A、B、C、E；高等数学选讲；博弈论；运筹学；组合优化 ；运筹与优化；图论
微积分I，II，III，IV，V
获奖：
