Goal Programming Solution of the Examiner Assignment Problem

Yıl 2017, Cilt: 1 Sayı: 2, 105 - 118, 30.11.2017

Emre Varlı , Hacı Mehmet Alağaş Tamer Eren , Emir Hüseyin Özder

Öz

In
universities and other educational institutions, the preparation of course
schedules, the making of examination schedules, scheduling studies for
assignments for examinations and lectures are carried out. Studies are being
done in many businesses for the balanced distribution of tasks among staff. In
this study, it was aimed to equip all examiners working at Kırıkkale University
Engineering Faculty in a balanced and fair manner in the midterm and final week
examinations and to prepare an appointment schedule in the framework of the
rules that the university wants. In the study, 741 assignments were made for 36
research assistants working in 7 different departments, taking into consideration
5 different time zones within the scope of 9 day examination period.For
assignments, the sections to which the delegates are attached are primarily
assigned and the special requests of the delegates are also taken into
consideration. The goal programming method is used for the assignment

Anahtar Kelimeler

Goal Programming, Examiners Assignment, Research Assistant

Sınav Görevlisi Atama Probleminin Hedef Programlama Yöntemiyle Çözümü

Öz

Üniversitelerde ve diğer eğitim
kurumlarında ders programlarının hazırlanması, sınav programlarının yapılması,
sınav ve derslere görevli ataması için çizelgeleme çalışmaları yapılmaktadır.
Görevlilerin dengeli görev dağılımı için birçok işletmede çalışmalar
yapılmaktadır. Bu çalışmada da Kırıkkale Üniversitesi Mühendislik Fakültesinde
çalışan bütün araştırma görevlilerinin vize ve final haftasındaki sınav
gözetmenliklerinin dengeli ve adaletli bir şekilde atamak ve üniversitenin
istediği kurallar çerçevesinde bir atama çizelgesini hazırlamak amaçlanmıştır. Çalışmada,
7 farklı bölümde çalışan 36 araştırma görevlisi için, 9 günlük sınav periyodu
kapsamında, 5 farklı saat dilimi göz önüne alınarak 741 sınava atama
yapılmıştır. Atamalar için görevlilerin bağlı olduğu bölümler öncelikle
atanması sağlanmıştır ve görevlilerin özel istekleri de dikkate alınmıştır.
Görevli ataması için hedef programlama yöntemi kullanılmıştır.

Anahtar Kelimeler

Hedef Programlama, Sınav Görevlisi Atama, Araştırma Görevlisi

Kaynakça

• Abbas, A.M., Tsang, E.P.K. (2001). Constraint-based timetabling-a case study. Computer Systems and Applications, ACS/IEEE International Conference, Beirut, Lebanon, 67-72.
• Alfares, H. (2001). Staffing and Workforce Scheduling for a Security Gate. International Journal of Operations & Quantitative Management, 7, 281–293.
• Al-Yakoob S.A., ve Sherali H.D. (2007). A mixed-integer programming approach to a class timetabling problem: A case study with gender policies and traffic considerations. European Journal of Operational Research, 180 (3), 1028-1044.
• Asmuni H., Burke E.K., Garibaldi J., ve McCollum B. (2004). Fuzzy multiple ordering criteria for examination timetabling”. Selected Papers from the 5th International Conference on the Practice and Theory of Automated Timetabling. Berlin, Germany, Springer Lecture Notes in Computer Science, 3616, 334-353.
• Charnes A. ve Cooper W.W. (1961). Management Models and Industrial Applications of Linear Programming. Wiley, New York.
• Charnes A., Cooper W. W., ve Ferguson R. (1955). Optimal Estimation of Executive Compensation by Linear Programming, Management Science, 1, 138-151.
• Charnes, A., ve Cooper, W.W. (1977). Goal programming and multiple objective optimizations, European Journal of Operational Research I, 39-54.
• Chu, S. C. K., (2007). Generating, scheduling and rostering of shift crew-duties: Applications at the Hong Kong International Airport. European Journal of Operational Research, 177, 1764-1778.
• Corominas, A., Lusa, A., ve Pastor, R., (2004). Planning annualisedhourswith a finite set of weekly working hours and joint holidays. Annals of Operations Research, 128, 217-233.
• Daskalaki S., Birbas T., ve Housos E. (2004). An Integer Programming Formulation for a Case Study in University Timetabling. European Journal of Operational Research, 153 (1), 117-135.
• Dimopoulou M., ve Miliotis P. (2004). An Automated University Course Timetabling System Developed in a Distributed Environment: A Case Study. European Journal of Operational Research, 153 (1), 136-147.
• Ignizio, J. Introduction to Goal Programming, Sage Publications Inc., Beverley Hills,California, USA, 1985.
• Legierski W., ve Widawski R. (2003). System of Automated Timetabling. 25th Int. Conf. Information Technology Interfaces ITI 2003, Cavtat, Croatia, 495-500.
• Parthiban, P., Ganesh, K., Narayanan, S., ve Dhanalakshmi, R. (2004). Preferences Based Decision-Making Model (PDM) for Faculty Course Assignment Problem. Engineering Management Conference Proceedings, IEEE International, Singapore, 3, 1338- 1341.
• Schaerf, A. (1999). Local Search Techniques for Large High School Timetabling Problems. Systems, Man and Cybernetics. Part A, IEEE Transactions, 29 (4), 368-377.
• Sigl B., Golub M., ve Mornar V. (2003). Solving Timetable Scheduling Problem Using Genetic Algorithms. Information Technology Interfaces, ITI 2003. Proceedings of the 25th International Conference, Dubrovnik, Croatia, 519 - 524.
• Tam V., ve Ting D. (2003). Combining the Min-Conflicts and Look-Forward Heuristics to Efectively Solve a Set of Hard University Timetabling Problems. 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'03). Sacremento, California, USA, 492-496.
• Topaloğlu, S., ve Özkarahan, I. (2004). An implicit goal programming model for the tour scheduling problem considering the employee work preferences. Annals of Operations Research, 128, 135-158.
• Ünal, F.M., ve Eren, T. (2016). Hedef Programlama ile Nöbet Çizelgeleme Probleminin Çözümü. Akademik Platform Mühendislik ve Fen Bilimleri Dergisi, 4 (1), 28-37.
• Ünlüsoy, S., ve Eren T. (2016). Kamusal Binalarda Temizlik Çizelgeleme ve Örnek Uygulama. Mühendislik Bilimleri ve Tasarım Dergisi, 4 (3), 149-155.
• Varlı E., Eren T., Gençer M. A., ve Çetin Özel S. (2016). Ankara Metrosu M1 Hattındaki Vatmanların Vardiya Saatlerinin Çizelgelenmesi. 3.Uluslararası Raylı Sistemler Mühendisliği Sempozyumu-Karabük.
• Varlı, E., ve Eren, T. (2017). Hemşire Çizelgeleme Problemi ve Bir Hastanede Uygulama. Akademik Platform Mühendislik ve Fen Bilimleri Dergisi, 5(1), ss. 34-40.
• Varlı, E., Ergişi, B., ve Eren, T. (2017). Özel Kısıtlı Hemşire Çizelgeleme Problemi: Hedef Programlama Yaklaşımı. Erciyes Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi, 0 (49), 189-206.
• Zhang L., ve Lau S.K. (2005). Constructing university timetable using constraint satisfaction programming approach. Proceedings of the 2005 International Conference on Computational Intelligence for Modelling, Control and Automation, and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC’05), Vienna, Austria, 55-60.
• Zhaohui F., ve Lim A. (2000). Heuristics for the Exam Scheduling Problem. Tools with Artificial Intelligence, ICTAI 2000 Proceedings. 12th IEEE International Conference, Vancouver, Canada, 172 – 175.