CN116151582A - Automatic version scheduling method and device based on resource identification and storage medium - Google Patents

Automatic version scheduling method and device based on resource identification and storage medium Download PDF

Info

Publication number
CN116151582A
CN116151582A CN202310204256.3A CN202310204256A CN116151582A CN 116151582 A CN116151582 A CN 116151582A CN 202310204256 A CN202310204256 A CN 202310204256A CN 116151582 A CN116151582 A CN 116151582A
Authority
CN
China
Prior art keywords
task
subtask
subtasks
period
working
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.)
Pending
Application number
CN202310204256.3A
Other languages
Chinese (zh)
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.)
Shanghai Zhongtongji Network Technology Co Ltd
Original Assignee
Shanghai Zhongtongji Network Technology 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 Shanghai Zhongtongji Network Technology Co Ltd filed Critical Shanghai Zhongtongji Network Technology Co Ltd
Priority to CN202310204256.3A priority Critical patent/CN116151582A/en
Publication of CN116151582A publication Critical patent/CN116151582A/en
Pending legal-status Critical Current

Links

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
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • 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/06311—Scheduling, planning or task assignment for a person or group
    • G06Q10/063116—Schedule adjustment for a person or group
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30—Computing systems specially adapted for manufacturing

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 embodiment of the invention provides a method, a device and a storage medium for automatically scheduling versions based on resource identification, belonging to the technical field of resource planning, wherein the method comprises the following steps: the task is split, task labels are identified for the split subtasks, the tasks are distributed to the working objects of the corresponding posts according to the task labels, when the tasks are distributed, task periods are divided according to task quantity of the tasks, available working time lengths of all the working objects of the corresponding posts in the task periods are counted, all the subtasks are distributed for the purpose of completing the tasks in the task periods, different work types of tasks are automatically identified according to the labeling of the tasks, various work key paths are calculated, the tasks are distributed according to available time lengths of the working objects of the corresponding posts, the efficient completion of the tasks can be guaranteed, and meanwhile the problem that the working strength of part of the working objects is overlarge due to unreasonable task distribution can be avoided.

Description

Automatic version scheduling method and device based on resource identification and storage medium
Technical Field
The invention belongs to the technical field of task scheduling, and particularly relates to an automatic version scheduling method and device based on resource identification and a storage medium.
Background
In the prior art, when a system task, particularly a staged systematic task is distributed, the working time of a working object of each post cannot be counted effectively, so that the task cannot be completed in the shortest time during task distribution, the working intensity of part of the working objects is high, the working intensity of part of the working objects is obviously lower, the utilization of human resources is unreasonable, and the task cannot be delivered in a specified time.
Disclosure of Invention
In order to at least solve the problems in the prior art, the invention provides a version automatic scheduling method, device and storage medium based on resource identification, which are used for solving the problems that in the prior art, statistics of total distribution amount of different types of tasks by each engineer cannot be automatically calculated, unreasonable distribution exists, resource waste exists and delivery timeliness is reduced.
The technical scheme provided by the invention is as follows:
a method for automatically scheduling versions based on resource identification, the method comprising:
splitting a task into a plurality of subtasks, and marking each subtask with a corresponding task label;
evaluating the task quantity of each subtask and determining the task period of the subtask;
determining a working object of a corresponding post according to the task label of each subtask, determining the working time length of the working object of the corresponding post in a task period, and distributing the subtask to the corresponding working object by taking the task quantity capable of completing the subtask in the task period of the subtask as a standard;
distributing all subtasks to the work objects of the corresponding posts according to task labels, and generating one or more task schedules;
when a plurality of task schedules exist, the user selects the corresponding task schedule according to the own requirements.
Preferably, the method comprises the steps of,
the splitting the task into a plurality of subtasks includes:
splitting the task according to the work content of the task in different stages to obtain a plurality of subtasks.
Preferably, the method comprises the steps of,
the task tag includes: front end, back end, IOS, android, data, test.
Preferably, the method comprises the steps of,
the evaluating the task amount of each subtask includes: selecting subtasks with the same work content from a historical task database according to the task labels and task contents of the split subtasks;
calculating average time of all subtasks, and taking the average time as the task quantity of the current subtasks;
determining the task period of the subtask according to the average daily work time of the post staff corresponding to the task label of the subtask;
or alternatively, the first and second heat exchangers may be,
and determining the task period of each subtask according to the total task period of the task.
Preferably, the method comprises the steps of,
the determining the working time length of the corresponding post working object in the task period comprises the following steps:
calculating the working time of all staff of the post in a certain period according to the working time of the overtime application, the working time of the leave and the working time of the adjustment and rest of the corresponding post working object in a certain period;
the subtask is assigned to a work object that can complete all the task amounts in a task cycle.
Preferably, the method comprises the steps of,
when the work object distributed with the subtasks temporarily leave or leave in the task period, the amount of the vacant task is determined according to the leave or leave-leave time, the amount of the vacant task is distributed to other staff who can finish the amount of the vacant task in the leave or leave-leave time of the staff, and the corresponding change of the task schedule is carried out.
Preferably, the method comprises the steps of,
when a plurality of work objects capable of completing the task quantity of the subtask in the task period exist in the corresponding positions, a plurality of task schedules are generated according to different staff allocated to each subtask and different expected time spent by different staff in completing the task quantity of the subtask.
An automatic version scheduling device based on resource identification, the device comprising:
and a task splitting module: the task splitting method comprises the steps of splitting a task into a plurality of subtasks, and marking each subtask with a corresponding task label;
task amount confirmation module: the task amount is used for evaluating each subtask, and the task period of the subtask is determined;
the task allocation module: the task management method comprises the steps of determining a working object of a corresponding post according to a task label of each subtask, determining the working time length of the working object of the corresponding post in a task period, and distributing the subtask to the corresponding working object by taking the task quantity capable of completing the subtask in the task period of the subtask as a standard;
the task schedule generation module: the task scheduling method comprises the steps of distributing all subtasks to work objects of corresponding posts according to task labels, and generating one or more task scheduling tables;
when a plurality of task schedules exist, the user selects the corresponding task schedule according to the own requirements.
A storage medium storing a computer program which, when executed by a processor, performs the steps of a method of automatic scheduling of versions based on resource identification as claimed in any one of the preceding claims.
The beneficial effects of the invention are as follows:
according to the method, the tasks are split, the split subtasks are identified, the tasks are distributed to the working objects of the corresponding posts according to the task labels, when the tasks are distributed, the task periods are divided according to the task quantity of the tasks, the available working time length of all the working objects of the corresponding posts in the task periods is counted, all the subtasks are distributed with the aim of completing the tasks in the task periods, different work types of tasks are automatically identified according to the labeling of the tasks, various work key paths are calculated, the tasks are distributed according to the available time length of the working objects of the corresponding posts, the efficient completion of the tasks can be guaranteed, and meanwhile the problem that the working strength of part of the working objects is overlarge due to unreasonable task distribution can be avoided.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flowchart of a method for automatically scheduling versions based on resource identifiers according to an embodiment of the present invention;
FIG. 2 is a system diagram of a version automatic scheduling device based on resource identification according to an embodiment of the present invention;
reference numerals:
the system comprises a 1-task splitting module, a 2-task quantity confirming module, a 3-task allocation module and a 4-task schedule generating module.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be described in detail below. It will be apparent that the described embodiments are only some, but not all, embodiments of the invention. All other embodiments, based on the examples herein, which are within the scope of the invention as defined by the claims, will be within the scope of the invention as defined by the claims.
FIG. 1 is a flowchart of a method for automatically scheduling versions based on resource identifiers according to an embodiment of the present invention; as shown in fig. 1, the method includes:
s1, splitting a task into a plurality of subtasks, and marking each subtask with a corresponding task label;
s2, evaluating the task quantity of each subtask, and determining the task period of the subtask;
s3, determining a working object of a corresponding post according to the task label of each subtask, determining the working time length of the working object of the corresponding post in a task period, and distributing the subtask to the corresponding working object by taking the task quantity capable of completing the subtask in the task period of the subtask as a standard;
s4, after distributing all the subtasks to the work objects of the corresponding posts according to task labels, generating one or more task schedules; when a plurality of task schedules exist, a user selects a corresponding task schedule according to own requirements;
it can be understood that the application splits the task into a plurality of subtasks, by marking each subtask with a corresponding task label to identify the subtask, and simultaneously, task allocation is carried out on the subtask according to the task label, the task amount of each subtask is evaluated, the task period of the subtask is determined, it is worth emphasizing that the task period is the number of days for completing the subtask, after knowing the task amount of the subtask, the number of days for completing the task theory can be obtained according to the task amount of the subtask compared with the working time length of the previous employee, the task period is generally larger than the number of days for completing the task theory, fault-tolerant time is left, the task label of the subtask is used for determining the position corresponding to the subtask, the working time length of all the position is determined according to the information of an OA system, after the working time length of the position in the task period is determined, the task allocation can be carried out by taking the subtask as a standard in the task period, it is worth noting that the situation that the subtask can be completed in the task period, the staff can complete the subtask in the task period, the embodiment can carry out the statistics on different situations in the day, the working time can be all the time can be carried out by the staff, the schedule can be adjusted according to the time schedule, the requirements can be adjusted according to the requirements of the user, the task can be automatically, the quality can be adjusted according to the task schedule can be obtained, and the quality can be adjusted by the user, and the quality can be adjusted according to the task can be obtained, and the task can be automatically, and the task can be adjusted according to the task can be automatically by the user, the adjustment result is synchronously on the task schedule of each work object, different work types of tasks are automatically identified according to the labeling of the tasks through the scheme, the key paths of each work type are calculated, the tasks are distributed according to the available time length of the corresponding post work object, the efficient completion of the tasks can be ensured, and meanwhile, the problem that the work intensity of part of the work objects is overlarge due to unreasonable task distribution can be avoided.
Preferably, the method comprises the steps of,
the splitting the task into a plurality of subtasks includes:
splitting the task according to the work content of the task in different stages to obtain a plurality of subtasks;
it will be appreciated that a task or an item typically requires the cooperation of persons from different departments to complete the task, and that some may be multiple departments to perform synchronously, and some may be that after one department completes, the next department can perform work next, and when calculating the total period of the task, it must be determined according to whether there is continuity between the subtasks, if there is no continuity between the subtasks, that is, multiple subtasks are performed synchronously, the longest task period in the subtasks is the total period of the task, and if there is continuity between the subtasks, the total task periods are all the subtask periods added, if some subtasks can be performed synchronously, and if there is continuity in the whole, then when calculating the total period of the task, only the task period of the subtask with the longest task period will be calculated.
Preferably, the method comprises the steps of,
the task tag includes: front end, back end, IOS, android, data, test;
it will be appreciated that an item or task may be distinguished by a front-end, back-end, data or test label, depending on the content of the job, where each label corresponds to a department.
Preferably, the method comprises the steps of,
the evaluating the task amount of each subtask includes: selecting subtasks with the same work content from a historical task database according to the task labels and task contents of the split subtasks;
calculating average time of all subtasks, and taking the average time as the task quantity of the current subtasks;
determining the task period of the subtask according to the average daily work time of the post staff corresponding to the task label of the subtask;
or alternatively, the first and second heat exchangers may be,
determining the task period of each subtask according to the total task period of the task;
it will be appreciated that if the subtask is already present in the historical task database, that is, the subtask is what the company has done, which is also very common in reality, most staff is repeatedly completing a task, in which case the task size of the subtask can be used as the task size of the subtask according to the average time of all the same subtasks in the historical task database, and the task size is counted in hours; there will of course be tasks that the subtask was never done, and the typical user will give a delivery deadline when delivering the task, and then manually divide the task cycles of each subtask according to the delivery deadline.
Preferably, the method comprises the steps of,
the determining the working time length of the corresponding post working object in the task period comprises the following steps:
calculating the working time of all staff of the post in a certain period according to the working time of the overtime application, the working time of the leave and the working time of the adjustment and rest of the corresponding post working object in a certain period;
distributing the subtasks to the work objects which can complete all task amounts in a task period;
it can be understood that the method for determining the working time of all the working objects of the post or the department in the task period is as follows: if the task period is 10 days, that is, the task amount of the subtasks needs to be completed in 10 days, the available time of all the working objects of the department needs to be counted, then the working time, the leave-in time and the adjustment time of all staff need to be known in 10 days in the future, the working time of the staff in the task period is obtained by adding and subtracting the working time of the staff on the basis of basic working time, such as eight hours of working per day, and the working time of the staff in the working period is synchronously updated on an OA system of a company, so that the working time of the staff can be obtained only by being in butt joint with the OA system.
Preferably, the method comprises the steps of,
when a work object distributed with a subtask temporarily asks for a leave or is called for a leave in a task period, determining the amount of the vacant task according to the time length of asking for a leave or is called for a leave, distributing the amount of the vacant task to other staff who can finish the amount of the vacant task in the time of asking for a leave or is called for a leave of the staff at the post, and carrying out corresponding change of a task schedule;
it can be understood that, due to the prediction of the working time length of the staff in the 10 days in the future, there is a work object with a subtask arranged, because of the emergency, needing to ask for the leave or call for rest, if the time length of the ask for the leave or call for rest does not lead to the overtime of the task, then no adjustment is performed, and if all the task amounts cannot be completed in the task period because of the ask for the leave, then the vacant task amounts are determined according to the ask for the leave or call for rest time length of the staff, and among the remaining work objects in the post, the work object capable of completing the vacant task amounts in the task period is selected and distributed, and meanwhile, the result of the change adjustment is updated synchronously in the task schedule.
Preferably, the method comprises the steps of,
when a plurality of work objects capable of completing the task quantity of the subtask in the task period exist in the corresponding positions, generating a plurality of task schedules according to different staff allocated to each subtask and different expected time for different staff to complete the task quantity of the subtask;
it can be understood that when the subtasks are distributed, since there are multiple staff completing the subtasks in the task period, the system can count all the situations respectively, so that multiple task schedules can be generated, when there are multiple task schedules, the user can select the final task schedule according to the expected time, and can also ensure the task quality preferentially, that is, perform certain screening or making standard on the work objects executing each subtask of the task.
As shown in fig. 2, the embodiment also discloses an automatic version scheduling device based on resource identification,
the device comprises:
task splitting module 1: the task splitting method comprises the steps of splitting a task into a plurality of subtasks, and marking each subtask with a corresponding task label;
task amount confirmation module 2: the task amount is used for evaluating each subtask, and the task period of the subtask is determined;
task allocation module 3: the task management method comprises the steps of determining a working object of a corresponding post according to a task label of each subtask, determining the working time length of the working object of the corresponding post in a task period, and distributing the subtask to the corresponding working object by taking the task quantity capable of completing the subtask in the task period of the subtask as a standard;
task schedule generation module 4: the task scheduling method comprises the steps of distributing all subtasks to work objects of corresponding posts according to task labels, and generating one or more task scheduling tables; when a plurality of task schedules exist, a user selects a corresponding task schedule according to own requirements;
it can be understood that the task is split into a plurality of subtasks through the task splitting module 1, corresponding task labels are marked on each subtask, the task quantity of each subtask is evaluated through the task quantity confirming module 2, and the task period of the subtask is determined; the task allocation module 3 determines the working object of the corresponding post according to the task label of each subtask, determines the working time length of the working object of the corresponding post in the task period, and allocates the subtask to the corresponding working object by taking the task quantity capable of completing the subtask in the task period of the subtask as a standard; after all subtasks are distributed to the work objects of the corresponding posts according to task labels through a task schedule generating module 4, one or more task schedules are generated; when a plurality of task schedules exist, a user selects a corresponding task schedule according to own requirements; through the scheme, the tasks are labeled, the tasks of different work types are automatically identified, the key paths of each work type are calculated, the tasks are distributed according to the available time length of the corresponding post work object, the efficient completion of the tasks can be ensured, and meanwhile, the problem that the work intensity of part of the work objects is overlarge due to unreasonable task distribution can be avoided.
The embodiment also discloses a storage medium, which stores a computer program, and when the computer program is executed by a processor, the steps in the automatic version scheduling method based on the resource identification are realized.
The foregoing is merely illustrative of the present invention, and the present invention is not limited thereto, and any person skilled in the art will readily recognize that variations or substitutions are within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
It is to be understood that the same or similar parts in the above embodiments may be referred to each other, and that in some embodiments, the same or similar parts in other embodiments may be referred to.
It should be noted that in the description of the present invention, the terms "first," "second," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance. Furthermore, in the description of the present invention, unless otherwise indicated, the meaning of "plurality" means at least two.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and further implementations are included within the scope of the preferred embodiment of the present invention in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the present invention.
It is to be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above-described embodiments, the various steps or methods may be implemented in software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, may be implemented using any one or combination of the following techniques, as is well known in the art: discrete logic circuits having logic gates for implementing logic functions on data signals, application specific integrated circuits having suitable combinational logic gates, programmable Gate Arrays (PGAs), field Programmable Gate Arrays (FPGAs), and the like.
Those of ordinary skill in the art will appreciate that all or a portion of the steps carried out in the method of the above-described embodiments may be implemented by a program to instruct related hardware, where the program may be stored in a computer readable storage medium, and where the program, when executed, includes one or a combination of the steps of the method embodiments.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing module, or each unit may exist alone physically, or two or more units may be integrated in one module. The integrated modules may be implemented in hardware or in software functional modules. The integrated modules may also be stored in a computer readable storage medium if implemented in the form of software functional modules and sold or used as a stand-alone product.
The above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, or the like.
In the description of the present specification, a description referring to terms "one embodiment," "some embodiments," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present invention. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiments or examples. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
While embodiments of the present invention have been shown and described above, it will be understood that the above embodiments are illustrative and not to be construed as limiting the invention, and that variations, modifications, alternatives and variations may be made to the above embodiments by one of ordinary skill in the art within the scope of the invention.

Claims (9)

1. A method for automatically scheduling versions based on resource identification, the method comprising:
splitting a task into a plurality of subtasks, and marking each subtask with a corresponding task label;
evaluating the task quantity of each subtask and determining the task period of the subtask;
determining a working object of a corresponding post according to the task label of each subtask, determining the working time length of the working object of the corresponding post in a task period, and distributing the subtask to the corresponding working object by taking the task quantity capable of completing the subtask in the task period of the subtask as a standard;
distributing all subtasks to the work objects of the corresponding posts according to task labels, and generating one or more task schedules;
when a plurality of task schedules exist, the user selects the corresponding task schedule according to the own requirements.
2. The method of claim 1, wherein the step of determining the position of the substrate comprises,
the splitting the task into a plurality of subtasks includes:
splitting the task according to the work content of the task in different stages to obtain a plurality of subtasks.
3. The method of claim 2, wherein the step of determining the position of the first electrode is performed,
the task tag includes: front end, back end, IOS, android, data, test.
4. The method of claim 3, wherein the step of,
the evaluating the task amount of each subtask includes: selecting subtasks with the same work content from a historical task database according to the task labels and task contents of the split subtasks;
calculating average time of all subtasks, and taking the average time as the task quantity of the current subtasks;
determining the task period of the subtask according to the average daily work time of the post staff corresponding to the task label of the subtask;
or alternatively, the first and second heat exchangers may be,
and determining the task period of each subtask according to the total task period of the task.
5. The method of claim 4, wherein the step of determining the position of the first electrode is performed,
the determining the working time length of the corresponding post working object in the task period comprises the following steps:
calculating the working time of all staff of the post in a certain period according to the working time of the overtime application, the working time of the leave and the working time of the adjustment and rest of the corresponding post working object in a certain period;
the subtask is assigned to a work object that can complete all the task amounts in a task cycle.
6. The method of claim 5, wherein the step of determining the position of the probe is performed,
when the work object distributed with the subtasks temporarily leave or leave in the task period, the amount of the vacant task is determined according to the leave or leave-leave time, the amount of the vacant task is distributed to other staff who can finish the amount of the vacant task in the leave or leave-leave time of the staff, and the corresponding change of the task schedule is carried out.
7. The method of claim 6, wherein the step of providing the first layer comprises,
when a plurality of work objects capable of completing the task quantity of the subtask in the task period exist in the corresponding positions, a plurality of task schedules are generated according to different staff allocated to each subtask and different expected time spent by different staff in completing the task quantity of the subtask.
8. An automatic version scheduling device based on resource identification, the device comprising:
and a task splitting module: the task splitting method comprises the steps of splitting a task into a plurality of subtasks, and marking each subtask with a corresponding task label;
task amount confirmation module: the task amount is used for evaluating each subtask, and the task period of the subtask is determined;
the task allocation module: the task management method comprises the steps of determining a working object of a corresponding post according to a task label of each subtask, determining the working time length of the working object of the corresponding post in a task period, and distributing the subtask to the corresponding working object by taking the task quantity capable of completing the subtask in the task period of the subtask as a standard;
the task schedule generation module: the task scheduling method comprises the steps of distributing all subtasks to work objects of corresponding posts according to task labels, and generating one or more task scheduling tables;
when a plurality of task schedules exist, the user selects the corresponding task schedule according to the own requirements.
9. A storage medium storing a computer program which, when executed by a processor, implements the steps of a resource identification based version automatic scheduling method of any one of claims 1-7.
CN202310204256.3A 2023-03-03 2023-03-03 Automatic version scheduling method and device based on resource identification and storage medium Pending CN116151582A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310204256.3A CN116151582A (en) 2023-03-03 2023-03-03 Automatic version scheduling method and device based on resource identification and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310204256.3A CN116151582A (en) 2023-03-03 2023-03-03 Automatic version scheduling method and device based on resource identification and storage medium

Publications (1)

Publication Number Publication Date
CN116151582A true CN116151582A (en) 2023-05-23

Family

ID=86352478

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310204256.3A Pending CN116151582A (en) 2023-03-03 2023-03-03 Automatic version scheduling method and device based on resource identification and storage medium

Country Status (1)

Country Link
CN (1) CN116151582A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116663860A (en) * 2023-07-27 2023-08-29 深圳昊通技术有限公司 Task allocation method and system for project demands and readable storage medium

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116663860A (en) * 2023-07-27 2023-08-29 深圳昊通技术有限公司 Task allocation method and system for project demands and readable storage medium
CN116663860B (en) * 2023-07-27 2024-01-09 深圳昊通技术有限公司 Task allocation method and system for project demands and readable storage medium

Similar Documents

Publication Publication Date Title
US7159206B1 (en) Automated process execution for project management
CN109559088A (en) Task management method, device, electronic equipment and storage medium
US8005706B1 (en) Method for identifying risks for dependent projects based on an enhanced telecom operations map
US20070150327A1 (en) Project management method and system
EP1681634A1 (en) Method and system for tracking changes in a document
US7155700B1 (en) Computer program having an object module and a software project definition module which customize tasks in phases of a project represented by a linked object structure
US8280756B1 (en) Milestone initial scheduling
US20150134386A1 (en) Collectively optimizing group schedules to minimize project completion time and cost
CN111563703B (en) Project management system, project management method, computer device, and computer-readable storage medium
US20150242782A1 (en) Interactive Planning Method And Tool
CN116151582A (en) Automatic version scheduling method and device based on resource identification and storage medium
KR20180109785A (en) Method and apparatus for assisting strategy map management based on schedule-assessment item and todo-assessment item
KR20180013474A (en) Method and apparatus for assisting strategy map management based on schedule-assessment item and todo-assessment item
CN117196530A (en) Digital intelligent scheduling method and system for software project set and human resource pool
JPH09101987A (en) Project progress managing device
Yordanova et al. An Agile methodology for managing business processes in an IT company
CN112308516A (en) Target project information generation method and related equipment
Afifi et al. RBPSim: A Resource-aware Extension of BPSim Using Workflow Resource Patterns.
US20080040198A1 (en) Device and Method for Modeling Electronic Business Transactions
US20040078254A1 (en) Methods and systems for human resource budgeting and control
JP2006146530A (en) Scheduling support system
CN113902350A (en) Scheduling method and device and computer readable storage medium
CN112766719A (en) Task allocation method and device
US20150356518A1 (en) Aggregate task system
JP2003331114A (en) Apparatus and method for evaluating design alteration and program

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