In this paper, we solve a dynamic assignment problem through a greedy computer algorithm. Our method considers employee qualifications, project characteristics and performance scoring. The algorithm first filters eligible employees; then scores them based on a weighted performance system, and finally selects an employee using the inverse transform technique where probabilities are related to the scores. Our approach allows the efficient assignment of projects, development of employee skills, and continuous monitoring of the assignment process.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Solving a Real-Life Dynamic Assignment Problem in the Service Sector

  • Jordi Fortuny-Santos,
  • Jordi Fortuny-Profitós

摘要

In this paper, we solve a dynamic assignment problem through a greedy computer algorithm. Our method considers employee qualifications, project characteristics and performance scoring. The algorithm first filters eligible employees; then scores them based on a weighted performance system, and finally selects an employee using the inverse transform technique where probabilities are related to the scores. Our approach allows the efficient assignment of projects, development of employee skills, and continuous monitoring of the assignment process.