CN111476478B - Art planning task processing method and device - Google Patents

Art planning task processing method and device Download PDF

Info

Publication number
CN111476478B
CN111476478B CN202010255505.8A CN202010255505A CN111476478B CN 111476478 B CN111476478 B CN 111476478B CN 202010255505 A CN202010255505 A CN 202010255505A CN 111476478 B CN111476478 B CN 111476478B
Authority
CN
China
Prior art keywords
list
modified
adjusting
execution time
requirement
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.)
Active
Application number
CN202010255505.8A
Other languages
Chinese (zh)
Other versions
CN111476478A (en
Inventor
范智锋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Netease Hangzhou Network Co Ltd
Original Assignee
Netease Hangzhou Network Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Netease Hangzhou Network Co Ltd filed Critical Netease Hangzhou Network Co Ltd
Priority to CN202010255505.8A priority Critical patent/CN111476478B/en
Publication of CN111476478A publication Critical patent/CN111476478A/en
Application granted granted Critical
Publication of CN111476478B publication Critical patent/CN111476478B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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/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
    • G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Economics (AREA)
  • Operations Research (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Educational Administration (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a processing method and a processing device for an art planning task. Wherein the method comprises the following steps: configuring a hierarchical relationship of an art planning task to be executed, wherein the hierarchical relationship comprises: according to a plurality of requirement lists obtained by splitting the to-be-executed art planning task, a plurality of link lists corresponding to each requirement list and a plurality of base lists corresponding to each link list; searching a to-be-modified list according to the hierarchical relationship, and adjusting time information of the to-be-modified list to obtain an adjustment result; and based on the adjustment result, synchronously updating the time information of the associated list of the list to be modified in the hierarchical relationship. The invention solves the technical problems that the time modification relation among the demand bill, the link bill and the base bill in the prior art resource management system cannot be embodied and the influence of the time modification is too simple.

Description

Art planning task processing method and device
Technical Field
The invention relates to the field of task processing, in particular to a processing method and device for an art planning task.
Background
The existing art resource management system has a plurality of defects, such as:
1. although the user can see the relation among the demand bill, the link bill and the execution base bill through the project module in the prior art resource management system; but still, the progress of the overall plan cannot be seen clearly by the user, because the user cannot use the system to make a corresponding plan.
2. The time of all demand sheets and the time of link sheets in the existing art management system depend on the time of the base sheet, namely, the time of the demand sheets and the time of the links can be changed by modifying the base sheet, but the changes are difficult to integrally show, the time axis of the user is only seen through the details of a single demand sheet at present, the mutual influence of the time is too simple, and the time relation between tasks cannot be reflected.
3. In the existing art management system, the process and the mode of constructing tasks are too tedious and time-consuming, the art PM constructs a demand, a plurality of contents are required to be filled in, a plurality of pages are required to be jumped, and a related link and an automatic related execution base form of the demand form are required to be constructed, so that the art PM consumes a lot of time.
In view of the above problems, no effective solution has been proposed at present.
Disclosure of Invention
The embodiment of the invention provides a processing method and a processing device for an art planning task, which at least solve the technical problems that the time modification relation among a demand bill, a link bill and a base bill in the existing art resource management system cannot be embodied and the influence of the time modification is too simple.
According to an aspect of the embodiment of the present invention, there is provided a processing method for an art planning task, including: configuring a hierarchical relationship of art planning tasks to be executed, wherein the hierarchical relationship comprises: according to the multiple requirement lists obtained by splitting the to-be-executed art planning task, multiple link lists corresponding to each requirement list and multiple base lists corresponding to each link list; searching a to-be-modified list according to the hierarchical relationship, and adjusting the time information of the to-be-modified list to obtain an adjustment result; and based on the adjustment result, synchronously updating the time information of the association list of the list to be modified in the hierarchical relationship.
Further, configuring the hierarchical relationship of the art planning task to be performed includes: splitting according to an art planning task to be executed to obtain at least one demand bill, and splitting the demand bill to obtain a plurality of sub-set bills; acquiring data information of a plan type field set in the art plan task to be executed, and judging whether the subset sheet is a demand sheet or not based on the data information; if the subset list of the requirement list is judged to be still the requirement list, splitting the subset list which is still the requirement list until the judging result is not the requirement list any more; if the sub-list is not the requirement list, determining the sub-list as a link list, and splitting the link list to obtain a plurality of base lists.
Further, configuring the hierarchical relationship of the art planning task to be performed further includes: constructing an execution order relationship between a plurality of sheets of a same hierarchy, wherein the plurality of sheets includes one of: a plurality of demand sheets, a plurality of link sheets, a plurality of base sheets, each sheet of the plurality of sheets having at most one pre-sheet; and storing the execution sequence relation by adopting a nested set model.
Further, building the execution order relationship between multiple singles of the same hierarchy includes: when adding a list in any hierarchy, determining whether the list to be added is provided with a pre-list or not; if the pre-list is arranged, acquiring all parent lists in the execution sequence relation of the list to be added; comparing the pre-list of the list to be added with all father-level list, judging whether the same father-level list exists or not; and if the same parent level list does not exist, adding the list to be modified provided with the pre-list into the execution sequence relation.
Further, adjusting the time information of the to-be-modified ticket includes at least one of: adjusting the initial execution time of the to-be-modified list; adjusting the finishing execution time of the to-be-modified list; adjusting the estimated execution time length of the to-be-modified list; adjusting the pre-list of the list to be modified; and adjusting the execution time difference between the list to be modified and the pre-list in the execution sequence relation.
Further, based on the adjustment result, synchronously updating the time information of the association list of the list to be modified in the hierarchical relationship includes: judging the type of the to-be-modified list and/or judging whether the relation list and the to-be-modified list have a front-to-back relation in the execution sequence relation or not, so as to obtain a judging result; based on the adjustment result and the judgment result, synchronously updating the time information of the association list
According to another aspect of the embodiment of the present invention, there is also provided a processing apparatus for an art planning task, including: a configuration unit, configured to configure a hierarchical relationship of an art planning task to be executed, where the hierarchical relationship includes: according to the multiple requirement lists obtained by splitting the to-be-executed art planning task, multiple link lists corresponding to each requirement list and multiple base lists corresponding to each link list; the adjusting unit is used for searching the list to be modified according to the hierarchical relation, and adjusting the time information of the list to be modified to obtain an adjusting result; and the updating unit is used for synchronously updating the time information of the association list of the list to be modified in the hierarchical relationship based on the adjustment result.
Further, the configuration unit includes: the first splitting module is used for splitting at least one demand bill according to an art planning task to be executed, and splitting the demand bill to obtain a plurality of subset bills; the judging module is used for acquiring the data information of the plan type field set in the art plan task to be executed and judging whether the subset sheet is a demand sheet or not based on the data information; the second splitting module is used for splitting the subset list which is still the requirement list if the subset list of the requirement list is judged to be still the requirement list, and the requirement list is not judged to be the requirement list any more; and the third splitting module is used for determining the subset list as the link list if judging that the subset list is not the subset list of the requirement list, and splitting the link list to obtain a plurality of base lists.
Further, the configuration unit further includes: a building module for building an execution order relationship between a plurality of sheets of a same hierarchy, wherein the plurality of sheets includes one of: a plurality of demand sheets, a plurality of link sheets, a plurality of base sheets, each sheet of the plurality of sheets having at most one pre-sheet; and the storage unit is used for storing the execution sequence relation by adopting a nested set model.
Further, the construction module comprises: the determining submodule is used for determining whether the list to be added is provided with a pre-list or not when the list is added in any level; the acquisition sub-module is used for acquiring all parent level sheets in the execution sequence relation of the sheets to be added if the front-end sheets are arranged; the judging sub-module is used for singly comparing the front list of the list to be added with all father levels and judging whether the same father level list exists or not; and the determining submodule is used for adding the list to be modified provided with the pre-list into the execution sequence relation if the same parent list does not exist.
Further, the adjusting unit includes at least one of: the first adjusting module is used for adjusting the initial execution time of the to-be-modified list; the second adjusting module is used for adjusting the finishing execution time of the to-be-modified list; the third adjusting module is used for adjusting the estimated execution time length of the to-be-modified list; the fourth adjustment module is used for adjusting the pre-list of the list to be modified; and a fifth adjustment module, configured to adjust an execution time difference between the to-be-modified ticket and the pre-ticket in the execution order relation.
Further, the updating unit includes: the second judging module is used for judging the type of the to-be-modified list and/or whether the relation list and the to-be-modified list have a front-back relation in the execution sequence relation or not, so as to obtain a judging result; and the updating module is used for synchronously updating the time information of the association list based on the adjustment result and the judgment result.
According to another aspect of the embodiment of the present invention, there is also provided a processor for running a program, wherein the program runs to execute the processing method of any of the above art planning tasks.
According to another aspect of the embodiment of the present invention, there is also provided a terminal including: the system comprises one or more processors, a memory, a display device, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs comprising a processing method for performing any of the above-described art planning tasks.
According to another aspect of the embodiment of the present invention, there is also provided a storage medium, wherein the storage medium includes a stored program, and the program executes the processing method of any of the above-mentioned surgical planning tasks.
According to another aspect of the embodiment of the present invention, there is also provided an electronic device, including: the system comprises one or more processors, a memory, a display device, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs comprising a processing method for performing any of the above-described art planning tasks.
According to the processing method for the art planning task, the hierarchical relationship of the art planning task to be executed is configured, wherein the hierarchical relationship comprises the following steps: according to the multiple requirement lists obtained by splitting the to-be-executed art planning task, multiple link lists corresponding to each requirement list and multiple base lists corresponding to each link list; searching a to-be-modified list according to the hierarchical relationship, and adjusting the time information of the to-be-modified list to obtain an adjustment result; based on the adjustment result, the time information of the related list of the list to be modified in the hierarchical relation is synchronously updated, so that the technical problems that the time modification relation among the demand list, the link list and the base list in the existing art resource management system in the related technology cannot be embodied and the time modification influence is too simple are solved.
That is, by pre-configuring the hierarchical relationship of the art planning task to be executed and then synchronously updating the time information of the associated list in the hierarchical relationship to be modified Shan Zaisuo based on the adjustment result of the list to be modified, the time information of the demand list/link list/base list in the system can be synchronously adjusted according to the hierarchical relationship, so that the situation that the influence of the modification on the time information of other demand list/link list/base list cannot be determined after the user modifies the time information of one demand list/link list/base list is avoided.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiments of the invention and together with the description serve to explain the invention and do not constitute a limitation on the invention. In the drawings:
FIG. 1 is a flow chart of a method of processing an art planning task provided in accordance with the present invention;
FIG. 2 is a schematic illustration of an alternative method of processing art planning tasks provided in accordance with the present invention;
FIG. 3 is a schematic diagram II of an alternative art planning task processing method provided in accordance with the present invention;
FIG. 4 is a schematic diagram III of an alternative method of processing art planning tasks provided in accordance with the present invention;
FIG. 5 is a schematic diagram IV of an alternative art planning task processing method provided in accordance with the present invention;
FIG. 6 is a schematic diagram five of an alternative art planning task process provided in accordance with the present invention;
fig. 7 is a schematic view of a processing device for an art planning task according to the present invention.
Detailed Description
In order that those skilled in the art will better understand the present invention, a technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in which it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present invention without making any inventive effort, shall fall within the scope of the present invention.
It should be noted that the terms "first," "second," and the like in the description and the claims of the present invention and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
According to an embodiment of the present invention, there is provided an embodiment of a processing method of an art planning task, it should be noted that the steps shown in the flowchart of the drawings may be performed in a computer system such as a set of computer executable instructions, and that although a logical order is shown in the flowchart, in some cases, the steps shown or described may be performed in an order different from that herein.
Fig. 1 is a processing method of an art planning task according to an embodiment of the present invention, as shown in fig. 1, the method including the steps of:
step S102, configuring a hierarchical relationship of art planning tasks to be executed, wherein the hierarchical relationship comprises: and splitting the to-be-executed art planning task to obtain a plurality of requirement lists, a plurality of link lists corresponding to each requirement list, and a plurality of base lists corresponding to each link list.
Step S104, searching the list to be modified according to the hierarchical relationship, and adjusting the time information of the list to be modified to obtain an adjustment result.
And step S106, based on the adjustment result, synchronously updating the time information of the association list of the list to be modified in the hierarchical relationship.
It should be noted that: the to-be-modified list can be a demand list in the hierarchical relationship, a link list in the hierarchical relationship and a base list in the hierarchical relationship; similarly, the association list of the to-be-modified list in the hierarchical relationship may also be at least one of a requirement list, a link list and a base list, where the requirement list, the link list and the base list are associated with each other in the hierarchical relationship.
According to the processing method for the art planning task, the hierarchical relationship of the art planning task to be executed is configured, wherein the hierarchical relationship comprises the following steps: according to the multiple requirement lists obtained by splitting the to-be-executed art planning task, multiple link lists corresponding to each requirement list and multiple base lists corresponding to each link list; searching a to-be-modified list according to the hierarchical relationship, and adjusting the time information of the to-be-modified list to obtain an adjustment result; based on the adjustment result, the time information of the related list of the list to be modified in the hierarchical relation is synchronously updated, so that the technical problems that the time modification relation among the demand list, the link list and the base list in the existing art resource management system in the related technology cannot be embodied and the time modification influence is too simple are solved.
That is, by pre-configuring the hierarchical relationship of the art planning task to be executed and then synchronously updating the time information of the associated list in the hierarchical relationship to be modified Shan Zaisuo based on the adjustment result of the list to be modified, the time information of the demand list/link list/base list in the system can be synchronously adjusted according to the hierarchical relationship, so that the situation that the influence of the modification on the time information of other demand list/link list/base list cannot be determined after the user modifies the time information of one demand list/link list/base list is avoided.
In an alternative example, configuring the hierarchical relationship of the art planning task to be performed includes: splitting according to an art planning task to be executed to obtain at least one demand bill, and splitting the demand bill to obtain a plurality of sub-set bills; acquiring data information of a plan type field set in the art plan task to be executed, and judging whether the subset sheet is a demand sheet or not based on the data information; if the subset list of the requirement list is judged to be still the requirement list, splitting the subset list which is still the requirement list until the judging result is not the requirement list any more; if the sub-list is not the requirement list, determining the sub-list as a link list, and splitting the link list to obtain a plurality of base lists.
That is, in the processing method provided in the embodiment of the present application, the demand ticket under the milestone is infinitely detachable, that is, the demand ticket under the milestone may contain an infinite hierarchy. Illustrating: if A is a milestone, a subset B of the milestone is provided with a requirement list, judging a subset C of the requirement list B at the moment, and if the judgment result of the subset C is true, speaking that C is also the requirement list; at this time, the subset D of the demand bill C is judged, if the judgment result of the subset D is true, the D is also the demand bill … … until the occurrence of the fact that the judgment result is false, and at this time, the judgment result is false, and the subset is determined to be the link bill by the link type.
In an optional example, configuring the hierarchical relationship of the art planning task to be performed further includes: constructing an execution order relationship between a plurality of sheets of a same hierarchy, wherein the plurality of sheets includes one of: a plurality of demand sheets, a plurality of link sheets, a plurality of base sheets, each sheet of the plurality of sheets having at most one pre-sheet; and storing the execution sequence relation by adopting a nested set model.
That is, three levels are included in the art planning task to be executed, namely, a level including a plurality of requirement sheets, a level including a plurality of link sheets, and a level including a plurality of base sheets, respectively, and each sheet in any level has at most one pre-sheet, wherein each sheet has at most one pre-sheet finger: the list in any layer level may not have a pre-list, or may have only one pre-list. The list in any hierarchy may not have a post list, and may have any number of post lists.
Preferably, constructing the execution sequence relationship between a plurality of units of the same hierarchy may be achieved by: when adding a list in any hierarchy, determining whether the list to be added is provided with a pre-list or not; if the pre-list is arranged, acquiring all parent lists in the execution sequence relation of the list to be added; comparing the pre-list of the list to be added with all father-level list, judging whether the same father-level list exists or not; and if the same parent level list does not exist, adding the list to be modified provided with the pre-list into the execution sequence relation.
It should be noted that: the execution sequence relation of the list to be added refers to: a tree-like sequence relation established by taking a list to be added as a bottom node and a front-back relation as a node relation; all parent level single fingers in the execution sequence relation where the list to be added is located: and in the tree-like sequence relation established by taking the list to be added as a bottom node and the front-back relation as a node relation, the list positioned on all ancestor nodes of the list to be added.
It should be noted that: the nested set model is one of the structural equation models. Illustrating: if all the free parameters of the first model are part of the similar parameters in the second model, the first model is nested in the second model; and in the path diagram, the path diagram of the first model can be obtained by removing part of the path from the path diagram of the second model.
In an alternative example, adjusting the time information of the to-be-modified ticket includes at least one of: adjusting the initial execution time of the to-be-modified list; adjusting the execution time of ending the to-be-modified list; adjusting the estimated execution time length of the to-be-modified list; adjusting the pre-list of the list to be modified; and adjusting the execution time difference between the list to be modified and the pre-list in the execution sequence relation.
It should be noted that: starting execution time of the to-be-modified list = ending execution time of the to-be-modified list relative to the pre-list in the execution sequence relation + execution time difference between the to-be-modified list and the pre-list of the to-be-modified list; end execution time of the to-be-modified list=start execution time of the to-be-modified list+estimated execution time of the to-be-modified list.
In an optional example, based on the adjustment result, synchronously updating time information of the association list of the list to be modified in the hierarchical relationship includes: judging the type of the to-be-modified list and/or judging whether the to-be-modified list has a front-to-back relation in the execution sequence relation to obtain a judging result; and based on the adjustment result and the judgment result, synchronously updating the time information of the association list.
Preferably, based on the adjustment result and the determination result, the updating of the time information of the association list includes at least any one of: if the to-be-modified list is the base list, synchronously updating the time information of the link list and the demand list corresponding to the base list; if the unit link list to be modified is needed, synchronously updating the time information of the demand list; and if the to-be-modified list has a post relation in the execution sequence relation, synchronously updating the time information of the list with the post relation with the to-be-modified list.
Illustrating: if the type of the to-be-modified list is a link list, and the link list has no front-back relation; and after the time information of the link list is adjusted, synchronously updating the time information of the demand list corresponding to the link list, wherein the starting execution time of the demand list is specifically determined by the minimum starting execution time of the corresponding link list, and the ending execution time of the demand list is determined by the minimum ending execution time of the corresponding link list.
Similarly, the starting execution time of the link list depends on the minimum starting execution time of the corresponding plurality of base lists, and the ending execution time of the link list depends on the minimum ending execution time of the corresponding plurality of base lists.
Illustrating: if the type of the bill to be modified is a base bill, and the base bill has a postposition relation; and after the time information of the base list is adjusted, the time information of the list with the post relation with the list to be modified is synchronously updated, and specifically, the initial execution time of the post list is automatically calculated according to the fact that the initial execution time of the current list = the end execution time of the current list relative to the pre-list in the execution sequence relation + the execution time difference between the current list and the pre-list of the list to be modified.
The number of the single to be modified is more than one, or one; in the case that a plurality of sheets having a post relation with the sheet to be modified may be provided, the plurality of post sheets may be in a parallel relation or in a series relation.
In summary, the processing method for the art planning task provided by the embodiment of the application realizes flexible scheduling of the existing or newly added milestones, the demand list, the link list and the execution base list, modifies the time at one place, automatically calculates the planning start time or the estimated end time of the related task list according to rules, gets rid of the influence of the single base list on the upper layer list, and further achieves the technical effect of managing the task list from top to bottom. In addition, the processing method for the art planning task provided by the embodiment of the application can also be combined with the Gantt chart and the list tree view to show the condition of the whole art plan.
It should be noted that: the demand sheet, link sheet, and base sheet are collectively referred to as a task sheet.
In order to enable those skilled in the art to more clearly understand the technical solutions of the present application, the description will be made with reference to specific embodiments:
as shown in fig. 2, the time modification scheme for each individual in the present application includes the following steps:
Step 1: judging whether the time of the to-be-modified list can be modified, if so, executing step 2, wherein the staff determines that the completed to-be-modified list cannot be modified in time, the to-be-modified list in the post relation in the sequence relation among a plurality of lists in the same hierarchy cannot be modified in time (namely, the to-be-modified list is a post list of other lists and does not have the post list), and the base list set to be automatically synchronized cannot be modified in time.
Step 2: judging whether the to-be-modified list belongs to a task list with a front-to-back relation and whether migration quantity is set; if the to-be-modified list belongs to the task list with the front-to-back relation and is provided with the migration quantity, setting the migration time length between the to-be-modified list and the front-to-front task list (namely, the execution time difference between the to-be-modified list and the front-to-be-modified list), continuing to execute the step 3, and if the migration quantity is not set in the to-be-modified list, directly executing the step 3.
Step 3: judging whether the to-be-processed list is a base list or not; if yes, performing a first processing flow (base sheet processing flow); if not, step 4 is performed.
Step 4; judging whether the list to be processed has a prepositive relation or not; if yes, performing a second processing flow (the processing flow of the to-be-processed list with the prepositive relation); if not, step 5 is performed.
Step 5, judging whether the list to be processed has no prepositive relationship and only has a postpositive relationship; if yes, a third processing flow (the processing flow of the to-be-processed list with no prepositive relation and only a postpositive relation) is carried out; if not, a fourth process flow (process flow of the list to be processed without the front-to-back relation) is executed.
As shown in fig. 3, the first process flow (base sheet process flow) includes the steps of:
step 21, judging whether the modification type of the to-be-modified list is the execution ending time; if not, go to step 22; if yes, acquiring the initial execution time of the to-be-modified list, resetting the ending execution time, and recalculating the estimated execution time by combining the initial execution time and the ending execution time of the to-be-modified list.
Step 22, judging whether the modification type of the to-be-modified list is the initial execution time; if not, go to step 23; if yes, continuing to judge whether the to-be-modified list corresponds to the Gantt chart, if yes, enabling the to-be-modified list to correspond to the ending execution time, and at the moment, re-calculating the estimated execution time by combining the starting execution time and the ending execution time of the to-be-modified list; if the Gantt chart does not exist, the to-be-modified list corresponds to the estimated execution time, and at the moment, the starting execution time and the estimated execution time of the to-be-modified list are combined to recalculate the ending execution time.
If the to-be-modified list has a Gantt chart and the execution time is not finished, ending the flow; if the single-unit non-Gantt chart to be modified has no estimated execution time, ending the flow.
Step 23, judging whether the modification type of the to-be-modified list is estimated execution duration; if not, ending the flow; if yes, determining the initial execution time of the to-be-modified list, and at the moment, recalculating the end execution time by combining the initial execution time of the to-be-modified list and the estimated execution time.
And if the modification type of the to-be-modified list is the estimated execution time and the to-be-modified list has no initial execution time, ending the flow. In addition, it should be noted that: the base sheet is unable to modify the execution time difference.
Finally, the first process flow (base sheet process flow) further includes a step of collecting the output result. Wherein, the output result at least comprises: the task list number, the modification type, the estimated execution time, the starting execution time, the ending execution time and the like.
As shown in fig. 4, the second processing flow (processing flow of a sheet to be processed having a prepositive relationship) includes the steps of:
step 31, judging whether the modification type of the to-be-modified list is the execution ending time; if not, go to step 32; if yes, resetting the ending execution time of the to-be-modified list, judging whether the to-be-modified list is determined to be completed by a worker, if not, recalculating the estimated execution time by combining the starting execution time and the ending execution time of the to-be-modified list, and if the to-be-modified list is completed, ending the flow.
It should be noted that: the task sheet that has been completed is determined by the staff to be unable to modify the end execution time.
Step 32, judging whether the modification type of the to-be-modified list is the execution starting time; if not, step 33 is executed, and if yes, the flow is ended. It should be noted that: the task list with the prepositive relation cannot modify the execution starting time.
Step 33, judging whether the modification type of the to-be-modified list is estimated execution duration; if not, step 33 is executed, if yes, the estimated execution time length of the to-be-modified list is reset, whether the to-be-modified list is determined to be completed by a worker is judged, if not, the starting execution time of the to-be-modified list and the estimated execution time length are combined to recalculate the ending execution time, and if the to-be-modified list is completed, the flow is ended.
It should be noted that: the task sheet that has been completed is determined by the staff to be unable to modify the estimated execution time.
Step 34, judging whether the modification type of the to-be-modified list is an execution time difference; if not, executing step 35, if yes, resetting the execution time difference of the to-be-modified list, judging whether the to-be-modified list is confirmed to be completed by a worker, if not, judging whether the front task list has the ending execution time, if so, re-calculating and setting the starting execution time of the front task list, if not, judging whether the front task list has the starting execution time, and if so, re-calculating and setting the ending execution time of the front task list; if the to-be-modified list is completed, ending the flow.
Step 35, judging whether the modification type of the to-be-modified list is a front task list of the to-be-modified list; if not, ending the flow, if yes, judging whether the to-be-modified list is determined to be finished by a worker, if not, judging whether the front-end task list has an ending execution time, if the front-end task list has the ending execution time, re-calculating and setting the starting execution time of the front-end task list, if the front-end task list does not have the ending execution time, judging whether the front-end task list has the estimated execution time, and if the front-end task list has the estimated execution time, re-calculating and setting the ending execution time of the front-end task list; if the to-be-modified list is completed, ending the flow.
Finally, the second processing flow (processing flow of the to-be-processed list with the prepositive relation) further includes: and collecting an output result, modifying the post-task list and calculating the parent node list time of the list to be processed. Specifically, the step of collecting the output result may be any one of the following: collecting information such as a task list number, a modification type, estimated execution time, starting execution time, ending execution time and the like; the post-modification task sheet may be: acquiring a post-task list of a current to-be-modified list, and correspondingly modifying time information of the post-task list based on modification contents (estimated execution time, start execution time, end execution time and the like) of the current to-be-modified list; the parent node list time of the to-be-processed list can be calculated as follows: acquiring a parent level list of a current to-be-modified list, and correspondingly modifying time information of the parent level list based on modification contents (such as estimated execution time, initial execution time, end execution time and the like) of the current to-be-modified list, for example, acquiring a requirement list corresponding to a task list when the current to-be-modified list is the task list; and when the current to-be-modified list is the base list, acquiring a task list corresponding to the base list.
The output result at least comprises: the task list number, the modification type, the estimated execution time, the starting execution time, the ending execution time and the like.
As shown in fig. 5, the third processing flow (processing flow of a to-be-processed sheet having no pre-relationship and only post-relationship) includes the steps of:
step 41, judging whether the modification type of the to-be-modified list is the execution ending time; if not, go to step 42; if yes, judging whether the to-be-modified list is determined to be completed by a worker, if not, determining the initial execution time of the to-be-modified list, and at the moment, recalculating the estimated execution time by combining the initial execution time and the end execution time of the to-be-modified list; if the to-be-modified list is completed, ending the flow.
If the modification type of the to-be-modified list is the ending execution time and there is no starting execution time, ending the flow.
Step 42, judging whether the modification type of the to-be-modified list is the execution starting time; if not, go to step 43; if yes, resetting the starting execution time of the to-be-modified list, continuously judging whether the to-be-modified list corresponds to the Gantt chart or not, if yes, judging whether the to-be-modified list has the ending execution time, and if yes, calculating the estimated execution time again by combining the starting execution time and the ending execution time of the to-be-modified list; if the Gantt chart is not available, judging whether the to-be-modified list is determined to be completed by a worker, if the to-be-modified list is not completed, determining the estimated execution time length of the to-be-modified list, and at the moment, calculating the ending execution time again by combining the starting execution time length and the estimated execution time length of the to-be-modified list.
If the to-be-modified list corresponds to the Gantt chart and the execution time is not finished, ending the flow; if the to-be-modified list has no corresponding Gantt chart and the to-be-modified list is completed, ending the flow.
Step 43, judging whether the modification type of the to-be-modified list is estimated execution duration; if not, go to step 44; if yes, judging whether the to-be-modified list is determined to be completed by a worker, if not, determining the estimated execution time length of the to-be-modified list, and at the moment, calculating the ending execution time again by combining the starting execution time length and the estimated execution time length of the to-be-modified list; if the to-be-modified list is completed, ending the flow.
If the modification type of the to-be-modified list is the estimated execution duration and the initial execution time is not available, ending the flow.
Step 44, judging whether the modification type of the to-be-modified list is an execution time difference; if not, step 45 is executed, and if yes, the flow is ended. It should be noted that: the list to be processed with no pre-relation and only post-relation cannot modify the execution time difference.
Step 45, judging whether the modification type of the to-be-modified list is a front task list of the to-be-modified list; if not, ending the flow; if yes, judging whether the to-be-modified list is determined to be finished by a worker; if the to-be-modified list is not completed, determining the starting execution time and the ending execution time of the pre-task list, judging whether the pre-task list has estimated execution time, if so, calculating the ending execution time of the pre-task list according to the starting execution time and the estimated execution time of the pre-task list, and if not, calculating the estimated execution time of the pre-task list according to the starting execution time and the ending execution time of the pre-task list; and if the to-be-modified list is completed, canceling the modification and ending the flow.
Finally, the third processing flow (the processing flow of the to-be-processed list with no prepositions and only the postpositions) further includes: and collecting an output result and calculating parent node list time of the list to be processed. Specifically, the step of collecting the output result is: collecting information such as a task list number, a modification type, estimated execution time, starting execution time, ending execution time and the like; the parent node list time of the to-be-processed list can be calculated as follows: acquiring a parent level list of a current to-be-modified list, and correspondingly modifying time information of the parent level list based on modification contents (such as estimated execution time, initial execution time, end execution time and the like) of the current to-be-modified list, for example, acquiring a requirement list corresponding to a task list when the current to-be-modified list is the task list; and when the current to-be-modified list is the base list, acquiring a task list corresponding to the base list.
As shown in fig. 6, the fourth processing flow (processing flow of a sheet to be processed having no tandem relation) includes the steps of:
step 51, judging whether the modification type of the to-be-modified list is the execution ending time; if not, go to step 52; if yes, judging whether the execution starting time exists in the to-be-modified list, if not, ending the flow, if yes, resetting the execution ending time of the to-be-modified list, and rescheduling and setting the estimated execution time of the to-be-modified list.
Step 52, judging whether the modification type of the to-be-modified list is the execution starting time; if not, go to step 53; if yes, resetting the starting execution time of the to-be-modified list, judging whether the modification of the starting execution time is from the Gantt chart, if yes, rebuilding, constructing and calculating the estimated execution time, if not, judging whether the to-be-modified list has the estimated execution time, and if so, rebuilding and calculating the ending execution time to reset the ending execution time.
Step 43, judging whether the modification type of the to-be-modified list is estimated execution duration; if not, ending the flow; if yes, judging whether the to-be-modified list has the starting execution time, if yes, constructing and calculating the ending execution time of the to-be-modified list so as to reset the ending execution time.
Finally, the fourth process flow (process flow of the to-be-processed sheet without the tandem relation) further includes: and collecting an output result and calculating parent node list time of the list to be processed. Specifically, the step of collecting the output result is: collecting information such as a task list number, a modification type, estimated execution time, starting execution time, ending execution time and the like; the parent node list time of the to-be-processed list can be calculated as follows: acquiring a parent level list of a current to-be-modified list, and correspondingly modifying time information of the parent level list based on modification contents (such as estimated execution time, initial execution time, end execution time and the like) of the current to-be-modified list, for example, acquiring a requirement list corresponding to a task list when the current to-be-modified list is the task list; and when the current to-be-modified list is the base list, acquiring a task list corresponding to the base list.
It should be noted that: when calculating the execution starting time, the execution ending time, the preset execution time and the offset time (the execution time difference between the list to be modified and the pre-list of the list to be modified), the preset date is eliminated, wherein the preset date can be a legal holiday or a custom holiday.
It should be noted that the steps illustrated in the flowcharts of the figures may be performed in a computer system such as a set of computer executable instructions, and that although a logical order is illustrated in the flowcharts, in some cases the steps illustrated or described may be performed in an order other than that illustrated herein.
The embodiment of the application also provides a processing device for the art planning task, and it is to be noted that the processing device for the art planning task of the embodiment of the application can be used for executing the processing method for the art planning task provided by the embodiment of the application. The following describes a processing device for an art planning task provided in an embodiment of the present application.
Fig. 7 is a schematic diagram of a processing apparatus of an art planning task according to an embodiment of the present application. As shown in fig. 7, the apparatus includes: configuration unit 10, adjustment unit 20, update unit 30.
A configuration unit 10 for configuring a hierarchical relationship of art planning tasks to be performed, wherein the hierarchical relationship includes: according to the multiple requirement lists obtained by splitting the to-be-executed art planning task, multiple link lists corresponding to each requirement list and multiple base lists corresponding to each link list;
the adjusting unit 20 is configured to search a to-be-modified list according to the hierarchical relationship, and adjust time information of the to-be-modified list to obtain an adjustment result;
and the updating unit 30 is used for synchronously updating the time information of the association list of the list to be modified in the hierarchical relationship based on the adjustment result.
According to the processing method for the art planning task, the configuration unit 10 configures a hierarchical relationship of the art planning task to be executed, wherein the hierarchical relationship comprises: according to the multiple requirement lists obtained by splitting the to-be-executed art planning task, multiple link lists corresponding to each requirement list and multiple base lists corresponding to each link list; the adjusting unit 20 searches the list to be modified according to the hierarchical relationship, and adjusts the time information of the list to be modified to obtain an adjustment result; the updating unit 30 synchronously updates the time information of the related list of the list to be modified in the hierarchical relation based on the adjustment result, so as to solve the technical problems that the time modification relation among the demand list, the link list and the base list in the prior art resource management system in the related art cannot be embodied and the influence of the time modification is too simple.
That is, by pre-configuring the hierarchical relationship of the art planning task to be executed and then synchronously updating the time information of the associated list in the hierarchical relationship to be modified Shan Zaisuo based on the adjustment result of the list to be modified, the time information of the demand list/link list/base list in the system can be synchronously adjusted according to the hierarchical relationship, so that the situation that the influence of the modification on the time information of other demand list/link list/base list cannot be determined after the user modifies the time information of one demand list/link list/base list is avoided.
Optionally, the configuration unit 10 includes: the first splitting module is used for splitting at least one demand bill according to an art planning task to be executed, and splitting the demand bill to obtain a plurality of subset bills; the judging module is used for acquiring the data information of the plan type field set in the art plan task to be executed and judging whether the subset sheet is a demand sheet or not based on the data information; the second splitting module is used for splitting the subset list which is still the requirement list if the subset list of the requirement list is judged to be still the requirement list, and the requirement list is not judged to be the requirement list any more; and the third splitting module is used for determining the subset list as the link list if judging that the subset list is not the subset list of the requirement list, and splitting the link list to obtain a plurality of base lists.
Optionally, the configuration unit 10 further includes: a building module for building an execution order relationship between a plurality of sheets of a same hierarchy, wherein the plurality of sheets includes one of: a plurality of demand sheets, a plurality of link sheets, a plurality of base sheets, each sheet of the plurality of sheets having at most one pre-sheet; and the storage unit is used for storing the execution sequence relation by adopting a nested set model.
Optionally, the building module includes: the determining submodule is used for determining whether the list to be added is provided with a pre-list or not when the list is added in any level; the acquisition sub-module is used for acquiring all parent level sheets in the execution sequence relation of the sheets to be added if the front-end sheets are arranged; the judging sub-module is used for singly comparing the front list of the list to be added with all father levels and judging whether the same father level list exists or not; and the determining submodule is used for adding the list to be modified provided with the pre-list into the execution sequence relation if the same parent list does not exist.
Optionally, the adjusting unit 20 includes at least one of: the first adjusting module is used for adjusting the initial execution time of the to-be-modified list; the second adjusting module is used for adjusting the finishing execution time of the to-be-modified list; the third adjusting module is used for adjusting the estimated execution time length of the to-be-modified list; the fourth adjustment module is used for adjusting the pre-list of the list to be modified; and a fifth adjustment module, configured to adjust an execution time difference between the to-be-modified ticket and the pre-ticket in the execution order relation.
Optionally, the updating unit 30 includes: the second judging module is used for judging the type of the to-be-modified list and/or whether the relation list and the to-be-modified list have a front-back relation in the execution sequence relation or not, so as to obtain a judging result; and the updating module is used for synchronously updating the time information of the association list based on the adjustment result and the judgment result.
The foregoing embodiment numbers of the present invention are merely for the purpose of description, and do not represent the advantages or disadvantages of the embodiments.
In the foregoing embodiments of the present invention, the descriptions of the embodiments are emphasized, and for a portion of this disclosure that is not described in detail in this embodiment, reference is made to the related descriptions of other embodiments.
In the several embodiments provided in the present application, it should be understood that the disclosed technology content may be implemented in other manners. The above-described embodiments of the apparatus are merely exemplary, and the division of the units, for example, may be a logic function division, and may be implemented in another manner, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some interfaces, units or modules, or may be in electrical or other forms.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied essentially or in part or all of the technical solution or in part in the form of a software product stored in a storage medium, including instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a Read-Only Memory (ROM), a random access Memory (RAM, randomAccess Memory), a removable hard disk, a magnetic disk, or an optical disk, or other various media capable of storing program codes.
The foregoing is merely a preferred embodiment of the present invention and it should be noted that modifications and adaptations to those skilled in the art may be made without departing from the principles of the present invention, which are intended to be comprehended within the scope of the present invention.

Claims (14)

1. A method for processing an art planning task, comprising:
configuring a hierarchical relationship of art planning tasks to be executed, wherein the hierarchical relationship comprises: according to the multiple requirement lists obtained by splitting the to-be-executed art planning task, multiple link lists corresponding to each requirement list and multiple base lists corresponding to each link list;
searching a to-be-modified list according to the hierarchical relationship, and adjusting the time information of the to-be-modified list to obtain an adjustment result;
based on the adjustment result, synchronously updating the time information of the association list of the list to be modified in the hierarchical relationship;
wherein said configuring said hierarchical relationship of said art planning task to be performed further comprises: constructing an execution order relationship between a plurality of sheets of a same hierarchy, wherein the plurality of sheets includes one of: a plurality of demand sheets, a plurality of link sheets, a plurality of base sheets, each sheet of the plurality of sheets having at most one pre-sheet; and storing the execution sequence relation by adopting a nested set model.
2. The method of claim 1, wherein configuring the hierarchical relationship of the art planning task to be performed comprises:
splitting according to an art planning task to be executed to obtain at least one demand bill, and splitting the demand bill to obtain a plurality of sub-set bills;
acquiring data information of a plan type field set in the art plan task to be executed, and judging whether the subset sheet is a demand sheet or not based on the data information;
if the subset list of the requirement list is judged to be still the requirement list, splitting the subset list which is still the requirement list until the judging result is not the requirement list any more;
if the sub-list is not the requirement list, determining the sub-list as a link list, and splitting the link list to obtain a plurality of base lists.
3. The method of claim 1, wherein constructing the execution order relationship between multiple singles of a same hierarchy comprises:
when adding a list in any hierarchy, determining whether a list to be added is provided with a pre-list or not;
if the pre-list is arranged, acquiring all parent lists in the execution sequence relation of the list to be added;
comparing the pre-list of the list to be added with all father-level list, judging whether the same father-level list exists or not;
And if the same parent level list does not exist, adding the list to be added provided with the pre-list into the execution sequence relation.
4. The method of claim 1, wherein adjusting the time information of the ticket to be modified comprises at least one of:
adjusting the initial execution time of the to-be-modified list;
adjusting the finishing execution time of the to-be-modified list;
adjusting the estimated execution time length of the to-be-modified list;
adjusting the pre-list of the list to be modified;
and adjusting the execution time difference between the list to be modified and the pre-list in the execution sequence relation.
5. The method according to claim 1 or 4, wherein based on the adjustment result, synchronously updating the time information of the association list of the list to be modified in the hierarchical relationship comprises:
judging the type of the to-be-modified list and/or judging whether the relation list and the to-be-modified list have a front-to-back relation in the execution sequence relation or not, so as to obtain a judging result;
and based on the adjustment result and the judgment result, synchronously updating the time information of the association list.
6. A processing apparatus for an art planning task, comprising:
a configuration unit, configured to configure a hierarchical relationship of an art planning task to be executed, where the hierarchical relationship includes: according to the multiple requirement lists obtained by splitting the to-be-executed art planning task, multiple link lists corresponding to each requirement list and multiple base lists corresponding to each link list;
the adjusting unit is used for searching the list to be modified according to the hierarchical relation, and adjusting the time information of the list to be modified to obtain an adjusting result;
the updating unit is used for synchronously updating the time information of the association list of the list to be modified in the hierarchical relationship based on the adjustment result;
wherein the configuration unit further comprises: a building module for building an execution order relationship between a plurality of sheets of a same hierarchy, wherein the plurality of sheets includes one of: a plurality of demand sheets, a plurality of link sheets, a plurality of base sheets, each sheet of the plurality of sheets having at most one pre-sheet; and the storage unit is used for storing the execution sequence relation by adopting a nested set model.
7. The apparatus of claim 6, wherein the configuration unit comprises:
The first splitting module is used for splitting at least one demand bill according to an art planning task to be executed, and splitting the demand bill to obtain a plurality of subset bills;
the judging module is used for acquiring the data information of the plan type field set in the art plan task to be executed and judging whether the subset sheet is a demand sheet or not based on the data information;
the second splitting module is used for splitting the subset list which is still the requirement list if the subset list of the requirement list is judged to be still the requirement list, and the requirement list is not judged to be the requirement list any more;
and the third splitting module is used for determining the subset list as the link list if judging that the subset list is not the subset list of the requirement list, and splitting the link list to obtain a plurality of base lists.
8. The apparatus of claim 7, wherein the building block comprises:
the first determining submodule is used for determining whether a pre-arranged list is arranged on a list to be added or not when the list is added in any level;
the acquisition sub-module is used for acquiring all parent level sheets in the execution sequence relation of the sheets to be added if the front-end sheets are arranged;
the judging sub-module is used for singly comparing the front list of the list to be added with all father levels and judging whether the same father level list exists or not;
And the second determining submodule is used for adding the list to be added provided with the pre-list into the execution sequence relation if the same parent list does not exist.
9. The apparatus of claim 6, wherein the adjustment unit comprises at least one of:
the first adjusting module is used for adjusting the initial execution time of the to-be-modified list;
the second adjusting module is used for adjusting the finishing execution time of the to-be-modified list;
the third adjusting module is used for adjusting the estimated execution time length of the to-be-modified list;
the fourth adjustment module is used for adjusting the pre-list of the list to be modified;
and a fifth adjustment module, configured to adjust an execution time difference between the to-be-modified ticket and the pre-ticket in the execution order relation.
10. The apparatus according to claim 6 or 9, characterized by an updating unit comprising:
the second judging module is used for judging the type of the to-be-modified list and/or whether the relation list and the to-be-modified list have a front-back relation in the execution sequence relation or not, so as to obtain a judging result;
and the updating module is used for synchronously updating the time information of the association list based on the adjustment result and the judgment result.
11. A processor for executing a program, wherein the program executes the processing method for an art planning task according to any one of claims 1 to 5.
12. A terminal, comprising: one or more processors, a memory, a display device, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs comprising a processing method for performing the art planning task of any of claims 1-5.
13. A storage medium comprising a stored program, wherein the program performs the processing method of the art planning task of any one of claims 1 to 5.
14. An electronic device, comprising: one or more processors, a memory, a display device, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs comprising a processing method for performing the art planning task of any of claims 1-5.
CN202010255505.8A 2020-04-02 2020-04-02 Art planning task processing method and device Active CN111476478B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010255505.8A CN111476478B (en) 2020-04-02 2020-04-02 Art planning task processing method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010255505.8A CN111476478B (en) 2020-04-02 2020-04-02 Art planning task processing method and device

Publications (2)

Publication Number Publication Date
CN111476478A CN111476478A (en) 2020-07-31
CN111476478B true CN111476478B (en) 2024-01-23

Family

ID=71750530

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010255505.8A Active CN111476478B (en) 2020-04-02 2020-04-02 Art planning task processing method and device

Country Status (1)

Country Link
CN (1) CN111476478B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112214208A (en) * 2020-10-20 2021-01-12 平安国际智慧城市科技股份有限公司 Method for processing multilevel data and related product thereof

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109684339A (en) * 2018-11-21 2019-04-26 金蝶软件（中国）有限公司 Method of adjustment, device, computer equipment and the storage medium of supply and demand document
CN110489434A (en) * 2019-07-23 2019-11-22 中国平安财产保险股份有限公司 A kind of information processing method and relevant device
CN110737674A (en) * 2019-10-14 2020-01-31 深圳前海微众银行股份有限公司 Visual chart query method, device and equipment and computer storage medium

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109684339A (en) * 2018-11-21 2019-04-26 金蝶软件（中国）有限公司 Method of adjustment, device, computer equipment and the storage medium of supply and demand document
CN110489434A (en) * 2019-07-23 2019-11-22 中国平安财产保险股份有限公司 A kind of information processing method and relevant device
CN110737674A (en) * 2019-10-14 2020-01-31 深圳前海微众银行股份有限公司 Visual chart query method, device and equipment and computer storage medium

Also Published As

Publication number Publication date
CN111476478A (en) 2020-07-31

Similar Documents

Publication Publication Date Title
CN109213597A (en) Resource allocation methods, device, computer equipment and computer readable storage medium
CN109102334A (en) Market area partition method, apparatus and electronic equipment
CN107203424A (en) A kind of method and apparatus that deep learning operation is dispatched in distributed type assemblies
CN106371840A (en) Software development method and device based on crowdsourcing
CN106101213A (en) Information-distribution type storage method
Gabrel et al. Optimal and automatic transactional web service composition with dependency graph and 0-1 linear programming
CN109741142A (en) Order allocation method, Order splitting device, readable storage medium storing program for executing and electronic equipment
CN109740765A (en) A kind of machine learning system building method based on Amazon server
CN111142746A (en) System quota calculation method and device
CN111476478B (en) Art planning task processing method and device
CN111190691A (en) Automatic migration method, system, device and storage medium suitable for virtual machine
CN109656595A (en) The method, apparatus and system that client-side program updates
CN106572191A (en) Cross-data center collaborative calculation method and system thereof
CN109582461A (en) A kind of calculation resource disposition method and system for linux container
CN106254452A (en) The big data access method of medical treatment under cloud platform
WO2010136802A1 (en) Managing line items in a computer-based modular planning tool
US8010217B2 (en) Reconfiguration of assets for reuse during manufacturing
CN108536518A (en) Method and system, reference platform, service terminal and the memory of task scheduling
JP2005032079A (en) Project pre-evaluation method
US8818831B2 (en) Service level objective management system, service level objective management method and program
CN116089518A (en) Data model extraction method and system, terminal and medium
US8296329B1 (en) Controller with heuristic bundle optimizer for data center migration or other type of transition
CN106302656A (en) The Medical Data processing method of cloud storage platform
CN111147494B (en) Multi-center access management method and device for block chain light nodes
CN104700170B (en) A kind of method and apparatus that manufacturing cost calculates tree

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