Optimal Employee Recruitment in Organizations under Attribute-Based Access Control.

Area of Science:

• Computer Science
• Human Resource Management

Background:

• Effective human resource management requires optimal employee recruitment and assignment.
• Security policies, like Attribute Based Access Control (ABAC), constrain employee task allocation.
• Identifying the best candidates from a large pool is critical for business success.

Purpose of the Study:

• To formalize the Optimal Recruitment Problem (ORP).
• To develop an efficient solution for selecting minimum new employees while satisfying security constraints.
• To address challenges in workforce reorganization and manpower utilization.

Main Methods:

• Formalization of the Optimal Recruitment Problem (ORP).
• Utilizing Attribute Based Access Control (ABAC) for security policy specification.
• Development and application of a greedy heuristic algorithm.

Main Results:

• The Optimal Recruitment Problem (ORP) is proven to be NP-hard.
• The proposed greedy heuristic demonstrates effectiveness and efficiency.
• Successful experimental evaluation of the heuristic's performance.

Conclusions:

• The greedy heuristic provides a practical solution for the ORP.
• This approach optimizes recruitment while adhering to complex security policies.
• The findings contribute to efficient human resource management in organizations.