Integer linear programming model for tutor workload assignment: a case study
| dc.contributor.author | Meththananda, K. P. G. N. S. | |
| dc.contributor.author | Samarathunga, D. M. | |
| dc.date.accessioned | 2024-10-26T18:58:20Z | |
| dc.date.available | 2024-10-26T18:58:20Z | |
| dc.date.issued | 2024-11-01 | |
| dc.description.abstract | The scheduling problem is one of the prominent problems among operations researchers due to its high applicability and cost of obtaining optimum solutions. There are many variations, applications, and solution techniques for scheduling problems. This study was devoted to obtaining a model based on a case study, assigning tutorial staff to tutorial classes, and conducting practical classes. Assigning teaching assistants to tutorial and practical classes is challenging for many universities. With a large number of students and a limited number of teaching assistants, it's crucial to ensure that assignments maximize both the assistants' satisfaction and their capacity to support students effectively. Although there are some similarities in the demonstrator workload problem among different departments, it varies from department to department depending on the number of theoretical and practical course units, the number of students registered for each course unit, the number of tutors, different rules of assignments, etc. This study considered the tutor workload assignment for semester one of the Department of Mathematics, University of Ruhuna, as a case study. An integer linear programming model was proposed, considering the objectives of equal workload among tutors and also assigning classes according to their preferences. Several constraints, such as the number of tutors needed for each tutorial class, grading all the tutorials weekly, assigning a required number of demonstrators for each practical class, and year-wise variations among tutors, were considered. The optimal solution for the case study of the proposed integer linear programming model was obtained by employing the MATLAB programming language using the Branch and Bound algorithm. The solution of the model provides the assignments of tutors for each tutorial class and practical class, with a possible equal workload among tutors. | |
| dc.identifier.citation | Proceedings of the Postgraduate Institute of Science Research Congress (RESCON) -2024, University of Peradeniya, P 56 | |
| dc.identifier.issn | 3051-4622 | |
| dc.identifier.uri | https://ir.lib.pdn.ac.lk/handle/20.500.14444/2619 | |
| dc.language.iso | en | |
| dc.publisher | Postgraduate Institute of Science (PGIS), University of Peradeniya, Sri Lanka | |
| dc.relation.ispartofseries | Volume 11 | |
| dc.subject | Branch and Bound algorithm | |
| dc.subject | Integer linear programming | |
| dc.subject | Scheduling problem | |
| dc.subject | Workload assignment | |
| dc.title | Integer linear programming model for tutor workload assignment: a case study | |
| dc.type | Article |