报告题目：Online Scheduling on Parallel Machines with Processing Set Restrictions

主讲人：谷存昌 教授

时   间：2026年11月2日（周一）14：30

地   点：湖滨校区2号楼2317

主办单位：科技处

承办单位：数学与统计学院

主讲人介绍：

谷存昌，中国运筹学会排序分会常务理事，河南省教学标兵，河南省运筹学会常务理事及教育与宣传工作委员会主任。教学方面，主持完成省级重点教研项目2项、省级一般教研项目1项，参与省级重大教研项目2项；主持建成教育部大学数学课程群虚拟教研室（国防科技大学共建单位），牵头建设人才培养模式改革虚拟教研室。科研方面，主要从事组合优化与排序理论方向研究，完成国家自然科学基金项目、省部级科研项目5项、横向科研项目3项；作为组合优化及应用团队负责人获批河南省科普专家团队，发表学术论文40余篇，出版教材1部。业绩与获奖方面，获河南省高等教育教学成果奖一等奖2项、二等奖1项，河南省科技进步成果一等奖1项，河南省教育数字化转型成果奖二等奖1项。

报告简介：

Scheduling theory focuses on the optimal allocation of tasks, resources, and processing times. As a core branch, parallel machine scheduling has been extensively studied. In real-world production and service systems, however, parallel machines are often not all the same; they differ in capability and applicability. Specifically, each job can only be assigned to machines that match its process requirements—a constraint known as processing set restrictions (or machine eligibility constraints). In this talk, we consider online scheduling on parallel machines subject to such restrictions. We will introduce the basic concepts and fundamental methods for this problem, and then present several recent advances made by our group in this area.

欢迎广大师生踊跃参加！