Optimasi penjadwalan menggunakan program linear

  • Elif Thoyyibah Rahmawati Program Studi Matematika, Universitas Islam Negeri Maulana Malik Ibrahim Malang
Keywords: Optimization, scheduling, linear programming, operations research, scheduling system

Abstract

This study examines the application of linear programming as an optimization method for university course scheduling. Academic scheduling problems are often complex due to the involvement of multiple interrelated components such as courses, lecturers, classrooms, and time slots, each with specific constraints. Therefore, a systematic mathematical approach is required to minimize conflicts and improve resource utilization. The linear programming model is constructed using binary decision variables to represent whether a course is assigned to a specific time slot. The objective function is designed to minimize scheduling conflicts and maximize the efficiency of resource usage, while the constraints reflect real-world conditions, such as preventing lecturer conflicts, avoiding overlapping classroom usage, and ensuring each course is scheduled only once. Simulation data are used to test the developed model. The results indicate that linear programming successfully produces structured, conflict-free, and efficient schedules compared to manual methods. Thus, this approach can serve as an effective solution for improving scheduling systems in educational institutions and supports more rational and systematic decision-making processes.

Downloads

Download data is not yet available.

References

Bazaraa, M. S., Jarvis, J. J., & Sherali, H. D. (2011). Linear programming and network flows. John Wiley & Sons.

Brucker, P., Burke, E. K., Curtois, T., Qu, R., & Vanden Berghe, G. (2010). A shift sequence based approach for nurse scheduling and a new benchmark dataset. Journal of Heuristics, 16(4), 559–573.

Burke, E. K., Kendall, G., Mısır, M., & Özcan, E. (2012). Monte carlo hyper-heuristics for examination timetabling. Annals of Operations Research, 196(1), 73–90.

Burke, E. K., Qu, R., & Soghier, A. (2014). Adaptive selection of heuristics for improving exam timetables. Annals of Operations Research, 218(1), 129–145.

Fourer, R., Gay, D. M., & Kernighan, B. W. (2003). AMPL. A modeling language for mathematical programming.

Hillier, F. S. (2005). Introduction to operations research. McGrawHill.

Nisa, A. Z., Marhayati, M., & Masamah, U. (2022). Strategi self-regulated learning untuk menurunkan tingkat prokrastinasi akademik siswa pada tugas program linear. Jurnal Pengembangan Pembelajaran Matematika, 4(1), 47–57. https://repository.uin-malang.ac.id/10963/

Pinedo, M. L. (2016). Design and implementation of scheduling systems: More advanced concepts. In Scheduling: Theory, algorithms, and systems (pp. 485–508). Springer.

Priandani, N. D., Holle, K. F. H., Junikhah, A., Aziza, M. R., Hasanah, N. A., Zafirah, Y., Fahmi, F. R. Z., Hanggara, F. D., & Kurniawan, F. (2023). Aplikasi optimasi travelling salesman problem with Time Windows (TSPTW) pada penjadwalan paket rute wisata di pulau Bali menggunakan algoritma genetika berbasis Android. https://repository.uin-malang.ac.id/15434/

Taha, H. A. (2017). Operations Research: An Introduction. 10th. Pearson.

Winston, W. L. (2004). Operations research: Applications and algorithm. Thomson Learning, Inc.

Yulianti, S. (2025). Optimasi algoritma cheapest insertion heuristic dengan algoritma tabu search dalam pencarian rute terpendek [Universitas Islam Negeri Maulana Malik Ibrahim]. https://repository.uin-malang.ac.id/25944/

PlumX Metrics

Published
2026-05-05
How to Cite
Rahmawati, E. (2026). Optimasi penjadwalan menggunakan program linear. Maliki Interdisciplinary Journal, 4(6), 272-278. Retrieved from https://urj.uin-malang.ac.id/index.php/mij/article/view/25778
Issue
Vol 4 No 6 (2026): JUNE
Section
Articles

Copyright (c) 2026 Elif Thoyyibah Rahmawati

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work’s authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal’s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.