avariantofmultitasknvehicleexplorationproblemmaximizingeveryprocessorsaverageprofit
文献类型：期刊论文
| 作者 | Xu Yangyang; Cui Jinchuan
|
| 刊名 | actamathematicaeapplicataesinica
 |
| 出版日期 | 2012 |
| 卷号 | 28期号:3页码:463 |
| ISSN号 | 0168-9673 |
| 英文摘要 | We discuss a variant of the multi-task n-vehicle exploration problem. Instead of requiring an optimal permutation of vehicles in every group, the new problem requires all vehicles in a group to arrive at the same destination. Given n tasks with assigned consume-time and profit, it may also be viewed as a maximization of every processor's average profit. Further, we propose a new kind of partition problem in fractional form and analyze its computational complexity. By regarding fractional partition as a special case, we prove that the average profit maximization problem is NP-hard when the number of processors is fixed and it is strongly NPhard in general. At last, a pseudo-polynomial time algorithm for the average profit maximization problem and the fractional partition problem is presented, using the idea of the pseudo-polynomial time algorithm for the classical partition problem. |
| 资助项目 | [Daqing oilfield company Project of PetroCHINA] ; [Key Laboratory of Management, Decision and Information Systems, Chinese Academy of Sciences] ; [Beijing Research Center of Urban System Engineering] |
| 语种 | 英语 |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/39911]  |
| 专题 | 应用数学研究所 |
| 作者单位 | 中国科学院数学与系统科学研究院 |
| 推荐引用方式 GB/T 7714 | Xu Yangyang,Cui Jinchuan. avariantofmultitasknvehicleexplorationproblemmaximizingeveryprocessorsaverageprofit[J]. actamathematicaeapplicataesinica,2012,28(3):463. |
| APA | Xu Yangyang,&Cui Jinchuan.(2012).avariantofmultitasknvehicleexplorationproblemmaximizingeveryprocessorsaverageprofit.actamathematicaeapplicataesinica,28(3),463. |
| MLA | Xu Yangyang,et al."avariantofmultitasknvehicleexplorationproblemmaximizingeveryprocessorsaverageprofit".actamathematicaeapplicataesinica 28.3(2012):463. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。