Next Article in Journal
On the Calculation of the Moore–Penrose and Drazin Inverses: Application to Fractional Calculus
Next Article in Special Issue
Special Issue “Mathematical Methods for Operations Research Problems”
Previous Article in Journal
Gender Classification Using Proposed CNN-Based Model and Ant Colony Optimization
Previous Article in Special Issue
On Little’s Formula in Multiphase Queues
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Solving a University Course Timetabling Problem Based on AACSB Policies

by
Nancy M. Arratia-Martinez
*,†,
Paulina A. Avila-Torres
and
Juana C. Trujillo-Reyes
Department of Business Administration, Universidad de las Américas Puebla/Ex-Hacienda Santa Catarina Mártir, San Andres Cholula, Puebla 72810, Mexico
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2021, 9(19), 2500; https://doi.org/10.3390/math9192500
Submission received: 30 May 2021 / Revised: 17 September 2021 / Accepted: 17 September 2021 / Published: 6 October 2021
(This article belongs to the Special Issue Mathematical Methods for Operations Research Problems)

Abstract

:
The purpose of this research is to solve the university course timetabling problem (UCTP) that consists of designing a schedule of the courses to be offered in one academic period based on students’ demand, faculty composition and institutional constraints considering the policies established in the standards of the Association to Advance Collegiate Schools of Business (AACSB) accreditation. These standards involve faculty assignment with high level credentials that have to be fulfilled for business schools on the road to seek recognition and differentiation while providing exceptional learning. A new mathematical model for UCTP is proposed. The model allows the course-section-professor-time slot to be assigned for an academic department strategically using the faculty workload, course overload, and the fulfillment of the AACSB criteria. Further, the courses that will require new hires are classified according to the faculty qualifications stablished by AACSB. A real-world case is described and solved to show the efficiency of the proposed model. An analysis of different strategies derived from institutional policies that impacts the resulting timetabling is also presented. The results show the course overload could be a valuable strategy for helping mitigate the total of new hires needed. The proposed model allows to create the course at the same time the AACSB standards are met.

1. Introduction

Timetabling is the process of building a timetable while satisfying several constraints. The timetabling problem has many applications such as educational and transportation issues for employees and others [1]. This research is focused on the university course timetabling problem, a problem that has been extensively studied [2]. The University Course Timetabling Problem (UCTP) consists of supplying a schedule of the courses to be offered in one academic period based on students enrolled and constraints established by the university. A course timetabling usually involves the allocation of resources (teachers, students, classrooms, etc.) and time slots to each given meeting (lectures, seminars, etc.) while satisfying constraints [3].
The UCTP has three stages: (i) faculty course assignment optimization, (ii) faculty course scheduling optimizations and (iii) faculty room assignment optimization [4], there are many constraints to be considered and they are usually divided into two categories: (i) hard constraints, these constraints must be satisfied in order to produce a feasible timetable and (ii) soft constraints, these constraints are desirable but not absolutely essential [2].
UCTP is considered one of the most interesting problems faced by universities [5] but some of them are still constructing timetables by hand [6] with the assistance of simple office applications like spreadsheets. This is a very difficult task given the many restrictions to be satisfied [3]. The automation of timetabling problems is a task that saves a lot of work and time for institutions, it also provides optimal solutions by improving the quality of education and services [5]. The educational timetabling problem has been formulated in many different ways and has been addressed using several analytic or heuristic approaches. However, it is difficult to implement the same approach to a problem because each institution has different characteristics and constraints or limitations [7].
There are some authors that consider preferences of the faculty in different areas. Such is the case of the method proposed by Immonen and Putkonen [8] where they build a timetable satisfying pre-requisite knowledge and specific preferences for faculty. Also Tavakoli et al. [9] say one subject can be taught by many lecturers but the priority must be given to the one with higher qualifications. In [10], authors use a bee colony optimization and consider the preferences of subjects a professor can teach. Another work is the one proposed by Domenech and Lusa [11] in which they propose a mathematical model considering some preferences according to the category of the professor. Al-Yakoob and Sherali [12] developed a mathematical model for assigning faculty members to classes considering their preferences of time as much as possible and the qualifications of the faculty.
Another characteristic considered in the construction of the timetable is the workload of the faculty, for example, in [11] authors propose a mathematical model where they balance the teachers’ workload. Authors in [12] present a mathematical model for assigning faculty members to classes considering teaching load and qualifications, the objective of the model is to minimize the dissatisfaction of faculty members. In some cases according to the level of the professor some institutions may establish a number of days a professor can teach in order to give them the opportunity to do work in research, such is the case of the approach made by Chen and Shih [13] where teachers of specific levels can only teach two classes per week and each teacher may not teach more hours than the limit stipulated by the academic department. Further, authors in [10] consider the maximum number of courses a professor can teach, or create a fair course timetable, balancing the interests between faculty [14].
Characteristics like, preferences of different types, workload, among others are important in the construction of timetable for business schools that are accredited by the Association to Advance Collegiate Schools of Business (AACSB) or for those institutions that would like to obtain the accreditation. For the latter, it is important to build the timetable fulfilling the standards established by AACSB. The mathematical model presented by Boronico and Kong [15] determines the full-time faculty (without any decision about the timetable) required according to accreditation guidelines of AACSB for the different campuses and disciplines, this is the reason business schools must now specify their relative emphasis on teaching, intellectual contributions, service, and make explicit commitments to particular types of intellectual contributions [16].
For business schools, it is very important to obtain the AACSB accreditation, specially for those schools outside North America and Europe [17], according to Bajada and Trayler [18], the faculty of a modern business school is expected to be academically qualified (AQ) under AACSB standards. For an institution that would like to receive AACSB accreditation, a certain percentage of the business school faculty must be AQ [17].
AACSB is an important influence on many business schools, that is the reason the accredited business schools are expected to have highly qualified faculty members to complete the course timetabling, but the number of faculty available to fill open positions is not sufficient and it is difficult for schools to recruit and retain the qualified faculty [19].
AACSB is becoming more important for business schools and fulfilling the standards is determinant to achieve the accreditation or re-accreditation. This implies universities need to accomplish the percentages of professors in every category and the construction of the timetable is directly related to that standard.
In the reviewed literature, we did not find any other paper that involves the timetabling problem with all the characteristics addressed here and the AACSB standards. This research is focused in the construction of a university course timetable for a business school considering mainly the preferences and qualifications of faculty, teaching load and the category of the professors in order to fulfill the percentages of the qualification standards established by the AACSB. The output of the model will be the assignment of professor to subject and time slot, also the number of professors that have to be hired in order to achieve the percentages indicated by the standard of the AACSB.
The papers found in the reviewed literature have some similarities with the proposed model. For example, authors like Immonen and Putkonen [8] and Al-Yakoob and Sherali [12] include in their construction of timetabling the qualification of professors. The category of professors is considered by Domenech and Lusa [11] and Chen and Shih [13]. Another similarity is the consideration of maximum number of courses, a characteristic taken into account by Ojha and Sahoo [10]. But our proposal has some differences with the papers found in literature, for example, we do not consider the balance of workload whereas Domenech and Lusa [11] and Al-Yakoob and Sherali [12] include this characteristic and the models proposed by them. One of the decision made by our proposed model is whether to give or not work overload to professors, characteristic not found in any other model. Boronico and Kong [15] take into account the standards of AACSB but they do not construct the timetable. Their model indicates the number of professors needed in each campus is order to comply the percentages of each category in the AACSB standards. To sum it up, any other paper that involves the timetabling problem with all the characteristics addressed here and the AACSB standards was not found.
The article is organized as followed, the rest of the Section 1 provides a description of the AACSB accreditation as well as the faculty standard; Section 2 describes on detail the context of the case study; Section 3 presents the proposed mathematical model; Section 4 presents the case information; Section 5 presents a discussion of the results; Section 6 presents the conclusions of the present work.

AACSB Accreditation and Standards

A challenge facing economic programs in business schools is that of aligning programs to be consistent with the assessment expectations for the AACSB accreditation [20]. Business school accreditation is a way for business schools to differentiate their brand and demonstrate the highest standard of achievement [21]. The AACSB is the most important institution responsible of accrediting business schools around the world. The AACSB was founded in 1916 and established the first standards for programs in business administration in 1919. Nowadays, there are 874 business institutions in 56 countries that have earned the AACSB accreditation [22].
A business school has to follow the next process in order to apply for the AACSB Accreditation: first, the business school must establish its membership and eligibility for accreditation. During the initial accreditation process, the school is evaluated based on the AACSB accreditation standards. After earning the AACSB accreditation, the business school is periodically evaluated to continue its accreditation [22].
The nine standards that every business school have to achieve are divided into three categories: (1) Strategic management and innovation, (2) Learner success and (3) Thought leadership, engagement and societal impact learning and teaching. Standard three declares that the school should maintain and strategically deploy a sufficient number of participating (P) and supporting (S) faculty. A participating faculty actively takes part in the activities of the school besides teaching responsibilities. A supporting faculty is more dedicated to teaching responsibilities; she/he does not normally participate in the intellectual or operational life of the school [22].
According to the AACSB, the faculty is classified as follows: Scholarly Academic (SA), Practice Academic (PA), Scholarly Practitioner (SP), or Instructional Practitioner (IP). Faculty members who do not meet the definitions of any of these categories are classified as Additional Faculty (A).
  • Scholarly Academics (SA) are faculty who have normally attained a terminal degree in a field related to the area of teaching and who sustain currency and relevance through scholarship and related activities.
  • Practice Academics (PA) are faculty who have normally attained a terminal degree in a field related to teaching and who sustain currency and relevance through professional engagement, interaction, and relevant activities.
  • Scholarly Practitioners (SP) are faculty who have normally attained a master’s degree related to the field of teaching; have professional experience and produce scholarship related to their professional background and experience.
  • Instructional Practitioners (IP) are faculty who have normally attained a master’s degree related to the field of teaching and who have professional experience and continue their engagement related to their professional background and experience.
  • Additional Faculty (A) are faculty who do not meet the expectations of the school as SA, PA, SP, or IP because the individual faculty member’s initial preparation and/or on-going engagement activities are not aligned with the school’s criteria.
In the first case (SA), they should have actual and relevancy research and activities linked to the same field of teaching. In the second case (PA), the teachers should be working in relevant professional positions also related to the field of teaching. The faculty classified as SA and PA must have a doctorate degree.
On the other hand, SP and IP have a master’s degree related to a teaching field and have significant professional experience at the same field they are teaching. The difference in this case is that SP sustain research associated to the area of their professional background and experience where they teach, and IP show relevancy and engagement through their professional experience related to their teaching field.
For more information on the above categories, please refer to the AACSB manual.
The standards provide guidance about the criteria the school should develop. The criteria applied to faculty is the following:
  • At least 60% of faculty should be participating. Faculty sufficiency related to teaching is measured through a teaching productivity metric (a particular institutional metric, e.g., contact-hours, course-hours, courses) and the overall should be at least 60% for the participating components.
  • Percentage of time devoted to mission for each faculty qualification group:
    Scholarly Academics ≥ 40%.
    Scholarly Academics + Practice Academics + Scholarly Practitioners ≥ 60%.
    Scholarly Academics + Practice Academics + Scholarly Practitioners + Instructional Practitioners ≥ 90%.
    Additional Faculty less than 10%.
    Normally, full-time professors spend 100% of their time devoted to the mission and an adequate and rational manner to assess the percentage of time devoted to the mission should be establish for part-time faculty [23].

2. Context of the Problem

The Business School is composed of seven departments. In a fall 2020 semester the school offered 345 courses in total for 7750 registered students. In the past, the 24% of the courses of the entire Business School corresponded to the academic department under study. This department can be considered one of the biggest in the business school. It offers 9 service courses to the other departments at school and also to other six bachelors degree of others schools.
Some years ago, the university started the process of achieving the AACSB accreditation, now the construction of the timetable has to consider the characteristics of the school and it has to fulfill the requirements of standard three of the AACSB. The current process is as follows:
1.
The dean’s office informs the academic department the number of students demanded by each course.
2.
The academic department defines the number of groups (sections) for the same course to be offered according to the maximum number of students per course allowed by the university.
3.
A first draft of the timetable is created manually, trying to satisfy the percentages of each category in the AACSB standard and other requirements.
4.
If the academic department notices a lower percentage than the required, then they have to recruit a professor of specific category.
5.
The academic department confirms the assignment with each professor and some changes could be made.
6.
Once the timetable is confirmed, it is sent to dean’s office where the assignment of classrooms is performed.
7.
Finally, the academic department proceeds to register the course timetable in the university’s system and to publish it on the official website.
In this case, student curricula consists of eight semesters and fifty courses that are divided into general education courses, basic/initial disciplinary education courses, and disciplinary courses. In a specific academic period there are students enrolled in each of the level (from first to eighth semesters), so it is needed to program all the courses by period but just the disciplinary courses are in charge of the academic department.
The requirements of the administration are:
  • There are two schemes of time slots for the academic department courses: scheme A) three sessions of one hour on Monday, Wednesday and Friday and, scheme B) two sessions of one hour and thirty minutes for Tuesday and Thursday.
  • The first class of the day starts at 7:00 a.m. and the last one starts at 7:00 p.m.
  • The courses that belong to the same semester in the curricula are assigned in different time slots.
  • Semester courses from 1st to 4th are assigned to start in the morning (07:00 to 14:00 h.), and from the 5th to 8th in the afternoon (13:00 to 20:00 h, and 7:00 a.m.). Some courses will need to be scheduled at additional times due to their high demand.
  • The course assignment for a professor is made by considering her/his knowledge area.
  • The number of courses to be assigned to full-time professors is well known and it depends of her/his profile (researcher or manager position).
  • Further, overload is allowed, when a course is assigned to a professor additionally to her/his official basic workload (authorized by the university).
  • It is not desirable to assign more than two courses to part-time professors.
  • When the total of courses to be scheduled exceeds the actual capacity (using course load and overload), then new hires should be considered.

3. Mathematical Formulation

When a department belongs to a school which wants to be accredited by high standards such as AACSB, and plays a fundamental role scheduling a large number of courses, it requires having mechanisms that facilitate decision-making to assign courses to the right teachers. Therefore, the mathematical formulations offer opportunities not only for assigning a large number of sections, but also for accomplishing the requirements of faculty qualifications.
The mathematical model proposed allows to determine the assignation of course-section-professor-time slot using the actual capacity. In case, it is not possible to schedule all courses, the remaining courses will be assigned to one faculty member category based on AACSB faculty qualifications policies and then the new hires can be established. Also the concept of course overload is contemplated.
Sets
CSet of courses, index i C .
PSet of professors, index j P .
P f u l l t i m e Set of full-time professors, index j P f u l l t i m e , P f u l l t i m e P .
P p a r t t i m e Set of part-time professors, index j P p a r t t i m e , P p a r t t i m e P .
TSet of semesters, index t T .
BSet of time slots, index k B .
B t Subset of time slots that are allowed to schedule courses belonging the semester t T .
C j Set of courses that the professor j can teach according with her/his knowledge area, C j C .
S i Set of sections needed to be schedule for the course i.
H 1 Set of faculty qualification categories, index p H 1 = { S A , P A , S P , I P , A } .
H 2 Set of categories for faculty composition based on the level of professors involvement, index q H 2 = { participating , supporting } .
H 3 Set of profiles of new hires based on the minimum academic profiles needed in order to allocate all the courses, index r H 3 .
C H r Set of courses that can be taught by a professor with academic profile r H 3 .
P Set of professors with faculty composition category: participating.
Parameters
h i Semester to which the course i belongs.
m j m a x Maximum number of courses to be assigned to professor j.
m j m i n Minimum number of courses to be assigned to professor j.
c j m a x Maximum number of course overload allowed for professor j.
α j Qualification of the professor j, α j H 1 .
uPercentage of faculty time spent dedicated to the mission per course for supporting faculty.
vPercentage of faculty time spent dedicated to the mission per participating faculty (in some cases it could be naturally 100%).
The decision variables in our model are denoted as follows:
x i j k l = 1 i f , t h e c o u r s e i i s a s s i g n e d t o p r o f e s s o r j i n t i m e s l o t k i n s e c t i o n l 0 otherwise .
σ j = Number of courses assigned to professor j without exceeding the number of courses allowed according to her/his academic profile.
σ j + = Number of additional courses assigned to full-time professors as course overload.
w i = Quantity of sections of the course i without assignation of schedule and professor.
y p q r = Quantity of course sections that weren’t programmed due to the lack of enough teacher staff, also to be programmed for new candidate professors with faculty qualification category p H 1 and with faculty composition category based on the level involvement q H 2 and an academic profile r H 3 .
z p q r = Auxiliary variables denoting the quantity of minimum candidates to professors to be hired with faculty qualification category p H 1 , with faculty composition category based on the level involvement q H 2 and an academic profile r H 3 .
The variables y p q r individually help to know how many courses without schedule require a specific professor profile (new hire) to maintain the adequate levels of the AACSB standards.
The objective function has to be established in accordance with the institution’s strategy, in this paper three possible objectives are stated. Naturally, it is desirable to minimize the total of courses without schedule (that need to be assigned to new hires) (Equation (1)).
m i n i m i z e p H 1 q H 2 r H 3 y p q r
Other objective function based on a policy is to minimize the aggregation of courses without schedule and the course overload of professors, this is described in expression (2).
m i n i m i z e p H 1 q H 2 r H 3 y p q r + j P σ j +
Further, in expression (3) the total number of new hires is minimized since the objective in expression (1) does not differentiate courses that can be assigned to different academic profiles. The value of z p q r is estimated in (20).
m i n i m i z e p H 1 q H 2 r H 3 z p q r
Since all sections should be assigned whenever possible, the group of constraints (4) guarantees that all course sections will be scheduled only if there is enough capacity (i.e., w i = 0 ), otherwise, the variable w i will take a value greater than zero ( w i > 0 ).
j P k B l S i X i j k l + w i = S i i C
where S i denotes the cardinality of the set S i .
The constraint group (5) states that each course section should be assigned just once.
j P k B X i j k l 1 i C , l S i
Course sections without a schedule and teacher assignment will result in new teacher hires with an AACSB faculty qualification category p H 1 , a category of faculty composition based on the level of involvement q H 2 and with an academic profile r H 3 . In constraint group (6) it is stated that the number of course sections without schedule that can be assigned to a candidate professor with an academic profile r H 3 should be equal to the number of courses assigned to new professors with a profile in each set of categories ( H 1 and H 2 ). It allows to balance and to relate course sections with faculty profiles.
p H 1 q H 2 y p q r = i C H r w i r H 3
All professors have a maximum and a minimum number of course sections to be assigned, this is restricted by (7) and (8). Commonly, for full-time professors this quantity represents the mandatory number of courses to be assigned, in that case m j m a x = m j m i n .
σ j m j m a x j P
σ j m j m i n j P
This model contemplates the concept of restricted course overload in order to consider to teach more than the maximum courses allowed for each professor. The number of assigned course sections of each professor is equal to the sum of the course load plus the course overload assigned, as it is shown in the group of constraints (9).
i C k B l S i x i j k l = σ j + σ j + j P
When the course overload does not apply for all professors or for part-time professors, it can be easily restricted. The constraint group (10) states the maximum number for professor j course overload.
σ j + c j m a x j P
Regarding the schedule, in (11) it is stated that all courses that belong to a same semester must be assigned to different time slots.
i { C | h i = t } j P l S i X i j k l 1 t T , k B
As it was mention in the previous section, the courses belonging to semester t should be scheduled just in the allowed time slots (the subset B t ), as it is shown in constraint group (12).
j P k B t X i j k l 0 t T , i { C | h i = t } , l S i
The constraint group (13) ensures that all professors will be assigned their courses in different time slots. It means that, there will not be any overlap in the schedule of professors.
i C l S i X i j k l 1 j P , k B
The courses assigned to the professors will be according to their credentials (14). Previously, a list of courses that a professor can teach according to her/his expertise area was created.
X i j k l 0 j P , i C j , l S i , k B
In some cases, full-time professors need to have a free day scheme in the afternoon allowing to teach at graduate programs as expressed in constraints (15)–(19). The set of time slots in conflict is B B for days scheme A, and B B for days scheme B. The auxiliary binary variables A j and B j denote if a professor j is free in the time slots to teach at the graduate program in the scheme A and scheme B, respectively.
A j + B j 1 j P f u l l t i m e
A j · σ j i C l S i k B X i j k l j P f u l l t i m e
A j i C l S i k B X i j k l j P f u l l t i m e
B j · σ i i C l S i k B X i j k l j P f u l l t i m e
B j i C l S i k B X i j k l j P f u l l t i m e
In (20) the number of professors needed for profile is calculated.
z p q r y p q r M , p H 1 , q H 2 , r H 3
where M denotes the maximum course load for a new professor.
To establish the criteria and policies for faculty based on AACSB standards the constraints (21)–(25) were incorporated.
Based on the metric selected (number of courses), we restricted that 60% of courses have to be imparted by participating faculty, as it is shown in constraint (21).
j P σ j + σ j + + p H 1 r H 3 y p q r 0.60 i C S i , q = participating
The total time dedicated to mission for each AACSB faculty qualification category is calculated in (22). The constraints are defined with q 1 = p a r t i c i p a t i n g , q 2 = s u p p o r t i n g a n d , p H 1 .
d e d p = u j P P α j = p ( σ j + σ j + ) + r H 3 y p q 2 r + v | P | + r H 3 z p q 1 r
Then, the time dedication to the mission of all faculty and courses with a hiring profile is restricted in (23)–(25). Different metrics can be applied according to the best structure for the institution. Here, the percentage of total time spend dedicated to the mission differentiating the percentage of participating faculty and supporting faculty is calculated.
d e d S A 0.4 p H 1 d e d p
d e d S A + d e d P A + d e d S P 0.6 p H 1 d e d p
d e d S A + d e d P A + d e d S P + d e d I P 0.9 p H 1 d e d p
Further, additional constraints to limit the number of new hires can be added for some determined profile. In constraint group (26) the latter condition is added.
z p q r a p q r
where a p q r are the maximum number of hires allowed by faculty qualification category p, with faculty composition category based on the level involvement q H 2 and an academic profile r H 3 .
Finally, the no-negativity constraints are included for the integer variables.
w i 0 i C
y p q r , z p q r 0 p H 1 , q H 2 , r H 3
σ j , σ j + 0 j P

Remarks of the Mathematical Formulation

Here some main remarks about the mathematical formulation are exposed:
  • In the proposed mathematical model the variables that allow to define the timetabling are x i j k l , while w i are the number of sections by course i that could not be programmed with the current faculty. In the Equation (4) is established the relation between these variables.
  • Since in the objective functions the y p q r variables are minimized directly or indirectly and the sum of all y p q r and the sum of all w i variables are equal, then the w i variables are also minimized in an indirectly form.
  • The variables y p q r and z p q r are related in the mathematical model in constraints (20), which allow to determine the number of new hires given the number of courses without schedule for all p H 1 , q H 2 and r H 3 categories.
  • The values of variables x i j k l impact in the assignations of the variables y p q r , since as was mentioned before, the variables x i j k l and w i are related, and the variables w i are related with y p q r , then, the variables x i j k l are related indirectly with the variables y p q r .
  • Regarding the latter, the constraints of balancing (21)–(25) are used to ensure compliance with the standard three of AACSB while defining the values for variables y p q r .
  • The variables x i j k l and z p q r are related through the relation stablished before about the pairs of variables ( x i j k l , w i ) ( w i , y p q r ) and ( y p q r , z p q r ).

4. Case Information

In this section the main information of the case studied corresponding to the fall 2020 academic period is described.
As it is stated in Table 1, in the academic period fall 2020, the academic department was constituted by 28 teachers (17 full-time professors and 11 part-time professors) with different profiles and preferences of courses according to their qualifications. They are classified as six supporting professors and 22 participating, according to the category (explained in the Section 1) the same 28 teachers can be classified as: 12 IP, 12 SA, 2 PA, 1 SP and 1 is classified as A (categories explained in Section 1).
There were 28 courses, each one with a specific number of sections (or groups), in total 82 sections to be scheduled. The course load and the list of possible courses to assign for each professor, are presented in Table 1. To get the solution, the course overload for part-time professors was considered as zero, since this concept is applicable just for full-time faculty.
The courses are distributed in the follow way:
  • Semester 1: 16 and 19.
  • Semester 2: 7 and 9.
  • Semester 3: 12 and 13.
  • Semester 4: 6, 8, 10 and 25.
  • Semester 5: 11, 14 and 18.
  • Semester 6: 2, 5, 17 and 20.
  • Semester 7: 1, 4, 15, 21 and 26.
  • Semester 8: 3, 22, 23, 24, 27 and 28.
Regarding new hires, based on the conditions established by the institution, it is possible to define limits on new hires, according to the categories and profiles established. For this, the constraint group (26) are established with the following limits: zero new hires with profile SA-supporting and for PA-supporting categories, also, zero new hires with profile SP-supporting, IP-supporting and A-supporting. The latter applies for all academic profiles ( r H 3 ).
The academic profiles are defined through the clusters of courses:
  • Academic profile 1: courses 10, 11, 12, 15, 20, 26, 27,
  • Academic profile 2: courses 1, 2, 18, 24,
  • Academic profile 3: courses 7, 8, 9, 13, 17, 23,
  • Academic profile 4: courses 3, 14, 25, 26, 27,
  • Academic profile 5: courses 16, 4, 5, 6, 19, 21, 22, 28.
In this way we assume a determined professor can be related with courses in one specific academic profile by her/his knowledge area.
To calculate the percentage of time dedication to the mission, course-hours for supporting professors (i.e., 7.5% of the time per course) were applied. And, the sum of time dedication to mission is 100% for all participating professors. Finally, since a new hire will be classified as either supporting or participating, for practical purposes we consider a new hire with a participating profile to be full-time and part-time for a supporting profile.

5. Results

In this section the results obtained for the UCTP based on the AACSB policies are presented.
Four strategies were applied to analyze the effects of combining new hiring profiles and course overload for professors through the minimization criteria, whether or not course overload was allowed. The four strategies are:
1.
to minimize courses without schedule allowing course overload (base case). This formulation is composed of objective function (1), and constraints (4)–(29).
2.
to minimize courses without schedule and zero teaching overload. This formulation is composed of objective function (1), and constraints (4)–(29). To avoid the course overload, in constraint (10), the parameter c j m a x is equal zero for all j P .
3.
to minimize courses without schedule and teaching overload. This formulation is composed of objective function (2), and constraints (4)–(29).
4.
to minimize hiring profiles (professors). This formulation is composed of objective function (3), and constraints (4)–(29). In this case, course overload is allowed.
The four strategies were solved through the proposed integer programming model implemented with ILOG CPLEX Optimization Studio version 12.8 on a computer with an Intel i7 at 2.5 GHz and 8 Gb of RAM. The solution algorithm used was the classic Branch and bound method. The execution time of the solutions was less than a second (0.58 s. in average) and in all cases the optimality was obtained with a zero value for the solution gap. To access the output of the solver CPLEX of the first strategy, see the Section Data Availability Statement.

5.1. Minimizing the Courses without Schedule Allowing Course Overload, the Base Case

The timetable for the case studied is shown in Figure 1 and Figure 2. First, in Figure 1 we show the assigned courses to each time slot in day scheme A: Monday, Wednesday and Friday (i.e three classes of 1 h per week). The color indicates the semester to which the course belongs. We named each assignation as C#S#P#, where the number contiguous to C is the course ID, then, the number next to the S is the number of section of that course, and finally, the number after P is the professor’s ID. As an example, the blue cell in time 07:00-08:00 (C19S1P27) implies that Section 1 of the course with ID19 from the first semester is assigned to professor ID P27 at that time. Naturally, Table 1 with the professors’ information shows that professor ID P27 can teach course ID19.
Figure 2 shows the assigned courses in day scheme B: Tuesday and Thursday classes (i.e., two classes of 1 h and 30 m per week). The same name structure for course assignation was applied.
The timetable obtained has 75 course sections scheduled (40 in Figure 1 and 35 in Figure 2) from the total of 82 needed course sections. Sixty four courses are assigned with basic faculty workload and 11 are overload assigned to full-time professors. The remaining seven non-scheduled course sections have an assigned hiring profile. The corresponding sections are: one section from course ID3, three sections from course ID4, two sections from course ID23, one section of the course ID24.
Figure 3 shows the proportions of the courses scheduled (with basic workload and with course overload) and courses with hiring profiles. It is important to note, that the contemplated assigned professors correspond to the list of active professors in the immediate preceding period, but when the courses’ demand increases, it will be necessary to contemplate hiring profiles. In these cases, the solution implies seven non-scheduled courses with hiring profiles.
As it was mentioned before, five academic profiles to new hires are defined, based on the composition of the program curricula and the creation of clusters of courses. This allows to identify the exact number of new hires needed. In this case, four professors are needed (one SA-participating, one PA-participating, two SP-supporting) each one belonging to a different academic profile. These new hires are the minimum hires to allocate the seven non-scheduled courses.
Beyond the fact that the optimal solution is obtained, it is possible to show the fulfillment of the constraints by observing the information in Figure 1 and Figure 2. The timetabling states that 75 sections were scheduled and assigned a professor and seven sections were not scheduled but have an assigned hiring profile, giving a total of 82 sections (the grand total of sections). Here, constraint (4) is accomplished. Additionally, can be seen how each section for each course is assigned just once (constraint (5)). Constraints (7)–(10) are about the maximum numbers of courses, the course overload and the maximum overload allowed for each professor, for this, the figures (Figure 1 and Figure 2) exhibit how this load is accomplished according to the information presented in Table 1.
Also in Figure 1 and Figure 2, it is seen how the courses of same semester (same color) are assigned in different time (constraint (11)), the courses from first semester to forth semester are scheduled from 7 hrs. to 14 hrs. and the courses from fifth semester to eighth semester are scheduled to 13 hrs. to 20 hrs. or 7 hrs., however, there are some exceptions due to high demand (constraint (12)). As well as, it is possible to observe how the schedule of professors is at different times (constraint (13)) and the courses assigned to them are according to their credentials (constraint (14)). In addition, the timetable includes the consideration that some professors need to have a free afternoon (restriction (15)–(19)) in order to be able to teach graduate courses.
The total courses assigned to participating faculty already hired by the university (55 sections), plus the courses not scheduled but assigned to a profile (seven sections) must be greater than or equal to 60% of the total Sections (50 sections). Here constraint (21) is accomplished. For constraints related to accomplish of percentages per category (23)–(25), the results can be reviewed in Section 5.5.
To access the complete output, please refer to the data availability statement in the section.

5.2. Minimizing Courses without Schedule and Zero Teaching Overload

In the Figure 4 and Figure 5 the timetables for the two schemes of days are presented for the application of second strategy. As is shown, when the problem presented before is solved minimizing the courses without schedule and zero teaching overload, the model can assign 69 sections with the number of available professors. The 13 remaining courses are: two sections of course ID3, four sections of course ID4, one section of course ID6, one section of course ID15, one section of the course ID20, two sections of course ID 21, and two section of the course ID24. In contrast with the first strategy, this one requires new hires to assign seven different courses, and, if the courses are not from common knowledge areas or require the same academic profile, then it will result in more hires. For this strategy, these courses are linked to academic profiles resulting in a number of six teachers needed. The distribution of this new hires, are: one PA-participating (full-time) profile and five SP-supporting (part-time) professors. The number of five SP-supporting professors needed is calculated based on the number of different courses without schedule and on the maximum load to be assigned to a full-time professor or part-time professor.

5.3. Minimizing Courses without Schedule and Teaching Overload

In the Figure 6 and Figure 7 the timetables for the two schemes of days are presented for the application of the third strategy. If the problem is solved considering the minimization of courses without schedule and teaching overload, the model assigns 71 sections with the number of available professors and suggests to hire five professors to teach eleven courses and only two professors will have one extra course as teaching overload. The courses to be assigned to new hires are: three sections of course ID3, three sections of course ID4, one section of course ID6, one section of course ID18, two sections of course ID 21, and one section of the course ID28. With the first strategy, seven sections of four different courses implied four new hires, while in the second strategy, thirteen sections implied five new hires, and with the application of the third strategy, eleven sections of seven different courses resulted in five new hires. This shows that to the extent that unscheduled courses are more and different, this results in a greater need for new hires.

5.4. Minimizing Hiring Profiles (Professors)

In Figure 8 and Figure 9 the timetables for the two schemes of days are presented for the application of the fourth strategy. When we solve the problem considering the minimization of hiring professors Equation (3), the model can assign 75 sections with the number of available professors and suggests to hire three professors to teach seven courses and eight professors will have teaching overload. The courses to be assigned to new hires are: three sections of the course ID3, three sections of the course ID9, and one section of the course ID24. Compared to the previous strategies, this one consists of assigning sections to new hires from only three different courses. This can result in similar academic profiles.

5.5. General Analysis

In the following, it is explained the behavior of each strategy in relation to the dedication of time of faculty to the mission (AACSB), also the impact of the objective function in the strategies regarding to new hires.
Table 2 presents the percentages of time dedication to the business school mission for each faculty qualification categories based on the AACSB standards. The obtained percentages are calculated for the four strategies established, strategy 1: to minimize the courses without schedule allowing course overload (base case); strategy 2: to minimize the courses without schedule and zero teaching overload; strategy 3: to minimize the courses without schedule and teaching overload; and, strategy 4: to minimize hiring profiles (professors). The percentage of dedication is obtained from the actual faculty and the new hires obtained from the application of the strategies.
In general, the percentage of time dedication to the mission for SA faculty states over 40% and the largest value (65%) was obtained with the strategy 4. Strategy 2 results in the lowest percentage (57%) for SA faculty. The actual faculty in this case has a greater number of faculty in SA and SP categories, this is why the lowest values in all faculty qualification categories are for the PA, SP and A categories in all the strategies.
Table 3 shows the distribution of new hires that are needed when one of the four proposed strategies is implemented. The first strategy minimizing the courses without schedule allowing course overload needs to hire one professor of SA profile, one professor of PA profile and two professors of SP profile, while the second strategy minimizing courses without schedule and zero teaching overload requires one professor PA and five professors of SP profile. The third strategy minimizing courses without schedule and teaching overload needs five professors of SP profile and strategy four, minimizing hiring profiles (professors) needs one professor of SA profile, one professor of SP profile and one professor of IP profile.
As it is seen, the first strategy suggests hiring four professors, less professors than strategy two or strategy three, due to the objective function that minimizes the courses without schedule and allows teaching overload, so with this objective, the model will try to assign more courses to current faculty and hire less professors. On the other hand, strategy two, requires six professors; in this second strategy, the objective function tries to minimize the courses without schedule, but here, the teaching overload is not allowed. This is why; this model suggests hiring more professors than any other strategy, because the teaching overload is not allowed, so the model assigns only the workload allowed to all faculty and suggests hiring more professors in order to cover the courses. In the third strategy, the model suggests hiring five professors; here, the model tries to minimize the aggregation of courses without schedule and teaching overload, it is important to notice than in this strategy all new hires are part-time (SP) given the conditions stated in Section 4. Strategy 4, suggests hiring less professors than any other strategy, due to, the model tries to minimize the hiring profiles, so, the timetable is created leaving the courses of the same profiles without schedule in order to hire less professors. The higher number of hire professors in all strategies is presented in the category SP.

6. Conclusions

This paper proposes an integer programming model to create the timetable of an academic department considering basic workload and course overload, as well as the profile and area of knowledge of each professor. The novelty in this paper is the incorporation of necessary requirements to fulfill the standards of AACSB, the most important accrediting association for business schools. It is well known that an accreditation as AACSB demands qualified faculty in each category and it is preponderant for business schools to have tools like the proposed here to support the decision making process.
The model was solved with data from a real case utilizing four different strategies that show the impact of allowing course overload and new hires. In all cases, the requirements of AACSB were met. This model will be useful to help the administration to select the best option that aligns with the objectives of the university. In this particular case, it was identified that the fourth strategy (minimize hires) is one of the best options given that it reduces the cost of new hires. This is why the course overload is a valuable resource that contributes to the last mentioned objective.
It is also common for universities that apply course overload to have a policy that establishes the maximum overload to be assigned to professors according to their hiring (the course overload implies an additional payment to a full-time professor). Therefore, it is important to explore the strategies and policies of an institution that impact the course timetabling and professor assignment.
In order to replicate this model, we suggest to classify the professors into full-time and part-time and according to the qualification categories (SA, PA, SP, IP, A), and participating or supporting (required by AACSB); to collect all the information related to the professors as the number of courses allowed to teach, as well as the courses they can teach according to their expertise. One important and necessary element is to define the time slots where the courses can take place.
The number of courses that can not be scheduled will require new hires, but identifying how many new hires are needed is important to know the knowledge area of the courses to create some categories of hiring profiles. For example, the courses about decision making methods, the courses about strategy and others. We divided the total set of disciplinary courses into disjoint sets to define these new hire profiles. In this sense, the current faculty can provide a first way to define the hire profiles with the courses that they teach as a reference.
Finally, it is important to know the strategy that the university wants to follow in order to use an appropriate objective function or criteria.
As future work, it is contemplated to add the preferences of time slots for faculty and additional necessities (course language, balancing the number of courses scheduled in the same time slot, room assignment, etc.). Further, the budget for new hires could be considered in order to not exceed the academic department budget.

Author Contributions

Conceptualization, N.M.A.-M., P.A.A.-T. and J.C.T.-R.; methodology, N.M.A.-M. and P.A.A.-T.; software, N.M.A.-M. and P.A.A.-T.; validation, N.M.A.-M. and P.A.A.-T.; formal analysis, N.M.A.-M., P.A.A.-T. and J.C.T.-R.; investigation, N.M.A.-M., P.A.A.-T. and J.C.T.-R.; resources, Not applicable; data curation, N.M.A.-M., P.A.A.-T. and J.C.T.-R.; writing—original draft preparation, N.M.A.-M. and P.A.A.-T.; writing—review and editing, N.M.A.-M., P.A.A.-T. and J.C.T.-R.; visualization, N.M.A.-M., P.A.A.-T. and J.C.T.-R.; supervision, N.M.A.-M., P.A.A.-T. and J.C.T.-R.; project administration, N.M.A.-M., P.A.A.-T. and J.C.T.-R. All authors have read and agreed to the published version of the manuscript.

Funding

The APC was funded by the institution of affiliation of the authors.

Data Availability Statement

The data corresponding fall 2020 academic period utilized in this research is reposited in Github (https://github.com/NanAMTZ/UCTP-fall2020, accessed on 20 August 2021).

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
AACSBAssociation to Advance Collegiate Schools of Business
UCTPUniversity Course Timetabling Problem
AQAcademic Qualified
PParticipating Faculty
SSupporting Faculty
SAScholarly Academic Faculty
PAPractice Academic Faculty
SPScholarly Practitioner Faculty
IPInstructional Practitioner Faculty
AAdditional Faculty

References

  1. Song, T.; Liu, S.; Tang, X.; Peng, X.; Chen, M. An iterated local search algorithm for the University Course Timetabling Problem. Appl. Soft Comput. 2018, 68, 597–608. [Google Scholar] [CrossRef]
  2. MirHassani, S. A computational approach to enhancing course timetabling with integer programming. Appl. Math. Comput. 2006, 175, 814–822. [Google Scholar] [CrossRef]
  3. Munirah Mazlan, M.M.; Khairi, A.F.K.A.; Mohamed, M.A.; Rahman, M.N.A. A study on optimization methods for solving course timetabling problem in university. Int. J. Eng. Technol. 2018, 7, 196–200. [Google Scholar] [CrossRef]
  4. Gabriel, D.F.; Pangilinan, J.M.A. Faculty course scheduling optimization. Am. Sci. Res. J. Eng. Technol. Sci. 2018, 44, 170–179. [Google Scholar]
  5. Perzina, R.; Ramik, J. Self-learning genetic algorithm for a timetabling problem with fuzzy constraints. Int. J. Innov. Comput. Inf. Control 2013, 9, 4565–4582. [Google Scholar]
  6. Soria-Alcaraz, J.A.; Özcan, E.; Swan, J.; Kendall, G.; Carpio, M. Iterated local search using an add and delete hyper-heuristic for university course timetabling. Appl. Soft Comput. 2016, 40, 581–593. [Google Scholar] [CrossRef] [Green Version]
  7. Junrie, B.; Matias, A.C.F.; Medina, R.M. A Fair Course Timetabling Using Genetic Algorithm with Guided Search Technique. 5th Int. Conf. Bus. Ind. Res. 2018, 1, 77–82. [Google Scholar] [CrossRef]
  8. Immonen, E.; Putkonen, A. A heuristic genetic algorithm for strategic university tuition planning and workload balancing. Int. J. Manag. Sci. Eng. Manag. 2018, 12, 118–128. [Google Scholar] [CrossRef]
  9. Tavakoli, M.M.; Shirouyehzad, H.; Lotfi, F.H.; Najafi, S.E. Proposing a novel heuristic algorithm for university course timetabling problem with the quality of courses rendered approach; a case study. Alex. Eng. J. 2020, 59, 3355–3367. [Google Scholar] [CrossRef]
  10. Ojha, D.; Sahoo, R.K.; Das, S. Automated timetable generation using bee colony optimization. Int. J. Appl. Inf. Syst. 2016, 10, 38–43. [Google Scholar] [CrossRef]
  11. Domenech, B.; Lusa, A. A MILP model for the teacher assigment problem considering teacher preferences. Eur. J. Oper. Res. 2016, 249, 1153–1160. [Google Scholar] [CrossRef]
  12. Al-Yakoob, S.M.; Sherali, H.D. Mathematical programming models and algorithms for a class faculty assignment problem. Eur. J. Oper. Res. 2006, 173, 488–507. [Google Scholar] [CrossRef]
  13. Chen, R.M.; Shih, H.F. Solving university course timetabling problems using constriction particle swarm optimization with local serach. Algorithms 2013, 6, 227–244. [Google Scholar] [CrossRef]
  14. Muhlenthaler, M.; Wanka, R. Fairness in academic course timetabling. Ann. Oper. Res. 2016, 239, 171–188. [Google Scholar] [CrossRef] [Green Version]
  15. Jess Boronico, J.M.; Kong, X. Faculty Sufficiency and AACSB accreditation compliance within a global university: A mathematical modeling approach. Am. J. Bus. Educ. 2014, 7, 213–218. [Google Scholar] [CrossRef] [Green Version]
  16. Henninger, E.A. Perceptions of the impact of the new AACSB standards on faculty qualifications. J. Organ. Chang. Manag. 1998, 11, 407–424. [Google Scholar] [CrossRef]
  17. Prasad, A.; Segarra, P.; Villanueva, C.E. Acadeic life under institutional pressures for AACSB accreditation: Insights from faculty members in Mexican business schools. Stud. High. Educ. 2019, 44, 1605–1618. [Google Scholar] [CrossRef]
  18. Bajada, C.; Trayler, R. Interdisciplinary business education: Curriculum through collaboration. Educ. Train. 2013, 55, 385–402. [Google Scholar] [CrossRef]
  19. Koys, D.J. Judging academic qualifications, professional qualifications, and participation of faculty using AACSB guidelines. J. Educ. Bus. 2008, 83, 207–213. [Google Scholar] [CrossRef]
  20. Fitzpatric, L.E.; McConnell, C. Aligning economics programs with AACSB accreditation process. J. Econ. Educ. Res. 2014, 15, 67–80. [Google Scholar]
  21. Deborah, M.; Gray, V.B.; Carson, M.; Chakraborty, D. Anatomy of an MBA program capstine project assessment measure for AACSB accreditation. Int. J. Bus. Adm. 2015, 6, 1–7. [Google Scholar]
  22. AACSB. 2020 Guiding Principles and Standards for Business Accreditation; AACSB: Tampa, FL, USA, 2020; pp. 1–55. [Google Scholar]
  23. AACSB. 2013 Eligibility Procedures and Accreditation Standards for Business Accreditation; AACSB: Tampa, FL, USA, 2018; pp. 1–55. [Google Scholar]
Figure 1. Timetable for courses in day scheme A: Monday, Wednesday and Friday, three classes of 1 h per week.
Figure 1. Timetable for courses in day scheme A: Monday, Wednesday and Friday, three classes of 1 h per week.
Mathematics 09 02500 g001
Figure 2. Timetable for courses in day scheme B: Tuesday and Thursday, two classes of 1 h and a half per week.
Figure 2. Timetable for courses in day scheme B: Tuesday and Thursday, two classes of 1 h and a half per week.
Mathematics 09 02500 g002
Figure 3. Proportions of courses.
Figure 3. Proportions of courses.
Mathematics 09 02500 g003
Figure 4. Timetable of second strategy for courses in day scheme A: Monday, Wednesday and Friday, three classes of 1 h per week.
Figure 4. Timetable of second strategy for courses in day scheme A: Monday, Wednesday and Friday, three classes of 1 h per week.
Mathematics 09 02500 g004
Figure 5. Timetable of second strategy for courses in day scheme B: Tuesday and Thursday, two classes of 1 h and a half per week.
Figure 5. Timetable of second strategy for courses in day scheme B: Tuesday and Thursday, two classes of 1 h and a half per week.
Mathematics 09 02500 g005
Figure 6. Timetable of third strategy for courses in day scheme A: Monday, Wednesday and Friday, three classes of 1 h per week.
Figure 6. Timetable of third strategy for courses in day scheme A: Monday, Wednesday and Friday, three classes of 1 h per week.
Mathematics 09 02500 g006
Figure 7. Timetable of third strategy for courses in day scheme B: Tuesday and Thursday, two classes of 1 h and a half per week.
Figure 7. Timetable of third strategy for courses in day scheme B: Tuesday and Thursday, two classes of 1 h and a half per week.
Mathematics 09 02500 g007
Figure 8. Timetable of fourth strategy for courses in day scheme A: Monday, Wednesday and Friday, three classes of 1 h per week.
Figure 8. Timetable of fourth strategy for courses in day scheme A: Monday, Wednesday and Friday, three classes of 1 h per week.
Mathematics 09 02500 g008
Figure 9. Timetableof fourth strategy for courses in day scheme B: Tuesday and Thursday, two classes of 1 h and a half per week.
Figure 9. Timetableof fourth strategy for courses in day scheme B: Tuesday and Thursday, two classes of 1 h and a half per week.
Mathematics 09 02500 g009
Table 1. Information of professors.
Table 1. Information of professors.
Professor IDMax. CoursesCourses Professor IDMax. CoursesCourses
P1223 P15327, 15, 10, 11
P2324, 18, 2, 1 P16225
P3220, 8, 16 P17416, 17, 7
P438, 16 P1849, 16, 4, 6
P5125 P19416, 12
P6325, 14, 21, 11, 3, 10 P20218, 2, 1
P7225, 16 P2128,6
P8211, 15, 2, 10 P22228, 1, 2
P9213, 5, 16, 20 P23323, 12, 8, 7
P1023, 24 P24327, 1, 2
P11226, 24 P2529, 16
P12216 P26215
P13322, 17, 16 P27319, 16
P14225, 3, 10, 11 P28316
Table 2. Percentage dedication of time of faculty to the Mission by strategy.
Table 2. Percentage dedication of time of faculty to the Mission by strategy.
StrategySAPASPIPA
Strategy 162%6%6%21%5%
Strategy 257%6%9%23%5%
Strategy 361%2%9%23%5%
Strategy 465%1%5%24%5%
Table 3. Number of new hires needed by strategy.
Table 3. Number of new hires needed by strategy.
StrategySAPASPIPA
Strategy 111200
Strategy 201500
Strategy 300500
Strategy 410110
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Arratia-Martinez, N.M.; Avila-Torres, P.A.; Trujillo-Reyes, J.C. Solving a University Course Timetabling Problem Based on AACSB Policies. Mathematics 2021, 9, 2500. https://doi.org/10.3390/math9192500

AMA Style

Arratia-Martinez NM, Avila-Torres PA, Trujillo-Reyes JC. Solving a University Course Timetabling Problem Based on AACSB Policies. Mathematics. 2021; 9(19):2500. https://doi.org/10.3390/math9192500

Chicago/Turabian Style

Arratia-Martinez, Nancy M., Paulina A. Avila-Torres, and Juana C. Trujillo-Reyes. 2021. "Solving a University Course Timetabling Problem Based on AACSB Policies" Mathematics 9, no. 19: 2500. https://doi.org/10.3390/math9192500

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop