单可变资源最小化加权完工时间和排序问题的强NP-困难性(英文)  

Strong NP-hardness of the Single-variable-resource Scheduling Problem to Minimize the Total Weighted Completion Time

作　　者：原晋江[1] 王勤[2] 

机构地区：[1]郑州大学数学系,郑州450052 [2]中国计量学院数学系,杭州310018

出　　处：《运筹学学报》2010年第1期31-36,共6页Operations Research Transactions

基　　金：supported by NSFC(10971201);NSFC-RGC(70731160633);SRFDP (20070459002);supported by NSFC(10601051);Zhejiang Provincial Natural Science Foundation of China(No.Y6090472)

摘　　要：Baker和Nuttle提出了下述单可变资源排序问题:n个工件利用某个单资源进行加工使得工件的完工时间的某个函数达到最小,而资源的可利用率是随着时间而变化的.当最小化的目标函数是工件的加权完工时间和时,Baker和Nuttle猜测该问题是NP-困难的.最近,Yuan、Cheng和Ng证明该问题在一般意义下是NP-困难的,但是问题的精确复杂性仍然是悬而未决的.本文我们证明了该问题是强NP-困难的.Baker and Nuttle studied the following single-variable-resource scheduling problem： sequencing n jobs for processing by a single resource to minimize a function of job completion times, when the availability of the resource varies over time. When the objective function to be minimized is the total weighted completion time, Baker and Nuttle conjectured that the problem is NP-hard. Recently, Yuan, Cheng and Ng showed that this problem is NP-hard in the binary sense, but the exact complexity of the problem is still open. We show in this paper that this problem is strongly NP-hard.

关 键 词：运筹学 排序 资源的可利用率 资源需求 加权完工时间和 强NP-困难性 

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