报告时间：2026年10月28日 19:00-20:00

报告地点：数注册送彩金 301 会议室

报告人： 录岭法 教授 郑州大学

报告题目：On-line single-machine scheduling to minimize the weighted makespan under (dis)agreeability conditions

报告摘要：We considered the on-line single-machine scheduling with the objective of minimizing the weighted makespan. For the general case, a lower bound of 2 and two online algorithms with the best-possible competitive ratio of 2 were provided in the literature. We considered eight special cases in which all jobs had the agreeability or disagreeability condition on jobs’ parameters. For each special case, we provided a lower bound and a corresponding on-line algorithm with the best-possible competitive ratio which matched the given lower bound.

报告人简介：录岭法，郑州大学数学与统计注册送彩金 教授，博士生导师，香港理工大学博士后。目前担任中国运筹学会排序分会常务理事，河南省运筹学会副秘书长。主要从事的研究方向为组合最优化、排序与调度理论。主持3项国家自然科学基金项目并参加6项国家自然科学基金项目。在《European Journal of Operational Research》、《Naval Research Logistics》、《Operations Research Letters》、《International Journal of Production Economics》、《Journal of Scheduling》、《Annals of Operations Research》等国际SCI期刊发表50多篇论文。

ng、Journal of Scheduling、Theoretical Computer Science等发表（或录用）论文64篇。