The analytic hierarchy process and multiobjective 0-1 faculty course assignment
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, cilt.157, sa.2, ss.398-408, 2004 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 157 Sayı: 2
- Basım Tarihi: 2004
- Doi Numarası: 10.1016/s0377-2217(03)00189-9
- Dergi Adı: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Sayfa Sayıları: ss.398-408
- Anahtar Kelimeler: 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
- Eskişehir Osmangazi Üniversitesi Adresli: Evet
Özet
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.