Goal Programming Model for Tutor Scheduling

Authors

  • Herlin Nikmah
  • Sutarman
  • Open Darnius

DOI:

https://doi.org/10.32734/jormtt.v3i2.8858

Keywords:

Goal Programming, Linear Programming, Tutor Scheduling

Abstract

This article presents goal programming model for tutor scheduling. Goal programming is the development of linear programming which has multiple objectives. Goal programming minimizes the deviation among the the desired level of goals and the actual achievement, which is achieved by changing inequality into equality by including positive and negative deviation variables accomplished by converting inequalities into equalities by including positive and negative deviation variables that allow the achievement below or above each goal. The results obtained from this model provide the optimal solutions where all objectives are achieved. This model also aims to achieve harmony and fairness between tutors and institutional management.

Downloads

Download data is not yet available.

Published

2021-09-30

How to Cite

[1]
H. Nikmah, Sutarman, and O. Darnius, “Goal Programming Model for Tutor Scheduling”, J. of Research in Math. Trends and Tech., vol. 3, no. 2, pp. 8-14, Sep. 2021.