Lecturer Teaching Scheduling that Minimize The Difference of Total Teaching Load Using Goal Programming

• Published in: Journal of physics. Conference series Vol. 1863; no. 1; p. 12003
• Main Authors: Hasanah, Alfiyyah, Hanum, Farida, Ruhiyat
• Format: Journal Article
• Language: English
• Published: Bristol IOP Publishing 01.03.2021
• Subjects: Deviation; Goal programming; Model testing; Physics; Schedules; Scheduling; Teaching
• ISSN: 1742-6588; 1742-6596
• DOI: 10.1088/1742-6596/1863/1/012003

An implementation of scheduling problems is the scheduling of lecturers in educational institution. There are several considerations, including the availability of teaching time, the suitability between the subject and the lecturer’s field, and also the fairness of assignments for each lecturer. Because of these considerations, scheduling using operation research is needed to overcome the weaknesses of scheduling by conventional methods, which may not be able to cover several rules and conditions that need to be met. This scheduling problem can be solved by linear goal programming. In this work, two types of constraints need to be considered, i.e. hard and soft constraints. The hard constraints are some constraints that must be fulfilled, while the soft constraints are some constraints that hoped to be fulfilled as much as possible. In goal programming, the goal is minimizing the deviation variable, which may be able to make the soft constraints deviate from the expected value. This scheduling model is applied to the data of scheduling lecturers in the Department of Mathematics XYZ University. In this model, the main goal is minimizing the difference of total teaching load and it was achieved quite well because the total credits earned by each lecturer was quite same due to the limitation of deviation value. However, it makes the other goal wasn’t fulfilled, there are several lecturers who get schedules to teach courses outside their division.