Sistem Informasi Manajemen Penjadwalan Kuliah Menggunakan Pendekatan Integer Programming
Article Sidebar
Main Article Content
Abstract
Penjadwalan kuliah merupakan masalah NP-Hard dan kompleksitas. Kompleksitas terjadi ketika jumlah mahasiswa dan pertemuan matakuliah yang harus dijadwalkan sangat banyak hingga mencapai ratusan bahkan ribuan. Tujuan penelitian adalah merancang sistem informasi penjadwalan kuliah menggunakan pendekatan integer programming untuk pemanfaatan resource pada perguruan tinggi politeknik. Secara umum penjadwalan kuliah dapat diselesaikan menggunakan pendekatan integer programming dengan menerapkan bilangan biner 0 dan 1. Hasil analisa data resource menunjukkan bahwa untuk informasi hard contraints bebas dari bentrok sedangkan soft contraints masih terdapat bentrok pada timeslot dosen. Hasil penelitian menggunakan integer programming dengan mengabungkan hard constraint dan soft constraint menghasilkan jadwal yang efektif namun tidak efisien dalam melakukan proses pengolahan data untuk menempatkan kelas dan dosen pada ruang dan timeslot, karena proses dilakukan secara manual dengan mengurutkan aktivitas yang sulit terlebih dahulu, sehingga membutuhkan waktu yang lama dalam mengatur resource untuk menghasilkan jadwal yang bebas dari bentrok dosen, kelas, dan ruangan. Pendekatan Integer Programming belum dapat menemukan solusi secara maksimal terutama pada pengaturan soft constraint.
Downloads
Article Details
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 (See The Effect of Open Access).
References
Chu, C.S., Chen, T.Y., dan Ho, H.J., 2006, Timetable Scheduling Using Particle Swarm Optimization, Proceedings of the First International Conference on Innovative Computing, Information and Control, 0-7695-2616-0/06, IEEE.
Irene, F.S.H., Deris, S., dan Hashim, M.Z.S., 2009, Incorporating Of Constraint-Based Reasoning Into Particle Swarm Optimization For University Timetabling Problem, ISSR Journals, Vol. 1 (1).
Kanoh, H., dan Chen, S., 2013, Particle Swarm Optimization with Transition Probability for Timetabling Problems, LNCS, Springer.
Mansur, 2014, Perancangan Sistem Informasi Penjadwalan Resource Perguruan Tinggi Menggunakan Metode Particle Swarm Optimization (PSO), Inovasi dan Teknologi Politeknik Negeri Bengkalis (Inovtek Polbeng), Volume 4, Nomor 2, Oktober, hlm. 75-86.
Oladokun, V.O dan Badmus, S.O, 2008, An Integer Linear Programming Model of a University Course Timetabling Problem, The Pacific Journal of Science and Technology, Volume 9. Number 2.
Phillips, E.A, Walker, G.C, Ehrgott, M, dan Ryan, M.D, 2014, Integer Programming for Minimal Perturbation Problems in University Course Timetabling, International Conference of the Practice and Theory of Automated Timetabling, PATAT 2014, 26-29, United Kingdom.
Pongcharoen, P., Promtet, W., Yenradee, P., dan Hicks, C., 2008, Stochastic Optimisation Timetabling Tool for university course scheduling, Int. J. Production Economics 112 903–918, Elsevier.
Shiau, F.D., 2011, A hybrid particle swarm optimization for a university course scheduling problem with flexible preferences, Expert Systems with Applications 38 235–248, Elsevier.
Staereling, V.H.V., 2012, School timetabling in theory and practice, VU University, Amsterdam.
Tassopoulos, X.L., dan Beligiannis, N.G., 2012, Using particle swarm optimization to solve effectively the school timetabling problem, Soft Comput 1229–1252, Springer.
Teoh, K.C., Wibowo, A., dan Ngadiman, S.M., 2013, Review of state of the art for metaheuristic techniques in Academic Scheduling Problems, Artif Intell OI 10.1007/s10462-013-9399-6, Springer.