Abstract
Abstract
Undergraduate thesis examination in Industrial Engineering Department of Universitas Sebelas Maret conducted through two stages, namely intermediate and final examination. Currently, the scheduling process of such examinations is done by the undergraduate thesis coordinator manually without certain systematic method or approach. In this paper, we develop an optimization model for the examinations scheduling considering several factors, namely the number of lecturers that must attend the examinations, the availability of rooms for examinations, the availability of each lecturer, and the assignment distributions. The model uses integer programming approach. Two performance criteria are used in the model, namely the difference between the number of each lecturer’s assignment with the average number of lecturer assignments and the number of penalties from the assignment of lecturers on certain time slot. The developed model is able to solve the scheduling problem more efficiently than manual scheduling done by thesis coordinator. The optimal solutions from the optimization model show a total difference in the assignment of lecturer with an average of 29.6 and a penalty of 0.
Publisher
Springer Science and Business Media LLC
Subject
Industrial and Manufacturing Engineering
Reference20 articles.
1. Boizumault P, Delon Y, Peridy L (1996) Constraint logic programming for examination timetabling. J Logic Program 26:217–233
2. Carter MW, Laporte G (1996) Recent developments in practical examination timetabling. Lecture notes in computer science, vol 1153, Springer, Edinburgh, pp 3–21
3. Daskalaki S, Birbas T Dan, Housos E (2004) An integer programming formulation for a case study in university timetabling. Eur J Oper Res 153:117–135
4. Fiarni C, Gunawan AS, Ricky, Maharani H, Kurniawan H (2015) Automated scheduling system for thesis and project presentation using forward chaining method with dynamic allocation resources. Proc Comput Sci 72:209–216
5. Hanum F, Romliyah MA, Bakhtiar T (2015) Exam invigilator assignment problem: a goal programming approach. Appl Math Sci 9(58):2871–2880
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献