Research on Scheduling Algorithm of Multi-Departmental Collaborative Human Resource System for Blockchain

Aiming at the problems such as inefficiency of multi-departmental collaboration in enterprise human resource management, a multi-departmental collaborative human resource system scheduling algorithm based on blockchain technology is proposed in terms of improving decision-making efficiency. In order to solve these problems, blockchain encryption technology and smart contracts are used to effectively analyze the security and efficiency of task scheduling. Simulation test experiments are applied to conclude that the minimized task completion time of this paper's algorithm is significantly better than that of ILHA, CPM and RANDOM algorithms under different task sizes. The results show that this scheme has significant advantages in improving scheduling efficiency and security, and verifies the efficiency and adaptability of this paper's algorithm.

Authors

Institutions

Publication Details

Published
2024-12-27
DOI
https://doi.org/10.1145/3718491.3718660
Primary Topic
Blockchain Technology Applications and Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on Scheduling Algorithm of Multi-Departmental Collaborative Human Resource System for Blockchain

Yi He, Hao Ye
Blockchain Technology Applications and Security
article

Research on Scheduling Algorithm of Multi-Departmental Collaborative Human Resource System for Blockchain

Yi He, Hao Ye
article en

Abstract

Aiming at the problems such as inefficiency of multi-departmental collaboration in enterprise human resource management, a multi-departmental collaborative human resource system scheduling algorithm based on blockchain technology is proposed in terms of improving decision-making efficiency. In order to solve these problems, blockchain encryption technology and smart contracts are used to effectively analyze the security and efficiency of task scheduling. Simulation test experiments are applied to conclude that the minimized task completion time of this paper's algorithm is significantly better than that of ILHA, CPM and RANDOM algorithms under different task sizes. The results show that this scheme has significant advantages in improving scheduling efficiency and security, and verifies the efficiency and adaptability of this paper's algorithm.

Nanning Normal University (CN)
Decent work and economic growth
Openalex Percentile: Top 54%
Blockchain Technology Applications and Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.