基于l_1、l_2范数度量的单位时间平行机加权总完工时间的逆调度问题(英文)  

Inverse Scheduling Problem of the Total Weighted Completion Time Problem with Unit Processing Time on Identical Parallel Machines for Two Types of Norms l_1 and l_2

作　　者：范洪长 鲁习文[2] 

机构地区：[1]太原经济与工商管理大学,越南太原250000 [2]华东理工大学理学院,上海200237

出　　处：《广西师范学院学报（自然科学版）》2014年第1期36-40,共5页Journal of Guangxi Teachers Education University(Natural Science Edition)

基　　金：supported by the Chinese NSF grant(No.11371137)

摘　　要：考虑了两种范数(l1和l2)度量下,单位时间的平行机上加权总完工时间调度问题的逆问题.对于已经给定的加工工序,在不同范数l1和l2下,通过最小限度地调整工件的权值,使得这一给定的加工工序成为最优,并且工件权值的调整不会增加原有的目标函数值.In this paper we study the inverse scheduling problem of the total weighted completion time problem with unit processing time on identical parallel machines for two types of norm l1 and l2 .The weights are minimally adjusted so that a given target job sequence becomes an optimal schedule for two types of norm l1 and l2 under the constraints that the resulting objective value based on the adjusted weights is no larger than the original objective value .

关 键 词：排序问题 逆问题 加权 平行机 

分 类 号：O224[理学—运筹学与控制论]