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

被引:31
|
作者
Ozdemir, MS [1 ]
Gasimov, RN [1 ]
机构
[1] Osmangazi Univ, Dept Ind Engn, TR-26030 Bademlik, Eskisehir, Turkey
关键词
zero-one multiple objective programming; analytic hierarchy process; faculty-course assignment problem; lagrange multiplier rule; modified subgradient method;
D O I
10.1016/s0377-2217(03)00189-9
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:398 / 408
页数:11
相关论文
共 50 条
  • [1] Multiobjective prioritization in the analytic hierarchy process by evolutionary computing
    Mikhailov, Ludmil
    APPLICATIONS OF SOFT COMPUTING: RECENT TRENDS, 2006, : 321 - 330
  • [2] A multiobjective faculty-course-time slot assignment problem with preferences
    Ismayilova, Nergiz A.
    Sagir, Mujgan
    Gasimov, Rafail N.
    MATHEMATICAL AND COMPUTER MODELLING, 2007, 46 (7-8) : 1017 - 1029
  • [3] A capital budgeting problem for preventing workplace mobbing by using analytic hierarchy process and fuzzy 0-1 bidimensional knapsack model
    Bas, Esra
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (10) : 12415 - 12422
  • [4] AN OBJECTIVE APPROACH TO FACULTY PROMOTION AND TENURE BY THE ANALYTIC HIERARCHY PROCESS
    SAATY, TL
    RAMANUJAM, V
    RESEARCH IN HIGHER EDUCATION, 1983, 18 (03) : 311 - 331
  • [5] Course Evaluation Method Based on Analytic Hierarchy Process
    Zhao, Chunna
    Zhao, Yu
    Tan, Xiaohui
    Li, Yingshun
    Luo, Liming
    Xiong, Yeqing
    2010 INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT (CCCM2010), VOL II, 2010, : 318 - 321
  • [6] Facets of an assignment problem with 0-1 side constraint
    Alfakih, AY
    Yi, TY
    Murty, KG
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2000, 4 (03) : 365 - 388
  • [7] Evolutionary and heuristic algorithms for multiobjective 0-1 knapsack problem
    Kumar, Rajeev
    Singh, R. K.
    Singhal, A. P.
    Bhartia, Atul
    APPLICATIONS OF SOFT COMPUTING: RECENT TRENDS, 2006, : 331 - +
  • [8] Enhancing Branch-and-Bound for Multiobjective 0-1 Programming
    Forget, Nicolas
    Parragh, Sophie N.
    INFORMS JOURNAL ON COMPUTING, 2024, 36 (01) : 285 - 304
  • [9] Analysis of a Multiobjective Evolutionary Algorithm on the 0-1 knapsack problem
    Kumar, Rajeev
    Banerjee, Nilanjan
    THEORETICAL COMPUTER SCIENCE, 2006, 358 (01) : 104 - 120
  • [10] Analytical hierarchy process and use of 0-1 goal programming methods in selecting supplier firm
    Daǧdeviren, Metin
    Eren, Tamer
    Journal of the Faculty of Engineering and Architecture of Gazi University, 2001, 16 (1-2): : 41 - 52