版权说明 操作指南
首页 > 成果 > 详情

The PAO Algorithm for Assignment Problem

认领
导出
反馈
分享
QQ微信 微博
成果类型:
会议论文
作者:
Wei, Shudi*;Jiang, Xiaoqi;Wang, Hui
通讯作者:
Wei, Shudi
作者机构:
[Wang, Hui; Wei, Shudi] Hengyang Normal Univ, Dept Comp Sci, Hengyang 421002, Hunan, Peoples R China.
[Jiang, Xiaoqi] Cent S Univ, Coll Business, Changsha 410083, Hunan, Peoples R China.
通讯机构:
[Wei, Shudi] H
Hengyang Normal Univ, Dept Comp Sci, Hengyang 421002, Hunan, Peoples R China.
语种:
英文
关键词:
Assignment Problem;Prioritized Aggregation Operators;Hungary Algorithm
期刊:
INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND INDUSTRIAL AUTOMATION (ICITIA 2015)
年:
2015
页码:
128-134
会议名称:
International Conference on Information Technology and Industrial Automation (ICITIA)
会议时间:
JUL 04-05, 2015
会议地点:
Guangzhou, PEOPLES R CHINA
会议主办单位:
[Wei, Shudi;Wang, Hui] Hengyang Normal Univ, Dept Comp Sci, Hengyang 421002, Hunan, Peoples R China.^[Jiang, Xiaoqi] Cent S Univ, Coll Business, Changsha 410083, Hunan, Peoples R China.
会议赞助商:
Hongkong Informat Sci & Engn Res Ctr, Hong Kong Sci Technol Res Ctr
出版地:
439 DUKE STREET, LANCASTER, PA 17602-4967 USA
出版者:
DESTECH PUBLICATIONS, INC
ISBN:
978-1-60595-266-6
机构署名:
本校为第一且通讯机构
院系归属:
计算机科学与技术学院
摘要:
The paper presents a new algorithm for calculating the Assignment Problem. The algorithm based on multi-criteria decision of the PAO (Prioritized Aggregation Operators) principle, which s generate the personnel sorting by using different tasks of the Assignment Problem as the criterion of the PAO. According to the sorting results of personnel, assign task to each individual. This method is simple, and only needs a little calculation without any mathematical modeling. The calculation results s...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com