Efficient graph-based algorithms for solving the team formation problem in production environment
by Abdulla Alqaddoumi; Youssef Harrath; Abdul Fattah Salman
International Journal of Computing Science and Mathematics (IJCSM), Vol. 14, No. 2, 2021

Abstract: This research investigates the pair formation problem described as forming pairs of people to achieve certain objectives. This problem is a subcategory of the well-known grouping problem that is classified as NP-complete. The necessity of pairing people in teams is frequent in many real-life fields such as education, social life, and production environments. To solve the problem, a mathematical formulation and a weighted graph-based representation are proposed. Pairing people is usually affected by psychological and productivity factors such as expertise and managers' opinion. These factors are summarised to produce quantitative scores representing the fitness relationship of each person towards others. Four algorithms are proposed to maximise the total weight of the formed pairs. The proposed algorithms are implemented and benchmarked using data instances of various sizes. The performance of the algorithms is evaluated against two proposed upper bounds. The results showed that the edge-based first algorithm (EPFA) outperforms other algorithms.

Online publication date: Mon, 08-Nov-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com