姓名：录岭法

职务/职称：教授（博士生导师）

研究领域：运筹学，组合优化，排序与调度

邮箱：lulingfa@zzu.edu.cn

简要经历

1)1998-09 至 2002-06, 郑州大学, 应用数学, 学士

2)2002-09 至 2005-06, 郑州大学, 运筹学与控制论, 硕士

3)2005-09 至 2008-06, 郑州大学, 基础数学, 博士

4)2008-07 至 2013-10, 郑州大学, 数学与统计学院, 讲师

5)2009-08 至 2011-08, 香港理工大学，商学院，博士后

6)2013-10 至 2020-05, 郑州大学, 数学与统计学院, 副教授

7)2020-05 至 今, 郑州大学, 数学与统计学院, 教授

主要项目

1. 国家自然科学基金青年项目，两阶段物流排序和工件可拒绝排序理论研究，2010-01至2012-12，主持

2. 国家自然科学基金委员会，面上项目， 基于调度管理与客户利益之间平衡的排序问题， 2012-01至2015-12，参加

3. 国家自然科学基金委员会，面上项目， 同类机上的若干排序问题研究，2016-01至2019-12，参加

4. 国家自然科学基金委员会，面上项目，优化顾客满意度的服务排序研究，2018-01至2021-12，主持

5. 国家自然科学基金委员会，面上项目，机器具有指派费用的若干排序问题研究，2020-01至2023-12，参加

6. 国家自然科学基金委员会，面上项目，工件拆分在供应链排序和工件可外包排序中的应用，2023-01至2026-12，主持

奖励

2019年获得第10届郑州大学学生“我最喜爱的老师”辛勤耕耘奖。

其他

目前担任中国运筹学会排序分会常务理事兼副秘书长，河南省运筹学会常务理事兼副秘书长。主持3项国家自然科学基金项目(1项青年基金和2项面上基金)并参加了其它5项国家自然科学基金项目。在《European Journal of Operational Research》、《Naval Research Logistics》、《Operations Research Letters》、《International Journal of Production Economics》、《Journal of Scheduling》、《Annals of Operations Research》等国际SCI期刊发表了40多篇论文。

论著

录岭法，张利齐，万龙，《多目标排序引论》，清华大学出版社。

论文

1.Rescheduling for new orders on a single machine with rejection, Journal of the Operational Research Society 75(2): 346-360, 2024.

2.New results on single-machine scheduling with rejection to minimize the total weighted completion time, Foundations of Computing and Decision Sciences 49(1): 75-94, 2024.

3.Online scheduling on a single machine with one restart for all jobs to minimize the weighted makespan, AIMS Mathematics 9(1): 2518-2519, 2024.

4.Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost, Journal of Combinatorial Optimization 46: 9,2023.

5.Order acceptance and scheduling with delivery under generalized parameters,Naval Research Logistics 70(8): 844-857,2023.

6.Parallel-batch scheduling with rejection: structural properties and approximation algorithms, European Journal of Operational Research 310(3): 1017-1032, 2023.

7.Single machine scheduling with rejection and a non-availability interval to minimize the maximum delivery completion time plus the total rejection cost, Asia-Pacific Journal of Operational Research 40(5): 2340017, 2023.

8.Pareto-scheduling with double-weighted jobs to minimize the weighted number of tardy jobs and total weighted late work, Naval Research Logistics69, 816–837, 2022.

9.Single machine scheduling with rejection to minimize the weighted makespan, Lecture Notes in Computer Science 13153: 96–110, 2021.

10.Pareto-scheduling of two competing agents with their own equal processing times, European Journal of Operational Research 301(2):1-18, 2021.

11.A two-agent one-machine multitasking scheduling problem solving by exact and metaheuristics, Complex & Intelligent Systems 8(3) :199–212, 2022.

12.In-house production and outsourcing under different discount schemes on the total outsourcing cost, Annals of Operations Research 298: 361–374, 2021.

13.Single machine scheduling with outsourcing under different fill rates or quantity discount rates, Asia-Pacific Journal of Operational Research 37(1): 1950033, 2020.

14.Single-machine scheduling with positional due indices and positional deadlines, Discrete Optimization 34: 100549, 2019.

15.A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan, RAIRO - Operations Research 53:1261-1266, 2018.

16.Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time, Asia-Pacific Journal of Operational Research 35(6): 1850048, 2018.

17.Single-machine scheduling with production and rejection costs to minimize the maximum earliness, Journal of Combinatorial Optimization 34(2): 331-342.

18.Competitive project scheduling on two unbounded parallel batch machines, Journal of the Operations Research Society of China 6(3): 473–483, 2018.

19.Online Single Machine Scheduling to Minimize the Maximum Starting Time, Asia-Pacific Journal of Operational Research 34(05): 1750022, 2017.

20.Rescheduling with new orders and general maximum allowable time disruptions, 4OR-Q J Oper Res 14(3): 261–280, 2016.

21.Parallel-machine scheduling with release dates and rejection, 4OR-Q J Oper Res 14:165–172, 2016.

22.Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time, Theoretical Computer Science 622: 45–65, 2016.

23.Two-machine open-shop scheduling with rejection to minimize the makespan, OR Spectrum 38(2): 519–529, 2016.

24.Scheduling problems with rejection to minimize the maximum flow time, Journal of Systems Science and Complexity 29(5): 1293-1301, 2016.

25.New results on two-machine flow-shop scheduling with rejection, Journal of Combinatorial Optimization 31(4): 1493–1504, 2016.

26.Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time 583: 67–77, 2015.

27.Integrated production and delivery scheduling on a serial batch machine to minimize the makespan, Theoretical Computer Science 572: 50–57, 2015.

28.On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time, Journal of Scheduling 15:391–398, 2012.

29.The Unbounded Parallel-Batch Scheduling with Rejection, Journal of the Operational Research Society 63: 293–298, 2012.

30.Optimal algorithms for single-machine scheduling with rejection to minimize the makespan, International Journal of Production Economics 130: 153–158, 2011.

31.Single-machine scheduling under the job rejection constraint, Theoretical Computer Science 411: 1877-1882, 2010.

32.Single machine scheduling with release dates and rejection, European Journal of Operational Research 198(3): 975-978, 2009.

33.Bounded single-machine parallel-batch scheduling with release dates and rejection, Computers & Operations Research 36(10): 2748-2751, 2009.

34.Unbounded parallel batch scheduling with job delivery to minimize makespan, Operations Research Letters 36(4): 477-480, 2008.

35.The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan, Theoretical Computer Science 396(1-3):283-289, 2008.

36.Single machine scheduling with release dates and job delivery to minimize the makespan, Theoretical Computer Science 393(1-3):102-108, 2008.

37.Single machine unbounded parallel-batch scheduling with forbidden intervals, European Journal of Operational Research 186: 1212–1217, 2008.

38.Rescheduling with release dates to minimize total sequence disruption under a limit on the makespan, Asia-Pacific Journal of Operational Research 24(06):789-796, 2007.

39.A note on the complexity of flow shop scheduling with transportation constraints, European Journal of Operational Research 178: 918–925, 2007.

40.The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard, European Journal of Operational Research 177: 1302–1309, 2007.