报告题目：Single-machine scheduling with learning dates

报告 人： 蒋义伟 教授 （浙江工商大学）

报告时间：2026年11月3日 10:00-11:00

报告地点：数足球吧 301报告厅

报告摘要：We consider a single-machine scheduling problem with learning-dates to minimize the makespan. Each job has a distinct learning-date, and its processing time differs before and after the learning-date. All jobs have the same learning efficiency, i.e., the ratio of the processing time after learning to that before learning is ρ (0 < ρ < 1) for each job. We consider two variants of the problem according to whether the jobs are preemptible, namely the preemptive model and the non-preemptive model. For the preemptive case, we develop an O(nlogn)-time solution algorithm with at most one preemption. For the non- preemptive case, we show that the problem is NP-hard and design an O(nlogn)-time approximation algorithm with a worst-case ratio of at most .

报告人简介：蒋义伟，博士，浙江工商大学教授，硕士生导师。美国UTD、香港大学、香港理工大学访问学者，美国《Mathematical Reviews》特约评论员，中国运筹学会排序专业委员会常务理事。入选浙江省“151”人才工程和省高校优秀青年教师资助计划。主要研究领域：调度理论、物流与供应链管理、离散优化、算法设计与分析等。主持国家自然科学基金3项、浙江省自然科学基金（含1项重点）3项。获浙江省高校科研成果二等奖1项（排名第一）。在运筹、管理与理论计算机科学等领域国际主流期刊NRL，EJOR，INS，JORS，CAIE和国内一级期刊《系统工程理论与实践》，《系统科学与数学》等发表学术论文80余篇。