A multiobjective faculty-course-time slot assignment problem with preferences

Authors:
Nergiz A. Ismayilova;Mujgan SağIr;Rafail N. Gasimov
Affiliations:
Eskişehir Osmangazi University, Engineering and Architecture Faculty, Industrial Engineering Department, Bademlik 26030, Eskişehir, Turkey;Eskişehir Osmangazi University, Engineering and Architecture Faculty, Industrial Engineering Department, Bademlik 26030, Eskişehir, Turkey;Eskişehir Osmangazi University, Engineering and Architecture Faculty, Industrial Engineering Department, Bademlik 26030, Eskişehir, Turkey
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2007

Citing 5
Cited 5

Solving the timetabling problem with simulated annealing

Enterprise information systems
The Complexity of Timetable Construction Problems

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Off-the-Peg or Made-to-Measure? Timetabling and Scheduling with SA and TS

PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Scalarization and Nonlinear Scalar Duality for Vector Optimization with Preferences that are not necessarily a Pre-order Relation

Journal of Global Optimization
Multicriteria Optimization

Multicriteria Optimization

A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization

SIAM Journal on Optimization
A direct barter model for course add/drop process

Discrete Applied Mathematics
Computing efficient solutions of nonconvex multi-objective problems via scalarization

GAVTASC'11 Proceedings of the 11th WSEAS international conference on Signal processing, computational geometry and artificial vision, and Proceedings of the 11th WSEAS international conference on Systems theory and scientific computation
Solution approaches to the course timetabling problem

Artificial Intelligence Review
A conic scalarization method in multi-objective optimization

Journal of Global Optimization

Quantified Score

Hi-index	0.98

Visualization

Abstract

A faculty-course-time slot assignment problem is studied. The multiobjective 0-1 linear programming model considering both the administration's and instructors' preferences is developed and a demonstrative example is included. Both modeling and solving such problems are difficult tasks due to the size, the varied nature, and conflicting objectives of the problems. The difficulty increases because the individuals involved in the problem may have different preferences related to the instructors, courses, and time slots. The Analytic Hierarchy Process (AHP) and Analytic Network Process (ANP) are used to weigh different and conflicting objectives. These weights are used in different scalarization approaches. The scalarized problems are solved using a standard optimization package, and solutions corresponding to the AHP and ANP weights are compared.