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

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.

[1]  Rafail N. Gasimov,et al.  The analytic hierarchy process and multiobjective 0-1 faculty course assignment , 2004, Eur. J. Oper. Res..

[2]  D. Costa,et al.  A tabu search algorithm for computing an operational timetable , 1994 .

[3]  R. N. Gasimov.  Characterization of the Benson proper efficiency and scalarization in nonconvex vector optimization , 2001 .

[4]  Efthymios Housos,et al.  An integer programming formulation for a case study in university timetabling , 2004, Eur. J. Oper. Res..

[5]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[6]  D. de Werra,et al.  An introduction to timetabling , 1985 .

[7]  Stefan D. Bloomfield,et al.  Preferential Course Scheduling , 1979 .

[8]  Yacov Y. Haimes,et al.  Multiobjective Decision Making: Theory and Methodology , 1983 .

[9]  Kathryn A. Dowsland,et al.  Off-the-Peg or Made-to-Measure? Timetabling and Scheduling with SA and TS , 1997, PATAT.

[10]  Masood A. Badri,et al.  A two-stage multiobjective scheduling model for [faculty-course-time] assignments , 1996 .

[11]  Alexander M. Rubinov,et al.  Scalarization and Nonlinear Scalar Duality for Vector Optimization with Preferences that are not necessarily a Pre-order Relation , 2004, J. Glob. Optim..

[12]  Thomas L. Saaty,et al.  Theory and Applications of the Analytic Network Process: Decision Making With Benefits, Opportunities, Costs, and Risks , 2005 .

[13]  Agostinho C. Rosa,et al.  Solving the Timetabling Problem with Simulated Annealing , 1999, ICEIS.

[14]  C. Tammer,et al.  Theory of Vector Optimization , 2003 .

[15]  Sophia Daskalaki,et al.  Efficient solutions for a university timetabling problem through integer programming , 2005, Eur. J. Oper. Res..

[16]  Victor A. Bardadym.  Computer-Aided School and University Timetabling: The New Wave , 1995, PATAT.

[17]  Alain Hertz,et al.  Constructing a course schedule by solving a series of assignment type problems , 1998, Eur. J. Oper. Res..

[18]  Jeffrey H. Kingston,et al.  The Complexity of Timetable Construction Problems , 1995, PATAT.

[19]  R. Weiner.  Lecture Notes in Economics and Mathematical Systems , 1985 .

[20]  E. Polak,et al.  On Multicriteria Optimization , 1976 .

[21]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[22]  T. Saaty.  Fundamentals of Decision Making and Priority Theory With the Analytic Hierarchy Process , 2000 .

[23]  Dominique de Werra,et al.  A generalized class-teacher model for some timetabling problems , 2002, Eur. J. Oper. Res..