Abstract
In the universities and other educational institutions, make-up/compensation examinations are made for students who cannot take the exam at the scheduled exam periods due to examinations, health problems and so on. Especially when there are a lot of students going into these examinations, preparing the exam schedule can be very difficult and time consuming. In the literature, generally exam scheduling problems are considered as when the number of sessions, examinations and students attending to the examinations are certain, examinations are assigned to the sessions by considering resource constraints such as supervisor, classroom. In this study, number of sessions is not known and desired to be minimized because the examinations must be completed within a short period. It is also aimed that the sessions are balanced as much as possible in terms of number of examinations and if a student will attend more than one examination in one day, the examinations will not be consecutive. A goal programming model is proposed for the considered problem. The developed model has been tested using real data from the Industrial Engineering Department of a University.
Keywords
References
- Qu R, Burke EK, McCollum B, Merlot LTG, Lee SY. “A Survey of search methodologies and automated system development for examination timetabling”. Journal of Scheduling, 12(1), 55-89, 2009.
- Burke EK, McCollum B, Meisels A, Petrovic S, Qu R. “A graph-based hyper-heuristic for educational timetabling problems”. European Journal of Operational Research, 176(1), 177-192, 2007.
- Lotfi V, Cerveny R. “A final-exam-scheduling package”. Journal of the Operational Research Society, 42(3), 205-216, 1991.
- Güngör İ. “Tamsayılı doğrusal programlama yaklaşımı ile sınav planlaması”. Süleyman Demirel Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi, 3(3), 105-112, 1998.
- Dimopoulou M, Miliotis P. “Implementation of a University Course and examination timetabling system”. European Journal of Operational Research, 130(1), 202-213, 2001.
- Azami ZN. “Hybrid heuristics for examination timetabling problem”. Applied Mathematics and Computation, 163(2), 705-733, 2005.
- White GM, Xie BS, Zonjic S. “Using tabu search with longer-term memory and relaxation to create examination timetables”. European Journal of Operational Research, 153(1), 80-91, 2004.
- Mirhassani SA. “Improving paper spread in examination timetables using integer programming”. Applied Mathematics and Computation, 179(2), 702-706, 2006.
- Dammak A, Elloumi A, Kamoun H. “Classroom assignment for exam timetabling”. Advances in Engineering Software, 37(10), 659-666, 2006.
- Pillay N, Banzhaf W. “An informed genetic algorithm for the examination timetabling problem”. Applied Soft Computing, 10(2), 457-467, 2010.
- Sağır M, Öztürk ZK. “Exam scheduling: mathematical modeling and parameter estimation with the analytic network process approach”. Mathematical and Computer Modelling, 52(5-6), 930-941, 2010.
- Turabieh H, Abdullah S. “An Integrated Hybrid Approach to The Examination Timetabling Problem”. Omega, 39(6), 598-607, 2011.
- Çavdur F, Değirmen S, Küçük MK. “Sınav çizelgeleme problemlerinde homojen sinav dağiliminin oluşturulmasi için kümeleme ve hedef programlama temelli bir yaklaşim”. Uludağ Üniversitesi Mühendislik Fakültesi Dergisi, 23(1), 167-188, 2018.
- Kahar MNM, Abu Bakar S, Shing LC, Mandal AK. “Solving kolej poly-tech mara examination timetabling problem”. Advanced Science Letters, 24(10), 7577-7581, 2018.
- Lei Y, Shi J, Yan Z. “A memetic algorithm based on MOEA/D for the examination timetabling problem”. Soft Computing, 22(5), 1511-1523, 2018.
- Keskin ME, Doyen A, Akyer H, Guler MG. “Examination timetabling problem with scarce resources: A case study”. European Journal of Industrial Engineering, 12(6), 855-874, 2018.
Abstract
Üniversitelerde ve diğer eğitim kurumlarında, sınav çakışması, sağlık problemleri vb. nedenlerle planlanan sınav dönemlerinde sınava giremeyen öğrencilere mazeret/telafi sınavları yapılmaktadır. Özellikle bu sınavlara girecek öğrenci sayısının çok olduğu durumlarda, sınav çizelgesinin hazırlanması oldukça zor ve zaman alıcı olabilmektedir. Literatürde genellikle sınav çizelgeleme problemleri, oturum sayısı, sınavlar ve sınavlara katılacak öğrenciler belirli iken sınavların gözetmen, derslik gibi kaynak kısıtlarını da dikkate alarak oturumlara atanması şeklinde ele alınmaktadır. Bu çalışmada ise oturum sayısı belli değildir ve sınavların kısa bir zaman diliminde tamamlanması gerektiğinden toplam oturum sayısının mümkün olduğunca az olması istenmektedir. Ayrıca oturumların sınav sayısı açısından mümkün olduğunca dengeli olması ve bir öğrenci bir günde birden fazla sınava girecekse mümkünse sınavlarının art arda olmaması hedeflenmektedir. Ele alınan problem için bir hedef programlama modeli önerilmiştir. Geliştirilen model, bir üniversitenin Endüstri Mühendisliği Bölümünden alınan gerçek veriler kullanılarak test edilmiştir.
Keywords
References
- Qu R, Burke EK, McCollum B, Merlot LTG, Lee SY. “A Survey of search methodologies and automated system development for examination timetabling”. Journal of Scheduling, 12(1), 55-89, 2009.
- Burke EK, McCollum B, Meisels A, Petrovic S, Qu R. “A graph-based hyper-heuristic for educational timetabling problems”. European Journal of Operational Research, 176(1), 177-192, 2007.
- Lotfi V, Cerveny R. “A final-exam-scheduling package”. Journal of the Operational Research Society, 42(3), 205-216, 1991.
- Güngör İ. “Tamsayılı doğrusal programlama yaklaşımı ile sınav planlaması”. Süleyman Demirel Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi, 3(3), 105-112, 1998.
- Dimopoulou M, Miliotis P. “Implementation of a University Course and examination timetabling system”. European Journal of Operational Research, 130(1), 202-213, 2001.
- Azami ZN. “Hybrid heuristics for examination timetabling problem”. Applied Mathematics and Computation, 163(2), 705-733, 2005.
- White GM, Xie BS, Zonjic S. “Using tabu search with longer-term memory and relaxation to create examination timetables”. European Journal of Operational Research, 153(1), 80-91, 2004.
- Mirhassani SA. “Improving paper spread in examination timetables using integer programming”. Applied Mathematics and Computation, 179(2), 702-706, 2006.
- Dammak A, Elloumi A, Kamoun H. “Classroom assignment for exam timetabling”. Advances in Engineering Software, 37(10), 659-666, 2006.
- Pillay N, Banzhaf W. “An informed genetic algorithm for the examination timetabling problem”. Applied Soft Computing, 10(2), 457-467, 2010.
- Sağır M, Öztürk ZK. “Exam scheduling: mathematical modeling and parameter estimation with the analytic network process approach”. Mathematical and Computer Modelling, 52(5-6), 930-941, 2010.
- Turabieh H, Abdullah S. “An Integrated Hybrid Approach to The Examination Timetabling Problem”. Omega, 39(6), 598-607, 2011.
- Çavdur F, Değirmen S, Küçük MK. “Sınav çizelgeleme problemlerinde homojen sinav dağiliminin oluşturulmasi için kümeleme ve hedef programlama temelli bir yaklaşim”. Uludağ Üniversitesi Mühendislik Fakültesi Dergisi, 23(1), 167-188, 2018.
- Kahar MNM, Abu Bakar S, Shing LC, Mandal AK. “Solving kolej poly-tech mara examination timetabling problem”. Advanced Science Letters, 24(10), 7577-7581, 2018.
- Lei Y, Shi J, Yan Z. “A memetic algorithm based on MOEA/D for the examination timetabling problem”. Soft Computing, 22(5), 1511-1523, 2018.
- Keskin ME, Doyen A, Akyer H, Guler MG. “Examination timetabling problem with scarce resources: A case study”. European Journal of Industrial Engineering, 12(6), 855-874, 2018.
Details
| Primary Language | Turkish |
|---|---|
| Subjects | Engineering |
| Journal Section | Research Article |
| Authors | |
| Publication Date | February 20, 2020 |
| Published in Issue | Year 2020 Volume: 26 Issue: 1 |
Cite
