既然你并没有真正提供更多的细节，我们只能给你广阔的指点。

Since you didn't really give more details, we can only give you broad pointers.

首先看看：稳定的婚姻问题。

和同样在网上搜索偶匹配（或加权边缘的情况：分配问题，可以使用来解决：的 Hungaring算法）。

And also search the web for Bipartite matching (or in cases of weighted edges: Assignment Problem, which can be solved using: Hungaring Algorithm).

请注意，一个解决方案，以稳定的婚姻问题也可以解决你的问题，尽管有一个假项目 - >学生preference。

Note that a solution to the stable marriage problem might also solve your problem, albeit with a fake project->student preference.

我希望上面的（稳定的婚姻/偶匹配/分配）的人会为你工作，但真的不能告诉没有更多的信息。

I expect one of the above (stable marriage/bipartite matching/assignment) will work for you, but can't really tell without more information.