Invigilator Duty Allocation in Examination Hall
Vikas Verma1, Apoorv Varshney2, Ashish Mathur3, Santanu Banerjee4, Poorneshwar Anand5
1Vikas Verma*, Assistant Professor,Department of Computer Science and Engineering, Jaipur National University, Jaipur, India.
2Apoorv Varshney, Student Department of Computer Science and Engineering, Jaipur National University, Jaipur, India.
3Ashish Mathur, Student Department of Computer Science and Engineering, Jaipur National University, Jaipur, India.
4Santanu Banerjee, Student Department of Computer Science and Engineering, Jaipur National University, Jaipur, India.
5Poorneshwar Anand Student Department of Computer Science and Engineering, Jaipur National University, Jaipur, India.
Manuscript received on March 15, 2020. | Revised Manuscript received on March 25, 2020. | Manuscript published on April 10, 2020. | PP: 736-739 | Volume-9 Issue-6, April 2020. | Retrieval Number: E3028039520/2020©BEIESP | DOI: 10.35940/ijitee.E3028.049620
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The complexity in invigilator duty allocation in examination schedule has increased in last few years as number of examinations was increased. This complexity had some ambiguities as some invigilators got maximum number of duties while some got minimum number of duties. This paper proposed an optimize algorithm to allocate duties to invigilators. This algorithm provides optimized way to allocate duties of invigilators to reduce ambiguities such as unequal amount of duty allocation of invigilators. In this paper, an algorithm is proposed to allocate any numbers of invigilators in different examination halls in such a way that each invigilator will get equal amount of duties. This algorithm has written and implemented in java language.
Keywords: Invigilator, Duty Allocation, Examination Schedule, Scheduling Algo.
Scope of the Article: Algorithms and Complexity