1. A key chain planning and scheduling software algorithm based on the technology of the Internet of things is characterized by comprising the following steps:

s1, traversing a task list, and adding tasks, wherein the attributes of the tasks comprise working hours, skills, resources and dependency relations;

s2, performing topological sorting on all tasks, calculating the earliest starting time and the latest starting time, solving a basic key path, recording the number of days of the key path, adding a key task mark, and taking the earliest starting time for the key task and the latest starting time for the non-key task;

s3, converting the work hours and standard calendar of each task into real date;

s4, traversing all tasks according to the assigned skills, checking conflicts according to the skill list, if conflicts exist, adding task dependency relationships, giving way to key tasks by non-key tasks, resetting the dates and the times obtained in the steps, and repeatedly executing the step S1 and the step S2 until no skill conflicts exist;

s5, according to the assigned resources to traverse all tasks, checking whether resource conflict exists, if conflict exists, adding task dependency relationship, non-key task yield key task, resetting the date and time obtained in the steps, and repeating the steps S1 and S2 until no resource conflict exists, thus obtaining a key chain;

s6, adding item buffer and connection buffer according to the key chain;

and outputting the planned starting date and the planned ending date of each task.

2. The key chain planning and scheduling software algorithm based on the technology of the internet of things according to claim 1, wherein: in step S6, the excess margin after the task operation period is shortened by percentage is used as an item buffer and a docking buffer.

3. The key chain planning and scheduling software algorithm based on the technology of the internet of things according to claim 2, wherein: according to the latest starting time of the task and the time required for completing the task, the last work of the task is firstly arranged, then the second work and the long-term work are determined, the starting work of the task is finally arranged, and the project is buffered and arranged at the last stage of the task period.

4. The key chain planning and scheduling software algorithm based on the technology of the internet of things according to claim 1, wherein: for step S6, the docking buffer is set after the critical task.

5. The key chain planning and scheduling software algorithm based on the technology of the internet of things according to claim 1, wherein: and (5) aiming at the step S5, checking the rear wall after the key chain is obtained, and if the key chain exceeds the rear wall, shortening all task time periods according to the same proportion.

6. The key chain planning and scheduling software algorithm based on the technology of the internet of things according to claim 1, wherein: an available calendar is set for the resource on which the task depends, and when the resource is unavailable or exclusive to other tasks, it will no longer be used by the new task.

7. The key chain planning and scheduling software algorithm based on the technology of the internet of things according to claim 1, wherein: skill categories and descriptions for different resources are defined, and when a resource is not available at a time, the system can recommend available resources with the same skill for task selection.

8. The key chain planning and scheduling software algorithm based on the technology of the internet of things according to claim 1, wherein: and when the task key resources are changed, the task progress is adjusted and early-warned.

9. The key chain planning and scheduling software algorithm based on the technology of the internet of things according to claim 1 or 8, wherein: the equipment resources are connected through the Internet of things technology, the equipment state, the scheduling and the real-time production capacity are obtained in real time and are adapted to the plan, the plan is dynamically predicted and recommended, and the plan progress is dynamically and really reflected.

Background

At present, the project management software at home and abroad has the following problems: 1. the method is short of multi-dimensional resource management and control, most project management software only relates to human resources in resource management at present, and especially in the process of importing new products in product research and development, the trial-manufacture/trial-manufacture progress of the products with electromechanical and soft integration is closely related to a supply chain, key manufacturing and testing equipment;

2. lack of real-time dynamic updates of device status, scheduling and production capacity of critical device resources, resulting in a plan that does not feed back a true progress, even the scheduling before project startup is the project period and task time scheduling calculated under the condition of unavailable resources;

3. due to the lack of a scientific computing method, a scheduling plan is optimized when resources are limited, and the current project management software cannot complete plan scheduling and project change prediction in real time through resource analysis and balance in the project execution process;

4. resource conflict identification of missing multiple project dimensions leads to insufficient utilization estimation of key resources in the planning process and causes unreachable planning;

5. how to combine the dimensions of the project to complete the resource balance under the condition that the back wall is not fallen, namely the condition that the project completion time is not changeable is lacked.

Disclosure of Invention

In order to overcome the defects of the prior art, the invention aims to provide a key chain plan scheduling software algorithm based on the technology of the internet of things, which can automatically schedule and prevent resource conflict, acquire the resource state and the productivity of key equipment in real time by utilizing the technology of the internet of things, dynamically adjust the plan period and reduce the project delay risk through a buffer mechanism.

In order to achieve the purpose, the technical scheme adopted by the invention is as follows:

a key chain planning and scheduling software algorithm based on the technology of the Internet of things comprises the following steps:

s1, traversing the task list, adding tasks, wherein the attributes of the tasks comprise working hours, skills, resources and dependency relations;

s2, performing topological sorting on all tasks, calculating the earliest starting time and the latest starting time, solving a basic key path, recording the number of days of the key path, adding a key task mark, and taking the earliest starting time for the key task and the latest starting time for the non-key task;

s3, converting the work hours and standard calendar of each task into real date;

s4, traversing all tasks according to the assigned skills, checking conflicts according to the skill list, if conflicts exist, adding task dependency relationships, giving way to key tasks by non-key tasks, resetting the dates and the times obtained in the steps, and repeatedly executing the step S1 and the step S2 until no skill conflicts exist;

s5, according to the assigned resources to traverse all tasks, checking whether resource conflict exists, if conflict exists, adding task dependency relationship, non-key task yield key task, resetting the date and time obtained in the steps, repeating the step S1 and the step S2 until no resource conflict exists, and finally obtaining a key path which is a key chain;

s6, adding item buffer and connection buffer according to the key chain;

and finally outputting the results as the planned starting date and the planned ending date of each task.

Preferably, in step S6, the margin that is exceeded after the task operation period is shortened by a percentage is used as an entry buffer and a docking buffer.

Preferably, according to the latest starting time of the task and the time required by the completion of the task, the last work of the task is firstly arranged, then the second work and the long-term work are determined, the starting work of the task is finally arranged, the whole work arrangement adopts a reverse push method, the arrangement is carried out from the end of the task to the front, and the project is buffered and arranged at the last stage of the task period.

Preferably, in step S6, a docking buffer is provided after the mission critical.

Preferably, in step S5, the back wall is checked after the key chain is obtained, and if the key chain exceeds the back wall, all task time periods are shortened in the same proportion.

Preferably, an available calendar is set for the resource on which the task depends, and when the resource is unavailable or is monopolized by other tasks, it will not be used by the new task any more.

Preferably, skill categories and descriptions for different resources are defined, and when a resource is not available at a time, the system can recommend available resources with the same skills for task selection.

Preferably, when the task key resources are changed, the task progress is adjusted and early-warned.

Preferably, the equipment resources are connected through the Internet of things technology, the equipment state, the scheduling and the real-time production capacity are obtained in real time and are adapted to the plan, the plan is dynamically predicted and recommended, and the plan progress is dynamically and really reflected.

Compared with the prior art, the invention has the beneficial effects that:

the key chain plan scheduling software algorithm based on the internet of things technology completes multi-dimensional modeling of a plan, establishes a priority heuristic rule in a plan scheduling process, generates a near-optimal project plan with the shortest construction period, and ensures accurate scheduling of the plan;

identifying resource conflicts in the plan, iteratively optimizing plan scheduling through a priority rule, solving the problem that a project works out a reasonable project plan through key chain algorithm service under a constrained condition, and adjusting and early warning the project progress when key resources of the project change;

the buffer mechanism is utilized to complete construction period compression and resource scheduling, project delay risks are reduced, a connection task and project buffer of a key chain are introduced, a project plan is dynamically adjusted, a rear wall is guaranteed not to fall down, and the plan is guaranteed to be controlled and stably executed in an environment without determined resources;

the equipment resources are connected through the Internet of things technology, the equipment state, the scheduling and the real-time production capacity are obtained in real time and are adapted to the plan, the plan is dynamically predicted and recommended, the plan progress is dynamically and truly reflected, the plan period is dynamically adjusted, and the project execution efficiency is improved.

Drawings

Fig. 1 is an overall block diagram of the present invention.

Fig. 2 is an example of setting an available calendar.

FIG. 3 is an example of skill categories and descriptions defining different resources.

FIG. 4 shows an example of a key chain obtained after automatic scheduling.

FIG. 5 is an example of reducing a mission period.

FIG. 6 is an example of adding an item buffer and a docking buffer.

Detailed Description

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

Referring to fig. 1-6, the present invention provides a technical solution: a key chain planning and scheduling software algorithm based on the technology of the Internet of things comprises the following steps:

the method comprises the following steps: traversing a task list, and adding tasks, wherein the attributes of the tasks comprise working hours, skills, resources and dependency relations;

step two: performing topological sequencing on all tasks, calculating the earliest starting time and the latest starting time, identifying a planned key path through a graph theory, recording the number of days of the key path, adding a key task mark, and taking the earliest starting time for a key task and the latest starting time for a non-key task;

step three: converting into real date according to the working hour (unit: hour) of each task and the standard calendar (corresponding individual calendar when the resource is assigned);

step four: traversing all tasks according to the assigned skills, checking conflicts according to the skill list, if the conflicts exist, adding task dependency relationships and non-key tasks yielding key tasks, resetting the dates and the times obtained in the steps, and repeatedly executing the first step and the second step until no skill conflicts exist;

step five: traversing all tasks according to assigned resources, checking whether resource conflicts exist, if conflicts exist, adding task dependency relationships, giving way to key tasks by non-key tasks, resetting dates and time obtained in the steps, repeatedly executing the first step and the second step until no resource conflicts exist, determining that the finally obtained key path is a key chain, checking a back wall (namely locking project estimation end time), and if the back wall is exceeded under the condition of unchangeability, shortening all task time periods according to the same proportion;

step six: shortening excess margin after a task working period according to percentage to be used as a project buffer and a connection buffer, adding the project buffer and the connection buffer into a key chain, setting the connection buffer behind a key task, firstly arranging the last work of the task according to the latest starting time of the task and the time required by the completion of the task, then determining the second work and the long-term work, and finally arranging the initial work of the task, wherein the whole work arrangement adopts a reverse pushing method, the arrangement is carried out from the end of the task to the front, and the project buffer is arranged at the last stage of the task working period;

and finally outputting the results as the planned starting date and the planned ending date of each task.

Setting an available calendar aiming at resources depended by the tasks, defining skill categories and descriptions of different resources when the resources are unavailable or are exclusive by other tasks and the system can recommend the available resources with the same skills for task selection when the resources are unavailable at a certain time; if the resource is a fan and an air conditioner, the skill includes air supply, and when the fan is not available, the system can recommend using the air conditioner.

When the key resources of the task change, the task progress is adjusted and early warned, the equipment resources are connected through the Internet of things technology, the equipment state, the scheduling and the real-time production capacity are obtained in real time and are adapted to the plan, and the plan is dynamically predicted and recommended, so that the plan progress is dynamically and really reflected.

The priority rule is used for determining the priority order of task execution, each task in the feasible task set is endowed with a weight according to a certain scheduling rule, when the task is selected, whether the weight is maximized or minimized is determined according to the rule requirement, if a plurality of tasks have the same weight, the task is selected according to a method of getting rid of tie, and the simplest way of getting rid of tie is to select a task with the smallest label or adopt a simple random way for selection. And the characteristics of lack of universality and limited optimizing capability are solved through heuristic rules, and the advantages of simplicity, applicability and high calculation efficiency are finally realized.

Take three kinds of automatic scheduling of resource constraint as an example

The first embodiment is as follows: the first task, the second task and the third task sequentially need the first resource, the second resource and the third resource, so that the first task, the second task and the third task need to be carried out in a staggered mode, wherein the first task and the second task are sequentially marked as key tasks, and the first resource, the second resource and the third resource are sequentially used from the first task, the second task and the third task.

Example two: the first task, the second task and the third task sequentially need the first resource, the second resource and the third resource, so that the first task, the second task and the third task need to be carried out in a staggered mode, wherein the first task and the third task are sequentially marked as key tasks, and the first resource, the second resource and the third resource are sequentially used from the first task, the third task and the second task.

Example three: the first task, the second task and the third task sequentially need the first resource, the second resource and the third resource, so that the first task, the second task and the third task need to be carried out in a staggered mode, wherein the second task and the third task are sequentially marked as key tasks, and therefore the first resource, the second resource and the third resource are sequentially used from the second task, the third task and the first task.

Finally, it should be noted that: although the present invention has been described in detail with reference to the foregoing embodiments, it will be apparent to those skilled in the art that changes may be made in the embodiments and/or equivalents thereof without departing from the spirit and scope of the invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.