Multiple Assignment in Task Allocation of Communication Base Stations

被引:0
|
作者
Liu Dong-ning [1 ]
Liu Tong-wu [1 ]
Zhu Xian-jun [2 ]
Zhang Wei [1 ]
Fang Xiao-zhao [1 ]
Peng Chong-jia [1 ]
机构
[1] Guangdong Univ Technol, Sch Comp, Guangzhou, Guangdong, Peoples R China
[2] Jinling Inst Technol, Sch Software Engn, Nanjing, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Optimization in human resource; role-based collaboration; E-CARGO; multiple assignment; many to many assignment;
D O I
10.1145/3127404.3127428
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
To optimize tasks allocation of communication base station, this paper proposes a multiple assignment method to solve it, which is via Role-Based Collaboration and its E-CARGO model. The contributions of this work include: 1) the concise formalization of dual tasks allocation; 2) using the Group Role Assignment (GRA) method to solve labors-stations allocation; 3) after that, using the Kuhn-Munkres algorithm with backtracking (KMB algorithm) to solve labors-tasks allocation in every station under many to many constraint. The proposed methods are verified by simulation experiments. The experimental results present the practicability of the proposed solutions. It provides an effective and optimal support for human resource decision-makers.
引用
收藏
页码:161 / 164
页数:4
相关论文
共 5 条
  • [1] Cruz-Peragon F., USING WIKIS COLLABOR, P1
  • [2] The Hungarian Method for the assignment problem
    Kuhn, HW
    [J]. NAVAL RESEARCH LOGISTICS, 2005, 52 (01) : 7 - 21
  • [3] Sacker Ruhul, 2007 IEEE C EV COMP, P3991
  • [4] Role-based collaboration and its kernel mechanisms
    Zhu, Haibin
    Zhou, MengChu
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 2006, 36 (04): : 578 - 589
  • [5] Solving the Many to Many assignment problem by improving the Kuhn-Munkres algorithm with backtracking
    Zhu, Haibin
    Liu, Dongning
    Zhang, Siqin
    Zhu, Yu
    Teng, Luyao
    Teng, Shaohua
    [J]. THEORETICAL COMPUTER SCIENCE, 2016, 618 : 30 - 41