A method, system, device and medium for improving the efficiency of college examination arrangement

Abstract

The application discloses a method, system, device and medium for improving the efficiency of college examination arrangement, wherein the method adopts the mode of matching sessions, examination rooms and invigilators to calculate the value in the relationship matrix to obtain a first relationship matrix for each course arranged by each examination arrangement personnel; the value in the relationship matrix is calculated based on the first relationship matrix, the selected course prompt times and the preset prompt number to obtain a second relationship matrix; the value in the relationship matrix is calculated based on the first relationship matrix, the current course selected prompt times and the total selected prompt times of all selected courses to obtain a third relationship matrix; the examination arrangement containing sessions, examination rooms and invigilators similar to each course in the first relationship matrix is calculated according to the second relationship matrix and the third relationship matrix; and the examination arrangement of each course is selected by performing conflict checking on each examination arrangement. The application can improve the efficiency and accuracy of examination arrangement.

Description

Technical Field

[0001] This invention relates to the field of college examination arrangement technology, and in particular to a method, system, device and medium for improving the efficiency of college examination arrangement. Background Technology

[0002] In university exam scheduling, the diversity of course exams, limited venues, specific teacher requirements, and personalized student development demands mean that automated scheduling often only fulfills a portion of the university's needs. Manual adjustments by staff are still required, including selecting suitable sessions, exam rooms, and invigilators for each exam, well into the later stages of scheduling. With these resources becoming increasingly scarce, staff must experiment extensively to successfully schedule exams for a single course. This approach leads to low efficiency and poor results in exam scheduling. Summary of the Invention

[0003] This invention aims to at least solve one of the technical problems existing in the prior art. To this end, this invention proposes a method, system, device, and medium for improving the efficiency of university examination scheduling, which can improve the efficiency and accuracy of examination scheduling.

[0004] In a first aspect, embodiments of the present invention provide a method for improving the efficiency of university examination scheduling, the method comprising:

[0005] Construct a relationship matrix between multiple exam scheduling personnel and courses;

[0006] For each course arranged by each examination scheduler, the values ​​in the relation matrix are calculated by matching the session, examination room, and invigilation, thus obtaining the first relation matrix;

[0007] For each course arranged by each exam scheduler, the values ​​in the relation matrix are calculated based on the first relation matrix, the number of times the course is selected as a prompt, and the preset number of prompts to obtain the second relation matrix;

[0008] For each course arranged by each exam scheduler, the values ​​in the relation matrix are calculated based on the first relation matrix, the number of times the current course is selected, and the total number of times all selected courses are selected, to obtain the third relation matrix;

[0009] Based on the second relation matrix and the third relation matrix, calculate multiple exam arrangements that are similar to each course in the first relation matrix, including session, exam room and invigilation;

[0010] A conflict check is performed on each of the aforementioned exam schedules to select the exam schedule for each course.

[0011] Compared with the prior art, the first aspect of the present invention has the following beneficial effects:

[0012] This method calculates the values ​​in the relation matrix for each course arranged by each exam scheduler by matching session, exam room, and invigilator, resulting in a first relation matrix. This method improves the accuracy of exam scheduling. For each course arranged by each exam scheduler, the second relation matrix is ​​obtained by calculating the values ​​in the relation matrix based on the first relation matrix, the number of times the course has been selected, and the preset number of prompts. Finally, for each course arranged by each exam scheduler, the second relation matrix is ​​calculated based on the first relation matrix, the number of times the current course has been selected, and the total number of times all selected courses have been selected. The values ​​in the relation matrix are calculated to obtain the third relation matrix. This matrix considers the matching of sessions, examination rooms, and invigilators, while also taking into account the accuracy of the real-time feedback from exam schedulers to the suggested courses, thus improving the accuracy of exam scheduling. Based on the second and third relation matrices, multiple exam schedules containing sessions, examination rooms, and invigilators that are similar to each course in the first relation matrix are calculated. Conflict checks are performed on each exam schedule to select the appropriate schedule for each course. Conflict checks further improve the accuracy of exam scheduling and directly obtain the exam schedule for each course without the need for iterative manual adjustments, thereby improving the efficiency of exam scheduling.

[0013] According to some embodiments of the present invention, the values ​​in the relationship matrix are calculated by matching session number, examination room, and invigilator in the following manner:

[0014]

[0015] Where t represents the examination scheduling personnel in the first column of the first relation matrix, t i Let c represent the personnel responsible for arranging the i-th exam, and c represent the course in the first row of the first relation matrix. i Let represent the i-th course, count(t,c) represent the number of times the exam scheduler and course appear simultaneously, w represent the preset reward weight, α represent any one of the following: perfect match, exam room and invigilator, match, exam room and invigilator, match, exam room and invigilator, match, and match invigilator. check represents the weighted matching of each course scheduled for each staff member based on α and w.

[0016] According to some embodiments of the present invention, the values ​​in the relationship matrix are calculated based on the first relationship matrix, the number of times the course is selected as a prompt, and the preset number of prompts in the following manner:

[0017]

[0018] Where l represents the first l prompts, F1 represents the value in the second relation matrix, R(x,N) represents the ratio of the number of times the course is selected to the number of preset prompts, and F(t,c) represents the value in the first relation matrix.

[0019] According to some embodiments of the present invention, the values ​​in the relation matrix are calculated based on the first relation matrix, the number of times the current course has been selected, and the total number of times all selected courses have been selected, in the following manner:

[0020]

[0021] Where l represents the previous l prompts, F2 represents the value in the third relation matrix, se(c) represents the number of times the current course has been selected, and se(all) represents the number of times the course has been selected. y ) represents the total number of times all selected courses are prompted for the y-th prompt, and F(t,c) represents the value in the first relation matrix.

[0022] According to some embodiments of the present invention, multiple exam schedules that are similar to each course in the first relation matrix are calculated in the following manner:

[0023]

[0024] Among them, F m Represents the F1 function or the F2 function, max(F m ) indicates taking the maximum value of either the F1 or F2 function, α m denoted by weight, and N represents the number of multiple exam arrangements that are similar to each course in the first relation matrix.

[0025] According to some embodiments of the present invention, the weights are calculated in the following manner:

[0026] α m =α m-1 +θr

[0027] Where, α m-1 θ represents the weight of the previous step, θ represents a constant coefficient, and r represents whether the current prompt has been selected by the user. If the current prompt has been selected, r is 1; if the current prompt has not been selected, r is 0.

[0028] According to some embodiments of the present invention, the conflict checking of each of the examination schedules to select an examination schedule for each course includes:

[0029] Conflict constraints are used to perform conflict checks on each of the exam arrangements, including the session, exam room, and invigilator, resulting in multiple check results.

[0030] Select the corresponding exam schedule for each course from the multiple test results.

[0031] Secondly, embodiments of the present invention also provide a system for improving the efficiency of university examination scheduling, the system comprising:

[0032] A matrix building unit, used to construct a matrix showing the relationship between multiple exam scheduling personnel and courses;

[0033] The first calculation unit is used to calculate the value in the relation matrix for each course arranged by each examination arranger, by matching the session, examination room and invigilation, to obtain the first relation matrix;

[0034] The second calculation unit is used to calculate the value in the relationship matrix for each course arranged by each examination scheduler, based on the first relationship matrix, the number of times the course is selected as a prompt, and the preset number of prompts, to obtain the second relationship matrix.

[0035] The third calculation unit is used to calculate the value in the relation matrix for each course arranged by each examination scheduler, based on the first relation matrix, the number of times the current course is selected, and the total number of times all selected courses are selected, to obtain the third relation matrix.

[0036] The fourth calculation unit is used to calculate, based on the second relation matrix and the third relation matrix, multiple examination arrangements containing sessions, examination rooms and invigilators that are similar to each course in the first relation matrix;

[0037] An examination scheduling unit is used to perform conflict checks on each of the aforementioned examination schedules in order to select the examination schedule for each course.

[0038] Thirdly, embodiments of the present invention also provide a device for improving the efficiency of college examination scheduling, including at least one control processor and a memory for communicatively connecting to the at least one control processor; the memory stores instructions executable by the at least one control processor, the instructions being executed by the at least one control processor to enable the at least one control processor to perform a method for improving the efficiency of college examination scheduling as described above.

[0039] Fourthly, embodiments of the present invention also provide a computer-readable storage medium storing computer-executable instructions for causing a computer to execute a method for improving the efficiency of college examination scheduling as described above.

[0040] It is understood that the beneficial effects of the second to fourth aspects compared with the related technologies are the same as the beneficial effects of the first aspect compared with the related technologies. Please refer to the relevant description in the first aspect above, which will not be repeated here. Attached Figure Description

[0041] The above and / or additional aspects and advantages of the present invention will become apparent and readily understood from the description of the embodiments taken in conjunction with the following drawings, in which:

[0042] Figure 1 This is a flowchart illustrating a method for improving the efficiency of college exam scheduling according to an embodiment of the present invention;

[0043] Figure 2 This is a flowchart of another embodiment of the method for improving the efficiency of college examination scheduling according to the present invention;

[0044] Figure 3 This is a structural diagram of a system for improving the efficiency of college exam scheduling according to an embodiment of the present invention;

[0045] Figure 4 This is a schematic diagram of the structure of an electronic device according to an embodiment of the present invention. Detailed Implementation

[0046] Embodiments of the present invention are described in detail below. Examples of these embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, and should not be construed as limiting the present invention.

[0047] In the description of this invention, the use of terms such as "first," "second," etc., is for the purpose of distinguishing technical features only and should not be construed as indicating or implying relative importance, or implicitly indicating the number of technical features indicated, or implicitly indicating the order of the technical features indicated.

[0048] In the description of this invention, it should be understood that the orientation descriptions, such as up, down, etc., are based on the orientation or positional relationship shown in the drawings and are only for the convenience of describing this invention and simplifying the description, and are not intended to indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation, and therefore should not be construed as a limitation of this invention.

[0049] In the description of this invention, it should be noted that, unless otherwise explicitly defined, terms such as "setting," "installation," and "connection" should be interpreted broadly, and those skilled in the art can reasonably determine the specific meaning of the above terms in this invention in conjunction with the specific content of the technical solution.

[0050] In university exam scheduling, the diversity of course exams, limited venues, specific teacher requirements, and personalized student development demands mean that automated scheduling often only fulfills a portion of the university's needs. Manual adjustments by staff are still required, including selecting suitable sessions, exam rooms, and invigilators for each exam, well into the later stages of scheduling. With these resources becoming increasingly scarce, staff must experiment extensively to successfully schedule exams for a single course. This approach leads to low efficiency and poor results in exam scheduling.

[0051] To address the aforementioned problems, this invention calculates the values ​​in the relation matrix for each course arranged by each exam scheduler using a matching method involving session, exam room, and invigilation, resulting in a first relation matrix. This matching method improves the accuracy of exam scheduling. For each course arranged by each exam scheduler, the invention calculates the values ​​in the relation matrix based on the first relation matrix, the number of times the course has been selected, and the preset number of prompts, resulting in a second relation matrix. Finally, for each course arranged by each exam scheduler, the invention calculates the values ​​in the relation matrix based on the first relation matrix, the number of times the current course has been selected, and the selection prompts for all selected courses. The total number of calculations in the relation matrix yields a third relation matrix. This third matrix considers the matching of sessions, examination rooms, and invigilators, while also taking into account the accuracy of the real-time feedback from exam schedulers to the suggested courses, thus improving the accuracy of exam scheduling. Based on the second and third relation matrices, multiple exam schedules containing sessions, examination rooms, and invigilators that are similar to each course in the first relation matrix are calculated. Conflict checks are performed on each exam schedule to select the appropriate exam schedule for each course. Through conflict checks, the accuracy of exam scheduling can be further improved, and the exam schedule for each course can be obtained directly without the need for iterative manual adjustments, thereby improving the efficiency of exam scheduling.

[0052] Reference Figure 1 This invention provides a method for improving the efficiency of university exam scheduling. This method includes, but is not limited to, steps S100 to S600, wherein:

[0053] Step S100: Construct a relationship matrix between multiple exam scheduling personnel and courses;

[0054] Step S200: For each course arranged by each examination scheduler, calculate the values ​​in the relation matrix by matching session, examination room and invigilator to obtain the first relation matrix;

[0055] Step S300: For each course arranged by each exam scheduler, calculate the values ​​in the relation matrix based on the first relation matrix, the number of times the course was selected as a prompt, and the preset number of prompts to obtain the second relation matrix;

[0056] Step S400: For each course arranged by each exam scheduler, calculate the value in the relation matrix based on the first relation matrix, the number of times the current course has been selected, and the total number of times all selected courses have been selected, to obtain the third relation matrix;

[0057] Step S500: Based on the second relation matrix and the third relation matrix, calculate multiple exam arrangements that are similar to each course in the first relation matrix, including session, exam room and invigilator.

[0058] Step S600: Perform a conflict check on each exam schedule to select the exam schedule for each course.

[0059] In this embodiment, to improve the accuracy of exam scheduling, multiple relationship matrices between exam schedulers and courses are constructed. For each course scheduled by each exam scheduler, the values ​​in the relationship matrix are calculated by matching sessions, exam rooms, and invigilators to obtain a first relationship matrix. For each course scheduled by each exam scheduler, the values ​​in the relationship matrix are calculated based on the first relationship matrix, the number of times the course has been selected, and the preset number of prompts to obtain a second relationship matrix. For each course scheduled by each exam scheduler, the values ​​in the relationship matrix are calculated based on the first relationship matrix, the number of times the current course has been selected, and the total number of times all selected courses have been selected to obtain a third relationship matrix. To improve the efficiency of exam scheduling, this embodiment calculates multiple exam arrangements containing sessions, exam rooms, and invigilators that are close to each course in the first relationship matrix based on the second and third relationship matrices. Conflict checks are performed on each exam arrangement to select the exam arrangement for each course.

[0060] In some embodiments, the values ​​in the relation matrix are calculated by matching session number, examination room, and invigilator as follows:

[0061]

[0062] Where t represents the examination scheduling personnel in the first column of the first relation matrix, t i Let c represent the personnel responsible for arranging the i-th exam, and c represent the course in the first row of the first relation matrix. i Let represent the i-th course, count(t,c) represent the number of times the exam scheduler and course appear simultaneously, w represent the preset reward weight, α represent any one of the following: perfect match, exam room and invigilator, match, exam room and invigilator, match, exam room and invigilator, match, and match invigilator. check represents the weighted matching of each course scheduled for each staff member based on α and w.

[0063] In this embodiment, considering the repetitive nature of course exam arrangements each semester, the accuracy of exam arrangements can be improved by analyzing the staff's past arrangements and calculating the matching effect from the perspectives of session, exam room, and invigilation.

[0064] In some embodiments, the values ​​in the relation matrix are calculated based on the first relation matrix, the number of times the course is selected as a prompt, and the preset number of prompts, in the following manner:

[0065]

[0066] Where l represents the first l prompts, F1 represents the value in the second relation matrix, R(x,N) represents the ratio of the number of times the course is selected to the number of preset prompts, and F(t,c) represents the value in the first relation matrix.

[0067] In this embodiment, in addition to considering the matching of session, examination room, and invigilator's perspective, the number of times the course is selected and the number of preset prompts are also taken into account, in order to prepare for a more accurate matching next time and improve the accuracy of the examination arrangement.

[0068] In some embodiments, the values ​​in the relation matrix are calculated based on the first relation matrix, the number of times the current course has been selected, and the total number of times all selected courses have been selected, in the following manner:

[0069]

[0070] Where l represents the previous l prompts, F2 represents the value in the third relation matrix, se(c) represents the number of times the current course has been selected, and se(all) represents the number of times the course has been selected. y Let F(t,c) represent the total number of times all selected courses are prompted for the y-th prompt, and let F(t,c) represent the value in the first relation matrix.

[0071] In this embodiment, in addition to considering the matching of session, examination room, and invigilator's perspective, the number of times the current course is selected and the total number of times all selected courses are selected are also considered, in order to prepare for a more accurate matching next time and improve the accuracy of exam scheduling.

[0072] In some embodiments, multiple exam schedules that are close to each course in the first relation matrix are calculated as follows:

[0073]

[0074] Among them, F m Represents the F1 function or the F2 function, max(F m ) indicates taking the maximum value of either the F1 or F2 function, α m represents the weight, and N represents the number of multiple exam arrangements that are similar to each course in the first relation matrix.

[0075] In this embodiment, by calculating multiple exam schedules that are similar to each course in the first relation matrix, the efficiency of exam scheduling can be improved without the need for cyclical manual adjustments.

[0076] In some embodiments, the weights are calculated as follows:

[0077] α m =α m-1 +θr

[0078] Where, α m-1 θ represents the weight of the previous step, θ represents a constant coefficient, and r represents whether the current prompt has been selected by the user. If the current prompt has been selected, r is 1; if the current prompt has not been selected, r is 0.

[0079] In some embodiments, a conflict check is performed on each exam schedule to select an exam schedule for each course, including:

[0080] Conflict constraints are used to perform conflict checks on each exam session, exam room, and invigilator, resulting in multiple check results;

[0081] Select the appropriate exam schedule for each course from the multiple test results.

[0082] In this embodiment, a conflict check is performed on each exam schedule to select the exam schedule for each course. Conflict checks can further improve the accuracy of exam schedules.

[0083] To facilitate understanding by those skilled in the art, a set of preferred embodiments is provided below:

[0084] This embodiment considers the repetitiveness of course exam arrangements each semester, analyzes past staff scheduling practices, and calculates matching effects from the perspectives of session number, exam room, and invigilation. It also considers the accuracy of staff's real-time feedback on suggested options to prepare for the next round of prompts. By more closely aligning with staff's requirements, the course exam scheduling process can be completed quickly. (Refer to...) Figure 2 The method in this embodiment specifically includes the following steps:

[0085] 1. Parameter settings.

[0086] Define multiple relationship matrices M1, M2, and M3 between exam schedulers and courses; define a preset reward weight w, with a default value of [1, 0.6, 0.4, 0.3, 0.3, 0.2, 0.2]; define the number of prompts N, with a default value of 6.

[0087] 2. Data weight calculation model.

[0088] Initialize each row and column value in the first relation matrix M1 using the following function:

[0089]

[0090] Where t represents the examination scheduling personnel in the first column of the first relation matrix, t i Let c represent the personnel responsible for arranging the i-th exam, and c represent the course in the first row of the first relation matrix. i Let represent the i-th course, count(t,c) represent the number of times the exam scheduler and course appear simultaneously, w represent the preset reward weight, α represent any one of the following: perfect match, exam room and invigilator, match, exam room and invigilator, match, exam room and invigilator, match, and match invigilator. check represents the weighted matching of each course scheduled for each staff member based on α and w. When F(t,c) returns 0, its value is 0.01.

[0091] Initialize each row and column value in the second relation matrix M2 using the following function:

[0092]

[0093] Where l represents the first l prompts, the default value of l is 5, F1 represents the value in the second relation matrix, when the return value of F1 is 0, the value is 0.001, R(x,N) represents the ratio of the number of times the course is selected to the number of preset prompts, and F(t,c) represents the value in the first relation matrix.

[0094] Initialize each row and column value in the third relation matrix M3 using the following function:

[0095]

[0096] Where l represents the previous l prompts, F2 represents the value in the third relation matrix, when F2 returns 0, the value is 0.001, se(c) represents the number of times the current course has been selected, and se(all y Let F(t,c) represent the total number of times all selected courses are prompted for the y-th prompt, and let F(t,c) represent the value in the first relation matrix.

[0097] 3. Real-time computing model.

[0098] When a staff member manually assigns an exam task, this embodiment calculates the N closest exam arrangement records (including session, exam room, and invigilator) for each course in M1 based on the exam scheduler and the selected course. The N exam arrangement records requiring prompts are then calculated using the following function:

[0099]

[0100] Among them, F m Represents the F1 function or the F2 function, max(F m ) represents taking the maximum value of either the F1 or F2 function, N represents the number of multiple exam arrangements that are similar to each course in the first relation matrix, and α m Represents the weight, α m The initial value is 0.001, and it iterates automatically with each prompt. The iteration formula is as follows:

[0101] α m =α m-1 +θr

[0102] Where, α m-1 The previous weight is represented by θ, which is a constant coefficient with a value of 0.001. r indicates whether the current prompt has been selected by the user; if selected, r is 1, and if not, r is 0. After each prompt, when the user selects an exam schedule record from the prompt, the selected session, exam room, and invigilator are quickly identified, and a basic conflict check is performed. After the selected exam schedule record is successfully saved, M1, M2, and M3 are updated to prepare for the next prompt.

[0103] It should be noted that the default values ​​in this embodiment can be changed according to the actual situation, and this embodiment does not impose any specific limitations.

[0104] In this embodiment, firstly, the repetitiveness of course exam arrangements each semester is considered, providing a data foundation for the model's execution; secondly, by matching the effect of sessions, exam rooms, and invigilator perspectives, and through real-time feedback from staff regarding prompts, preparation is made for more accurate matching in the next iteration; and thirdly, it better aligns with the work requirements of staff, improving satisfaction and the rationality of the arrangements. After trials in universities, the exam scheduling efficiency of this embodiment's method, compared to the traditional method of trying each exam one by one, significantly reduces the time required to complete each exam to be scheduled.

[0105] Reference Figure 3 This invention also provides a system for improving the efficiency of university exam scheduling. This system includes a matrix construction unit 100, a first calculation unit 200, a second calculation unit 300, a third calculation unit 400, a fourth calculation unit 500, and an exam scheduling unit 600, wherein:

[0106] Matrix building unit 100 is used to build multiple relationship matrices between exam scheduling personnel and courses;

[0107] The first calculation unit 200 is used to calculate the values ​​in the relation matrix for each course arranged by each examination arranger, by matching the session, examination room and invigilation, and to obtain the first relation matrix.

[0108] The second calculation unit 300 is used to calculate the values ​​in the relation matrix for each course arranged by each examination arranger, based on the first relation matrix, the number of times the course is selected as a prompt, and the number of preset prompts, to obtain the second relation matrix;

[0109] The third calculation unit 400 is used to calculate the value in the relation matrix for each course arranged by each examination scheduler, based on the first relation matrix, the number of times the current course has been selected, and the total number of times all selected courses have been selected, to obtain the third relation matrix;

[0110] The fourth calculation unit 500 is used to calculate multiple exam arrangements, including sessions, exam rooms, and invigilators, that are similar to each course in the first relation matrix, based on the second relation matrix and the third relation matrix.

[0111] Exam scheduling unit 600 is used to perform conflict checks on each exam schedule in order to select the exam schedule for each course.

[0112] It should be noted that since the system for improving the efficiency of college exam scheduling in this embodiment and the method for improving the efficiency of college exam scheduling described above are based on the same inventive concept, the corresponding content in the method embodiment is also applicable to this system embodiment, and will not be described in detail here.

[0113] Reference Figure 4 This application also provides a device for improving the efficiency of university exam scheduling. This device includes:

[0114] At least one memory;

[0115] At least one processor;

[0116] At least one program;

[0117] The program is stored in memory, and the processor executes at least one program to implement the method described above for improving the efficiency of college examination scheduling.

[0118] This electronic device can be any smart terminal, including mobile phones, tablets, personal digital assistants (PDAs), and in-vehicle computers.

[0119] The electronic devices according to embodiments of this application will now be described in detail.

[0120] The processor 1600 can be implemented using a general-purpose central processing unit (CPU), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this disclosure.

[0121] The memory 1700 can be implemented as a read-only memory (ROM), static storage device, dynamic storage device, or random access memory (RAM). The memory 1700 can store the operating system and other application programs. When the technical solutions provided in the embodiments of this specification are implemented through software or firmware, the relevant program code is stored in the memory 1700 and is called and executed by the processor 1600 to execute the method for improving the efficiency of college examination scheduling according to the embodiments of this disclosure.

[0122] The input / output interface 1800 is used to implement information input and output.

[0123] The communication interface 1900 is used to enable communication and interaction between this device and other devices. Communication can be achieved through wired means (such as USB, Ethernet cable, etc.) or wireless means (such as mobile network, WIFI, Bluetooth, etc.).

[0124] Bus 2000 transmits information between various components of the device (e.g., processor 1600, memory 1700, input / output interface 1800, and communication interface 1900);

[0125] The processor 1600, memory 1700, input / output interface 1800 and communication interface 1900 are connected to each other within the device via bus 2000.

[0126] This disclosure also provides a storage medium, which is a computer-readable storage medium storing computer-executable instructions for causing a computer to perform the above-described method for improving the efficiency of college examination scheduling.

[0127] Memory, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs and non-transitory computer-executable programs. Furthermore, memory may include high-speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid-state storage device. In some embodiments, memory may optionally include memory remotely located relative to the processor, and these remote memories can be connected to the processor via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

[0128] The embodiments described in this disclosure are for the purpose of more clearly illustrating the technical solutions of this disclosure and do not constitute a limitation on the technical solutions provided by this disclosure. As those skilled in the art will know, with the evolution of technology and the emergence of new application scenarios, the technical solutions provided by this disclosure are also applicable to similar technical problems.

[0129] Those skilled in the art will understand that the technical solutions shown in the figures do not constitute a limitation on the embodiments of this disclosure, and may include more or fewer steps than shown, or combine certain steps, or different steps.

[0130] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs.

[0131] Those skilled in the art will understand that all or some of the steps in the methods disclosed above, as well as the functional modules / units in the systems and devices, can be implemented as software, firmware, hardware, or suitable combinations thereof.

[0132] The terms “first,” “second,” “third,” “fourth,” etc. (if present) in the specification and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of this application described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms “comprising” and “having,” and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0133] It should be understood that in this application, "at least one (item)" means one or more, and "more than" means two or more. "And / or" is used to describe the relationship between related objects, indicating that three relationships can exist. For example, "A and / or B" can represent three cases: only A exists, only B exists, and both A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one (item) of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one (item) of a, b, or c can represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple.

[0134] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0135] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0136] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0137] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes multiple instructions to cause an electronic device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of this application. The aforementioned storage medium includes various media capable of storing programs, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks. The embodiments of this application have been described in detail above with reference to the accompanying drawings, but this application is not limited to the above embodiments. Various changes can be made within the scope of knowledge possessed by those skilled in the art without departing from the spirit of this application.

Claims

1. A method for improving the efficiency of college examination scheduling, characterized in that, The methods for improving the efficiency of university exam scheduling include: Construct a relationship matrix between multiple exam scheduling personnel and courses; For each course arranged by each exam scheduler, the values ​​in the relation matrix are calculated by matching session, exam room, and invigilator, resulting in a first relation matrix, which includes: in, This represents the examination scheduling personnel in the first column of the first relation matrix. Indicates the first One of the exam arrangement personnel, This represents the courses in the first row of the first relation matrix. Indicates the first A course, This indicates the number of times that exam schedulers and courses appear together. This indicates the preset reward weight. This indicates a perfect match for any one of the following: session, exam room and invigilator; match session and exam room; match session and invigilator; match exam room and invigilator; match session; match exam room; and match invigilator. This indicates that each course arranged for each staff member is based on and Perform weight matching; For each course arranged by each exam scheduler, the values ​​in the relation matrix are calculated based on the first relation matrix, the number of times the course was selected, and the preset number of prompts to obtain a second relation matrix, including: in, Indicates the preceding This is a reminder. This represents the value in the second relation matrix. This indicates the ratio of the number of times a course is selected for a prompt to the number of preset prompts. This represents the value in the first relation matrix; For each course arranged by each exam scheduler, the values ​​in the relation matrix are calculated based on the first relation matrix, the number of times the current course has been selected, and the total number of times all selected courses have been selected, to obtain a third relation matrix, which includes: in, Indicates the preceding This is a reminder. This represents the value in the third relation matrix. This indicates the number of times the current course has been selected. Indicates the first The total number of times each of the selected courses is selected. This represents the value in the first relation matrix; Based on the second relation matrix and the third relation matrix, calculate multiple exam arrangements, including sessions, exam rooms, and invigilators, that are similar to each course in the first relation matrix, including: in, This represents either the second relation matrix or the third relation matrix. This indicates taking the maximum value from either the second or the third relation matrix. Indicates weight, This represents the number of multiple exam arrangements that are similar to each course in the first relation matrix; A conflict check is performed on each of the aforementioned exam schedules to select the exam schedule for each course.

2. The method for improving the efficiency of college examination scheduling according to claim 1, characterized in that, The weights are calculated as follows: in, This indicates the weight from the previous iteration. Indicates a constant coefficient. This indicates whether the current prompt has been selected by the user. If the current prompt has been selected, then... The value is 1; if the current prompt is not selected, then... The value is 0.

3. The method for improving the efficiency of college examination scheduling according to claim 1, characterized in that, The process of performing conflict checks on each of the aforementioned exam schedules to select the exam schedule for each course includes: Conflict constraints are used to perform conflict checks on each of the exam arrangements, including the session, exam room, and invigilator, resulting in multiple check results. Select the corresponding exam schedule for each course from the multiple test results.

4. A system for improving the efficiency of college examination scheduling, characterized in that, The system for improving the efficiency of college exam scheduling includes: A matrix building unit, used to construct a matrix showing the relationship between multiple exam scheduling personnel and courses; The first calculation unit is used to calculate the values ​​in the relation matrix for each course arranged by each exam scheduler, using a matching method of session, exam room, and invigilator, to obtain the first relation matrix, which includes: in, This represents the examination scheduling personnel in the first column of the first relation matrix. Indicates the first One of the exam arrangement personnel, This represents the courses in the first row of the first relation matrix. Indicates the first A course, This indicates the number of times that exam schedulers and courses appear together. This indicates the preset reward weight. This indicates a perfect match for any one of the following: session, exam room and invigilator; match session and exam room; match session and invigilator; match exam room and invigilator; match session; match exam room; and match invigilator. This indicates that each course arranged for each staff member is based on and Perform weight matching; The second calculation unit is used to calculate the values ​​in the relationship matrix for each course arranged by each exam scheduler, based on the first relationship matrix, the number of times the course was selected as a prompt, and the preset number of prompts, to obtain a second relationship matrix, including: in, Indicates the preceding This is a reminder. This represents the value in the second relation matrix. This indicates the ratio of the number of times a course is selected for a prompt to the number of preset prompts. This represents the value in the first relation matrix; The third calculation unit is used to calculate the values ​​in the relation matrix for each course arranged by each exam scheduler, based on the first relation matrix, the number of times the current course has been selected, and the total number of times all selected courses have been selected, to obtain a third relation matrix, including: in, Indicates the preceding This is a reminder. This represents the value in the third relation matrix. This indicates the number of times the current course has been selected. Indicates the first The total number of times each of the selected courses is selected. This represents the value in the first relation matrix; The fourth calculation unit is used to calculate, based on the second relation matrix and the third relation matrix, multiple examination arrangements containing session numbers, examination rooms, and invigilators that are similar to each course in the first relation matrix, including: in, This represents either the second relation matrix or the third relation matrix. This indicates taking the maximum value from either the second or the third relation matrix. Indicates weight, This represents the number of multiple exam arrangements that are similar to each course in the first relation matrix; An examination scheduling unit is used to perform conflict checks on each of the aforementioned examination schedules in order to select the examination schedule for each course.

5. A device for improving the efficiency of college examination scheduling, characterized in that, It includes at least one control processor and a memory for communicatively connecting to the at least one control processor; the memory stores instructions executable by the at least one control processor, which, when executed by the at least one control processor, enable the at least one control processor to perform the method for improving the efficiency of college examination scheduling as described in any one of claims 1 to 3.

6. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-executable instructions for causing a computer to perform the method for improving the efficiency of college examination scheduling as described in any one of claims 1 to 3.

Images