CN111985740A - Task processing method and device - Google Patents
Task processing method and device Download PDFInfo
- Publication number
- CN111985740A CN111985740A CN201910425354.3A CN201910425354A CN111985740A CN 111985740 A CN111985740 A CN 111985740A CN 201910425354 A CN201910425354 A CN 201910425354A CN 111985740 A CN111985740 A CN 111985740A
- Authority
- CN
- China
- Prior art keywords
- strategy
- task
- task processing
- node
- policy
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 24
- 238000000034 method Methods 0.000 claims description 30
- 230000008569 process Effects 0.000 claims description 15
- 230000004913 activation Effects 0.000 claims description 8
- 238000010586 diagram Methods 0.000 description 9
- 230000004048 modification Effects 0.000 description 6
- 238000012986 modification Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 241000531116 Blitum bonus-henricus Species 0.000 description 1
- 235000008645 Chenopodium bonus henricus Nutrition 0.000 description 1
- 230000009471 action Effects 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000003252 repetitive effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Development Economics (AREA)
- General Business, Economics & Management (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Information Transfer Between Computers (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The disclosure provides a task processing method and a task processing device. The task processing method comprises the following steps: receiving a task group through a root node of a preset strategy tree, wherein the preset strategy tree comprises multiple stages, and each stage comprises a plurality of task processing strategy nodes; determining a corresponding strategy branch of the task group in the preset strategy tree, wherein the strategy branch comprises a multi-stage task processing strategy node; executing the task processing strategy in the strategy branch on the task group; and acquiring the collection lists of the task group and the picking task list corresponding to each collection list from the output of the last stage task processing strategy node of the strategy branch. The task processing method can improve task processing efficiency.
Description
Technical Field
The present disclosure relates to the field of computer technologies, and in particular, to a task processing method and apparatus.
Background
In warehousing operation, to improve the picking efficiency, the positioning information of a plurality of orders is often collected, the orders are grouped according to the strategies such as order type, order quantity, commodity quantity, positioning details and the like, and the plurality of orders in each group are called as an aggregate order. After the collection sheet is established, the collection sheet is divided into one or more picking task sheets according to the positioning details, the commodity quantity and other strategies, and the picking task sheets are distributed to one or more pickers for picking. The strategies of building the collection sheet and splitting the collection sheet task sheet can influence each other, for example, different order types, the strategies of building the collection sheet and splitting the task sheet corresponding to the order quantity, the commodity quantity and the like are different. Different warehouses can also select different strategies for building the aggregate list and splitting the task list according to the specific conditions of the warehouses.
In the related technology, the strategy selection and the strategy execution of the assembly sheet and the assembly sheet splitting task sheet are alternately carried out when the business logic is executed, the logic is disordered, the flow is long, if new business logic is added, only the existing flow can be modified, the risk is high, and the warehouse is not supported to freely configure the strategy according to the self condition.
It is to be noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present disclosure, and thus may include information that does not constitute prior art known to those of ordinary skill in the art.
Disclosure of Invention
The present disclosure is directed to a task processing method and a task processing apparatus, which are used to overcome, at least to some extent, the problems of long task processing flow, inconvenience in policy modification, inflexibility in configuration, and the like due to the limitations and disadvantages of the related art.
According to a first aspect of the embodiments of the present disclosure, there is provided a task processing method, including: receiving a task group through a root node of a preset strategy tree, wherein the preset strategy tree comprises multiple stages, and each stage comprises a plurality of task processing strategy nodes; determining a corresponding strategy branch of the task group in the preset strategy tree, wherein the strategy branch comprises a multi-stage task processing strategy node; executing the task processing strategy in the strategy branch on the task group; and acquiring the collection lists of the task group and the picking task list corresponding to each collection list from the output of the last stage task processing strategy node of the strategy branch.
In an exemplary embodiment of the disclosure, the executing the task processing policy within the policy branch on the task group includes:
determining the execution sequence of the multi-stage task processing strategy nodes according to the hierarchy of the preset strategy tree;
and enabling the task processing strategy corresponding to the task processing strategy node to process the tasks in the task group according to the execution sequence.
In an exemplary embodiment of the present disclosure, the multi-level task processing policy node includes an activated node and an inactivated node, and the executing the task processing policy within the policy branch on the task group includes:
and when the activated nodes are executed, skipping the activated nodes to execute the task processing strategy corresponding to the activated nodes at the next stage.
In an exemplary embodiment of the present disclosure, further comprising:
setting a corresponding task processing strategy node as an inactivated node according to a system preset parameter;
and controlling the corresponding activated node to be closed to be an inactivated node according to the node closing parameters transmitted by the root node.
In an exemplary embodiment of the present disclosure, the determining a policy branch corresponding to the task group includes:
And determining each stage of task processing strategy nodes corresponding to the task group by the root node according to the information of the task group.
In an exemplary embodiment of the present disclosure, the activation node determines, according to the information of the task group, a next-stage activation node corresponding to the task group.
In an exemplary embodiment of the present disclosure, the task processing policy nodes include a collection list generation policy node and a task list splitting policy node, in the preset policy tree, the task processing policy priority of each level of the task processing policy node is higher than the next level and lower than the previous level, and the priority of the collection list generation policy node is higher than the priority of the task list splitting policy node.
According to a second aspect of the embodiments of the present disclosure, there is provided a task processing device including:
the task group receiving module is used for receiving the task group through a root node of a preset strategy tree, the preset strategy tree comprises multiple stages, and each stage comprises a plurality of task processing strategy nodes;
the strategy branch selecting module is set to determine the corresponding strategy branch of the task group in the preset strategy tree, and the strategy branch comprises multi-stage task processing strategy nodes;
A policy execution module configured to execute a task processing policy in the policy branch for the task group;
and the result summarizing module is used for acquiring the collection sheets of the task group and the picking task sheet corresponding to each collection sheet from the output of the last stage task processing strategy node of the strategy branch.
According to a third aspect of the present disclosure, there is provided a task processing apparatus including: a memory; and a processor coupled to the memory, the processor configured to perform the method of any of the above based on instructions stored in the memory.
According to a fourth aspect of the present disclosure, there is provided a computer-readable storage medium having stored thereon a program which, when executed by a processor, implements a task processing method as recited in any one of the above.
According to the task processing method provided by the embodiment of the disclosure, the processing strategy selection process is separated from the processing strategy execution process, so that the mutual influence among the strategies is reduced, the logic arrangement is clear, the modification is convenient, and the fault is not easy to occur. In addition, by using a strategy tree management assembly single-component strategy and a task single splitting strategy, the flexibility of strategy configuration can be improved, and the task processing efficiency can be improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is to be understood that the drawings in the following description are merely exemplary of the disclosure, and that other drawings may be derived from those drawings by one of ordinary skill in the art without the exercise of inventive faculty.
Fig. 1 is a flowchart of a task processing method in an exemplary embodiment of the present disclosure.
FIG. 2 is a flow chart of assembling a preset policy tree in an embodiment of the present disclosure.
Fig. 3 is a schematic diagram of a preset policy tree in an embodiment of the disclosure.
FIG. 4 is a schematic diagram of a pick policy branch in an embodiment of the present disclosure.
Fig. 5 is a sub-flowchart of step S106 in the embodiment of the present disclosure.
Fig. 6 is a block diagram of a task processing device in an exemplary embodiment of the present disclosure.
FIG. 7 is a block diagram of an electronic device in an exemplary embodiment of the disclosure.
FIG. 8 is a schematic diagram of a computer-readable storage medium in an exemplary embodiment of the disclosure.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the subject matter of the present disclosure can be practiced without one or more of the specific details, or with other methods, components, devices, steps, and the like. In other instances, well-known technical solutions have not been shown or described in detail to avoid obscuring aspects of the present disclosure.
Further, the drawings are merely schematic illustrations of the present disclosure, in which the same reference numerals denote the same or similar parts, and thus, a repetitive description thereof will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.
The following detailed description of exemplary embodiments of the disclosure refers to the accompanying drawings.
Fig. 1 schematically shows a flowchart of a task processing method in an exemplary embodiment of the present disclosure. Referring to fig. 1, a task processing method 100 may include:
step S102, receiving a task group through a root node of a preset strategy tree, wherein the preset strategy tree comprises multiple stages, and each stage comprises a plurality of task processing strategy nodes;
step S104, determining a corresponding strategy branch of the task group in the preset strategy tree, wherein the strategy branch comprises a multi-stage task processing strategy node;
step S106, executing the task processing strategy in the strategy branch to the task group;
and step S108, acquiring the collection sheets of the task group and the picking task sheet corresponding to each collection sheet from the output of the last-stage task processing strategy node of the strategy branch.
According to the task processing method provided by the embodiment of the disclosure, the processing strategy selection process is separated from the processing strategy execution process, so that the mutual influence among the strategies is reduced, the logic arrangement is clear, the modification is convenient, and the fault is not easy to occur. In addition, by using a strategy tree management assembly single-component strategy and a task single splitting strategy, the flexibility of strategy configuration can be improved, and the task processing efficiency can be improved.
Next, each step of the task processing method 100 will be described in detail.
In step S102, a task group is received through a root node of a preset policy tree, where the preset policy tree includes multiple levels, and each level includes multiple task processing policy nodes.
The preset policy tree may be assembled first before receiving the task group. The assembly of the policy tree may be performed at startup of the application executing the task processing method 100 without the need for temporary assembly each time business logic is executed.
In the embodiment of the present disclosure, the task is, for example, an order processing task, and the order is, for example, an online shopping order, which is not limited in the present disclosure. The task processing strategy can comprise an aggregation list generating strategy and a task list splitting strategy. The aggregate sheet generation policy is, for example, a policy of grouping a plurality of orders in the task group according to the number of items or location information (data of storage positions of the items in the library, including item numbers, batches, levels, positions in the library, and the like), and the task sheet splitting policy is, for example, a policy of splitting order items into a plurality of picking task sheets according to the number, types, and location information of the items in the aggregate sheet. Each task processing strategy can be used as a child node to participate in the assembly of the preset strategy tree.
In the embodiment of the present disclosure, the policy tree uses a single atomic policy as an independent node, and forms a tree structure by layering and forking, which contains all the atomic policies, but only a single branch will be activated and executed in each actual service. An independent atomic policy is called a node of the policy tree, a node with the highest priority is called a root node, and each node can have one or more child nodes.
FIG. 2 is a flow chart of assembling a preset policy tree in an embodiment of the present disclosure.
Referring to fig. 2, the process of assembling the policy tree may include:
step S21, determining the priority of a plurality of task processing strategies;
step S22, selecting the unselected strategy with the highest priority;
step S23, connecting the strategy with the highest priority as the selected sub-node to the node of the previous level;
and step S24, judging whether there is any unselected strategy, if yes, returning to step S22, otherwise, ending the process.
First, the task processing policies may be ordered by priority. For example, the priority of the collection sheet generation strategy is higher than that of the task sheet splitting strategy, and the priority of the strategy for generating the collection sheet according to the order type is higher than that of the strategy for generating the collection sheet according to the commodity quantity. Then, nodes of a preset strategy tree are set from high to low according to the priority, the node level of the high-priority strategy is smaller than that of the low-priority strategy, namely the task processing strategy priority of each level of task processing strategy nodes is higher than that of the next level and lower than that of the previous level.
When a child node of a certain node is selected, a strategy which may need to be executed is screened out from all nodes of the next priority level of the node, and the strategy is connected to the node as the child node. The children of a node of the same priority (i.e., a node at the same level of the policy tree) may be duplicated, but a task processing policy node only appears at the same level of the policy tree.
Fig. 3 is a schematic diagram of a preset policy tree in an embodiment of the disclosure.
Referring to fig. 3, a policy for generating an aggregate sheet according to an order type with the highest priority may be selected as a root node of the policy tree, a policy for generating an aggregate sheet according to an order quantity with the highest priority may be selected as a child node to be connected to the root node of the policy tree, a plurality of order quantity policies corresponding to different order types may be selected as a plurality of first-level child nodes, and a policy for generating an aggregate sheet according to a commodity quantity with the third highest priority may be selected as a second-level child node of the order quantity policy node to be connected to the policy tree. And so on, a strategy tree 300 containing all the strategies of building the collection list and splitting the task list is finally formed.
The composition of the strategy tree enables each task processing strategy to be realized independently without mutual influence, and is convenient to expand. When the node needs to be deleted, only the corresponding node and the node selection logic of the node at the upper level are directly deleted; similarly, when a node needs to be added, only the node selection logic of the node at the upper level needs to be modified, and the service logic code of the task processing strategy corresponding to the node needs to be added. The modification is convenient, the logic is clear, and the readability is high. In addition, the strategy tree can comprise nodes of various task processing strategies, the requirements of different service scenes are met, and the application range is wide.
In step S104, a policy branch corresponding to the task group in the preset policy tree is determined, where the policy branch includes multi-stage task processing policy nodes.
In embodiments of the present disclosure, the tasks in a task group are derived from a task pool. A plurality of tasks can be screened out through a set of condition parameters to generate a task group, and then the corresponding strategy branch of the task group is determined according to various parameters (order quantity, commodity quantity in the order, and the like) of the task group.
For example, each stage of task processing policy node corresponding to the task group may be determined by the root node from the information of the task group stage by stage.
FIG. 4 is a schematic diagram of a pick policy branch in an embodiment of the present disclosure.
Referring to fig. 4, first, a root node may be selected according to the order type, then a first-level child node may be selected from the plurality of first-level child nodes according to the order quantity policy in the order group, and then a second-level child node may be selected from the plurality of second-level child nodes linked to the first-level child node according to the commodity quantity policy in the order group. And repeating the steps until the strategy branch is determined after the child node of the last level is selected.
In an exemplary embodiment of the present disclosure, each task processing policy node is set to have an activated/inactivated attribute that can be changed by controlling a parameter in the policy implementation code. When the node is an activated node, corresponding business logic can be executed; when the node is an inactive node, the corresponding service logic is masked from execution. The manner of changing the node activation state to an inactive node may include setting a corresponding task processing policy node to be an inactive node according to a preset parameter of the system, or controlling a corresponding active node to be closed to be an inactive node according to a node closing parameter transmitted by the root node. The manner of setting the inactive node as the active node is the reverse.
The active state settings of the nodes may be manually entered by an operator or system default settings prior to receiving a task group. The activation state of the node does not affect the selection of the strategy branch, namely whether the node is activated or not is not considered when the strategy branch is selected, and whether the node meets the selection condition or not is only considered.
In step S106, a task processing policy in the policy branch is executed for the task group.
The method comprises the steps of firstly determining an execution sequence of multi-level task processing strategy nodes according to the hierarchy of a preset strategy tree, and then starting tasks in a task processing strategy processing task group corresponding to the task processing strategy nodes according to the execution sequence.
If the node comprises an activated node and an inactivated node, when a node is executed, the activated state of the node can be judged firstly, if the node is the activated node, the service logic corresponding to the node is executed, the processed information is transmitted to the next-level sub-node, if the node is the inactivated node, the information is directly transmitted to the next-level sub-node, and the same processing is carried out by the next-level sub-node until the whole strategy branch is executed.
Fig. 5 is a sub-flowchart of step S106 in the embodiment of the present disclosure.
Referring to fig. 5, step S106 may include:
step S1061, acquiring a root node of the strategy branch;
step S1062, judging whether the node is in an activated state, if so, entering step S1063, otherwise, entering step S1064;
step S1063, executing the task processing strategy corresponding to the node to the task group;
step S1064, judging whether the strategy branch has a next-level node, if so, entering step S1065, otherwise, ending the process;
in step S1065, after the next-level node of the policy branch is obtained, the process returns to step S1062.
By setting the activated state and the inactivated state of the node, the flexibility of strategy execution can be enhanced, the warehouse can be freely configured according to the self condition conveniently, codes do not need to be modified, the flexibility of the program is enhanced, the calling party can freely select the strategy to be executed only by inputting corresponding parameters, and the flexibility and the configurability are high.
In step S108, the collection sheet of the task group and the picking task sheet corresponding to each collection sheet are obtained from the output of the last stage task processing policy node of the policy branch.
After executing all the task processing strategies of the strategy branch, the output of the last-level child node is one or more collection sheets of the task group and one or more picking task sheets corresponding to each collection sheet.
The order forms are distributed into the collection form through the strategy execution of the strategy branch, all goods in the order forms are gathered according to categories and quantities, and the order forms are distributed into one or more picking order forms through the strategy of the strategy branch, and the picking order forms are distributed to one or more pickers so that the pickers can complete all picking tasks on one kind of goods in one collection form at the same position, and therefore picking efficiency is improved. After the picking is finished, the goods with different types and quantities are grouped according to the order according to the information in the collection sheet so as to facilitate the logistics distribution.
In summary, by completely separating policy selection from policy execution and using a policy tree convenient for independent modification to generate a collection sheet and a picking task sheet, the task processing policy can be modified conveniently and rapidly, the task processing efficiency is improved, and the risk of system stability caused by modification of the task processing policy is reduced.
Corresponding to the above method embodiments, the present disclosure also provides a task processing device, which may be used to execute the above method embodiments.
Fig. 6 schematically shows a block diagram of a task processing device in an exemplary embodiment of the present disclosure.
Referring to fig. 6, the task processing device 600 may include:
a task group receiving module 602 configured to receive a task group through a root node of a preset policy tree, where the preset policy tree includes multiple levels, and each level includes multiple task processing policy nodes;
a policy branch selecting module 604 configured to determine a policy branch corresponding to the task group in the preset policy tree, where the policy branch includes a multi-stage task processing policy node;
a policy enforcement module 606 configured to enforce the task processing policies in the policy branch for the task group;
and the result summarizing module 608 is configured to obtain the collection lists of the task groups and the picking task list corresponding to each collection list from the output of the last stage task processing strategy node of the strategy branch.
In an exemplary embodiment of the disclosure, the policy enforcement module 606 is configured to:
determining the execution sequence of the multi-stage task processing strategy nodes according to the hierarchy of the preset strategy tree;
and enabling the task processing strategy corresponding to the task processing strategy node to process the tasks in the task group according to the execution sequence.
In an exemplary embodiment of the disclosure, the multi-level task processing policy nodes include an active node and an inactive node, and the policy enforcement module 606 is configured to:
And when the activated nodes are executed, skipping the activated nodes to execute the task processing strategy corresponding to the activated nodes at the next stage.
In an exemplary embodiment of the present disclosure, the node state setting module 610 is further included, and is configured to:
setting a corresponding task processing strategy node as an inactivated node according to a system preset parameter;
and controlling the corresponding activated node to be closed to be an inactivated node according to the node closing parameters transmitted by the root node.
In an exemplary embodiment of the disclosure, the policy branch extraction module 604 is configured to:
and determining each stage of task processing strategy nodes corresponding to the task group by the root node according to the information of the task group.
In an exemplary embodiment of the present disclosure, the activation node determines, according to the information of the task group, a next-stage activation node corresponding to the task group.
In an exemplary embodiment of the present disclosure, the task processing policy nodes include a collection list generation policy node and a task list splitting policy node, in the preset policy tree, the task processing policy priority of each level of the task processing policy node is higher than the next level and lower than the previous level, and the priority of the collection list generation policy node is higher than the priority of the task list splitting policy node.
Since the functions of the apparatus 600 have been described in detail in the corresponding method embodiments, the disclosure is not repeated herein.
It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.
In an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or program product. Thus, various aspects of the invention may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.
An electronic device 700 according to this embodiment of the invention is described below with reference to fig. 7. The electronic device 700 shown in fig. 7 is only an example and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 7, electronic device 700 is embodied in the form of a general purpose computing device. The components of the electronic device 700 may include, but are not limited to: the at least one processing unit 710, the at least one memory unit 720, and a bus 730 that couples various system components including the memory unit 720 and the processing unit 710.
Wherein the storage unit stores program code that is executable by the processing unit 710 such that the processing unit 710 performs the steps according to various exemplary embodiments of the present invention as described in the above section "exemplary method" of the present specification. For example, the processing unit 710 may execute step S102 as shown in fig. 1: receiving a task group through a root node of a preset strategy tree, wherein the preset strategy tree comprises multiple stages, and each stage comprises a plurality of task processing strategy nodes; step S104: determining a corresponding strategy branch of the task group in the preset strategy tree, wherein the strategy branch comprises a multi-stage task processing strategy node; step S106: executing the task processing strategy in the strategy branch on the task group; step S108: and acquiring the collection lists of the task group and the picking task list corresponding to each collection list from the output of the last stage task processing strategy node of the strategy branch.
The storage unit 720 may include readable media in the form of volatile memory units, such as a random access memory unit (RAM)7201 and/or a cache memory unit 7202, and may further include a read only memory unit (ROM) 7203.
The storage unit 720 may also include a program/utility 7204 having a set (at least one) of program modules 7205, such program modules 7205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.
The electronic device 700 may also communicate with one or more external devices 900 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 700, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 700 to communicate with one or more other computing devices. Such communication may occur via an input/output (I/O) interface 750. Also, the electronic device 700 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the internet) via the network adapter 760. As shown, the network adapter 760 communicates with the other modules of the electronic device 700 via the bus 730. It should be appreciated that although not shown in the figures, other hardware and/or software modules may be used in conjunction with the electronic device 700, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
In an exemplary embodiment of the present disclosure, there is also provided a computer-readable storage medium having stored thereon a program product capable of implementing the above-described method of the present specification. In some possible embodiments, aspects of the invention may also be implemented in the form of a program product comprising program code means for causing a terminal device to carry out the steps according to various exemplary embodiments of the invention described in the above section "exemplary methods" of the present description, when said program product is run on the terminal device.
Referring to fig. 8, a program product 800 for implementing the above method according to an embodiment of the present invention is described, which may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited in this regard and, in the present document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
A computer readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
Furthermore, the above-described figures are merely schematic illustrations of processes involved in methods according to exemplary embodiments of the invention, and are not intended to be limiting. It will be readily understood that the processes shown in the above figures are not intended to indicate or limit the chronological order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
Claims (10)
1. A task processing method, comprising:
receiving a task group through a root node of a preset strategy tree, wherein the preset strategy tree comprises multiple stages, and each stage comprises a plurality of task processing strategy nodes;
determining a corresponding strategy branch of the task group in the preset strategy tree, wherein the strategy branch comprises a multi-stage task processing strategy node;
Executing the task processing strategy in the strategy branch on the task group;
and acquiring the collection lists of the task group and the picking task list corresponding to each collection list from the output of the last stage task processing strategy node of the strategy branch.
2. The task processing method of claim 1, wherein the executing the task processing policy within the policy branch on the task group comprises:
determining the execution sequence of the multi-stage task processing strategy nodes according to the hierarchy of the preset strategy tree;
and enabling the task processing strategy corresponding to the task processing strategy node to process the tasks in the task group according to the execution sequence.
3. The task processing method of claim 2, wherein the multi-level task processing policy nodes include active nodes and inactive nodes, and wherein executing the task processing policy within the policy branch on the task group comprises:
and when the activated nodes are executed, skipping the activated nodes to execute the task processing strategy corresponding to the activated nodes at the next stage.
4. The task processing method according to claim 3, further comprising:
Setting a corresponding task processing strategy node as an inactivated node according to a system preset parameter;
and controlling the corresponding activated node to be closed to be an inactivated node according to the node closing parameters transmitted by the root node.
5. The task processing method of claim 1, wherein the determining the policy branch corresponding to the task group comprises:
and determining each stage of task processing strategy nodes corresponding to the task group by the root node according to the information of the task group.
6. The task processing method according to claim 5, wherein a next-level activation node corresponding to the task group is determined by an activation node according to the information of the task group.
7. The task processing method according to claim 1, wherein the task processing policy nodes include a collection list generation policy node and a task list splitting policy node, and in the preset policy tree, the task processing policy priority of each level of the task processing policy nodes is higher than the next level and lower than the previous level, and the priority of the collection list generation policy node is higher than the priority of the task list splitting policy node.
8. A task processing apparatus, comprising:
The task group receiving module is used for receiving the task group through a root node of a preset strategy tree, the preset strategy tree comprises multiple stages, and each stage comprises a plurality of task processing strategy nodes;
the strategy branch selecting module is set to determine the corresponding strategy branch of the task group in the preset strategy tree, and the strategy branch comprises multi-stage task processing strategy nodes;
a policy execution module configured to execute a task processing policy in the policy branch for the task group;
and the result summarizing module is used for acquiring the collection sheets of the task group and the picking task sheet corresponding to each collection sheet from the output of the last stage task processing strategy node of the strategy branch.
9. An electronic device, comprising:
a memory; and
a processor coupled to the memory, the processor configured to perform the method of task processing according to any of claims 1-7 based on instructions stored in the memory.
10. A computer-readable storage medium on which a program is stored, the program implementing the task processing method according to any one of claims 1 to 7 when executed by a processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910425354.3A CN111985740B (en) | 2019-05-21 | 2019-05-21 | Task processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910425354.3A CN111985740B (en) | 2019-05-21 | 2019-05-21 | Task processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111985740A true CN111985740A (en) | 2020-11-24 |
| CN111985740B CN111985740B (en) | 2024-05-24 |
Family
ID=73437285
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910425354.3A Active CN111985740B (en) | 2019-05-21 | 2019-05-21 | Task processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111985740B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113888181A (en) * | 2021-10-25 | 2022-01-04 | 支付宝(杭州)信息技术有限公司 | Business processing and risk detection strategy system construction method, device and equipment |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100042450A1 (en) * | 2008-08-15 | 2010-02-18 | International Business Machines Corporation | Service level management in a service environment having multiple management products implementing product level policies |
| CN102393937A (en) * | 2011-10-12 | 2012-03-28 | 深圳市络道科技有限公司 | Address matching method and system of address tree based on backward production |
| CN103299326A (en) * | 2011-01-30 | 2013-09-11 | 北京协通天下科技有限公司 | A logistics system and a method for providing logistics service with the logistics system |
| US20160204923A1 (en) * | 2015-01-12 | 2016-07-14 | International Business Machines Corporation | Dynamically allocating compute nodes among cloud groups based on priority and policies |
| CN106933889A (en) * | 2015-12-31 | 2017-07-07 | 华为技术有限公司 | For regular collocation method, display methods and the client screened |
| CN107016599A (en) * | 2017-04-06 | 2017-08-04 | 四川创物科技有限公司 | A kind of order set group technology and device |
| CN107636709A (en) * | 2015-03-19 | 2018-01-26 | 美国联合包裹服务公司 | The execution of goods transportation rule |
| CN108009768A (en) * | 2017-11-15 | 2018-05-08 | 佛山杰致信息科技有限公司 | A kind of home-delivery center's method for sorting based on sequence information storage |
| CN108985672A (en) * | 2017-06-01 | 2018-12-11 | 北京京东尚科信息技术有限公司 | Information output method and device |
-
2019
- 2019-05-21 CN CN201910425354.3A patent/CN111985740B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100042450A1 (en) * | 2008-08-15 | 2010-02-18 | International Business Machines Corporation | Service level management in a service environment having multiple management products implementing product level policies |
| CN103299326A (en) * | 2011-01-30 | 2013-09-11 | 北京协通天下科技有限公司 | A logistics system and a method for providing logistics service with the logistics system |
| CN102393937A (en) * | 2011-10-12 | 2012-03-28 | 深圳市络道科技有限公司 | Address matching method and system of address tree based on backward production |
| US20160204923A1 (en) * | 2015-01-12 | 2016-07-14 | International Business Machines Corporation | Dynamically allocating compute nodes among cloud groups based on priority and policies |
| CN107636709A (en) * | 2015-03-19 | 2018-01-26 | 美国联合包裹服务公司 | The execution of goods transportation rule |
| CN106933889A (en) * | 2015-12-31 | 2017-07-07 | 华为技术有限公司 | For regular collocation method, display methods and the client screened |
| CN107016599A (en) * | 2017-04-06 | 2017-08-04 | 四川创物科技有限公司 | A kind of order set group technology and device |
| CN108985672A (en) * | 2017-06-01 | 2018-12-11 | 北京京东尚科信息技术有限公司 | Information output method and device |
| CN108009768A (en) * | 2017-11-15 | 2018-05-08 | 佛山杰致信息科技有限公司 | A kind of home-delivery center's method for sorting based on sequence information storage |
Non-Patent Citations (4)
| Title |
|---|
| DULLAERT, W等: "An evolutionary algorithm for order splitting with multiple transport alternatives", 《EXPERT SYSTEMS WITH APPLICATIONS》, vol. 28, 1 February 2005 (2005-02-01), XP004705901, DOI: 10.1016/j.eswa.2004.10.002 * |
| 张珺等: "电子商务环境下并行分区拣选***的订单合并优化研究", 《中国优秀硕士学位论文全文数据库（信息科技辑）》, no. 7, 15 July 2015 (2015-07-15) * |
| 朱艳红;赵俊卓;余翔;: "基于Arena的邮政物流拣货策略仿真建模研究", 福建电脑, no. 09, 25 September 2018 (2018-09-25) * |
| 李旭宏;程日盛;张永;薛永吉;: "配送中心不同拣货策略的仿真建模研究", 交通与计算机, no. 02 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113888181A (en) * | 2021-10-25 | 2022-01-04 | 支付宝(杭州)信息技术有限公司 | Business processing and risk detection strategy system construction method, device and equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111985740B (en) | 2024-05-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101651576B (en) | Alarm information processing method and system | |
| CN106933889A (en) | For regular collocation method, display methods and the client screened | |
| KR20150117280A (en) | Building applications for configuring processes | |
| US11044274B2 (en) | Policy evaluation trees | |
| CN101551760A (en) | Representation of data transformation processes for parallelization | |
| CN111427748A (en) | Task warning method, system, equipment and storage medium | |
| CN106156998A (en) | The management method of a kind of Pending tasks and device | |
| KR20200062299A (en) | Transaction selection device for selecting blockchain transactions | |
| CN103488674A (en) | Computing system and method for implementing and controlling thereof | |
| CN101877136A (en) | Method, equipment and system for processing graphic object | |
| US10235100B2 (en) | Optimizing column based database table compression | |
| US9875288B2 (en) | Recursive filter algorithms on hierarchical data models described for the use by the attribute value derivation | |
| CN100485615C (en) | Method and device for managing operation state related to software components | |
| CN111985740B (en) | Task processing method and device | |
| CN107220044B (en) | Method and device for driving business object based on meta-model | |
| JP3415310B2 (en) | Test case creation device | |
| CN112783447A (en) | Method, apparatus, device, medium, and article of manufacture for processing snapshots | |
| CN111782820A (en) | Knowledge graph creating method and device, readable storage medium and electronic equipment | |
| AU2022241571A1 (en) | Methods and systems for generating workflows for analysing large data sets | |
| CN116127154A (en) | Knowledge tag recommendation method and device, electronic equipment and storage medium | |
| CN109558403A (en) | Data aggregation method and device, computer installation and computer readable storage medium | |
| US20050268306A1 (en) | Method and system for presenting actions associated with a managed object in a task context | |
| US20210311942A1 (en) | Dynamically altering a query access plan | |
| US11061859B2 (en) | Object creation from hierarchical metadata stored on a storage device | |
| CN113971500A (en) | Data subdivision management method and device and data management platform |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |