Journals / Endüstri Mühendisliği / 2016 / Cilt: 27 - Sayı: 1

UNIVERSITY COURSE SCHEDULING PROBLEMS IN CASE OF CONSIDERATION OF THE USER PREFERENCES

KULLANICI TERCİHLERİNİN DİKKATE ALINMASI DURUMUNDA ÜNİVERSİTE DERS ÇİZELGELEME PROBLEMİ

Pages
2–16
Publication Date
2016-03-25
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

The proposed approach gives better solutions will increase overall performance of the educational systems from the point of students and instructors.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this study, a multi objective 0-1 integer mathematical model is proposed for the purpose of obtaining high-quality solutions to an educational timetabling problem faced a few times in each term in the universities.
📊
Key Findings & Data:The course-room-time slot scheduling problem which assigns events (course) to resources (room-time slot) is a big dimensional problem based on the number of constraints and variables.
💡
Conclusion & Impact:The proposed approach gives better solutions will increase overall performance of the educational systems from the point of students and instructors.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Çok ölçütlü karar verme · ders-derslik-zaman çizelgeleme problemi · matematiksel modelleme

Abstract

In this study, a multi objective 0-1 integer mathematical model is proposed for the purpose of obtaining high-quality solutions to an educational timetabling problem faced a few times in each term in the universities. The course-room-time slot scheduling problem which assigns events (course) to resources (room-time slot) is a big dimensional problem based on the number of constraints and variables. The solution to this problem requires intensive labor and resources. Thus, the problem is important for educational institutions, and also is a difficult problem. Beside the main assignment constraints, each of them has its own specific constraint and objectives changing from one institution to another. The mathematical model which is developed by considering the user preferences with a multi criteria decision making model was experimented by using the data of a department in Anadolu University. During the solution step, the weighted sum scalarization method is used and it is seen that the mathematical model found the optimal solution within a reasonable time. The outcome is compared with the current schedule. The proposed approach gives better solutions will increase overall performance of the educational systems from the point of students and instructors.

Özet

Bu çalışmada, üniversitelerde bir eğitim döneminde en az iki defa karşılaşılan bir eğitimsel zaman çizelgeleme problemi için kaliteli çözümlerin elde edilmesi amacıyla, çok amaçlı 0-1 tamsayılı bir matematiksel model sunulmuştur. Faaliyetlerin (ders) kaynaklara (derslik-zaman) atandığı ders-derslik-zaman çizelgeleme problemi kısıt ve değişken sayıları açısından büyük boyutlu bir problemdir. Bu problemin çözümü, yoğun iş gücü ve kaynak gerektirmektedir. Dolayısıyla, eğitim kurumları açısından önemli olduğu kadar, zor da bir problemdir. Temel atama kısıtlarının yanı sıra, kurumdan kuruma değişmekle birlikte, her problemin kendine özgü kısıt ve amaç fonksiyonları bulunmaktadır. Çalışmada, çok ölçütlü bir karar verme modeli ile kullanıcı tercih ve istekleri de dikkate alınarak geliştirilen matematiksel model, Anadolu Üniversitesi bünyesinde bir bölüme ait veriler ile ağırlıklı toplam skalerleştirme yöntemi kullanılarak çözdürüldüğünde, kabul edilebilir bir sürede en iyi çözüme ulaşılmıştır. Elde edilen çizelge mevcut çizelge ile karşılaştırıldığında, önerilen sistemin öğrenciler, öğretim üyeleri ve kaynak kullanımı açısından genel performansı arttırıcı yönde iyi sonuç verdiği görülmüştür.

🔖

Cite This Article

ÖZTÜRK, Z. K., KASIMBEYLİ, N., ÖZDEMİR, M. S., ACAR, M. S., ÖZÇETİN, E., ALEGÖZ, M., CEYLAN, G. (2016). UNIVERSITY COURSE SCHEDULING PROBLEMS IN CASE OF CONSIDERATION OF THE USER PREFERENCES. Endüstri Mühendisliği, Cilt: 27 - Sayı: 1, 2–16. https://ajindex.com/articles/70704

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (13)

  1. Abuhamdah, A., Ayob, M. 2009. “Experimental Result of Particle Collision Algorithm For Solving Course Timetabling Problems,” International Journal of Computer Science and Network Security, vol. 9 (9), p. 134-142
  2. Abuhamdah, A., Ayob, M., Kendall, G., Sabar, N. 2014. “Population Based Local Search for University Course Timetabling Problems,” Applied Intelligence, vol. 40, p. 44–53
  3. Achá, R., Nieuwenhuis, R. 2014. “Curriculum-Based Course Timetabling with SAT and Maxsat,” Annals of Operations Research, vol. 218, p. 71–91
  4. Akyol, E., Saraç, T. 2012, “Plastik Parçalar Üreten bir Firmanın Montaj Hatlarının Çizelgelenmesi,” MMO Endüstri Mühendisliği Dergisi, sayı 23 (2), s. 28-41
  5. Al-Betar, M., Khader, A., Zaman, M. 2012, “University Course Timetabling Using a Hybrid Harmony Search Metaheuristic Algorithm,” IEEE Transactıons On Systems, Man and Cybernetıcs—Part C: Applıcatıons and Reviews, vol. 42 (5), p. 664-680
  6. Azimi, Z. N. 2005. “Hybrid Heuristics for Examination Timetabling Problem,” Applied Mathematics and Computation, vol. 163, p. 705-733
  7. Azmat, C. S., Widmer, M. 2004. “A Case Study of Single Shift Planning and Scheduling Under Annualized Hours: A Simple Three-Step Approach,” European Journal of Operational Research, vol. 153, p. 148–175
  8. Badri, M. A. 1996. “A Two-Stage Multiobjective Scheduling Model For Faculty-Course-Time Assignments,” European Journal of Operational Research, vol. 94, p. 16–28
  9. Beligiannis, G. N., Moschopoulosa, C. N., Kaperonisa, G. P., Likothanassisa, S. D. 2008. “Applying Evolutionary Computation To The School Timetabling Problem: The Greek Case,” Computers and Operations Research, vol. 35 (4), p. 1265-1280
  10. Bolaji, A. L., Kahader, A. T., Al-Betar, M. A. 2014. “University Course Timetabling Using Hybridized Artificial Bee Colony with Hill Climbing Optimizer,” Journal of Computational Science, vol. 5, p. 809-818
  11. Boronico, J. 2000. “Quantitative Modeling and Technology Driven Departmental Course Scheduling,” Omega, vol. 28, p. 327-346
  12. Burke, E. K., Newall, J. P., Weare, R. F. 1996. “A Memetic Algorithm For University Exam Timetabling,” Lecture Notes in Computer Science, 1153. The Practice and Theory of Automated Timetabling: Selected Papers (ICPTAT 95), Burke, E. K., Ross, P. (Ed.), Springer-Verlag, Berlin, Heidelberg, New York, p. 241-250
  13. Burke, E. K., Kendall, G., Soubeiga, E. 2003. “A Tabu Search Hyperheuristic for Timetabling and Rostering,” Journal of Heuristics, vol. 9 (6), p. 451-