84
Views
2
CrossRef citations to date
0
Altmetric
General Paper

The school class allocation problem—maximising friendship requests subject to diversity requirements

Pages 1091-1100 | Received 28 Oct 2013, Accepted 18 Jun 2014, Published online: 21 Dec 2017
 

Abstract

Friendship groups are an important element in both the social and academic well-being of school students, particularly in their younger years. Each year, school management has to assign students to a particular class in their new grade in junior school, and in doing so make and break friendship preferences as other criteria need to be satisfied in order to ensure diversity. This ongoing administrative task is time consuming and does not always result in the most equitable allocation. Coupled with the lack of transparency of the process, this can lead to teacher and parent frustration. This paper formulates and solves a mathematical programming model for this problem and shows that better solutions can likely be found in a fraction of the time using software that is freely available.

Acknowledgements

I thank the Trinity College Gawler South School for its interest and participation in this project, the Defence Science and Technology Organisation for allowing me to develop and apply my skills in mathematical programming and the referees for their constructive comments.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.