Algorithm for efficient seating plan for centralized exam system

Chaki, Prosanta Kumar; Anirban, Shikha

doi:10.1109/icctict.2016.7514601

Cited by 11 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The developed software helps the exam Coordinators to allocate the duties to respective teachers and to develop a student seating allocation plans for examinations. The paper [3] describes the way to create exam seat plans for many students studying various courses. This approach was primarily concerned with making the best use of available space, keeping students from being given the same question set in order to prevent cheating (copying from others) during the exam, eliminating seat overlap, and lastly creating a full seating arrangement that is comfortable for both students and examiners.…”

Section: Literature Reviewmentioning

confidence: 99%

The Invigilatorapp: For Efficient Scheduling and Reminder Notifications

2023

IRJMETS

View full text Add to dashboard Cite

Maintaining the validity and fairness of exams in educational institutions depends on effectively arranging invigilation duties. This study examines different invigilation duty scheduling techniques and a new system developed to enhance the procedure. Due to the complexity of modern examination systems, more advanced and automatic scheduling methods must be used instead of the manual allocation used in traditional procedures. The study reviews known algorithms, from straightforward rule-based approaches to sophisticated optimization methods. After that, a developed system is shown which makes use of simple algorithm to decide on scheduling wisely. Using real-world data, the suggested method is assessed and contrasted with existing algorithms, indicating its ability to achieve efficiency, fairness, and invigilator satisfaction.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

The Invigilatorapp: For Efficient Scheduling and Reminder Notifications

2023

IRJMETS

View full text Add to dashboard Cite

show abstract

“…The primary concern of well-prepared examination halls depends on the comprehensive distribution of examination seats. Allocation of the examination seats with unique number will ensure the distance among students can be controlled to avoid cheating by copying answers from their close friends (Chaki & Anirban, 2016). The process of examination seat allocation starts as soon as the examination timetable of the courses is released.…”

Section: Related Workmentioning

confidence: 99%

“…This type of examination environment is easy to maintain, but cannot be tested with large numbers of enrolment, which requires more examination halls, courses and invigilators. The system should be able to cover and mostly focus on optimum uses of examination seats, having a standard distance of students getting the same set of question paper, avoiding the overlapping of seats and finally comprehensive seating arrangement that is comfortable for the students and invigilators (Chaki & Anirban, 2016).…”

Section: Related Workmentioning

confidence: 99%

Nested Repetitive Structure Techniques in Examination Seating Number Allocation Process at UiTM Pulau Pinang Branch

Othman

Kadar

Wahab

2020

JCRINN

View full text Add to dashboard Cite

Preparation of examination seating numbers during the final examination at UiTM Pulau Pinang branch is manually drafted and written by the examination unit staff on the class lists printed through the Student Integrated Managements Systems (SIMs). Process of assigning the seating number for each student takes couple of weeks and this task has become a challenging part for examination unit. Since the students’ enrolments are linearly increasing every semester, the workloads among Examination Unit staffs become very burdensome in assigning the seating number. To automate the process of assigning the seating numbers, an algorithm was designed and constructed using the nested repetitive or looping structure techniques with JAVA programming language. Two tasks were identified in assigning the seating numbers; the first task was to set the examination seating number range with start and end numbers for each group of courses registered by the students and the subsequent task was to assign the seating number for each student accordingly by group seating number range as specified during the prior task without the violation or overlapping of seating numbers. The algorithm was tested using real data enrolments taken from SIMs for two semesters and resulted in positive effect especially on the reduction of stressfulness and zero erroneous allocation of the seating numbers.

show abstract

“…The research that comes closest to the problem in terms of distance constraints is derived from the exam session planning problems. Chaki and Anirban [1] developed the exam session planning problem previously considered in the literature into more detailed seating arrangements in examination rooms in such a way as to make cheating during exams more difficult. They developed a set of constructive heuristics and the results they obtained show that the optimized seating plans are better than those generated manually, even tough they could not achieve an optimal solution in general.…”

Section: Introductionmentioning

confidence: 99%

Epidemiology-constrained Seating Plan Problem

Dąbkowski

Kacperski

Kaleta

2022

Foundations of Computing and Decision Sciences

View full text Add to dashboard Cite

The emergence of an infectious disease pandemic may result in the introduction of restrictions in the distance and number of employees, as was the case of COVID-19 in 2020/2021. In the face of fluctuating restrictions, the process of determining seating plans in office space requires repetitive execution of seat assignments, and manual planning becomes a time-consuming and error-prone task. In this paper, we introduce the Epidemiology-constrained Seating Plan problem (ESP), and we show that it, in general, belongs to the NP-complete class. However, due to some regularities in input data that could a affect computational complexity for practical cases, we conduct experiments for generated test cases. For that reason, we developed a computational environment, including the test case generator, and we published generated benchmarking test cases. Our results show that the problem can be solved to optimality by CPLEX solver only for specific settings, even in regular cases. Therefore, there is a need for new algorithms that could optimize seating plans in more general cases.

show abstract

Algorithm for efficient seating plan for centralized exam system

Cited by 11 publications

References 6 publications

The Invigilatorapp: For Efficient Scheduling and Reminder Notifications

The Invigilatorapp: For Efficient Scheduling and Reminder Notifications

Nested Repetitive Structure Techniques in Examination Seating Number Allocation Process at UiTM Pulau Pinang Branch

Epidemiology-constrained Seating Plan Problem

Contact Info

Product

Resources

About