A Two-Stage Approach for Project Reviewer Assignment Problem

Abstract:

In this paper we employ a two-stage approach to solve the project reviewer assignment problem. The objective is to best satisfy the preferences of reviewers. In addition, the number of total movement times of reviewers is minimized. Reviewers are first invited to show their preferences to the projects with a number to indicate their priority. After aggregating the data, a two-stage approach is used to best match the reviewers and projects. At the first stage reviewers are assigned, while at the second stage review venues are arranged in a way that the total change times of venues for reviewers are minimized. The results show that the proposed two-stage scheme is very helpful in solving the project reviewer assignment problem.

• Periodical: Advanced Materials Research (Volumes 452-453)
• Pages: 369-373
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.452-453.369
• Online since: January 2012
• Authors: Rong Chang Chen, Pei Hsuan Shang, Mei Chun Chen
• Keywords: Assignment, GA, Genetic Algorithm (GA), Project Reviewer Assignment

References

[1] M. Gen, R. Cheng: Genetic Algorithms and Engineering Optimization. New York: John Wiley & Sons (1999).

[2] D.E. Goldberg: Genetic Algorithm in Search, Optimization, and Machine Learning. Massachusetts, Addison Wesley (1989).

[3] J.H. Holland: Adaptation in Natural and Artificial Systems, Ann Arbor: University of Michigan Press (1975).

[4] M. Mitchell: An Introduction to Genetic Algorithms, MIT Press, Cambridge (1996).

[5] R.C. Chen, T.S. Chen and C.C. Lin: A New Binary Support Vector System for Increasing Detection Rate of Credit Card Fraud, International Journal of Pattern Recognition and Artificial Intelligence Vol. 20(2) (2006), pp.227-239.

DOI: 10.1142/s0218001406004624

[6] R.C. Chen: Grouping Optimization Based on Social Relationships, to appear in Mathematical Problems in Engineering (2011).

[7] R. Burkard, M. Dell'Amico and S. Martello: Assignment Problems, Society for Industrial and Applied Mathematics, Philadelphia (2009).

[8] D.G. Cattrysse, L.N. Van Wassenhove: A Survey of Algorithms for the Generalized Assignment Problem, European Journal of Operational Research Vol. 60 (1992), pp.260-272.

DOI: 10.1016/0377-2217(92)90077-m

[9] S. Martello, P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley, New York (1990).

[10] T. Öncan: A Survey of the Generalized Assignment Problem and its Applications, Information Systems and Operational Research Vol. 45(3) (2007), pp.123-141.

DOI: 10.3138/infor.45.3.123

[11] P.C. Chu, J.E. Beasley: A Genetic Algorithm for the Generalized Assignment Problem, Computers and Operations Research Vol. 24(1) (1997), p.17–23.

DOI: 10.1016/s0305-0548(96)00032-9

[12] P.R. Harper, V. de Senna, I.T. Vieira and A.K. Shahani: A Genetic Algorithm for the Project Assignment Problem, Computers and Operations Research Vol. 32(5) (2005), pp.1255-1265.

DOI: 10.1016/j.cor.2003.11.003

[13] R.C. Chen, M.J. Huang, R.G. Chung and C.J. Hsu: Allocation of Short-Term Jobs to Unemployed Citizens amid the Global Economic Downturn Using Genetic Algorithm, Expert Systems with Applications Vol. 38 (2011), pp.7537-7543.

DOI: 10.1016/j.eswa.2010.12.113