Student project allocations models (SPA) in which lecturers have preferences over students (projects) have been studied in. We present new method to construct a general student project allocation model (SPA-(s, p)) in which the lecturers have preference lists over pairs (student, project), and the students have preference lists over projects. SPA-(s, p) is turned out to be very useful in combination between the student project allocation models with preference lists over students (or projects). Our model proposes several ways to construct the lecturer's preference lists which give us higher efficiency and accurate results. Furthermore, we present algorithmic issues for SPA-(s, p), the algorithm yields a stable matching of students to projects, which respects the preference lists and capacity constraints.