- 學位論文
TEAM FORMATION FOR MULTIPLE PROJECTS
TEAM FORMATION FOR MULTIPLE PROJECTS
摘要
Realizing projects which are demanding in terms of resources and capabilities might need to be carried out by more than one person. Instead a set of individuals who will form a team can corporate to achieve these projects. Selecting the employees to form the best team and simultaneously choose which projects need to be realized is a tough decision problem frequently encountered in every enterprise. This research considers the problem of such team formation for the realization of multiple projects. We consider some constraints such as the availability of the employees, the duration of the project and the profit of each project. The objective is to maximize the profit of the company by selecting the suitable time slots to form a team who can handle the project with the highest profit. A mathematical model is provided for the problem. The feasible schedule will contain all the time slots that can be used to create teams. Those time slots have to meet the project constraints as well as the profit constraints. With this model, it will be possible to find out who will be selected to join the team. Also, to solve this model, an algorithm based on Frequent Itemset Mining (FIM) will be used. Experiments will then be performed to show the effectiveness and the performance of the model. This paper, team formation for multiple projects, bring new value by considering the employee’s unavailability and using FIM which was never done before in the literature.
並列摘要
Realizing projects which are demanding in terms of resources and capabilities might need to be carried out by more than one person. Instead a set of individuals who will form a team can corporate to achieve these projects. Selecting the employees to form the best team and simultaneously choose which projects need to be realized is a tough decision problem frequently encountered in every enterprise. This research considers the problem of such team formation for the realization of multiple projects. We consider some constraints such as the availability of the employees, the duration of the project and the profit of each project. The objective is to maximize the profit of the company by selecting the suitable time slots to form a team who can handle the project with the highest profit. A mathematical model is provided for the problem. The feasible schedule will contain all the time slots that can be used to create teams. Those time slots have to meet the project constraints as well as the profit constraints. With this model, it will be possible to find out who will be selected to join the team. Also, to solve this model, an algorithm based on Frequent Itemset Mining (FIM) will be used. Experiments will then be performed to show the effectiveness and the performance of the model. This paper, team formation for multiple projects, bring new value by considering the employee’s unavailability and using FIM which was never done before in the literature.