Profile of Associate Professor Wan Long

​

    ​Name: Wan Long 

    ​Title: Associate Professor

    ​Office Phone:

    ​Email: cocu3328@163.com

​

1. Introduction

Basic Information:

Wan Long, male, was born in March 1981. He earned a PhD in Operational Research and Cybernetics at Zhejiang University and currently works as an associate professor and master supervisor at the School of Information Management, Jiangxi University of Finance and Economics.

Research Directions: Scheduling Theory, Design and Analysis of Algorithms, Algorithmic Game Theory, Big Data Analysis and Application

Work Experience:

July 2013-December 2016, School of Information Management, Jiangxi University of Finance and Economics, Lecturer

December 2016-Present, School of Information Management, Jiangxi University of Finance and Economics, Associate Professor

2. Teaching Experience

Courses Taught:

Calculus

Linear Algebra

Operational Research

Game Theory

Honors:

Outstanding Young Academic Talent of Jiangxi University of Finance and Economics

In the Tenth Chinese Mathematics Competitions in 2018, he instructed students Feng Linjun, Xue Yao, and Liang Tianxin to win first prize, second prize, and third prize respectively.

In the Eleventh Chinese Mathematics Competitions in 2019, he instructed students Xiao Wenxin and Liu Junfeng to win first prizes, Wang Xinyi and Feng Jiazhi to win second prizes, and Wang Hongjia, Chen Yifan, Chen Lichao, and Hu Fuyan to win third prizes.

3. Research Achievements

Projects Hosted:

1．A study of Pareto optimization in the scheduling field, 11426120, National Natural Science Foundation of China.

2．A study of Pareto efficiency for multi-agent scheduling problems, 11601198, National Natural Science Foundation of China.

3．Equilibrium analysis of scheduling game, 20142BAB211017, Jiangxi Natural Science Foundation.

4．Algorithmic research of multi-agent scheduling problems, GJJ150464, Science and Technology Project of the Education Department of Jiangxi Province.

5．A study of algorithmic complexity of multi-agent scheduling problems, GJJ190250, Science and Technology Project of the Education Department of Jiangxi Province.

6．Research on Layered Teaching of Operations Research, JXYJG-2015-066, Jiangxi Graduate Education Reform Project.

Papers:

1．Long Wan, Jinjiang Yuan. Simultaneous Approximation Ratios for Parallel Machine Scheduling Problems. Journal of the Operations Research Society of China,7(3): 485-500, 2019. (EI)

2．Long Wan, Jinjiang Yuan. Single-machine Scheduling with Operator Non-availability to Minimize Total Weighted Completion. Information Sciences, 445-446, 1-5, 2018. (SCI)

3．Long Wan, Lijun Wei, Naixue Xiong, Jinjiang Yuan, Jiacai Xiong, Pareto Optimization for the Two-agent Scheduling Problems with Linear Non-increasing Deterioration Based on Internet of Things. Future Generation Computer Systems, 76, 293-300, 2017. (SCI)

4．Long Wan, Jinjiang Yuan, Lijun Wei, Pareto Optimization Scheduling with Two Competing Agents to Minimize the Number of Tardy Jobs and the Maximum Cost. Applied Mathematics and Computation, 273, 912-923, 2016. (SCI)

5．Shengwu Yang, Long Wan, Na Yin. Research on Single Machine SLK/DIF Due Window Assignment Problem with Learning Effect and Deteriorating Jobs. Applied Mathematical Modeling, 39(15), 4593-4598, 2015. (SCI)

6．Dehua Xu, Long Wan, Aihui Liu, Dar-Li Yang. Single Machine Total Completion Time Scheduling Problem with Workload-dependent Maintenance Duration. Omega-The International Journal of Management Science, 52, 101-106, 2015. (SCI) 

7．Long Wan, Jinjiang Yuan, Zhichao Geng. A Note on the Preemptive Scheduling to Minimize Total Completion Time with Release Time and Deadline Constraints. Journal of Scheduling, 18, 315-323, 2015. (SCI)

8．Long Wan, Zhihao Ding, Yunpeng Li, Qianqian Chen, Zhiyi Tan. Scheduling to Minimize the Maximum Total Completion Time Per Machine. European Journal of Operational Research, 242(1), 45-50, 2015. (SCI)

9．Ma Ran, Long Wan, JinJiang Yuan. Online Bounded-batch Scheduling to Minimize Total Weighted Completion Time on Parallel Machines. International Journal of Production Economics, 156, 31-38, 2014. (SCI) 

10．Long Wan, Ran Ma, Jinjiang Yuan. Primary-Secondary Bicriteria Scheduling on Identical Machines to Minimize the Total Completion Time of All Jobs and the Maximum T-time of All Machines. Theoretical Computer Science, 518, 117-123, 2014. (SCI)

11．Long Wan, An Zhang. Coordinated Scheduling on Parallel Machines with Batch Delivery. International Journal of Production Economics, 150, 199-203, 2014. (SCI) 

12．Long Wan, Xiaofang Deng, Zhiyi Tan. Inefficiency of Nash Equilibria with Parallel Processing Policy. Information Processing Letters, 113(13), 465-469, 2013. (SCI)

13．Long Wan, Jinjiang Yuan. Single-machine Scheduling to Minimize the Total Earliness and Tardiness is Strongly NP-hard. Operations Research Letters, 41(4), 363-365, 2013. (SCI).

14．Zhiyi Tan, Long Wan, Qi Zhang, Wei Ren. Inefficiency of Equilibria for the Machine Covering Game on Uniform Machines. Acta Informatica, 49(6), 361-379, 2012. (SCI).

Books Published:

Wan Long, A Study of Scheduling Games and Related Problems, Jilin University Press, 200,000 words, 2015