华东理工大学学报：自然科学版2012，Vol.38Issue(6)：757-761,5.
平行机上单位加工时间加权总完工时间排序问题的反问题
Inverse Problem of Total Weighted Completion Time Objective with Unit Processing Time on Identical Parallel Machines
摘要
Abstract
In inverse scheduling problems, a job sequence is given and the objective is to determine the minimal perturbation to process times or weights of jobs so that the given schedule becomes optimal with respect to a pre selected objective function. In this paper, we study the inverse problem of the total weighted completion time objective with unit processing time on identical parallel machines. The weights are minimally adjusted so that a given target job sequence becomes an optimal schedule for different norms under the constraints that the resulting objective value based on the adjusted weights is no more than the original objective value.关键词
排序问题/反问题/加权/完工时间/平行机Key words
scheduling/inverse problem/weight/completion time/parallel machine分类
数理科学引用本文复制引用
Hongtruong Pham,鲁习文..平行机上单位加工时间加权总完工时间排序问题的反问题[J].华东理工大学学报：自然科学版,2012,38(6):757-761,5.基金项目
国家自然科学基金 （）
