DeepAI AI Chat
Log In Sign Up

TAIP: an anytime algorithm for allocating student teams to internship programs

by   Athina Georgara, et al.

In scenarios that require teamwork, we usually have at hand a variety of specific tasks, for which we need to form a team in order to carry out each one. Here we target the problem of matching teams with tasks within the context of education, and specifically in the context of forming teams of students and allocating them to internship programs. First we provide a formalization of the Team Allocation for Internship Programs Problem, and show the computational hardness of solving it optimally. Thereafter, we propose TAIP, a heuristic algorithm that generates an initial team allocation which later on attempts to improve in an iterative process. Moreover, we conduct a systematic evaluation to show that TAIP reaches optimality, and outperforms CPLEX in terms of time.


page 1

page 2

page 3

page 4


Strategic Voting in the Context of Stable-Matching of Teams

In the celebrated stable-matching problem, there are two sets of agents ...

Synergistic Team Composition: A Computational Approach to Foster Diversity in Teams

Co-operative learning in heterogeneous teams refers to learning methods ...

Partial Replanning for Decentralized Dynamic Task Allocation

In time-sensitive and dynamic missions, multi-UAV teams must respond qui...

A quest for a fair schedule: The Young Physicists' Tournament

The Young Physicists Tournament is an established team-oriented scientif...

Informational Diversity and Affinity Bias in Team Growth Dynamics

Prior work has provided strong evidence that, within organizational sett...

Soccer League Optimization: A heuristic Algorithm Inspired by the Football System in European Countries

In this paper a new heuristic optimization algorithm has been introduced...