Quality inspection list distribution method, device and equipment

Through the automated quality inspection order allocation method, the waste and uneven resources caused by manual allocation are solved, efficient and fair distribution of quality inspection orders is achieved, and labor costs are reduced.

CN120258357APending Publication Date: 2025-07-04YUANBAO TECH (BEIJING) TECH CO LTD
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202510219883.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-02-26
Publication Date
2025-07-04

AI Technical Summary

Technical Problem

In the prior art, the allocation of quality inspection orders mainly relies on manual methods, resulting in waste of resources and uneven distribution, and increasing manual operation costs.

Method used

The automated quality inspection order allocation method is adopted. By obtaining the quality inspection order to be allocated and the allocation rules, each quality inspector is assigned to it in sequence until the first preset time is reached. Then the unassigned quality inspection orders are sorted and allocated again according to the sorting results until the total time of each quality inspector reaches the second preset time.

Benefits of technology

It improves the efficiency and fairness of quality inspection form allocation, reduces labor costs, and ensures that the total gap in quality inspection time for quality inspection personnel is small.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120258357A_ABST
    Figure CN120258357A_ABST
Patent Text Reader

Abstract

The invention provides a quality inspection list distribution method, device and equipment, and belongs to the technical field of computers, the method comprises the steps that a plurality of quality inspection lists to be distributed and distribution rules of the plurality of quality inspection lists are acquired, and the distribution rules are associated with quality inspection requirements; according to the plurality of quality inspection lists, sequentially allocating the quality inspection lists to each quality inspector until the sum of the quality inspection durations corresponding to the quality inspection lists allocated to the first quality inspector reaches a first preset duration; sorting the quality inspection orders which are not allocated in the plurality of quality inspection orders according to the allocation rule to obtain at least one target sequence, and the quality inspection duration corresponding to the quality inspection order which is ranked higher in the target sequence is shorter; and according to the arrangement sequence of the quality inspection lists in the at least one target sequence, the quality inspection lists are allocated to each quality inspector again until the sum of the quality inspection durations corresponding to the quality inspection lists allocated to each quality inspector is not less than a second preset duration, and the second preset duration is greater than the first preset duration. Therefore, the distribution efficiency and the distribution fairness of the quality inspection lists can be improved, and the labor cost is reduced.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This application belongs to the field of computer technology, and particularly relates to a quality inspection form allocation method, device, and equipment. Background Art

[0002] In practical applications, quality inspectors need to perform corresponding quality inspection work on the call situations of different personnel such as customer service to timely discover potential risks and problems during the call process. However, when allocating the content to be quality inspected at present, most use the manual allocation method, and the quality inspection form is allocated to the corresponding quality inspector through the manual operation of the quality inspection administrator. During the manual allocation process, the quality inspection management personnel need to log in to the system for allocation operations, which consumes a lot of time of the quality inspection management personnel, increases the cost of manual operations, and there may be a situation where the subjective consciousness of people intervenes and causes uneven allocation. Summary of the Invention

[0003] This application provides a quality inspection form allocation method, device, and equipment to improve the allocation efficiency and fairness of quality inspection forms and reduce labor costs.

[0004] This application provides a quality inspection form allocation method, including: Obtain a plurality of quality inspection forms to be allocated and the allocation rules of the plurality of quality inspection forms, where the allocation rules are associated with quality inspection requirements; Allocate quality inspection forms to each quality inspector in sequence according to the plurality of quality inspection forms and the allocation rules until the total quality inspection duration corresponding to the quality inspection forms allocated to the first quality inspector reaches a first preset duration; Sort the unallocated quality inspection forms among the plurality of quality inspection forms according to the allocation rules to obtain at least one target sequence, and the quality inspection duration corresponding to the quality inspection form ranked higher in the target sequence is shorter; Allocate quality inspection forms to each quality inspector again according to the arrangement order of the quality inspection forms in the at least one target sequence until the total quality inspection duration corresponding to the quality inspection forms allocated to each quality inspector is not less than a second preset duration, and the second preset duration is greater than the first preset duration.

[0005] According to the quality inspection form allocation method provided by this application, the step of allocating quality inspection forms to each quality inspector in sequence according to the plurality of quality inspection forms and the allocation rules until the total quality inspection duration corresponding to the quality inspection forms allocated to the first quality inspector reaches a first preset duration includes: obtaining the allocation rules; dividing the plurality of quality inspection forms into at least one quality inspection form set according to the allocation rules; determining the target quality inspection form set corresponding to each quality inspector from the at least one quality inspection form set; and selecting the quality inspection forms to be allocated to its corresponding quality inspector from the target quality inspection form set until the total quality inspection duration corresponding to the quality inspection forms allocated to the first quality inspector reaches a first preset duration.

[0006] According to the inspection list allocation method provided by the present application, sorting the unallocated inspection lists among the multiple inspection lists to obtain at least one target sequence includes: performing the following operations for each inspection list set in the at least one inspection list set: determining the unallocated inspection lists in the current inspection list set; sorting the unallocated inspection lists through the minimum heap algorithm to obtain the target sequence corresponding to the current inspection list set.

[0007] According to the inspection list allocation method provided by the present application, the target sequence is represented by a binary tree. Reallocating inspection lists to each inspector according to the arrangement order of the inspection lists in the at least one target sequence includes: repeatedly determining each inspector as the current inspector, and performing the following operations for each current inspector until the total inspection duration corresponding to the inspection lists allocated to each inspector is not less than a second preset duration: determining the target binary tree corresponding to the current inspector according to the allocation rule; allocating the inspection list corresponding to the vertex of the target binary tree to the current inspector.

[0008] According to the inspection list allocation method provided by the present application, after allocating the inspection list corresponding to the vertex of the target binary tree to the current inspector, the method further includes: determining whether the total inspection duration corresponding to the inspection lists allocated to all inspectors corresponding to the target binary tree is not less than the second preset duration respectively according to the allocation rule; if not, rebalancing the target binary tree according to the inspection duration of the unallocated inspection lists in the target binary tree.

[0009] According to the inspection list allocation method provided by the present application, there are multiple target binary trees. Allocating the inspection list corresponding to the vertex of the target binary tree to the current inspector includes: obtaining the reference inspection list corresponding to the vertex of each target binary tree; obtaining the inspection duration corresponding to each reference inspection list; selecting a target inspection list from the multiple reference inspection lists according to the inspection duration, where the target inspection list is the reference inspection list that makes the total inspection duration allocated to the current inspector closest to the second preset duration among the multiple reference inspection lists; allocating the target inspection list to the current inspector.

[0010] According to the inspection list allocation method provided by the present application, after reallocating inspection lists to each inspector according to the arrangement order of the inspection lists in the at least one target sequence, the method further includes: converting the voice information corresponding to the allocated inspection lists into text information; obtaining inspection rules and business rules; determining violation content according to the inspection rules and the business rules; determining whether the violation content exists in the text information; if the violation content exists, marking the text information corresponding to the violation content.

[0011] The present application also provides a quality inspection form allocation device, including: An acquisition unit, configured to acquire a plurality of quality inspection forms to be allocated and the allocation rules of the plurality of quality inspection forms, where the allocation rules are associated with quality inspection requirements; A first allocation unit, configured to allocate quality inspection forms to each quality inspector in sequence according to the plurality of quality inspection forms and the allocation rules until the total quality inspection duration corresponding to the quality inspection forms allocated to the first quality inspector reaches a first preset duration; A sorting unit, configured to sort the unallocated quality inspection forms among the plurality of quality inspection forms according to the allocation rules to obtain at least one target sequence, where the shorter the quality inspection duration corresponding to the quality inspection form ranked earlier in the target sequence; A second allocation unit, configured to allocate quality inspection forms to each quality inspector again according to the arrangement order of the quality inspection forms in the at least one target sequence until the total quality inspection duration corresponding to the quality inspection forms allocated to each quality inspector is not less than a second preset duration, and the second preset duration is greater than the first preset duration.

[0012] The present application also provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where when the processor executes the computer program, the quality inspection form allocation method as described in any one of the above is implemented.

[0013] The present application also provides a non-transitory computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the quality inspection form allocation method as described in any one of the above is implemented.

[0014] The present application also provides a computer program product, including a computer program, and when the computer program is executed by a processor, the quality inspection form allocation method as described in any one of the above is implemented.

[0015] The quality inspection form allocation method, device, and equipment provided by the embodiments of the present application first allocate quality inspection forms to each quality inspector in sequence according to a plurality of quality inspection forms to be allocated and allocation rules until the total quality inspection duration corresponding to the quality inspection forms allocated to the first quality inspector reaches a first preset duration, then sort the unallocated quality inspection forms among the plurality of quality inspection forms according to the allocation rules to obtain at least one target sequence, where the shorter the quality inspection duration corresponding to the quality inspection form ranked earlier in the target sequence, and finally allocate quality inspection forms to each quality inspector again according to the arrangement order of the quality inspection forms in the at least one target sequence until the total quality inspection duration corresponding to the quality inspection forms allocated to each quality inspector is not less than a second preset duration. This can automatically allocate the quality inspection forms to be allocated, reduce labor costs, and improve allocation efficiency. Moreover, it can improve the fairness during the allocation of quality inspection forms, making the difference in the total quality inspection duration allocated to quality inspection personnel small. Description of the Drawings

[0016] To more clearly illustrate the technical solutions in the present invention or the prior art, the following will briefly introduce the accompanying drawings required for use in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are some embodiments of the present invention. For those of ordinary skill in the art, without creative efforts, other accompanying drawings can also be obtained based on these drawings.

[0017] Figure 1 It is a schematic flowchart of a quality inspection form allocation method provided by an embodiment of the present application.

[0018] Figure 2 It is a schematic diagram of a target sequence provided by an embodiment of the present application.

[0019] Figure 3 It is a schematic structural diagram of a quality inspection form allocation device provided by an embodiment of the present application.

[0020] Figure 4 It is a schematic structural diagram of an electronic device provided by the present application. Specific Embodiments

[0021] To make the objectives, technical solutions, and advantages of the present invention clearer, the following will clearly and completely describe the technical solutions in the present invention with reference to the accompanying drawings in the present invention. Obviously, the described embodiments are some, but not all, of the embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts fall within the protection scope of the present invention.

[0022] The terms "first", "second", etc. in the specification and claims of the present application and the above accompanying drawings are used to distinguish different objects, rather than to describe a specific order. In addition, the terms "include" and "have" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or device that includes a series of steps or units is not limited to the listed steps or units, but optionally further includes steps or units not listed, or optionally further includes other steps or units inherent to these processes, methods, products, or devices.

[0023] Referring to "embodiments" herein means that a specific feature, structure, or characteristic described in connection with the embodiments can be included in at least one embodiment of the present application. The phrase appears in various places in the specification and does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment mutually exclusive with other embodiments. Those skilled in the art will explicitly and implicitly understand that the embodiments described herein can be combined with other embodiments.

[0024] Currently, when allocating the content to be quality inspected, the manual allocation method is mostly adopted. The quality inspection form is allocated to the corresponding quality inspector through the manual operation of the quality inspection administrator, which wastes human resources and there is an uneven distribution situation.

[0025] In view of the above problems, the embodiments of the present application provide a method, device and equipment for allocating quality inspection forms. The embodiments of the present application will be introduced in detail below with reference to the accompanying drawings.

[0026] Please refer to Figure 1 , Figure 1 which is a schematic flowchart of a method for allocating quality inspection forms provided by the embodiments of the present application. The method for allocating quality inspection forms includes the following steps.

[0027] S101, obtain a plurality of quality inspection forms to be allocated and the allocation rules of the plurality of quality inspection forms, where the allocation rules are associated with quality inspection requirements.

[0028] Among them, each quality inspection form corresponds to call data, and the call data includes call duration. At the same time, each quality inspection form also corresponds to a seat and a quality inspection form type. For example, the quality inspection form type corresponding to a quality inspection form is a sales type or an after-sales type, etc., and a seat corresponds to a customer service staff, etc.

[0029] In specific implementation, the allocation rules can indicate different dimensions according to quality inspection requirements. For example, when formulating allocation rules based on the quality inspection duration dimension, the quality inspection requirement at this time is to fairly allocate quality inspection forms to all quality inspectors, that is, the allocation rule is that the difference in quality inspection duration between quality inspectors is less than a preset difference. For example, when formulating allocation rules based on both the quality inspection duration dimension and the quality inspection form type dimension at the same time, the corresponding quality inspection requirement is to fairly allocate quality inspection forms to all quality inspectors, and quality inspection forms of the same type are allocated to specific persons. For example, quality inspection forms of the same type are allocated by the same person. Then the allocation rule is that the difference in quality inspection duration between quality inspectors is less than a preset difference, and quality inspection forms of the same type are allocated to the same quality inspector. It is also possible to formulate allocation rules based on the quality inspection duration dimension, the quality inspection form type dimension and the seat dimension at the same time. Then the corresponding quality inspection requirement is to fairly allocate quality inspection forms to all quality inspectors, and quality inspection forms of the same type and the same seat are allocated to specific persons. For example, quality inspection forms of the same type and the same seat are allocated to the same person. Then the corresponding allocation rule is that the difference in quality inspection duration between quality inspectors is less than a preset difference, and quality inspection forms of the same type and the same seat are allocated to the same quality inspector.

[0030] S102, allocate quality inspection forms to each quality inspector in turn according to the plurality of quality inspection forms and the allocation rules until the total quality inspection duration of the quality inspection forms allocated to the first quality inspector reaches a first preset duration.

[0031] Among them, first determine the assignable quality inspection orders corresponding to each quality inspector based on the assignment rules, and then randomly select quality inspection orders from the corresponding assignable quality inspection orders and assign them to the corresponding quality inspectors. When assigning quality inspection orders, the following operations can be performed for each quality inspector: randomly select multiple quality inspection orders from the assignable quality inspection orders that have not been assigned, so that the total quality inspection duration corresponding to the quality inspection orders assigned to the current quality inspector reaches the first preset duration, and then determine the next quality inspector as the current quality inspector until the total quality inspection duration corresponding to each quality inspector reaches the first preset duration. Or when assigning quality inspection orders, it can also be to randomly select one quality inspection order from the corresponding assignable quality inspection orders and assign it to each quality inspector in turn, and then end after the total quality inspection duration assigned to the first quality inspector reaches the first preset duration.

[0032] In specific implementation, the first preset duration can be associated with the total quality inspection duration of multiple quality inspection orders. For example, the first preset duration is 80% of the total quality inspection duration. Or the first preset duration can also be associated with the total quality inspection duration that each quality inspector needs to be assigned. For example, if the total quality inspection duration that quality inspector B needs to perform quality inspection is 200 minutes, then the first preset duration can be 160 minutes. In particular, the first preset duration can also be associated with the second preset duration, that is, the first preset duration is less than the second preset duration. For example, the first preset duration is 80% of the second preset duration.

[0033] S103. Sort the unassigned quality inspection orders among the multiple quality inspection orders according to the assignment rules to obtain at least one target sequence, and the quality inspection duration corresponding to the quality inspection order with a more forward sort order in the target sequence is shorter.

[0034] Among them, when sorting, it can be sorted in ascending order based on the quality inspection duration corresponding to the quality inspection order to obtain at least one target sequence. In specific implementation, the unassigned quality inspection orders among the multiple quality inspection orders can be sorted to obtain a target sequence. Or the unassigned quality inspection orders among the multiple quality inspection orders can be sorted to obtain at least one target sequence, and the types of quality inspection orders included in each target sequence are the same. Or the unassigned quality inspection orders among the multiple quality inspection orders can be sorted to obtain at least one target sequence, and the types of quality inspection orders included in each target sequence are the same and the corresponding seats are also the same.

[0035] S104. Reassign quality inspection orders to each quality inspector according to the arrangement order of the quality inspection orders in the at least one target sequence until the total quality inspection duration corresponding to the quality inspection orders assigned to each quality inspector is not less than the second preset duration, and the second preset duration is greater than the first preset duration.

[0036] Among them, when allocating quality inspection forms to each quality inspector in sequence, the quality inspection form ranked at the forefront in the target sequence is preferentially allocated to the corresponding quality inspector. When the total quality inspection duration corresponding to one of the quality inspectors is not less than the second preset duration, the allocation of quality inspection forms to this quality inspector is stopped. The second preset duration can be determined based on the requirements of each quality inspector. For example, if the total quality inspection duration required by this quality inspector is 200 minutes, then the second preset duration is 200 minutes. Or based on the total quality inspection duration of multiple quality inspection forms and the number of quality inspectors, it is determined that the quality inspection duration required by each quality inspector is 200 minutes, then the second preset duration can also be 200 minutes.

[0037] It can be seen that in this embodiment, first, according to the multiple quality inspection forms to be allocated and the allocation rule, quality inspection forms are allocated to each quality inspector in sequence until the total quality inspection duration corresponding to the quality inspection forms allocated to the first quality inspector reaches the first preset duration. Then, the unallocated quality inspection forms among the multiple quality inspection forms are sorted according to the allocation rule to obtain at least one target sequence. The quality inspection form ranked more forward in the target sequence has a shorter corresponding quality inspection duration. Finally, according to the arrangement order of the quality inspection forms in the at least one target sequence, quality inspection forms are allocated to each quality inspector again until the total quality inspection duration corresponding to the quality inspection forms allocated to each quality inspector is not less than the second preset duration. In this way, the quality inspection forms to be allocated can be automatically allocated, reducing labor costs and improving the allocation efficiency. Moreover, it can improve the fairness during the allocation of quality inspection forms, making the difference in the total quality inspection duration allocated to quality inspection personnel small.

[0038] In a possible embodiment, the step of allocating quality inspection forms to each quality inspector in sequence according to the multiple quality inspection forms and the allocation rule until the total quality inspection duration corresponding to the quality inspection forms allocated to the first quality inspector reaches the first preset duration includes: obtaining the allocation rule; dividing the multiple quality inspection forms into at least one quality inspection form set according to the allocation rule; determining the target quality inspection form set corresponding to each quality inspector from the at least one quality inspection form set; and selecting the quality inspection form to be allocated to its corresponding quality inspector from the target quality inspection form set until the total quality inspection duration corresponding to the quality inspection forms allocated to the first quality inspector reaches the first preset duration.

[0039] Among them, the corresponding relationship between the quality inspector and the quality inspection form set can be determined based on the allocation rule, and quality inspection forms are only allocated to the quality inspector from the corresponding set. For example, quality inspector B corresponds to target quality inspection form set 1 and target quality inspection form set 2. When it comes to allocating quality inspection forms to quality inspector B, only one quality inspection form is randomly selected from target quality inspection form set 1 and target quality inspection form set 2 for allocation.

[0040] It can be seen that in this embodiment, by selecting quality inspection forms for allocation from the target quality inspection set corresponding to the quality inspector based on the allocation rule, the allocation fairness and allocation efficiency can be improved.

[0041] In a possible embodiment, sorting the unassigned quality inspection forms among the multiple quality inspection forms to obtain at least one target sequence includes: performing the following operations for each quality inspection form set in the at least one quality inspection form set: determining the unassigned quality inspection forms in the current quality inspection form set; sorting the unassigned quality inspection forms through a min-heap algorithm to obtain the target sequence corresponding to the current quality inspection form set.

[0042] Wherein, before sorting, the remaining unassigned quality inspection forms can be divided into different quality inspection form sets based on the assignment rule, and then the quality inspection forms included in each quality inspection form set are sorted separately. In a specific implementation, the min-heap algorithm is a complete binary tree that satisfies the following two conditions: complete binary tree: except for the bottom layer, all nodes in other layers are filled, and the nodes in the bottom layer are filled from left to right in sequence. And the property of the heap: for each node, its value is less than or equal to the value of its child nodes (that is, the value of the parent node is less than or equal to the value of the child nodes). In particular, it can also include that the value of the left node is less than or the value of the right node, etc. For example Figure 2 As shown, sorting the numbers "1, 3, 5, 6, 7, 8, 9" through the min-heap algorithm can obtain Figure 2 the binary tree shown in the figure, where the value of the top vertex of the binary tree is the smallest number 1, and the value of each child node is greater than the value of its corresponding parent node.

[0043] It can be seen that in this embodiment, when using the min-heap algorithm for sorting, when there is a large amount of data to be sorted, the sorting complexity can be reduced and resource consumption can be reduced.

[0044] In a possible embodiment, the target sequence is represented by a binary tree. Reassigning the quality inspection forms to each quality inspector according to the arrangement order of the quality inspection forms in the at least one target sequence includes: repeatedly determining each quality inspector as the current quality inspector, and performing the following operations for each of the current quality inspectors until the total quality inspection duration corresponding to the quality inspection forms assigned to each quality inspector is not less than a second preset duration: determining the target binary tree corresponding to the current quality inspector according to the assignment rule; assigning the quality inspection form corresponding to the vertex of the target binary tree to the current quality inspector.

[0045] Wherein, when using the min-heap algorithm for sorting, the corresponding target sequence is a binary tree, and the quality inspection duration of the quality inspection form corresponding to the position of the top vertex, that is, the parent node, of the binary tree is the shortest. Therefore, when assigning quality inspection forms to the current quality inspector, the quality inspection form at the top vertex can be assigned to the quality inspector.

[0046] It can be seen that in this embodiment, by preferentially allocating the inspection order with the shortest inspection duration to the inspector, the total inspection duration allocated to the inspector can be made closest to the second preset duration, improving the fairness and allocation efficiency of the inspection order allocation.

[0047] In a possible embodiment, after allocating the inspection order corresponding to the vertex of the target binary tree to the current inspector, the method further includes: determining whether the total inspection duration corresponding to the inspection orders allocated to all inspectors corresponding to the target binary tree is not less than the second preset duration according to the allocation rule; if not, rebalancing the target binary tree according to the inspection duration of the unallocated inspection orders in the target binary tree.

[0048] Among them, after the inspection order of the vertex of the binary tree corresponding to a target sequence is allocated, it can be first determined whether the total inspection duration of all inspectors corresponding to the target sequence is not less than the second preset duration. If it is not less than the second preset duration, it means that the inspection orders in the target sequence will no longer be allocated, and the allocation of the target sequence ends. If there is at least one corresponding inspector whose total inspection duration is less than the second preset duration, the binary tree corresponding to the target sequence needs to be rebalanced. This rebalancing can be achieved through a sinking operation. The sinking operation includes comparing the top element of the heap (i.e., the inspection duration of the inspection order at the top vertex of the binary tree) with its child nodes, and then finding the smallest child node. If the value of this node is greater than the value of the child node, their positions are exchanged, and then this node continues to "sink" down to its new position, repeating this process until the properties of the heap are satisfied. For example, after Figure 2 the top number "2" in is allocated, after rebalancing, the number "5" will become the new vertex of this binary tree.

[0049] It can be seen that in this embodiment, by using the minimum heap algorithm for sorting, after one allocation, a new binary tree can be automatically re-obtained based on rebalancing, which can reduce the sorting complexity and resource consumption.

[0050] In a possible embodiment, there are multiple target binary trees. The step of allocating the inspection order corresponding to the vertex of the target binary tree to the current inspector includes: obtaining the reference inspection order corresponding to the vertex of each target binary tree; obtaining the inspection duration corresponding to each reference inspection order; selecting a target inspection order from the multiple reference inspection orders according to the inspection duration, where the target inspection order is the reference inspection order that makes the total inspection duration allocated to the current inspector closest to the second preset duration among the multiple reference inspection orders; and allocating the target inspection order to the current inspector.

[0051] Among them, when a quality inspector corresponds to multiple target sequences, that is, in one assignment, a quality inspection form can be selected from the quality inspection forms corresponding to the vertices of multiple binary trees. At this time, an optimal solution can be selected from the quality inspection forms corresponding to the vertices of multiple binary trees based on the greedy algorithm, and this optimal solution is assigned to the current quality inspector, so that the total quality inspection duration of the quality inspection forms already assigned to the current quality inspector is closest to the second preset duration. For example, if the total quality inspection duration of the quality inspection forms already assigned to the current quality inspector is still 5 minutes short of the second preset duration, and the current quality inspector corresponds to three target sequences, and the quality inspection durations of the quality inspection forms of the vertices of the binary trees corresponding to these three target sequences are 1 minute, 4 minutes, and 2 minutes respectively, then a quality inspection form with a quality inspection duration of 4 minutes can be selected based on the greedy algorithm and assigned to the current quality inspector.

[0052] It can be seen that in this embodiment, when there are multiple quality inspection forms to choose from, the quality inspection form that can make the total quality inspection duration assigned to the current quality inspector closest to the second preset duration is preferentially selected. This can improve the distribution efficiency of the quality inspection forms and ensure the fairness of the distribution.

[0053] In a possible embodiment, after re-assigning quality inspection forms to each quality inspector according to the arrangement order of the quality inspection forms in the at least one target sequence, the method further includes: converting the voice information corresponding to the assigned quality inspection form into text information; obtaining quality inspection rules and business rules; determining violation content according to the quality inspection rules and the business rules; determining whether the violation content exists in the text information; if the violation content exists, marking the text information corresponding to the violation content.

[0054] Among them, after the quality inspection form is assigned, the voice information corresponding to the quality inspection form can also be converted into text. Then, the converted text is recognized and trained through a preset model. Then, according to the key elements required for judgment and combined with the business rules, the elements are combined to identify and output the violation content corresponding to the call content. In specific implementation, target elements can be determined according to the quality inspection rules. The business rules can include the front-back order, whether there is omission, and whether there is conflict of the target elements under the current business. The violation content can be keywords or violation points. Finally, the violation content identified by the model is matched with the text information. If the violation content is hit, the text information of this part is marked. The marking method can be to bold and red-mark this part of the text information. So that when the quality inspector conducts the quality inspection of this quality inspection form, the violation content can be quickly located based on the marked content, and then it is determined whether there is a violation.

[0055] It can be seen that in this embodiment, marking the violation content after converting the quality inspection form into text can improve the work efficiency of the quality inspector and enhance the intelligence of the device.

[0056] A quality inspection form allocation device provided by the present application will be described below. The quality inspection form allocation device described below corresponds to and refers to the quality inspection form allocation method described above.

[0057] Please refer to Figure 3 , Figure 3 which is a schematic structural diagram of a quality inspection form allocation device provided by an embodiment of the present application. The quality inspection form allocation device 300 includes: an acquisition unit 301, configured to acquire a plurality of quality inspection forms to be allocated and the allocation rules of the plurality of quality inspection forms, where the allocation rules are associated with quality inspection requirements; a first allocation unit 302, configured to sequentially allocate the quality inspection forms to each quality inspector according to the plurality of quality inspection forms and the allocation rules until the total quality inspection duration corresponding to the quality inspection forms allocated to the first quality inspector reaches a first preset duration; a sorting unit 303, configured to sort the unallocated quality inspection forms among the plurality of quality inspection forms according to the allocation rules to obtain at least one target sequence, where the quality inspection form with a higher ranking in the target sequence has a shorter corresponding quality inspection duration; a second allocation unit 304, configured to allocate the quality inspection forms to each quality inspector again according to the arrangement order of the quality inspection forms in the at least one target sequence until the total quality inspection duration corresponding to the quality inspection forms allocated to each quality inspector is not less than a second preset duration, and the second preset duration is greater than the first preset duration.

[0058] In a possible embodiment, in the aspect of sequentially allocating the quality inspection forms to each quality inspector according to the plurality of quality inspection forms and the allocation rules until the total quality inspection duration corresponding to the quality inspection forms allocated to the first quality inspector reaches the first preset duration, the first allocation unit 302 is specifically configured to: acquire the allocation rules; divide the plurality of quality inspection forms into at least one quality inspection form set according to the allocation rules; determine the target quality inspection form set corresponding to each quality inspector from the at least one quality inspection form set according to the allocation rules; and select the quality inspection forms to be allocated to the corresponding quality inspector from the target quality inspection form set until the total quality inspection duration corresponding to the quality inspection forms allocated to the first quality inspector reaches the first preset duration.

[0059] In a possible embodiment, in the aspect of sorting the unallocated quality inspection forms among the plurality of quality inspection forms to obtain at least one target sequence, the sorting unit 303 is specifically configured to: perform the following operations for each quality inspection form set in the at least one quality inspection form set: determine the unallocated quality inspection forms in the current quality inspection form set; and sort the unallocated quality inspection forms through a minimum heap algorithm to obtain the target sequence corresponding to the current quality inspection form set.

[0060] In a possible embodiment, when the target sequence is represented by a binary tree, and the second allocation unit 304 re - allocates the quality inspection sheets for each quality inspector according to the arrangement order of the quality inspection sheets in the at least one target sequence, the second allocation unit 304 is specifically configured to: loop to determine each quality inspector as the current quality inspector, and perform the following operations for each of the current quality inspectors until the total quality inspection duration corresponding to the quality inspection sheets allocated to each quality inspector is not less than a second preset duration: determine the target binary tree corresponding to the current quality inspector according to the allocation rule; allocate the quality inspection sheet corresponding to the vertex of the target binary tree to the current quality inspector.

[0061] In a possible embodiment, after allocating the quality inspection sheet corresponding to the vertex of the target binary tree to the current quality inspector, the second allocation unit 304 is further configured to: determine whether the total quality inspection duration corresponding to the quality inspection sheets allocated to all the quality inspectors corresponding to the target binary tree is not less than the second preset duration respectively according to the allocation rule; if not, re - balance the target binary tree according to the quality inspection duration of the un - allocated quality inspection sheets in the target binary tree.

[0062] In a possible embodiment, there are multiple target binary trees. When allocating the quality inspection sheet corresponding to the vertex of the target binary tree to the current quality inspector, the second allocation unit 304 is specifically configured to: obtain the reference quality inspection sheet corresponding to the vertex of each target binary tree; obtain the quality inspection duration corresponding to each reference quality inspection sheet; select a target quality inspection sheet from the multiple reference quality inspection sheets according to the quality inspection duration, where the target quality inspection sheet is the reference quality inspection sheet that makes the total quality inspection duration allocated to the current quality inspector closest to the second preset duration; allocate the target quality inspection sheet to the current quality inspector.

[0063] In a possible embodiment, the quality inspection sheet allocation device 300 further includes a marking unit. After re - allocating the quality inspection sheets for each quality inspector according to the arrangement order of the quality inspection sheets in the at least one target sequence, the marking unit is specifically configured to: convert the voice information corresponding to the allocated quality inspection sheets into text information; obtain the quality inspection rules and business rules; determine the non - compliant content according to the quality inspection rules and the business rules; determine whether the non - compliant content exists in the text information; if the non - compliant content exists, mark the text information corresponding to the non - compliant content.

[0064] Please refer to Figure 4 , Figure 4 which is the structural schematic diagram of the electronic device provided by this application. As Figure 4As shown, the electronic device may include: a processor 410, a communications interface 420, a memory 430, and a communication bus 440. Among them, the processor 410, the communications interface 420, and the memory 430 complete communication with each other through the communication bus 440. The processor 410 may call the logical instructions in the memory 430 to execute the quality inspection list allocation method, which includes: obtaining a plurality of quality inspection lists to be allocated and the allocation rules of the plurality of quality inspection lists, where the allocation rules are associated with quality inspection requirements; sequentially allocating the quality inspection lists to each quality inspector according to the plurality of quality inspection lists and the allocation rules until the total quality inspection duration corresponding to the quality inspection lists allocated to the first quality inspector reaches a first preset duration; sorting the unallocated quality inspection lists among the plurality of quality inspection lists according to the allocation rules to obtain at least one target sequence, where the quality inspection lists with a higher ranking in the target sequence have a shorter corresponding quality inspection duration; and reallocating the quality inspection lists to each quality inspector according to the arrangement order of the quality inspection lists in the at least one target sequence until the total quality inspection duration corresponding to the quality inspection lists allocated to each quality inspector is not less than a second preset duration, and the second preset duration is greater than the first preset duration.

[0065] In addition, when the logical instructions in the above-mentioned memory 430 can be implemented in the form of software functional units and sold or used as an independent product, they can be stored in a computer-readable storage medium. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or a part of this technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of the present invention. The foregoing storage medium includes: various media such as USB flash drives, mobile hard disks, read-only memories (ROMs), random access memories (RAMs), magnetic disks, or optical discs that can store program codes.

[0066] On the other hand, the present invention also provides a non-transitory computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, it implements the quality inspection form allocation method provided by the above-mentioned various methods. The method includes: obtaining a plurality of quality inspection forms to be allocated and the allocation rules of the plurality of quality inspection forms, where the allocation rules are associated with quality inspection requirements; sequentially allocating the quality inspection forms to each quality inspector according to the plurality of quality inspection forms and the allocation rules until the total quality inspection duration corresponding to the quality inspection forms allocated to the first quality inspector reaches a first preset duration; sorting the unallocated quality inspection forms among the plurality of quality inspection forms according to the allocation rules to obtain at least one target sequence, where the quality inspection forms with a higher ranking in the target sequence have a shorter corresponding quality inspection duration; and allocating the quality inspection forms to each quality inspector again according to the arrangement order of the quality inspection forms in the at least one target sequence until the total quality inspection duration corresponding to the quality inspection forms allocated to each quality inspector is not less than a second preset duration, and the second preset duration is greater than the first preset duration.

[0067] In another aspect, the present application also provides a computer program product, including a computer program. When the computer program is executed by a processor, it implements the quality inspection form allocation method as described in any one of the above. The method includes: obtaining a plurality of quality inspection forms to be allocated and the allocation rules of the plurality of quality inspection forms, where the allocation rules are associated with quality inspection requirements; sequentially allocating the quality inspection forms to each quality inspector according to the plurality of quality inspection forms and the allocation rules until the total quality inspection duration corresponding to the quality inspection forms allocated to the first quality inspector reaches a first preset duration; sorting the unallocated quality inspection forms among the plurality of quality inspection forms according to the allocation rules to obtain at least one target sequence, where the quality inspection forms with a higher ranking in the target sequence have a shorter corresponding quality inspection duration; and allocating the quality inspection forms to each quality inspector again according to the arrangement order of the quality inspection forms in the at least one target sequence until the total quality inspection duration corresponding to the quality inspection forms allocated to each quality inspector is not less than a second preset duration, and the second preset duration is greater than the first preset duration.

[0068] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed to multiple network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art can understand and implement it without creative efforts.

[0069] Through the description of the above embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on this understanding, the essence of the above technical solution, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0070] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and are not intended to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions described in the foregoing embodiments, or perform equivalent replacements for some of the technical features; and these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A quality inspection form allocation method, characterized in that, Including: Obtaining a plurality of quality inspection forms to be allocated and the allocation rules for the plurality of quality inspection forms, where the allocation rules are associated with quality inspection requirements; Sequentially allocating the quality inspection forms to each quality inspector according to the plurality of quality inspection forms and the allocation rules until the total quality inspection duration corresponding to the quality inspection forms allocated to the first quality inspector reaches a first preset duration; Sorting the unallocated quality inspection forms among the plurality of quality inspection forms according to the allocation rules to obtain at least one target sequence, where the quality inspection forms with a higher ranking in the target sequence have a shorter corresponding quality inspection duration; Allocating the quality inspection forms to each quality inspector again according to the arrangement order of the quality inspection forms in the at least one target sequence until the total quality inspection duration corresponding to the quality inspection forms allocated to each quality inspector is not less than a second preset duration, and the second preset duration is greater than the first preset duration.

2. The method according to claim 1, characterized in that The step of sequentially allocating the quality inspection forms to each quality inspector according to the plurality of quality inspection forms and the allocation rules until the total quality inspection duration corresponding to the quality inspection forms allocated to the first quality inspector reaches a first preset duration includes: Dividing the plurality of quality inspection forms into at least one quality inspection form set according to the allocation rules; Determining the target quality inspection form set corresponding to each quality inspector from the at least one quality inspection form set according to the allocation rules; Selecting the quality inspection forms to be allocated to its corresponding quality inspector from the target quality inspection form set until the total quality inspection duration corresponding to the quality inspection forms allocated to the first quality inspector reaches a first preset duration.

3. The method according to claim 2, wherein The step of sorting the unallocated quality inspection forms among the plurality of quality inspection forms to obtain at least one target sequence includes: Performing the following operations for each quality inspection form set in the at least one quality inspection form set: Determining the unallocated quality inspection forms in the current quality inspection form set; Sorting the unallocated quality inspection forms through a minimum heap algorithm to obtain the target sequence corresponding to the current quality inspection form set.

4. The method according to claim 3, characterized in that, The target sequence is represented by a binary tree. The step of allocating the quality inspection forms to each quality inspector again according to the arrangement order of the quality inspection forms in the at least one target sequence includes: Circularly determining each quality inspector as the current quality inspector and performing the following operations for each of the current quality inspectors until the total quality inspection duration corresponding to the quality inspection forms allocated to each quality inspector is not less than a second preset duration: Determining the target binary tree corresponding to the current quality inspector according to the allocation rules; Allocating the quality inspection form corresponding to the vertex of the target binary tree to the current quality inspector.

5. The method according to claim 4, characterized in that, After allocating the quality inspection form corresponding to the vertex of the target binary tree to the current quality inspector, the method further includes: Determining whether the total quality inspection duration corresponding to the quality inspection forms allocated to all quality inspectors corresponding to the target binary tree is not less than the second preset duration respectively according to the allocation rules; If not, rebalancing the target binary tree according to the quality inspection duration of the unallocated quality inspection forms in the target binary tree.

6. The method according to claim 4, characterized in that There are multiple target binary trees. The step of allocating the quality inspection form corresponding to the vertex of the target binary tree to the current quality inspector includes: Obtaining the reference quality inspection form corresponding to the vertex of each target binary tree; Obtaining the quality inspection duration corresponding to each reference quality inspection form; Select a target quality inspection form from multiple reference quality inspection forms according to the quality inspection duration, where the target quality inspection form is the reference quality inspection form among the multiple reference quality inspection forms that makes the total quality inspection duration assigned to the current quality inspector closest to the second preset duration; Assign the target quality inspection form to the current quality inspector.

7. The method according to any one of claims 1-6, characterized in that, After re-assigning quality inspection forms to each quality inspector according to the arrangement order of the quality inspection forms in the at least one target sequence, the method further includes: Convert the voice information corresponding to the assigned quality inspection form into text information; Obtain quality inspection rules and business rules; Determine the non-compliant content according to the quality inspection rules and the business rules; Determine whether the non-compliant content exists in the text information; If the non-compliant content exists, mark the text information corresponding to the non-compliant content.

8. A quality inspection form distribution device, characterized in that, Includes: An obtaining unit, configured to obtain multiple quality inspection forms to be assigned and the assignment rules of the multiple quality inspection forms, where the assignment rules are associated with quality inspection requirements; A first assignment unit, configured to sequentially assign quality inspection forms to each quality inspector according to the multiple quality inspection forms and the assignment rules until the total quality inspection duration corresponding to the quality inspection form assigned to the first quality inspector reaches the first preset duration; A sorting unit, configured to sort the unassigned quality inspection forms among the multiple quality inspection forms according to the assignment rules to obtain at least one target sequence, where the quality inspection form with a higher ranking in the target sequence has a shorter corresponding quality inspection duration; A second assignment unit, configured to re-assign quality inspection forms to each quality inspector according to the arrangement order of the quality inspection forms in the at least one target sequence until the total quality inspection duration corresponding to the quality inspection form assigned to each quality inspector is not less than the second preset duration, and the second preset duration is greater than the first preset duration.

9. An electronic device, comprising a memory, a processor, and a computer program stored on the memory and running on the processor, characterized in that, When the processor executes the computer program, the steps of the quality inspection form assignment method according to any one of claims 1 to 7 are implemented.

10. A non-transitory computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, the steps of the quality inspection form assignment method according to any one of claims 1 to 7 are implemented.

Citation Information

Patent Citations

  • Task allocation method and device, electronic equipment and storage medium

    CN115545408A

  • Resource scheduling method and device, electronic equipment and storage medium

    CN117349002A

  • Balanced document distribution method

    CN118278652A

  • Database management method for quality inspection scheduling, computer equipment and computer readable storage medium

    CN118709975A