科研之友
微信
新浪微博
Facebook
分享链接
摘要
In the paper "The complexity of mean flow time scheduling problems with release times", by Baptiste, Brucker, Chrobak, Durr, Kravchenko and Sourd, the authors claimed to prove strong -hardness of the scheduling problem , namely multiprocessor preemptive scheduling where the objective is to minimize the mean flow time. We point out a serious error in their proof and give a new proof of strong -hardness for this problem.
- 出版日期2015-6
