Abstract 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 problem. 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.
[1]
C. R. Seshan.
Some Generalisations of the Time Minimising Assignment Problem
,
1981
.
[2]
Peter L. Hammer,et al.
Time‐minimizing transportation problems
,
1969
.
[3]
James P. Ignizio,et al.
Linear Programming in Single- and Multiple-Objective Systems
,
1984
.
[4]
Lawrence R. Jauch,et al.
Evaluation of University Professors' Research Performance
,
1975
.
[5]
Alan Frieze.
Bottleneck Linear Programming
,
1975
.
[6]
Robert Garfinkel,et al.
The bottleneck transportation problem
,
1971
.
[7]
S. Geetha,et al.
Time-Cost Trade-Off Analysis in Some Constrained Assignment Problems
,
1989
.
[8]
Y. Aneja,et al.
BICRITERIA TRANSPORTATION PROBLEM
,
1979
.