报告题目（Title）：Single machine scheduling with maintenance, controllable processing times and rejection
报告人（Speaker）： 罗文昌(宁波大学)
报告时间（Time）： 2026年5月27号 16:50 -17:35
报告地点（Venue）： 莲花街校区惟德楼315会议室
报告摘要（Abstract）：
We study a single machine scheduling problem with a maintenance activity, controllable processing times, and optional job rejection. In this problem, the processing time of each job is a bounded linear decreasing function of the amount of resources allocated to it, and no job can be processed during the maintenance period. The objective is to minimize the sum of the makespan, the total resource consumption cost, and the total rejection cost of rejected jobs. This problem is NP-hard, and we give several structure properties for the optimal solution. We then propose a 5-approximation algorithm based on linear programming rounding and a fast n-approximation algorithm. Subsequently, based on the pseudo-polynomial time dynamic programming exact algorithm, the n-approximation algorithm, and the bound improvement procedure, we propose two fully polynomial time approximation schemes.
报告人简介：
罗文昌，男，宁波大学数学与统计学院教授，博士生导师。于2011年6月获浙江大学运筹学博士学位。已完成教育部项目及浙江省自然科学基金项目，国家自然科学基金面上项目各1项，目前主持国家自然科学基金面上项目1项，已在Algorithmica, JOS，ORL, EJOR，OMEGA，JORS，IPL，JOCO，CIE, 4OR, APJOR等主流国际期刊及ISSAC，COCOON，COCOA等主流国际学术会议发表SCI/EI/SSCI检索论文40余篇。
数学与统计学院
2026年5月22日
