Solving a University Course Timetabling Problem Based on AACSB Policies
نویسندگان
چکیده
The purpose of this research is to solve the university course timetabling problem (UCTP) that consists designing a schedule courses be offered in one academic period based on students’ demand, faculty composition and institutional constraints considering policies established standards Association Advance Collegiate Schools Business (AACSB) accreditation. These involve assignment with high level credentials have fulfilled for business schools road seek recognition differentiation while providing exceptional learning. A new mathematical model UCTP proposed. allows course-section-professor-time slot assigned an department strategically using workload, overload, fulfillment AACSB criteria. Further, will require hires are classified according qualifications stablished by AACSB. real-world case described solved show efficiency proposed model. An analysis different strategies derived from impacts resulting also presented. results overload could valuable strategy helping mitigate total needed. create at same time met.
منابع مشابه
SOLVING UNIVERSITY COURSE TIMETABLING PROBLEM USING GENETIC ALGORITHM Master Thesis
This is to certify that we have read this thesis and that we find it fully adequate in scope, quality and content, as a thesis for the degree of Master of Science. continously asking me " how is the thesis going? " , because she encouraged me to persevere without knowing it. Also I would like to thank to my best friend, my colleague, my dear husband Tarkan Aydın for his understanding, patience,...
متن کاملGreedy Ants Colony Optimization Strategy for Solving the Curriculum Based University Course Timetabling Problem
This work was carried out in collaboration between both authors. Author KP designed the study, wrote the protocol and supervised the work. Authors KP and ZG carried out all laboratories work and performed the statistical analysis. Author KP managed the analyses of the study. Author KP wrote the first draft of the manuscript. Author ZG managed the literature searches and edited the manuscript. B...
متن کاملVariable Neighborhood Search Based Algorithm for University Course Timetabling Problem
In this paper a variable neighborhood search approach as a method for solving combinatory optimization problems is presented. A variable neighborhood search based algorithm for solving the problem concerning the university course timetable design has been developed. This algorithm is used to solve the real problem regarding the university course timetable design. It is compared with other algor...
متن کاملAn Event Grouping Based Algorithm for University Course Timetabling Problem
This paper presents the study of an event grouping based algorithm for a university course timetabling problem. Several publications which discuss the problem and some approaches for its solution are analyzed. The grouping of events in groups with an equal number of events in each group is not applicable to all input data sets. For this reason, a universal approach to all possible groupings of ...
متن کاملThe effect of neighborhood structures on tabu search algorithm in solving university course timetabling problem
The design of course timetables for academic institutions is a very difficult job due to the huge number of possible feasible timetables with respect to the problem size. This process contains lots of constraints that must be taken into account and a large search space to be explored, even if the size of the problem input is not significantly large. Different heuristic approaches have been prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math9192500