# Course Opening, Assignment and Timetabling with Student Preferences

### Sacha Varone, David Schindl

#### Abstract

We consider the following problem of course scheduling and assignment of students. Students express their preferences for each course from several sets of proposed courses and each student has to take a certain number of courses from each set. A minimum number of students is required to open a course and a maximum number of students is specified for each course. The courses have to be scheduled on a limited number of periods so that simultaneous courses have no students in common. This problem can be seen as a generalization of the Student Project Allocation problem. It consists in determining which courses to open, specifying the schedule for these opened courses, and assigning students to them, so that their preferences are maximized. Our model is an Integer Programming problem, which we solve with a common available solver using an iterative process.

#### References

- Anwar, A. A. and Bahaj, A. S. (2003). Student project allocation using integer programming. IEEE Transactions on Education, 46:359-367.
- Badri, M. A., Davis, D. L., Davis, D. F., and Hollingsworth, J. (1998). A multi-objective course scheduling model: Combining faculty preferences for courses and times. Computers & OR, 25(4):303-316.
- Harper, P. R., de Senna, V., Vieira, I. T., and Shahani, A. K. (2005). A genetic algorithm for the project assignment problem. Computers & Operations Research, 32(5):1255 - 1265.
- Hinkin, T. R. and Thompson, G. M. (2002). Schedulexpert: Scheduling courses in the cornell university school of hotel administration. Interfaces, 32:45-57.
- Manlove, D. F. and O'Malley, G. (2008). Student-project allocation with preferences over projects. Journal of Discrete Algorithms, 6(4):553 - 560. Selected papers from the 1st Algorithms and Complexity in Durham Workshop (ACiD 2005), 1st Algorithms and Complexity in Durham Workshop (ACiD 2005).
- Rudová, H., Müller, T., and Murray, K. (2011). Complex university course timetabling. Journal of Scheduling, 14:187-207.
- Saber, H. M. and Ghosh, J. B. (2001). Assigning students to academic majors. Omega, 29(6):513-523.
- Schniederjans, M. J. and Kim, G. C. (1987). A goal programming model to optimize departmental preference in course assignments. Computers & OR, 14(2):87- 96.

#### Paper Citation

#### in Harvard Style

Varone S. and Schindl D. (2013). **Course Opening, Assignment and Timetabling with Student Preferences** . In *Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,* ISBN 978-989-8565-40-2, pages 153-158. DOI: 10.5220/0004189901530158

#### in Bibtex Style

@conference{icores13,

author={Sacha Varone and David Schindl},

title={Course Opening, Assignment and Timetabling with Student Preferences},

booktitle={Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},

year={2013},

pages={153-158},

publisher={SciTePress},

organization={INSTICC},

doi={10.5220/0004189901530158},

isbn={978-989-8565-40-2},

}

#### in EndNote Style

TY - CONF

JO - Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,

TI - Course Opening, Assignment and Timetabling with Student Preferences

SN - 978-989-8565-40-2

AU - Varone S.

AU - Schindl D.

PY - 2013

SP - 153

EP - 158

DO - 10.5220/0004189901530158