The analytic hierarchy process and multiobjective 0-1 faculty course assignment

Ozdemir M., Gasimov R.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, vol.157, no.2, pp.398-408, 2004 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 157 Issue: 2
  • Publication Date: 2004
  • Doi Number: 10.1016/s0377-2217(03)00189-9
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.398-408
  • Keywords: zero-one multiple objective programming, analytic hierarchy process, faculty-course assignment problem, lagrange multiplier rule, modified subgradient method, BENSON PROPER EFFICIENCY, NONCONVEX VECTOR OPTIMIZATION, TABU SEARCH, SET
  • Eskisehir Osmangazi University Affiliated: Yes


This paper gives a general model for the faculty course assignment problem that is a zero-one nonlinear multiobjective programming problem. Because of the nonconvexity of the problem, simple weighting scalarization does not guarantee finding all Pareto-optimal solutions. Therefore, a newly developed three step process consisting of the Analytic Hierarchy Process, scalarization and the subgradient method is provided to deal with the problem. This approach is used to solve a nonconvex multiobjective faculty course assignment problem for the first time. A real life application is included. (C) 2003 Elsevier B.V. All rights reserved.