Penjadwalan Menggunakan Integer Linear Programming dengan Penerapan Minimal Perturbation dalam Studi Kasus Departemen Teknik Informatika ITS

Hapsari, Meylina Tesa (2026) Penjadwalan Menggunakan Integer Linear Programming dengan Penerapan Minimal Perturbation dalam Studi Kasus Departemen Teknik Informatika ITS. Other thesis, Institut Teknologi Sepuluh Nopember.

Text 5025221149-Undergraduate_Thesis.pdf - Accepted Version Restricted to Repository staff only Download (2MB) | Request a copy

Abstract

Penjadwalan mata kuliah merupakan permasalahan optimasi kombinatorial kompleks yang diklasifikasikan sebagai masalah NP-Hard. Di Departemen Teknik Informatika ITS, proses penjadwalan masih dilakukan secara manual, sehingga memakan waktu lama dan rentan terhadap kesalahan manusia (human error). Kompleksitas semakin meningkat dengan adanya mekanisme Team Teaching, keberagaman program studi (Reguler, IUP, RPL, dan RKA), serta kebutuhan akan revisi jadwal mendadak di tengah semester. Penelitian ini mengusulkan model matematis menggunakan metode Integer Linear Programming (ILP) untuk menghasilkan jadwal yang optimal dan efisien. Selain itu, pendekatan Minimal Perturbation Problem (MPP) diintegrasikan untuk menangani perubahan jadwal dengan cara meminimalkan gangguan terhadap jadwal yang sudah ada. Model ini diimplementasikan menggunakan bahasa pemrograman Python dengan pustaka PuLP dan solver HiGHS. Hasil yang diharapkan dari penelitian ini adalah sebuah sistem yang mampu menghasilkan jadwal bebas konflik, memenuhi seluruh batasan mutlak (hard constraints), mengakomodasi batasan preferensi (soft constraints), serta menjaga stabilitas operasional saat terjadi perubahan jadwal.
================================================================================================================================
University course timetabling is a complex combinatorial optimization problem classified as NP-Hard. In the Department of Informatics at ITS, the scheduling process is still conducted manually, making it time-consuming and prone to human error. The complexity is further increased by Team Teaching mechanisms, diverse study programs (Regular, IUP, RPL, and RKA), and the need for sudden schedule revisions mid-semester. This research proposes a mathematical model using the Integer Linear Programming (ILP) method to produce an optimal and efficient schedule. Furthermore, the Minimal Perturbation Problem (MPP) approach is integrated to handle schedule changes by minimizing disruptions to the pre-existing schedule. This model is implemented using the Python programming language with the PuLP library and the HiGHS solver. The expected result of this research is a system capable of generating conflict-free schedules that satisfy all hard constraints, accommodate soft constraints (preferences), and maintain operational stability during schedule adjustments.

Item Type:	Thesis (Other)
Uncontrolled Keywords:	Batasan Keras, Batasan Lunak, Penjadwalan Kuliah, Integer Linear Programming, Minimal Perturbation Problem, Course Timetabling, Hard Constraint, Integer Linear Programming, Minimal Perturbation Problem, Soft Constraint.
Subjects:	Q Science > QA Mathematics > QA9.58 Algorithms
Divisions:	Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Informatics Engineering > 55201-(S1) Undergraduate Thesis
Depositing User:	Meylina Tesa Hapsari
Date Deposited:	20 Jul 2026 02:19
Last Modified:	20 Jul 2026 02:19
URI:	http://repository.its.ac.id/id/eprint/135617

Actions (login required)

View Item