Automatic examination arrangement algorithm for supplementary examination and rerepair

By designing the automatic scheduled test for re-examination and re-examination algorithm, the problem of inefficient schedule for re-examination and re-examination in the existing technology has been solved, automated examination arrangements and resource optimization have been realized, and the efficiency of education management and scientific resource allocation have been improved.

CN118917592APending Publication Date: 2024-11-08YANCHENG INST OF TECH
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410958562.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-17
Publication Date
2024-11-08

AI Technical Summary

Technical Problem

The existing technology has failed to effectively solve the scheduling problems of make-up and re-examination examinations, resulting in academic affairs staff facing cumbersome data processing and adjustment difficulties, unreasonable resource allocation and inefficient efficiency.

Method used

An automatic test schedule algorithm for re-examination is designed. By preparing and storing relevant data, setting the maximum number of people in the time period and venue, and sorting and allocating it in combination with the campus combination table and test paper number to ensure that the same courses are students on the same campus within the same time period. The examination is conducted, and the distribution of candidates in each examination room is optimized by matching the steps to generate the final test schedule.

Benefits of technology

It realizes automatic generation of examination arrangements based on students' personal situations, ensures that the examination sessions are balanced, reduces spatial complexity, improves the efficiency of exam schedule and resource utilization, reduces human errors, and meets the needs of the academic affairs department.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118917592A_ABST
    Figure CN118917592A_ABST
Patent Text Reader

Abstract

The invention discloses an automatic examination arrangement algorithm for supplementary examination and rerepair, and relates to the field of examination arrangement information processing. Examination paper numbers are used as core association of examination arrangement, it is ensured that students with the same examination paper number are examined at the same time, and the particularity of supplementary examination and rerepair examination arrangement is considered at the same time; the method comprises the following steps: firstly, summarizing necessary data of supplementary examination and rerepair according to test paper numbers, then sorting according to the number of examinees, and arranging the examinees at the same time in consideration of the same course of different school districts. According to the invention, corresponding examination arrangements can be automatically generated according to personal conditions of students and specific requirements of supplementary examination and rerepair.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of examination scheduling information processing, and in particular to an automatic examination scheduling algorithm for make-up examinations and retaking exams. Background Art

[0002] Traditional course scheduling usually relies on manual work, which is inadequate in the face of increasingly complex scheduling needs. Academic staff have to spend a lot of time and energy dealing with tedious data such as courses, teachers, students, venues, time, etc., and often face problems such as difficulty in adjustment and large amounts of repetitive work. The research and application of scheduling systems are also of great significance for optimizing the allocation and utilization of educational resources. By reasonably allocating resources such as classrooms and invigilators, scheduling systems can help improve resource utilization efficiency, reduce resource waste, and create better conditions for the development of schools.

[0003] Automatically scheduling exams with the help of computer systems can greatly improve the efficiency of scheduling exams and reasonably allocate limited resources, making exam arrangements more scientific and reasonable. Such an automated system can comprehensively consider various factors, avoid scheduling conflicts, and reduce the possibility of human errors. At the same time, it can also realize the automatic export and processing of scheduling data, further reducing the burden on teaching staff. Therefore, the research and development and application of scheduling algorithms are of great significance. It not only improves the efficiency and level of education management, but also provides scientific decision-making references for school managers, helps to optimize the allocation of educational resources, improve the quality of education management, and promote the process of education informatization. Scheduling algorithms refer to a class of algorithms used to arrange resources such as exam time, location, and invigilators. Its purpose is to optimize exam arrangements and improve efficiency and fairness under the premise of meeting various constraints. However, the scheduling algorithms in the prior art are mainly aimed at normal scheduling exams, and are not designed for make-up exams, retakes, and other exams. Summary of the invention

[0004] Purpose of the invention: In view of the problem that there is no scheduling for make-up and retake exams in the prior art, the present invention provides an automatic scheduling algorithm for make-up and retake exams;

[0005] Technical solution: An automatic scheduling algorithm for retaking and retaking exams, comprising the following steps:

[0006] S1. Prepare the data required for the make-up exam and store it in the exam database;

[0007] S2. Set the time period required for retaking and retaking the course, the maximum number of people in each venue, and the balancing path;

[0008] S3, determine whether the database for scheduled examinations still stores relevant data of candidates for make-up examinations and retaking exams; if not, it means that there is no relevant data of candidates for make-up examinations and retaking exams in the database for scheduled examinations, and the output is empty; if so, obtain the examination data in the database for scheduled examinations;

[0009] S4. Based on the obtained test scheduling data, determine whether the average number of people in each time period is less than the maximum number of people in each venue; if so, the maximum number of people in each time period is equal to the maximum number of people in each venue; if not, the maximum number of people in each time period = the total number of people taking the make-up exam / number of time periods;

[0010] S5. Obtain all possible permutations according to the number of campuses, and obtain a campus combination table of different campus permutations and combinations;

[0011] S6. For each campus combination table, in the examination scheduling data obtained in S3, search for the examination scheduling data corresponding to the examination paper numbers of the campus examinations listed in the campus combination table at the same time, aggregate them according to the examination paper numbers to obtain a total examination scheduling table, sort them from large to small according to the number of examinees, and store the sorted data in the examination to be scheduled table corresponding to each campus combination table;

[0012] S7, arrange the examinations in order according to the examination paper numbers in the campus combination table from the largest to the smallest number of campuses, to ensure that students with the same examination paper numbers in different campuses take the examinations at the same time; compare the maximum number of students in each time period obtained in S4 with the total number of students in the list of each campus to determine whether it is less than the maximum number of students in each time period; the total number of students in the list includes the total number of students in the existing examination list and the total number of students with examination paper numbers to be added;

[0013] 1) If yes, determine whether the student whose test paper number is to be added is already in the test list;

[0014] If the student whose test paper number is to be added is not in the existing test list, the student data of the student whose test paper number is to be added is stored in the existing test list to form a temporary test list, the test paper number data in the total test list and the test list to be scheduled is deleted, and it is determined whether the test list to be scheduled is empty. If the test list to be scheduled is not empty, continue to S7. If the test list to be scheduled is empty, the time period is increased by 1, and S8 is performed.

[0015] 2) If not, remove the current test paper number from the total test list and the test list to be scheduled, and determine whether the test list to be scheduled is empty. If the test list to be scheduled is not empty, continue with S7. If the test list to be scheduled is empty, increase the time period by 1 and proceed to S8.

[0016] S8, determine whether the time period is equal to the maximum time period; if so, obtain the temporary test schedule list, and then execute S9; if not, return to S7 to continue execution;

[0017] S9. Balancing the data according to the balancing steps to obtain the official test list;

[0018] S10, judging whether the campus combination table obtained in S5 is empty;

[0019] If yes, execute S11, if no, return to execute S6;

[0020] S11. According to the maximum number of candidates in each venue and the official examination schedule information, candidates are assigned to different venues to obtain the examination schedule results.

[0021] Furthermore, in S1, the data required for the make-up exam and retake include: the name and student number of the student who is taking the make-up exam and retake, the campus, college, class, the name of the make-up exam and retake course, the test paper number, the session, and the semester.

[0022] Furthermore, in S3, the test scheduling data specifically refers to the test paper number, campus, student number, session, and semester in the data required for the make-up exam or retaking the course.

[0023] Furthermore, in S4, the average number of students in each time period refers to the data obtained by dividing the total number of students who take the make-up exam and retake the course by the number of time periods.

[0024] Furthermore, the specific operations of S9 are as follows:

[0025] (1) Determine whether the total test list is empty;

[0026] (2) If the total test list is empty, execute S10;

[0027] (3) If the total exam schedule is not empty, determine whether the maximum number of people in each time period has reached twice the maximum number of people in each time period; if so, store the last temporary exam schedule in the official exam schedule; if not, increase the maximum number of people in each time period by the number of people in the step, then go from S6 to S8, store the result in the temporary exam schedule, and then return to S9.

[0028] Furthermore, in S11:

[0029] 1) The formal examination list information includes the information of candidates taking the examination within the specified time period, including: examination paper number, campus, student number, session, and semester;

[0030] 2) The test schedule includes campus, time period, test paper number, course name, class, venue, session, seat number, candidate's name, and student ID number.

[0031] Beneficial effects: The present invention can automatically generate corresponding examination arrangements according to the students' personal circumstances and the specific requirements of make-up and retaking exams. The present invention can realize automatic scheduling of make-up and retaking exams according to the relevant data of the campus, college, class, student number, name, test paper number, course name, etc., the input time period, the maximum number of people that the venue can accommodate, the balancing path, etc., to ensure that the same courses in different campuses are scheduled at the same time, while also taking into account the balance of the examination sessions, and finally generate the scheduling results required by the academic affairs department, which are saved and output in the form of Excel tables. The present invention is designed to use a balancing step. When scheduling the exam, the candidates in each examination room can be distributed as evenly as possible, and as many candidates as possible can be arranged to take the exam. The subsequent code is streamlined through nested polling, which further reduces the space complexity. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] Figure 1 Flowchart of the automatic scheduling algorithm for retaking exams for a single campus;

[0033] Figure 2 Flowchart of the algorithm for automatically scheduling exams for make-up and retake exams at multiple campuses. DETAILED DESCRIPTION

[0034] The technical solution of the present invention is described in detail below with reference to the accompanying drawings, but the protection scope of the present invention is not limited to the embodiments.

[0035] Example 1

[0036] This embodiment provides a single-campus make-up exam retake automatic scheduling algorithm, which is embedded in the teaching management system by setting a single-campus make-up exam retake scheduling module; the specific implementation of the single-campus make-up exam retake scheduling module is as follows:

[0037] The front-end development uses the style design provided by Ant Design, which provides a clear and beautiful appearance for the page. In addition to Ant Design, the Ag-Grid table processing module is also introduced to provide strong support for the data display and processing of the front-end page. Ag-Grid provides a wealth of functions, including data sorting, filtering, paging, etc., which can meet the diverse needs of data operations. In the single-campus make-up exam retake scheduling page, after the user fills in the relevant information according to the regulations, the front-end encapsulates the data into the request body and sends it to the back-end through Axios. After receiving the request, the back-end runs the scheduling algorithm and transmits the success and failure results to the front-end. The front-end displays the success and failure pages of the make-up exam scheduling based on the received data, so that users can clearly understand the results of the scheduling. The specific process of the back-end processing is as follows: the back-end receives the request information sent by the front-end, and then authenticates and authorizes the user through the Token authentication interceptor to ensure the security of the system. Once authenticated, the back-end starts to execute the single-campus make-up exam retake automatic scheduling algorithm.

[0038] The specific implementation process is as follows:

[0039] A) Data preparation: Ensure that the necessary data for make-up exams and retakes has been imported into the system (the imported raw data includes: serial number, college, class, student ID, name, course code, course name, credits, test paper number, test paper address, college offering the course, campus, tutoring method, examination method, tutor). Pre-process and clean the data required for make-up exams and retakes. The cleaned make-up exam and retake data includes: campus, college, class, student ID, name, test paper number, course name, session, and semester.

[0040] B) Exam scheduling algorithm design: Design an algorithm for scheduling make-up and retake exams, using the test paper number (the test paper number is information that cannot be repeated and is used to connect other information) as the core association for scheduling exams, to ensure that students with the same test paper number take the exam at the same time. Considering the particularity of scheduling make-up and retake exams, first summarize the necessary data for make-up and retake exams based on the test paper number, and then sort them according to the number of candidates.

[0041] C) Test scheduling generation: Schedule the test according to the test with the largest number of participants, create a test time list based on the number of time periods entered, and determine the maximum number of candidates for each time period. Assign each test paper number to ensure that students with the same test paper number take the test at the same time, and avoid the problem of taking two tests at the same time. During the test scheduling process, try to balance the number of candidates in each time period and maximize the number of candidates.

[0042] D) Scheduling result evaluation: Evaluate the generated scheduling plan to ensure that all basic hard and hard constraints are met, including no conflict in exam time and venue, etc. According to the balancing module, re-poll the test paper numbers that cannot be scheduled to supplement the missing parts in the scheduling plan.

[0043] E) Output of test scheduling results: The final test scheduling plan will be output to the academic affairs management personnel, providing detailed information such as test time, venue allocation, etc.

[0044] The requirements and implementation logic of the exam scheduling, the business logic of the preliminary exam scheduling is as follows:

[0045] 1) Students with the same test paper number will take the test at the same time. Each examination room will be assigned as many students as possible, and the number of students in each time period will be as balanced as possible. After the first round of exams is completed, the students who have not completed the schedule will be included in the next round of exams. In extreme cases, if the number of courses a student needs to retake exceeds the number of exams, they will need to be handled separately.

[0046] First, extract the test paper numbers and group them, sort them by number of people, arrange the tests with the most people first, and create a time storage list for the test according to the number of time periods entered. There are two situations for the maximum number of candidates in each time period:

[0047] A. When the maximum number of people / time periods ≥ the maximum number of people in each venue, the maximum number of candidates in each time period is the maximum number of people / time periods.

[0048] B. When the maximum number of people / time periods < the maximum number of people in each venue, the maximum number of candidates in each time period is the maximum number of people in each venue.

[0049] According to the above two conditions, the test paper numbers are added to the list in turn, and before the new test paper number is added, all the student numbers in the new test paper number need to be compared with the student numbers previously in the list. If there is no conflict, they can enter, otherwise they cannot enter. This ensures that students with the same test paper number take the exam at the same time and do not take two exams at the same time.

[0050] 2) Arrange as many students as possible in each examination room

[0051] The above method can only complete the preliminary examination arrangement, and it is not possible to find all the test paper numbers that can be arranged. At this time, it is necessary to poll again to check for omissions. This system has designed a balancing module to complete the examination arrangement for the test paper numbers that cannot be inserted due to insufficient space. The maximum tolerance interval of balancing is twice the maximum number of candidates in each time period.

[0052] like Figure 1 As shown in the figure, the specific steps of the automatic scheduling algorithm for make-up and retaking exams in a single campus are as follows:

[0053] Step 1: When the exam is scheduled, prepare the data required for the make-up exam and store it in the exam database;

[0054] The make-up exam and retake data refers to the cleaned data of students who take the make-up exam and retake, including: the name and student number of the students, the campus, college, class, name of the make-up exam and retake course, test paper number, session, and semester.

[0055] (1) Campus is the campus where the student is located. For example, some schools have two campuses, north and south, so the campus field is needed to distinguish them. When scheduling a make-up exam or retake exam for a single campus, the campus value is unique. When scheduling an exam, students from this campus take the exam at this campus.

[0056] (2) The examination paper number includes the examination paper number and course name of the make-up examination or retake subject;

[0057] (3) Sessions (exam batches). Multiple exams for different courses can be scheduled in the same time period. Exams for courses with the same test paper number must be scheduled in the same time period, but the same session can include courses with different test paper numbers.

[0058] (4) Semester is used to distinguish the make-up exam and retake data of different semesters. Normally, the exam data is the data of the current semester, but considering that historical data will be saved, semesters are set to prevent erroneous data from being retrieved. Semester can be used to divide the data pool (data that needs to be scheduled for exams) to avoid data errors.

[0059] Step 2: Set the time period required for retaking and retaking exams, the maximum number of people in each venue, and the balancing path;

[0060] (1) Time period:

[0061] Set the time period for the exams as needed. There are 5 time periods available for arranging exams every day, each lasting 2 hours, 2 in the morning, 2 in the afternoon, and 1 in the evening. Time periods are defined as integers. If 5 exams are scheduled per day, the time period is an integer from 1 to 5. Because make-up exams and retakes are generally scheduled on weekends, a maximum of 10 exams can be scheduled on Saturdays and Sundays. The maximum number of time periods is 10, and each time period corresponds to a specific exam time. For example, time period 1 corresponds to the exam session from 7:30 to 9:30, time period 2 corresponds to the exam session from 10:10 to 12:10, and so on.

[0062] (2) Venue:

[0063] Because make-up exams and retakes are usually scheduled on weekends, there is no need to determine venue conflicts. The maximum number of people in each venue is usually set to the number of candidates that each exam room can accommodate × 2, and subsequent exams will be scheduled based on this setting. Each venue has a number, name, and capacity, and belongs to a specific campus. Each venue can only conduct one exam at a time, and its capacity should be greater than twice the number of examinees.

[0064] (3) Balancing step:

[0065] Balancing is to try to evenly distribute the candidates in each examination room when scheduling the exam, to avoid the situation where some examination rooms have too few candidates. The smaller the balancing step, the more even the candidate distribution can be, but it will also take more time.

[0066] Step 3, determining whether the database for scheduled examinations stores relevant data of candidates who need to retake the make-up examination;

[0067] The database for scheduled exams stores the relevant data of the candidates who are taking the make-up exam and retaking the course in step 1;

[0068] (1) If not, it means that there is no relevant data of the candidates who need to retake the exam in the database for scheduled exams, and the output is empty.

[0069] (2) If so, obtain the examination scheduling data in the database of examinations to be scheduled; the examination scheduling data specifically refers to the test paper number, campus, student number, session, and semester required for the make-up examination or retaking the course.

[0070] Step 4: Based on the obtained test scheduling data, determine whether the average number of people in each time period is less than the maximum number of people in each venue;

[0071] When scheduling an exam, you need to enter the number of time periods. Divide the total number of people who need to take the exam by the number of time periods. The result is the average number of people per time period (for example, if a course with 5,800 students needs to arrange a make-up exam and retake exam, and there are a total of 10 time periods, the average number of people per time period is 580).

[0072] The total number of records of the exam scheduling data after cleaning in step 1 is the total number of people to be scheduled for the exam. Divide it by the number of time periods entered to get the number of people in each time period.

[0073] (1) If yes, then the maximum number of people in each time period is equal to the maximum number of people in each venue, and go to step 5;

[0074] (2) If not, then the maximum number of students in each time period = total number of students / number of time periods, and go to step 5; the total number of students refers to the total number of students waiting to be scheduled for the exam, that is, the total number of students who need to retake the exam.

[0075] Step 5: Aggregate all the test schedule data according to the test paper number to obtain the total test schedule table, and sort them from large to small according to the number of people, and store the sorted data in the waiting test schedule table;

[0076] Sort the number of examinees from large to small according to the test paper number, and store the test paper number and the number of examinees in a List entity class that you have written. <classidnumber>In the object, the test paper number is stored separately in a List <string>In the object allid, complete the data initialization.

[0077] Step 6: Compare the maximum number of people in each time period obtained in step 4 with the total number of people in the list to determine whether it is less than the maximum number of people in each time period;

[0078] The total number of people in the list includes the number of people in the existing exam list and the total number of people whose exam papers are to be added; the number of people in the existing exam list refers to the number of people who have completed the exam schedule; the data for adding the exam paper number is obtained in step 5;

[0079] (1) If so, determine whether the student whose test number is to be added is already in the existing test list;

[0080] If the student whose test paper number is to be added is not in the existing test list, store the student data of the test paper number to be added into the existing test list to form a temporary test list, delete the test paper number data in the total test list and the test list to be scheduled, and determine whether the test list to be scheduled is empty. If the test list to be scheduled is not empty, continue with step 6. If the test list to be scheduled is empty, then the time period is +1, and proceed to step 7. The test list includes the test paper number and student number.

[0081] (2) If not, remove the current test paper number from the list of pending tests (obtained by searching the database in step 3), and determine whether the list of pending tests is empty. Otherwise, proceed to step 6. If so, increase the time period by 1, and proceed to step 7.

[0082] The specific implementation details are as follows:

[0083] Initializing a List <string>The object list of the class is used to store the students who have been scheduled for examinations in a certain period of time, and then a loop is started: read the examination paper numbers in allid in turn, query the relevant information of the corresponding examination paper number (including student number, course number, examination paper number) through MyBatis, extract the student information in the list through .stream().map(Exam::getStudentid).collect(Collectors.toList()), compare the number of students corresponding to the current examination paper number with the average avg (the average avg refers to the average number of students per examination mentioned in step 5), if it is greater, skip it first (the number of examinees exceeds the maximum number of references, and balancing is required), until the examination paper number less than the average is read, and the examination is scheduled. Through the custom check_repetition class, it is judged that if there is no conflict between the students to be scheduled and the students who have been scheduled (to ensure that the same student will not take the examination at the same time), the current student is inserted into the list of students who have been scheduled, so that an insertion is completed, and the above steps are repeated until the number of references reaches the average, or the sizes of the two allid lists are the same, then the loop is jumped out and the first round of examinations ends. Delete the scheduled exam roll number from allid.

[0084] The above steps need to be repeated until all time periods are completed.

[0085] Step 7: Determine whether the current time period is equal to the maximum time period;

[0086] That is, determine whether the current scheduled exam is the last exam;

[0087] If yes, go to step 8;

[0088] If not, return to step 5 to continue execution.

[0089] Step 8: Perform data balancing according to the balancing steps to obtain the official test list information; the specific operations of step 8 are as follows:

[0090] (1) Determine whether the total test list is empty;

[0091] (2) If the total test list is empty, go to step 9;

[0092] (3) If the total exam schedule is not empty, determine whether the maximum number of people in each time period has reached twice the maximum number of people in each time period; if so, store the last temporary exam schedule in the official exam schedule; if not, increase the maximum number of people in each time period by the number of people in the step, then run steps 5 to 7, store the results in the temporary exam schedule, and then return to step 8.

[0093] Step 9: Allocate candidates to different venues based on the maximum number of people in each venue and the official exam schedule information to obtain the exam schedule results.

[0094] 1) The formal examination list information includes the information of candidates taking the examination within the specified time period, including: examination paper number, campus, student number, session, and semester;

[0095] 2) The test schedule includes campus, time period, test paper number, course name, class, venue, session, seat number, candidate's name, and student ID number.

[0096] According to the information in the official exam list, the required data is searched through the database and output to Excel. According to the maximum number of people in the venue entered by the user, the candidates are assigned to different venues through Google's Lists.partition() function, and the maximum number of people in each classroom does not exceed the number limit entered by the user.

[0097] Through the official exam list information, find out the exam time, test paper number, course name, class, venue, student name, session, semester and other information stored in the MySQL database (the database for exams to be scheduled in step 3), and generate Excel in order through POI (Office operation Java library), then transmit it to the front end, and store the exam information in the database. At the same time, save the result in a temporary variable through assignment, in preparation for the subsequent front end to access the exam results.

[0098] The test scheduling results are shown in the following table (the test scheduling results of multiple campuses will be stored in different sheets. The following table is the test scheduling results of the South Campus, and "South Campus Test Schedule" is displayed at the top of the table), including time (the time period required for the test scheduling set in step 2), test number (the test paper number set in step 1), course name (the course name set in step 1), class (the class set in step 1), venue (representing venue information), seat number (the seat number assigned to the student in the classroom), candidate name (name set in step 1), and student number (student number set in step 1).

[0099]

[0100] For the test paper numbers whose number of candidates exceeds the average upper limit and whose examination schedule cannot be completed, balancing is required to make the examination results as balanced as possible.

[0101] Example 2

[0102] In the present embodiment, a multi-campus make-up exam retake automatic scheduling algorithm is provided. By setting a multi-campus make-up exam retake module to be embedded in the teaching management system, the specific implementation of the multi-campus make-up exam retake module is as follows: in the front-end implementation of the multi-campus, compared with the single-campus make-up exam retake module, the main difference is that the API interface accessed when the front-end sends a request is different, and the function of campus selection is added in the result display. The front-end sends a request by accessing different API interfaces to obtain the data required by the multi-campus make-up exam retake module. When the result is displayed, through the selection box on the page, the user can select different campuses, so as to query and display the result data of the corresponding campus. In the back-end implementation of the multi-campus make-up exam retake module, it is similar to the implementation of the single campus, but there are some key differences: the multi-campus module adopts an iterative design idea to handle the scheduling requirements between different campuses. First, the back-end obtains the data of the common campus through MyBatis and performs the first round of scheduling. Then, for the remaining campus combinations, iterative scheduling is performed to ensure that the examination arrangement of each campus meets the requirements. After completing the exam scheduling for all campuses, the backend uses Google's Lists.partition() function to assign candidates to different time periods and ensure that the maximum number of students in each classroom does not exceed the limit entered by the user. Finally, after completing the personnel allocation, the backend uses POI to complete the data processing, and saves and outputs the results in Excel format. The exam scheduling results for each campus are saved in different Sheet pages for subsequent reference. At the same time, the results are also saved in temporary variables by assignment, in case the front end needs to access the exam scheduling results later. This implementation scheme ensures the efficiency and reliability of the multi-campus make-up exam and re-examination scheduling module.

[0103] The specific implementation of the multi-campus make-up exam and retake scheduling module is as follows:

[0104] A) Data preparation: Ensure that the necessary data for make-up exams and retakes has been imported into the system (the imported raw data includes: serial number, college, class, student ID, name, course code, course name, credits, test paper number, test paper address, college offering the course, campus, tutoring method, examination method, tutor). Pre-process and clean the data required for make-up exams and retakes. The cleaned make-up exam and retake data includes: campus, college, class, student ID, name, test paper number, course name, tutor, session, and semester.

[0105] B) Exam scheduling algorithm design: Design an algorithm for scheduling make-up and retake exams in multiple campuses, using the test paper number as the core link for scheduling, to ensure that students with the same test paper number can take the exam at the same time in different campuses. Considering the relative independence of each campus, design the exam scheduling process to meet the scheduling requirements between different campuses.

[0106] C) Test scheduling generation: Initialize the test schedule for each campus to ensure that students with the same test paper number take the test at the same time in different campuses. Schedule the test according to the arrangement and combination of the campuses, and arrange the test for each campus one by one to ensure that the test schedules of different campuses do not interfere with each other. During the test scheduling process, try to balance the number of examinees in each time period of each campus to ensure the balance and maximization of the number of candidates.

[0107] D) Scheduling result evaluation: Evaluate the generated scheduling plan to ensure that all basic hard and hard constraints are met, including no conflict in exam time and venue, etc. According to the scope of the rules, adjust the number of candidates in each time period to achieve a balanced number of candidates.

[0108] D. Output of test results:

[0109] For multiple campuses, students with the same test paper number should take the exam at the same time in different campuses, and each exam room should be arranged with as many students as possible. Then, the number of candidates should also be balanced as much as possible in each time period, but the number of sessions for each campus can be relatively independent. If there are still students who have not finished their schedule after the initial exam is completed, they will be combined into the next exam.

[0110] Exam schedule requirements:

[0111] 1) Students with the same test paper number from different campuses take the test at the same time

[0112] When scheduling retakes at multiple campuses, compared with single campuses, not only do students with the same test paper number at the same campus need to take the exam at the same time, but students with the same test paper number at different campuses also need to take the exam at the same time. The specific scheduling process is as follows:

[0113] First, all campuses are arranged and combined, and sorted according to the number of elements in the combination. Then, the data in the database is queried according to the sorting order, and the examination scheduling is started. During the examination scheduling process, a list of time periods corresponding to the number of campuses needs to be generated. Next, check whether there are any student examination scheduling conflicts in each time period to ensure the smooth scheduling of the examination. Then, insert the student data into the corresponding time period according to the order of the campuses. Finally, poll all the test paper numbers until all the test paper numbers have been scheduled for a round of examinations.

[0114] For example, suppose there are two campuses: "South Campus" and "North Campus". First, get the permutations of the campuses, namely "South Campus, North Campus", "South Campus" and "North Campus". Then, sort them out in order of sorting. First, sort the data that contains both the "South Campus, North Campus" labels, and then sort the data that contains only the "South Campus" label and only the "North Campus" label.

[0115] This scheduling process is designed to ensure that students from different campuses can take the exam at the same time with the same exam paper number, thus ensuring the fairness and consistency of the exam.

[0116] 2) Ensure that the number of participants in each campus and each time period is balanced as much as possible

[0117] When scheduling exams in multiple campuses, the number of candidates in each time period in each campus should be balanced as much as possible. However, scheduling exams in multiple campuses is more complicated, so this system has designed a balancing module to achieve this goal.

[0118] This balancing module will process the test schedule of each campus to ensure that the number of candidates in each time period of each campus is as balanced as possible within the specified range. The specific steps are as follows: First, for each campus test schedule, calculate the number of candidates in each time period. Then, according to the rule requirements (i.e., the test schedule requirements: students with the same test paper number in different campuses take the exam at the same time, and try to ensure the balance of the number of candidates in each time period of each campus), determine the expected value of the number of candidates in each time period. Next, adjust each time period one by one, appropriately reduce the number of candidates in the time period with too many people, and appropriately increase the number of candidates in the time period with too few people to achieve a balance of the number of candidates. In the adjustment process, it is necessary to take into account the mutual influence between time periods to ensure that the overall test schedule is reasonable and meets the requirements of the rules. Finally, update the test schedule of each campus to ensure that the number of candidates in each time period is balanced. Through such a balancing module, the number of candidates in the multi-campus test schedule can be effectively managed, ensuring that the number of candidates in each time period of each campus is as balanced as possible, thereby improving the fairness and effectiveness of the test schedule.

[0119] like Figure 2 As shown, an automatic scheduling algorithm for retaking and retaking exams in multiple campuses includes the following steps:

[0120] Steps 1 to 4 are the same as steps 1 to 4 in Example 1;

[0121] Step 5: Obtain all possible permutations according to the number of campuses, and obtain a campus combination table of different campus permutations and combinations.

[0122] All possible arrangements specifically mean that, if we take the South and North campuses as an example, there are three possible combinations: 1. Students and courses that only take the exams in the South campus; 2. Students and courses that only take the exams in the North campus; 3. Students and courses that take the exams in both the North and South campuses.

[0123] For example, if there are two campuses, South Campus and North Campus, the possible combinations are South-South Campus Table, South Campus Table, and North Campus Table. When there are three campuses, assuming they are South, North, and West, the possible combinations are South-South-West Campus Table, South-South Campus Table, North-West Campus Table, South-West Campus Table, South Campus Table, North Campus Table, and West Campus Table. There are seven possible combinations.

[0124] Step 6. For each campus combination table, in the test scheduling data obtained in step 3, search for the test scheduling data corresponding to the test paper numbers of the campus examinations listed in the campus combination table at the same time, aggregate them according to the test paper numbers to obtain the total test scheduling table, sort them from large to small according to the number of examinees, and store the sorted data in the test scheduling table corresponding to each campus combination table.

[0125] Through SQL statements, data from the campus combination table is extracted, and all data that meets the conditions at the same time (for example, when arranging the north and south campus combination table, the condition is that this test paper number needs to have students who take the exam in both the south campus and the north campus, so the multi-campus combination is arranged first) is aggregated according to the test paper number, and sorted from large to small according to the number of people, and the sorted data is stored in the waiting test table.

[0126] Step 7: Arrange the examinations in order according to the examination paper numbers in the campus combination table from most to least campuses, to ensure that students with the same examination paper numbers in different campuses take the examinations in the same time period; compare the maximum number of students in each time period obtained in step 4 with the total number of students in the list of each campus to determine whether it is less than the maximum number of students in each time period; the total number of students in the list includes the total number of students in the existing examination list and the total number of students with examination paper numbers to be added;

[0127] (1) If yes, determine whether the student whose test number is to be added is already in the existing test list:

[0128] (1.1) If the student whose test paper number is added is already in the existing test list, the test paper number data in the waiting test list is deleted, and it is determined whether the waiting test list is empty;

[0129] (1.2) If the student whose test paper number is to be added is not in the existing test list, the student data of the test paper number to be added is stored in the existing test list to form a temporary test list, the test paper number data in the total test list and the test list to be scheduled is deleted, and it is determined whether the test list to be scheduled is empty. If the test list to be scheduled is not empty, proceed to step 7. If the test list to be scheduled is empty, the time period is increased by 1 and step 8 is performed;

[0130] (2) If not, remove the current test paper number from the total test list and the test list to be scheduled, and determine whether the test list to be scheduled is empty. If the test list to be scheduled is not empty, proceed to step 7. If the test list to be scheduled is empty, increase the time period by 1 and proceed to step 8.

[0131] Step 8: Determine whether the time period is equal to the maximum time period;

[0132] If yes, get the temporary exam schedule and execute step 9; if no, return to step 7 and continue.

[0133] Step 9: Perform data balancing according to the balancing steps to obtain the official test list;

[0134] (1) First determine whether the total test table is empty.

[0135] (2) If the total test schedule is empty, delete the campus information for this test in the campus combination table and execute step 10.

[0136] (3) If the total exam schedule is not empty, determine whether the maximum number of people in each time period has reached twice the maximum number of people in each time period. If so, store the last temporary exam schedule in the formal exam schedule; if not, increase the maximum number of people in each time period by the number of people in the step, then run steps 6 to 8, store the result in the temporary exam schedule, and then return to step 9;

[0137] The official examination list information includes information about candidates taking the examination within a specified time period, including: examination paper number, campus, student number, session, and semester.

[0138] Step 10: Determine whether the campus combination table obtained in step 5 is empty;

[0139] If yes, go to step 11; if no, go back to step 6.

[0140] Step 11: Allocate candidates to different venues based on the maximum number of people in each venue and the official exam schedule information to obtain the exam schedule results.

[0141] 1) The formal examination list information includes the information of candidates taking the examination within the specified time period, including: examination paper number, campus, student number, session, and semester;

[0142] 2) The test schedule includes campus, time period, test paper number, course name, class, venue, session, seat number, candidate's name, and student ID number.

[0143] Through the official examination schedule information, find out the examination time, examination paper number, course name, class, venue, student name, session, semester and other information stored in the MySQL database, and generate Excel in order through POI (Office operation Java library), then transmit it to the front end, and store the examination schedule information in the database.

[0144] As described above, although the present invention has been shown and described with reference to specific preferred embodiments, it should not be construed as limiting the present invention itself. Various changes in form and details may be made without departing from the spirit and scope of the present invention.< / string> < / string> < / classidnumber>

Claims

1. An automatic scheduling algorithm for retaking and retaking exams, characterized in that: The steps include: S1. Prepare the data required for the make-up exam and store it in the exam database; S2. Set the time period required for retaking and retaking the course, the maximum number of people in each venue, and the balancing path; S3, determine whether the database for scheduled examinations still stores relevant data of candidates for make-up examinations and retaking exams; if not, it means that there is no relevant data of candidates for make-up examinations and retaking exams in the database for scheduled examinations, and the output is empty; if so, obtain the examination data in the database for scheduled examinations; S4. Based on the obtained test scheduling data, determine whether the average number of people in each time period is less than the maximum number of people in each venue; if so, the maximum number of people in each time period is equal to the maximum number of people in each venue; if not, the maximum number of people in each time period = the total number of people taking the make-up exam / number of time periods; S5. Obtain all possible permutations according to the number of campuses, and obtain a campus combination table of different campus permutations and combinations; S6. For each campus combination table, in the examination scheduling data obtained in S3, search for the examination scheduling data corresponding to the examination paper numbers of the campus examinations listed in the campus combination table at the same time, aggregate them according to the examination paper numbers to obtain a total examination scheduling table, sort them from large to small according to the number of examinees, and store the sorted data in the examination to be scheduled table corresponding to each campus combination table; S7, arrange the examinations in order according to the examination paper numbers in the campus combination table from the largest to the smallest number of campuses, to ensure that students with the same examination paper numbers in different campuses take the examinations at the same time; compare the maximum number of students in each time period obtained in S4 with the total number of students in each campus list to determine whether it is less than the maximum number of students in each time period; The total number of people in the list includes the total number of people in the existing examination list and the number of test papers to be added; 1) If yes, determine whether the student whose test paper number is to be added is already in the test list; If the student whose test paper number is to be added is not in the existing test list, the student data of the student whose test paper number is to be added is stored in the existing test list to form a temporary test list, the test paper number data in the total test list and the test list to be scheduled is deleted, and it is determined whether the test list to be scheduled is empty. If the test list to be scheduled is not empty, continue to S7. If the test list to be scheduled is empty, the time period is increased by 1, and S8 is performed. 2) If not, remove the current test paper number from the total test list and the test list to be scheduled, and determine whether the test list to be scheduled is empty. If the test list to be scheduled is not empty, continue with S7. If the test list to be scheduled is empty, increase the time period by 1 and proceed to S8. S8, determine whether the time period is equal to the maximum time period; if so, obtain the temporary test schedule list, and then execute S9; if not, return to S7 to continue execution; S9. Balancing the data according to the balancing steps to obtain the official test list; S10, judging whether the campus combination table obtained in S5 is empty; If yes, execute S11, if no, return to execute S6; S11. According to the maximum number of candidates in each venue and the official examination schedule information, candidates are assigned to different venues to obtain the examination schedule results.

2. The test scheduling algorithm according to claim 1, characterized in that: In S1, the data required for the make-up exam and retake include: the name and student number of the student who is taking the make-up exam and retake, the campus, college, class, the name of the make-up exam and retake course, the test paper number, the session, and the semester.

3. The test scheduling algorithm according to claim 1, characterized in that: In S3, the test scheduling data specifically refers to the test paper number, campus, student number, session, and semester required for the make-up exam or retake.

4. The test scheduling algorithm according to claim 1, characterized in that: In S4, the average number of students in each time period refers to the total number of students who take the make-up exam and retake the course divided by the number of time periods.

5. The test scheduling algorithm according to claim 1, characterized in that: The specific operation of S9 is as follows: (1) Determine whether the total test list is empty; (2) If the total test list is empty, execute S10; (3) If the total exam schedule is not empty, determine whether the maximum number of people in each time period has reached twice the maximum number of people in each time period; if so, store the last temporary exam schedule in the official exam schedule; if not, increase the maximum number of people in each time period by the number of people in the step, then go from S6 to S8, store the result in the temporary exam schedule, and then return to S9.

6. The test scheduling algorithm according to claim 1, characterized in that: In S11: 1) The formal examination list information includes the information of candidates taking the examination within the specified time period, including: examination paper number, campus, student number, session, and semester; 2) The test schedule includes campus, time period, test paper number, course name, class, venue, session, seat number, candidate's name, and student ID number.