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

主讲人：谷存昌 教授

单     位：河南工业大学

时     间：2026年4月16日 17:00

地     点：龙子湖校区九章学堂南楼C座209

摘     要：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.

简     介：谷存昌，博士，教授，硕士研究生导师，兼任中国运筹学会排序分会常务理事、河南省运筹学会常务理事、河南省运筹学会教育与宣传工作委员会主任、河南省高等教育学会高等学校教育教学评估管理服务中心副主任，省级科研平台“河南省粮食粮情大数据发展创新实验室”负责人。研究方向为：组合最优化、大数据分析。近年来主持和参与国家自然科学基金项目2项、省部级科研项目3项，完成横向科研项目2项，主持完成省级教研项目3项，获省研究生高等教育教学成果一等奖、省本科高等教育教学成果奖二等奖、省科技进步成果一等奖等，发表论文40余篇，出版教材1部。