Aplikasi Metode Sequential Three-Stage Integer Goal Programming untuk Penjadwalan Kuliah

Nisrina Nafi’atul Huda; I Gusti Bagus Budi Dharma; Widya Wasityastuti

doi:10.22146/jpki.25309

Aplikasi Metode Sequential Three-Stage Integer Goal Programming untuk Penjadwalan Kuliah

https://doi.org/10.22146/jpki.25309

Nisrina Nafi’atul Huda^(1*), I Gusti Bagus Budi Dharma⁽²⁾, Widya Wasityastuti⁽³⁾

(1) Departemen Teknik Mesin dan Industri, Fakultas Teknik, Universitas Gadjah Mada
(2) Departemen Teknik Mesin dan Industri, Fakultas Teknik, Universitas Gadjah Mada
(3) Departemen Ilmu Faal, Fakultas Kedokteran, Universitas Gadjah Mada
(*) Corresponding Author

Abstract

Background: One of scheduling problems in educational sector currently was the course scheduling in college or well known as University Course Timetabling Problem (UCTP). The UCTP was comprehensive because of the policy difference among the university, faculties, and departments. The Faculty of Medicine Universitas Gadjah Mada, which organizes a block system has a different and more complex scheduling type than other faculties with non-block system. The porpose of this research was to build a mathematic model of block system UCTP in Faculty of Medicine Universitas Gadjah Mada to optimize the scheduling process time and results.

Method: This research was conducted by dividing the scheduling problem into 4 sub – scheduling problems that are sequential, which are the scheduling of the 5 primary courses (lecture, panel discussion, practical sessions, tutorial, and skills laboratory), scheduling topics for each course, student’ group scheduling, and classroom scheduling. The problems are then modeled in the form of integer goal programming.

Results: The block system scheduling model in Faculty of Medicine Universitas Gadjah Mada by considering topic and possibility of unavailability room using Sequential Three-Stage Integer Goal Programming has successfully developed and well verified.

Conclusion: The model developed in this study is able to produce a schedule that meets all hard constraint in less than 24 hours. The result was more efficient compared to the previous trial-and-error method that consumed 30-45 days.

Keywords

scheduling, course, university, course scheduling, sequential, and goal-programming

Full Text:

PDF

References

Matijas VD, Molnar G, Cupic M, Jakobovic D, Basic BD. University Course Timetabling Using ACO: A Case Study on Laboratory Exercises. University of Zagreb; 1986.
Daskalaki S, Birbas T, Houses E. An Integer Programming Formulation for Case Study in University Timetabling. European Journal of Operational Research. 2004; 153:117-35.
Bakir M A, Aksop C. Integer Programming Approach to A University Timetabling Problem. Hacettepe Journal of Mathematics and Statistics. 2008; 37: 41-55.
Al-Husain R, Hasan MK, Al-Qaheri H. A Sequential Three-Stage Integer Goal Programming (IGP) Model for Faculty-Course-Time-Classroom Assignment. Informatica. 2011; 35:157-64.
Kurniasih A. Pemodelan Matematis Untuk Penjadwalan Kuliah Sistem Blok. Universitas Gadjah Mada; 2013.
Sen N, Nandi M. Goal Programming, its Application in Management Sectors-Special Attantion into Plantation Management: A Review. International Journal of Scientific and Research Publications. 2012; 2(9):1.
Rosenthal, RE. Goal Programming – A Critique. NZOR. 1983; 11(1):2.
Anderson DR, Sweeney DJ, Williams TA, Camm JD, Martin RK. An Introduction to Management Science: Quantitative Approaches to Decision Making. Revised 13th Edition. 2012. pp 667-8.