We consider the problem of assigning a set of independent (non-conflicting) exams having a given size to a set of classrooms having certain capacities. We formulate the problem as a zero–one linear integer program for both cases where each classroom contains no more than one exam and for the case where this constraint is relaxed. For the second case, the problem is also formulated as a transportation problem. We already presented two working papers that consider the problem of assigning exams to timeslots at the Faculty of Economics and Management Sciences of Sfax using several heuristics based on graph colouring. This paper is a supplement of the earlier ones, where the solution obtained in these papers (i.e., timetables composed of non-conflicting exams) serves as an input to the problem treated here. Some elementary results are proved and a simple heuristic procedure is developed to solve the problem.