2021
DOI: 10.1109/access.2021.3103495
|View full text |Cite
|
Sign up to set email alerts
|

A Mathematical Model for Course Timetabling Problem With Faculty-Course Assignment Constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(5 citation statements)
references
References 26 publications
0
5
0
Order By: Relevance
“…Constraints (7) force stuMove sdtqr to be 1 if student group s is at room q on slot t and at room r on slot t+1. Constraints (8) force stuNMove sqr to be the total number of times that any student group move from room q to room r.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Constraints (7) force stuMove sdtqr to be 1 if student group s is at room q on slot t and at room r on slot t+1. Constraints (8) force stuNMove sqr to be the total number of times that any student group move from room q to room r.…”
Section: Methodsmentioning
confidence: 99%
“…In different contexts such as university or military, a mixed-integer programming model can be adjusted to solve a timetabling problem with different constraints. Algethami and Laesanklang [8] proposed a multi-objective mixed-integer programming model for a university course timetabling problem. The model considered both events assignments and faculty satisfaction based on university requirements.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In this regard, the principles of proposing a new mathematical model are inspired by [10][11][12][13][14]. Based on modeling from the subject literature [15][16][17], the objective function of the model is divided into two parts. e first part is for professors, and the second part is for students.…”
Section: Methodsmentioning
confidence: 99%
“…Constraint of Students. Constraint (15) guarantees the noninterference of courses related to each group of students in each time period:…”
Section: Methodsmentioning
confidence: 99%
“…In the UCTP of Chávez-Bosquez et al [13], the purpose is to maximize Professors' preferences, and the paper applies a hybrid Tabu Search algorithm to solve the problem. Algethami and Laesanklang [14] propose a multiobjective model for UCTP of Taif University to maximize events assignments and faculty-members preferences satisfaction and minimize student learning days and unassigned events. e model has been solved within IBM ILOG CPLEX software.…”
Section: Literature Reviewmentioning
confidence: 99%