Pengembangan Program Komputer Penjadwalan Matakuliah Berdasarkan Pewarnaan Graf dengan Algoritma Welsh-Powell Terbobot
DOI:
https://doi.org/10.24014/coreit.v6i1.9955Abstract
Penjadwalan matakuliah di suatu universitas merupakan permasalahan yang kompleks, dikarenakan melibatkan berbagai sumber daya yang memiliki kemungkinan tumpang tindih (bentrok) cukup besar. Beberapa universitas tidak lagi menyusun jadwal matakuliahnya secara manual. Mereka telah menggunakan berbagai program komputer penjadwalan berbasis web yang cukup populer, sebagai contoh Lantiv, Unitime, dan sebagainya. Program-program komputer tersebut merupakan program yang dikembangkan di negara lain. Bagaimana dengan program produksi Indonesia? Penelitian ini merupakan upaya untuk menjawab hal tersebut. Program yang dikembangkan dalam penelitian ini dilandaskan pada teori pewarnaan graf, khususnya pewarnaan simpul (vertex) dengan algoritma Welsh-Powell Terbobot. Program computer yang dihasilkan diberi nama ARC Scheduler yang ditulis dengan bahasa C++ dan IDE Code Blocks. Program ini telah diujicobakan di Universitas Advent Indonesia pada tahun 2018 dan 2019 dengan respon pengguna sangat puas. Program ARC Scheduler terus dikembangkan dalam hal pengoperasian secara remote, baik berbasis web maupun berbasis android.
References
Lantiv, “SCHEDULING STUDIOTM 2021: Course Scheduling Software.” [Online]. Available: https://scheduling-studio.lantiv.com/. [Accessed: 04-May-2020].
Unitime, “UniTime | University Timetabling Online.” [Online]. Available: https://unitime.org/. [Accessed: 04-May-2020].
D. J. A. Welsh and M. B. Powell, “An upper bound for the chromatic number of a graph and its application to timetabling problems,” Comput. J., vol. 10, no. 1, pp. 85–86, Jan. 1967, doi: 10.1093/comjnl/10.1.85.
D. de Werra, “An introduction to timetabling,” Eur. J. Oper. Res., vol. 19, no. 2, pp. 151–162, 1985, doi: 10.1016/0377-2217(85)90167-5.
F. K. S. Dewi, “Pembangunan Perangkat Lunak Pembangkit Jadwal Kuliah dan Ujian Dengan Metode Pewarnaan Graf,” J. Buana Inform., 2010, doi: 10.24002/jbi.v1i1.295.
K. H. Rosen, Discrete Mathematics Applications and Its Eighth Edition. New York: McGraw-Hill Education, 2019.
K. Appel, W. Haken, and J. Koch, “Every planar map is four colorable. Part II: Reducibility,” Illinois J. Math., vol. 21, no. 3, pp. 491–567, 1977, doi: 10.1215/IJM/1256049012.
A. P. Rahadi, “Penjadwalan Matakuliah Menggunakan Pewarnaan Graf Dengan Algoritma Largest First,” J. Padegogik Mat., vol. 2, no. 1, pp. 1–13, Jan. 2019, doi: 10.35974/jpd.v2i1.1067.
H. Jusuf, “Pewarnaan Graph pada Simpul untuk Mendeteksi Konflik Penjadwalan Kuliah.” [Online]. Available: https://www.researchgate.net/publication/277756776_Pewarnaan_Graph_pada_Simpul_untuk_Mendeteksi_Konflik_Penjadwalan_Kuliah. [Accessed: 05-May-2020].
M. ASLAN, “A Performance Comparison of Graph Coloring Algorithms,” Int. J. Intell. Syst. Appl. Eng., 2016, doi: 10.18201/ijisae.273053.
X. Zhou and T. Nishizeki, “Graph Coloring Algorithms,” IEICE Trans. Inf. Syst., 2000.
N. Cauvery, “Timetable Scheduling using Graph Coloring,” Int. J. P2P Netw. Trends Technol., 2011.
S. Astuti, “Penyusunan Jadwal Ujian Matakuliah Dengan algoritma Pewarnaan Graf Welch Powell| Astuti | JURNAL DIAN,” J. DIAN, vol. 11, no. 1, p. 68, 2011.
H. Setiawan, H. Hanafi, L. R. Prilanti, and Kestrilia, “Implementasi Algoritma Kunang-Kunang untuk Penjadwalan Mata Kuliah di Universitas Ma Chung 269.”
E. Crookshanks, Practical software development techniques : tools and techniques for building enterprise software. Apress, 2014.
UNAI, “Universitas Advent Indonesia.” [Online]. Available: https://unai.edu/wp-content/uploads/2018/12/Laporan-Wakil-Rektor-I-Bidang-Akademik-UNAI-T.A.-15-16.pdf. [Accessed: 06-May-2020].
Microsoft, “Download Visual C++ Redistributable for Visual Studio 2015 from Official Microsoft Download Center.” [Online]. Available: https://www.microsoft.com/en-us/download/details.aspx?id=48145. [Accessed: 08-May-2020].
The Code Blocks Team, “Code::Blocks.” [Online]. Available: http://codeblocks.org/. [Accessed: 10-May-2020].
E. B. Pani and A. Simbolon, “20182019 Ganjil - Google Sheets.” [Online]. Available: https://docs.google.com/spreadsheets/d/1Sbfe53t387v1qtfg3M72146MSfMltNQSqLmwJcCgQwQ/edit#gid=1433553467. [Accessed: 06-May-2020].
M. Al-Obaedy, “Classic-Waterfall-Development-Model.png (616×328).” [Online]. Available: https://www.researchgate.net/profile/Mohaned_Al-Obaidy/publication/259772190/figure/fig1/AS:392568656416769@1470607069202/Classic-Waterfall-Development-Model.png. [Accessed: 05-May-2020]
Downloads
Published
Issue
Section
License
The Authors submitting a manuscript do so on the understanding that if accepted for publication, copyright of the article shall be assigned to CoreIT journal and published by Informatics Engineering Department Universitas Islam Negeri Sultan Syarif Kasim Riau as publisher of the journal.
Authors who publish with this journal agree to the following terms:
Authors automatically transfer the copyright to the journal and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution-ShareAlike (CC BY SA) 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 permission for 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 (See The Effect of Open Access).
