宁波大学罗文昌教授学术报告

宁波大学罗文昌教授学术报告

报告主题：Approximation scheme for rejection-allowed rescheduling with job delays

报告专家：罗文昌  教授

报告时间：2019年10月19日 10:00-12:00

报告地点：信息管理学院H402报告厅

报告摘要：  

We study a novel rescheduling problem in which a set of jobs has been assigned an original schedule to minimize the total weighted completion time on a single machine, with the assumption that all of them will be available when the planned processing begins. The need for rescheduling arises due to some jobs could not arrive in time; the decision-maker has to adjust the original schedule to account for the delayed jobs without causing excessive time disruption to the original schedule and to minimize his/her operational cost. While the decision-maker can choose to reject some jobs, the total rejection cost and the tardiness of each accepted job in the adjusted schedule are strictly upper bounded by given thresholds, respectively. The total operational cost includes three components: the total weighted completion time of the accepted jobs, the total rejection cost of the rejected jobs, and the penalty on the maximum tardiness for the accepted jobs. We study this novel rescheduling problem from approximation algorithm perspective, as it generalizes several classic NP-hard scheduling problems; we design a pseudo-polynomial time dynamic programming exact algorithm and, when the total rejection cost is unbounded, develop the exact algorithm into a fully polynomial time approximation scheme.

            

专家介绍：

罗文昌，江西吉水人，宁波大学教授，2011年6月博士毕业于浙江大学运筹学专业，2015年8月至2016年8月及2017年7月至2017年9月以高级访问教授身份在加拿大阿尔伯塔大学计算科学系从事合作研究。研究领域为组合优化及数学建模。主要研究组合优化问题的近似算法设计及性能分析，管理科学中实际问题的建模与计算。主持国家自然科学基金面上项目1项, 教育部人文社会科学规划基金项目及浙江省自然科学基金项目各1项，在OMEGA, EJOR, JOS,JOCO, Algorithmica, IPL, CIE, JIMO 等国际主流学术期刊及COCOON2018, ISSAC2016, FAW-AAIM2011, AAIM2010等国际主流学术会议以第一作者身份发表SCI, SSCI及EI检索学术论文十多篇。指导研究生发表(二级)核心期刊以上论文10余篇；在指导本科生参加全国大学生数学建模竞赛方面也有丰富的经验, 自2010年起多次指导学生连续获得全国一等奖,全国二等奖多项。