Automated application processing

被引:0
作者
Eshita Sharma
Keshav Gupta
Lubaina Machinewala
Samaksh Dhingra
Shrey Tripathi
V S Shreyas
Sujit Kumar Chakrabarti
机构
[1] International Institute of Information Technology,
来源
Sādhanā | / 47卷
关键词
Algorithms; meta heuristics; application processing; graph colouring; assignment;
D O I
暂无
中图分类号
学科分类号
摘要
Recruitment in large organisations often involves interviewing a large number of candidates. The process is resource intensive and complex. Therefore, it is important to carry it out efficiently and effectively. Planning the selection process consists of several problems, each of which maps to one or the other well-known computing problem. Research that looks at each of these problems in isolation is rich and mature. However, research that takes an integrated view of the problem is not common. In this paper, we take two of the most important aspects of the application processing problem, namely review/interview panel creation and interview scheduling. We have implemented our approach as a prototype system and have used it to automatically plan the interview process of a real-life data set. Our system provides a distinctly better plan than the existing practice, which is predominantly manual. We have explored various algorithmic options and have customised them to solve these panel creation and interview scheduling problems. We have evaluated these design options experimentally on a real data set and have presented our observations. Our prototype and experimental process and results may be a very good starting point for a full-fledged development project for automating application processing process.
引用
收藏
相关论文
共 19 条
  • [1] Zvi G(1988)An o (n2 (m+ n log n) log n) min-cost flow algorithm J. the ACM (JACM) 35 374-386
  • [2] Éva T(1989)Finding minimum-cost circulations by canceling negative cycles J. ACM 36 873-886
  • [3] Goldberg AV(1987)Using tabu search techniques for graph coloring Computing 39 345-351
  • [4] Tarjan RE(1996)A column generation approach for graph coloring INFORMS J. Comput. 8 344-354
  • [5] Hertz A(1982)Register allocation & spilling via graph coloring ACM Sigplan Notices 17 98-101
  • [6] de Werra D(2017)Ant colony system for graph coloring problem International Journal of Engineering Science and Computing 7 14120-14125
  • [7] Trick MA(2017)Effective and efficient dynamic graph coloring Proc. VLDB Endow. 11 338-351
  • [8] Mehrotra A(1981)The application of a graph coloring method to an examination scheduling problem INFORMS J. Appl. Anal. 11 57-65
  • [9] Chaitin GJ(undefined)undefined undefined undefined undefined-undefined
  • [10] Karthikeyan R(undefined)undefined undefined undefined undefined-undefined