AN ALGORITHM FOR THE COMMITTEE CONSTRUCTION PROBLEM

Date

1994-08-25

Author

CEYLAN, D
SAATCIOGLU, O
SEPIL, C

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

205
views

0
downloads

This paper presents an approach to the problem of committee construction for Associate Professorship promotions. In Turkey, the promotion to the 'Associate Professor' title is centrally organized by the Interuniversity Council. The Interuniversity Council assigns an evaluation committee to each applicant. Each applicant is then examined by the committee based on his/her publications and background. The problem is, how to form juries in order to maximize the match of background of the jury members and the candidates and to balance the number of assignments made to the professors. The method developed consists of techniques in solving multiple criteria problems, bottleneck assignment problems, and transportation problems. The criteria of the problem are ordered in a lexicographic manner and solution algorithms are developed for individual problems, depending on their respective structures. The overall method is coded to create a user-friendly software which assigns main and reserved members of the juries and determines the appropriate place for the meetings.

Subject Keywords

Management Science and Operations Research, Modelling and Simulation, Information Systems and Management

URI

https://hdl.handle.net/11511/66464

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

DOI

https://doi.org/10.1016/0377-2217(94)90028-0

Collections

Department of Business Administration, Article

Suggestions

OpenMETU
Core

A NEW HEURISTIC APPROACH FOR THE MULTIITEM DYNAMIC LOT-SIZING PROBLEM KIRCA, O; KOKTEN, M (Elsevier BV, 1994-06-09) In this paper a framework for a new heuristic approach for solving the single level multi-item capacitated dynamic lot sizing problem is presented. The approach uses an iterative item-by-item strategy for generating solutions to the problem. In each iteration a set of items are scheduled over the planning horizon and the procedure terminates when all items are scheduled. An algorithm that implements this approach is developed in which in each iteration a single item is selected and scheduled over the planni...
A conic quadratic formulation for a class of convex congestion functions in network flow problems Gürel, Sinan (Elsevier BV, 2011-06-01) In this paper we consider a multicommodity network flow problem with flow routing and discrete capacity expansion decisions. The problem involves trading off congestion and capacity assignment (or expansion) costs. In particular, we consider congestion costs involving convex, increasing power functions of flows on the arcs. We first observe that under certain conditions the congestion cost can be formulated as a convex function of the capacity level and the flow. Then, we show that the problem can be effici...
THE SCHEDULING OF ACTIVITIES TO MAXIMIZE THE NET PRESENT VALUE OF PROJECTS - COMMENT SEPIL, C (Elsevier BV, 1994-02-24) In a recent paper, Elmaghraby and Herroelen have presented an algorithm to maximize the present value of a project. Here, with the help of an example, it is shown that the algorithm may not find the optimal solution.
Bank asset and liability management under uncertainty Oguzsoy, CB; Güven, Sibel (Elsevier BV, 1997-11-01) This study presents a multiperiod stochastic linear simple recourse model for asset and liability management in banking. The model determines the portfolio of assets and liabilities over the planning horizon given a set of deterministic rates of returns of investments and costs of borrowings, and a set of random outstanding deposit levels, liquidity and total reserve requirements with a given discrete probability distribution. The intention is to develop an optimization tool to assure sustained profitabilit...
A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems Chung, Chia-Shin; Flynn, James; Kırca, Ömer (Elsevier BV, 2006-10-01) The m-machine permutation flowshop problem with the total tardiness objective is a common scheduling problem, which is known to be NP-hard. Here, we develop a branch and bound algorithm to solve this problem. Our algorithm incorporates a machine-based lower bound and a dominance test for pruning nodes. We undertake a numerical study that evaluates our algorithm and compares it with the best alternative existing algorithm. Extensive computational experiments indicate that our algorithm performs better and ca...

Citation Formats

D. CEYLAN, O. SAATCIOGLU, and C. SEPIL, “AN ALGORITHM FOR THE COMMITTEE CONSTRUCTION PROBLEM,” EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, pp. 60–69, 1994, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/66464.