报告题目：Updated complexity results in single-machine primary-secondary scheduling for minimizing two regular criteria

报告人：原晋江 教授

时 间：2021年5月18日16:30—17:30

地 点：73882必赢游戏欢迎光临莲花街校区实训楼314-2

摘 要：In the primary-secondary scheduling problem, we have a primary scheduling criterion and a secondary scheduling criterion. The goal of the problem is to find a schedule which minimizes the second criterion, subject to the restriction that the primary criterion is minimized. Lee and Vairaktarakis [LV1993] presented a comprehensive review for the computational complexity of the single-machine primary-secondary scheduling problems, where all the jobs are released at time zero. When both of the two criteria are regular, more than twenty problems were posed as open in [LV1993]. This talk will report the research progress of these open problems.

报告人简介：原晋江现任郑州大学数学与统计学院教授、博士生导师、教授委员会主任。1995年于四川大学应用数学专业获得理学博士学位。研究兴趣主要在排序、图论、组合最优化等领域。曾发表SCI期刊学术论文二百余篇，主持国家基金项目8项。