Following articles have been selected as our main references.

1. D. J. Abraham, R. W. Irving, and D. F. Manlove. Two algorithms for the student-project allocation problem. Journal of Discrete Algorithms, 5(1):73–90, 2007.
2. A. Arulselvan, Á. Cseh, and J. Matuschke. The student/project allocation problem with group projects. arXiv preprint arXiv:1412.0325, 2014.
3. D. Gale and L. S. Shapley. College admissions and the stability of marriage. The American Mathematical Monthly, 69(1):9–15, 1962.
4. D. F. Manlove. Algorithmics of matching under preferences, volume 2. World Sientific, 2013.

Reference 1 depicted a similar SPA-problem in our project and yet without allowing group projects. Two linear algorithms are presented to solve this problem. Particularly, we will study the SPA-lecturer in this paper to see if it can be modified to cope with our problem.

Reference 2 studied a SPA-problem with group projects. However, the problem did not take lecturer’s preference lists into consideration. Students and projects are simply connected by weighted-edges to indicate the priority. The authour claimed that such problem is NP-complete unless each project has a capacity smaller than or equal to 2.

Reference 3 and 4 gave the theoretical background of this problem.