Network cutover task scheduling method and device, electronic equipment and storage medium

Abstract

The application discloses a network switching task scheduling method, and belongs to the technical field of communication. The method comprises the following steps: setting a scheduling period; obtaining information of switching tasks in the scheduling period, wherein the information of the switching tasks comprises a priority level of the switching tasks, and the priority level represents a necessary degree of scheduling of the switching tasks in the scheduling period; performing conflict comparison on all the switching tasks, and generating a conflict level for the switching tasks, wherein the conflict level represents a severity of conflict of the switching tasks with the rest of the switching tasks in the scheduling period; and outputting a scheduling result through a preset scheduling model, wherein the scheduling model schedules all the switching tasks as a strong constraint condition of the priority level and a weak constraint condition of the conflict level. The method can automatically schedule the network switching tasks, and can schedule as many switching tasks with high priority levels as possible under the premise that the switching tasks that must be scheduled in the scheduling period are scheduled, and the conflict between the switching tasks is reduced as much as possible.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of communication technology, in particular to a network cutting task scheduling method and device, electronic equipment and storage medium. BACKGROUND

[0002] With the development of communication business, the transmission network is becoming more and more complex. The adjustment of network structure, replacement of network line, change of network device configuration, addition or replacement of network device, etc. requires cutting of devices and lines in the network. Network cutting needs to consider the influence on other links and other provinces, as well as the relationship between primary and backup optical fibers, to ensure the smoothness of primary and backup links and security links in the existing network, and to balance the demand urgency, demand priority, upper-layer bearing business demand and conflict avoidance of each province.

[0003] At present, major network operators mainly use manual scheduling for network cutting task scheduling. Each province submits a network cutting task work order, and the work order is audited and a scheduling strategy is developed manually according to personal experience. This manual network cutting task scheduling method wastes manpower, and has low scheduling efficiency, is prone to errors, and has poor scheduling results. SUMMARY

[0004] Therefore, the present application provides a network cutting task scheduling method, device, electronic equipment and storage medium to solve the problems of manpower waste, low scheduling efficiency, error-prone, and poor scheduling results caused by manual network cutting task scheduling in the prior art.

[0005] To achieve the above purpose, the first aspect of the present application provides a network cutting task scheduling method, comprising:

[0006] setting a scheduling period;

[0007] obtaining information of cutting tasks in the scheduling period, the information of the cutting tasks including a priority level of the cutting tasks, the priority level indicating the necessity of scheduling the cutting tasks in the scheduling period;

[0008] conflict comparison is performed on all the cutting tasks, and a conflict level is generated for the cutting tasks, the conflict level indicating the severity of the conflict between the cutting task and the remaining cutting tasks in the scheduling period;

[0009] outputting a scheduling result through a preset scheduling model, the scheduling model scheduling all the cutting tasks with the priority level as a strong constraint condition and the conflict level as a weak constraint condition.

[0010] Optionally, the scheduling model is preset with different scores of different priority levels and different scores of different conflict levels, the score of the priority level is a positive value, and the score of the conflict level is a negative value.

[0011] For the same level of the priority level and the conflict level, the score of the priority level is greater than the absolute value of the score of the conflict level, and for the adjacent two levels of the priority level and the conflict level, the score of the lower level of the priority level is less than or equal to the absolute value of the score of the higher level of the conflict level.

[0012] The scheduling model sums up the preset different scores of different priority levels and different scores of different conflict levels to obtain a solution with the maximum total score, and schedules all the cut-in tasks according to the solution.

[0013] Optionally, for the adjacent two levels of the priority level and the conflict level, the difference between the score of the lower level of the priority level and the absolute value of the score of the lower level of the conflict level is greater than the difference between the score of the higher level of the priority level and the absolute value of the score of the higher level of the conflict level.

[0014] Optionally, the scheduling model is further preset with a score of a task density, the score of the task density is a negative value, and if the difference between the number of the cut-in tasks scheduled in different time periods in the scheduling period is greater than or equal to a preset amount, the scheduling model further considers the score of the task density when solving.

[0015] Optionally, the absolute value of the score of the task density is between the score of the highest level of the priority level and the score of the lowest level of the priority level, and / or the score of the task density is less than the score of the highest level of the conflict level.

[0016] Optionally, the different time periods include two adjacent days, and / or the preset amount includes a multiple.

[0017] Optionally, the information of the cut-in task further includes a number, a name and a cut-in time of the cut-in task.

[0018] The second aspect of the present application provides a scheduling device for network cut-in tasks, comprising:

[0019] A setting module is configured to set a scheduling period.

[0020] An acquisition module is configured to acquire information of a cut-in task, the information of the cut-in task including a priority level of the cut-in task, the priority level indicating a scheduling necessity degree of the cut-in task in the scheduling period.

[0021] a comparison module configured to compare all the cut-over tasks for conflicts and generate a conflict level for the cut-over tasks, the conflict level representing a conflict severity of the cut-over tasks in the scheduling period;

[0022] a processing module configured to output a scheduling result by a preset scheduling model, the scheduling model scheduling all the cut-over tasks with the priority level as a strong constraint condition and the conflict level as a weak constraint condition.

[0023] The third aspect of the present application provides an electronic device, comprising:

[0024] one or more processors;

[0025] a memory having one or more programs stored thereon, when the one or more programs are executed by the one or more processors, the one or more processors implement the method for scheduling network cut-over tasks according to the first aspect of the present application;

[0026] one or more I / O interfaces connected between the processor and the memory and configured to implement information interaction between the processor and the memory.

[0027] The fourth aspect of the present application provides a computer readable medium having a computer program stored thereon, when the program is executed by a processor, the method for scheduling network cut-over tasks according to the first aspect of the present application is implemented.

[0028] The present application has the following advantages:

[0029] The method and device for scheduling network cut-over tasks, the electronic device and the storage medium provided by the present application set a scheduling period, acquire priority level information representing a scheduling necessity of the cut-over tasks in the scheduling period, compare all the cut-over tasks in the scheduling period for conflicts, generate a conflict level for the cut-over tasks, the conflict level representing a conflict severity of the cut-over tasks in the scheduling period, and schedule all the cut-over tasks with the priority level as a strong constraint condition and the conflict level as a weak constraint condition by a preset scheduling model to output a scheduling result. Thus, the network cut-over tasks can be automatically scheduled, and the cut-over tasks with high priority levels can be scheduled as much as possible while the cut-over tasks that must be scheduled in the scheduling period are scheduled, and the conflicts between the cut-over tasks are reduced as much as possible. Thus, the problems of human resource waste, low scheduling efficiency, errors, and poor scheduling effect caused by manual scheduling of network cut-over tasks in the prior art can be solved, and the human resource waste is reduced, the scheduling efficiency is improved, the error probability is reduced, and the scheduling effect is improved. BRIEF DESCRIPTION OF DRAWINGS

[0030] The accompanying drawings are included to provide a further understanding of the application and are incorporated in and constitute a part of this specification, illustrate embodiments of the application and serve to explain the principles of the application, but do not limit the application.

[0031] Figure 1 A flow chart of a network cutover task scheduling method provided by an embodiment of the application is shown in FIG. 1.

[0032] Figure 2 A structural schematic diagram of an electronic device provided by an embodiment of the application is shown in FIG. 2. DETAILED DESCRIPTION

[0033] The specific embodiments of the application will be described in detail below with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are merely illustrative and explanatory and are not intended to limit the application.

[0034] As used herein, the term "and / or" includes any and all combinations of one or more of the associated listed items.

[0035] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.

[0036] When the term "comprising" or "made of" is used in the application, it is specified that the features, integers, steps, operations, elements and / or components exist, but it does not exclude the presence or addition of one or more other features, integers, steps, operations, elements, components and / or groups thereof.

[0037] The embodiments described herein can be described with reference to plan views and / or cross-sectional views by virtue of the fact that the application is ideally suited to such illustrative views. Thus, the illustrated embodiments can be modified to provide for example, example illustrations of the application.

[0038] Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and the present application, and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.

[0039] In a first aspect, an embodiment of the application provides a network cutover task scheduling method, comprising:

[0040] S1, setting a scheduling period;

[0041] S2, acquire information of the cut-over task in the scheduling period, the information of the cut-over task including a priority level of the cut-over task, the priority level indicating a necessary degree of scheduling of the cut-over task in the scheduling period;

[0042] S3, perform conflict comparison on all the cut-over tasks, and generate a conflict level for the cut-over task, the conflict level indicating a severity of conflict of the cut-over task with the rest of the cut-over tasks in the scheduling period;

[0043] S4, output a scheduling result by a preset scheduling model, the scheduling model scheduling all the cut-over tasks with the priority level as a strong constraint condition and the conflict level as a weak constraint condition.

[0044] The network cut-over task scheduling method, device, electronic equipment and storage medium provided by the embodiment of the application can set a scheduling period, acquire priority level information indicating a necessary degree of scheduling of the cut-over task in the scheduling period, perform conflict comparison on all the cut-over tasks in the scheduling period, and generate a conflict level indicating a severity of conflict of the cut-over task in the scheduling period, so that all the cut-over tasks can be scheduled by a preset scheduling model with the priority level as a strong constraint condition and the conflict level as a weak constraint condition, and a scheduling result can be output, thereby automatically scheduling the network cut-over task, scheduling as many cut-over tasks with a high priority level as possible under the premise that the cut-over tasks that must be scheduled in the scheduling period are scheduled, and reducing the conflict between the cut-over tasks as much as possible, thereby solving the problems of human waste, low scheduling efficiency, error-prone, and poor scheduling effect caused by manual scheduling of the network cut-over task in the prior art, and reducing human waste, improving scheduling efficiency, reducing the probability of scheduling error, and improving the scheduling effect.

[0045] In actual application, the information of the cut-over task can be presented in the form of a work order.

[0046] Optionally, setting the scheduling period can include setting a date and time of starting scheduling and a date and time of ending scheduling. However, the way of setting the scheduling period is not limited thereto.

[0047] Optionally, the priority level can include a first priority level and a second priority level. The first priority level can indicate that the cut-over task must be scheduled in the scheduling period, and the second priority level can indicate that the cut-over task is preferentially scheduled in the scheduling period. The necessary degree of the cut-over task of the first priority level is higher than that of the cut-over task of the second priority level, that is, the cut-over task of the first priority level is more preferentially scheduled than the cut-over task of the second priority level in the scheduling period. However, the way of setting the priority level is not limited thereto.

[0048] Optionally, the conflict level can include a first level conflict and a second level conflict. The conflict severity of the first level conflict between the splicing task and the rest of the splicing tasks in the scheduling period can be higher than the conflict severity of the second level conflict between the splicing task and the rest of the splicing tasks in the scheduling period, that is, the conflict between the first level conflict and the rest of the splicing tasks in the scheduling period is more serious than the conflict between the second level conflict and the rest of the splicing tasks in the scheduling period. However, the setting method of the conflict level is not limited to this.

[0049] In actual application, the conflict between each splicing task and the rest of the splicing tasks can be compared according to the hierarchical association relationship of the fiber core of the splicing task, the WDM optical amplification segment, the SDH multiplexing segment, and the service circuit, and the conflict level of the splicing task with conflict can be generated. However, the conflict comparison method of all splicing tasks is not limited to this.

[0050] In actual application, the scheduling model can schedule all splicing tasks with the priority level as a strong constraint condition and the conflict level as a weak constraint condition, so that the first priority must be scheduled in the scheduling period, and for example, the second priority non-must be scheduled in the scheduling period. The splicing task can be scheduled according to the conflict level, for example, for the second priority and the first level conflict splicing task, since it is a non-must be scheduled splicing task, and the conflict severity between it and the rest of the splicing tasks is high, so it can be set according to other actual conditions to be scheduled in the scheduling period or not to be scheduled in the scheduling period. For the second priority and the second level conflict splicing task, although it is a non-must be scheduled splicing task, the conflict severity between it and the rest of the splicing tasks is low, so it can be scheduled in the scheduling period, so that the network splicing task can be automatically scheduled, and the splicing task with higher priority can be scheduled as much as possible under the premise of scheduling the splicing task that must be scheduled in the scheduling period, and the conflict between the splicing tasks can be reduced as much as possible.

[0051] In an embodiment of the present application, the scheduling model can be pre-set with different scores of different priority levels and different scores of different conflict levels. The score of the priority level is a positive value, and the score of the conflict level is a negative value. For the same level of priority level and conflict level, the score of the priority level is greater than the absolute value of the score of the conflict level. For the adjacent two levels of priority level and conflict level, the score of the low level of priority level is less than or equal to the absolute value of the score of the high level of conflict level. The scheduling model sums the pre-set different scores of different priority levels and different scores of different conflict levels to schedule all splicing tasks with the solution of the maximum total score.

[0052] That is, in actual application, when the scheduling model sums up different scores of different priority levels and different scores of different conflict levels according to the preset different priority levels and different conflict levels, and schedules all the cut-in tasks according to the solution with the maximum total score, the priority level of the cut-in task is a plus item, and the conflict level is a minus item. By making the priority level and the conflict level of the same level, the score of the priority level is greater than the absolute value of the score of the conflict level, and for the priority level and the conflict level of adjacent two levels, the score of the priority level of the lower level is less than or equal to the absolute value of the score of the conflict level of the higher level, for example, the score of the first priority level can be 50 points, the score of the first level conflict can be -30 points, the score of the second priority level can be 30 points, and the score of the second level conflict can be -5 points, so that the cut-in task of the first priority level must be scheduled, and the cut-in task of the second priority level and the second level conflict must be scheduled, and the cut-in task of the second priority level and the first level conflict can be set according to other actual conditions, and can be scheduled in the scheduling period or not.

[0053] Such design is due to that in actual application, considering the timeliness of scheduling, the cut-in task of the first priority level should be scheduled even under the first level conflict, therefore, the minus score of the cut-in task of the first level conflict should be less than the plus score of the cut-in task of the first priority level, and considering the timeliness of scheduling, the cut-in task of the second priority level should be scheduled as much as possible even under the second level conflict, therefore, the minus score of the cut-in task of the second level conflict should be less than the plus score of the cut-in task of the second priority level, and considering the risk of scheduling, the cut-in task of the second priority level should not be scheduled under the first level conflict, therefore, the minus score of the first level conflict should be greater than or equal to the plus score of the cut-in task of the second priority level.

[0054] However, the score of the first priority level, the score of the second priority level, the score of the first level conflict and the score of the second level conflict are not limited to this.

[0055] In an embodiment of the present application, for the priority level and the conflict level of adjacent two levels, the difference between the absolute value of the score of the priority level of the lower level and the score of the conflict level of the lower level can be greater than the difference between the absolute value of the score of the priority level of the higher level and the score of the conflict level of the higher level.

[0056] For example, the difference between the absolute value of the score of the second priority level and the score of the second level conflict can be 25, and the difference between the absolute value of the score of the first priority level and the score of the first level conflict can be 20, such design is due to that considering the timeliness of scheduling, although the second level conflict should be avoided as much as possible, it should not hinder the scheduling of the cut-in task of the second priority level too much, therefore, the minus score of the cut-in task of the second level conflict should be significantly less than the plus score of the cut-in task of the second priority level.

[0057] In an embodiment of the present application, the scheduling model can further be preset with a score of task density, the score of task density being a negative value, and if the difference between the number of cut-in tasks scheduled in the preset different time periods in the scheduling period is greater than or equal to the preset amount, the scheduling model further takes the score of task density into account when solving.

[0058] That is, in actual application, when the scheduling model is used to sum up and schedule, if the difference between the number of cut-in tasks scheduled in the preset different time periods in the scheduling period is greater than or equal to the preset amount, subtraction is further needed, so that the density of cut-in tasks scheduled in the scheduling period can be adjusted, and more cut-in tasks can be scheduled.

[0059] The density of scheduled cut-in tasks is further taken into account, so that the scheduled cut-in tasks can be adjusted according to the number of cut-in tasks scheduled in the scheduling week,

[0060] In an embodiment of the present application, the absolute value of the score of task density can be between the score of the highest priority level and the score of the lowest priority level, and / or the score of task density can be less than the score of the highest conflict level.

[0061] By making the absolute value of the score of task density between the score of the highest priority level and the score of the lowest priority level, for example, the score of task density can be -40, and the absolute value of which is between the score of the first priority level 50 and the score of the second priority level 30, so that when the difference between the number of cut-in tasks scheduled in the preset different time periods in the scheduling period is greater than or equal to the preset amount, the cut-in tasks of the first priority level can be avoided to be eliminated, and the cut-in tasks of the second priority level can be scheduled to the time period in which the number of cut-in tasks in the scheduling period is too small, so that more cut-in tasks can be scheduled.

[0062] By making the score of task density less than the score of the highest conflict level, for example, the score of task density can be -40, and the score of the first conflict level can be -30, so that when the difference between the number of cut-in tasks scheduled in the preset different time periods in the scheduling period is greater than or equal to the preset amount, the cut-in tasks of the first conflict level and the cut-in tasks of the second conflict level can be scheduled to the time period in which the number of cut-in tasks in the scheduling period is too small, so that more cut-in tasks can be scheduled.

[0063] However, the score of task density is not limited thereto.

[0064] In an embodiment of the present application, the preset different time periods can include two adjacent days, and / or the preset amount can include a multiple.

[0065] For example, the multiple can be one, and if the number of the cutting tasks scheduled in the adjacent two days in the scheduling period is greater than or equal to one, the scheduling model subtracts the score of the task density (for example, -40 points) according to the score of the task density, and the scheduling model subtracts the score of the task density every time the number of the cutting tasks scheduled in the adjacent two days in the scheduling period is greater than or equal to one. However, the multiple is not limited thereto.

[0066] In an embodiment of the present application, the information of the cutting task can further include the number, the name and the cutting time of the cutting task.

[0067] The steps of the above methods are only for clear description, and can be combined into one step or split into multiple steps in implementation, as long as the same logical relationship is included, which is within the protection scope of the present application. Adding irrelevant modifications or introducing irrelevant designs in the algorithm or the process, but not changing the core design of the algorithm and the process, are within the protection scope of the present application.

[0068] In a second aspect, an embodiment of the present application provides a scheduling device for network cutting tasks, which includes a setting module, an obtaining module, a comparing module and a processing module. The setting module is configured to set a scheduling period. The obtaining module is configured to obtain information of the cutting tasks, the information of the cutting tasks including a priority level of the cutting tasks, the priority level indicating a scheduling necessity degree of the cutting tasks in the scheduling period. The comparing module is configured to compare all the cutting tasks for conflicts and generate a conflict level for the cutting tasks, the conflict level indicating a conflict severity degree of the cutting tasks in the scheduling period. The processing module is configured to output a scheduling result by a preset scheduling model, the scheduling model scheduling all the cutting tasks with the priority level as a strong constraint condition and the conflict level as a weak constraint condition.

[0069] The scheduling device for network cutover tasks provided by the embodiment of the present application sets a scheduling period through a setting module, acquires priority level information representing the necessity of scheduling cutover tasks in the scheduling period through an acquisition module, and generates a conflict level representing the severity of conflicts of cutover tasks in the scheduling period through a comparison module by comparing all cutover tasks in the scheduling period. The processing module can schedule all cutover tasks by taking the priority level as a strong constraint condition and the conflict level as a weak constraint condition through a preset scheduling model, and output a scheduling result. Therefore, the scheduling device can automatically schedule network cutover tasks, and can schedule as many cutover tasks with high priority as possible while reducing conflicts between cutover tasks, thereby solving the problems of human waste, low scheduling efficiency, errors, and poor scheduling effect caused by manual scheduling of network cutover tasks in the prior art, and reducing human waste, improving scheduling efficiency, reducing the probability of scheduling errors, and improving the scheduling effect.

[0070] The device provided by the embodiment of the present application has functions or includes modules that can be used to execute the method described in the first aspect of the method embodiment, and the specific implementation and technical effects can be referred to the description of the method embodiment. For brevity, they will not be described here.

[0071] It should be noted that each module involved in the present embodiment is a logical module. In actual application, one logical unit can be one physical unit, a part of a physical unit, or a combination of multiple physical units. In addition, in order to highlight the innovative part of the present application, units not closely related to solving the technical problems proposed by the present application are not introduced in the present embodiment, but this does not mean that there are no other units in the present embodiment.

[0072] Referring to Figure 2 In a third aspect, the embodiment of the present application provides an electronic device, which includes:

[0073] one or more processors 901;

[0074] a memory 902, having one or more programs stored thereon, when the one or more programs are executed by the one or more processors, causing the one or more processors to implement the network cutover task scheduling method provided by the embodiment of the present application;

[0075] one or more I / O interfaces 903 connected between the processor and the memory, configured to realize the information interaction between the processor and the memory.

[0076] The electronic device provided by the embodiment of the present application can automatically schedule network cut tasks by means of the scheduling method for network cut tasks provided by the embodiment of the present application, and can schedule as many high-priority cut tasks as possible while scheduling the cut tasks that must be scheduled in the scheduling period, and can minimize the conflicts between the cut tasks, thereby solving the problems of human resource waste, low scheduling efficiency, error-prone, and poor scheduling effect caused by manual scheduling of network cut tasks in the prior art, and thereby reducing human resource waste, improving scheduling efficiency, reducing the probability of scheduling errors, and improving the scheduling effect.

[0077] The processor 901 is a device with data processing capability, including but not limited to a central processing unit (CPU) and the like; the memory 902 is a device with data storage capability, including but not limited to a random access memory (RAM, more specifically SDRAM, DDR, etc.), a read-only memory (ROM), an electrically erasable programmable read-only memory (EEPROM), and a flash memory (FLASH); and the I / O interface 903 is connected between the processor 901 and the memory 902, and can realize information interaction between the processor 901 and the memory 902, including but not limited to a data bus and the like.

[0078] In an embodiment of the present application, the processor 901, the memory 902, and the I / O interface 903 are connected to each other through a bus, and further connected to other components of the computing device.

[0079] In a fourth aspect, the embodiment of the present application further provides a computer readable medium having a computer program stored thereon, and the program is executed by a processor to implement the scheduling method for network cut tasks provided by the embodiment of the present application. To avoid repeated description, the specific steps of the scheduling method for network cut tasks provided by the embodiment of the present application are not described here.

[0080] The computer readable medium provided by the embodiment of the present application can automatically schedule network cut tasks by means of the scheduling method for network cut tasks provided by the embodiment of the present application, and can schedule as many high-priority cut tasks as possible while scheduling the cut tasks that must be scheduled in the scheduling period, and can minimize the conflicts between the cut tasks, thereby solving the problems of human resource waste, low scheduling efficiency, error-prone, and poor scheduling effect caused by manual scheduling of network cut tasks in the prior art, and thereby reducing human resource waste, improving scheduling efficiency, reducing the probability of scheduling errors, and improving the scheduling effect.

[0081] Those skilled in the art can understand that all or some of the steps in the method, the functions of the modules / units in the system and the device disclosed above can be implemented by software, firmware, hardware, or a combination thereof. In the hardware implementation, the division between the functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component can have multiple functions, or one function or step can be performed by several physical components in cooperation. Some or all of the physical components can be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit. Such software can be distributed on computer-readable media, which can include computer storage media (or non-transitory media) and communication media (or transitory media). As is well known to those skilled in the art, the term computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store the desired information and can be accessed by a computer. In addition, as is well known to those skilled in the art, communication media typically includes computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism, and can include any information delivery medium.

[0082] In summary, the network cutover task scheduling method and device, the electronic device and the storage medium provided by the embodiments of the present application can automatically schedule network cutover tasks, and can schedule as many cutover tasks with high priority as possible while scheduling the cutover tasks that must be scheduled within the scheduling period, and can minimize the conflicts between cutover tasks, thereby solving the problems of human waste, low scheduling efficiency, easy errors, and poor scheduling effect caused by manual scheduling of network cutover tasks in the prior art, and thereby reducing human waste, improving scheduling efficiency, reducing the probability of scheduling errors, and improving the scheduling effect.

[0083] It has to be understood that, in the present document, the terms "comprising", "including", or any other variant thereof, are intended to cover a non-exclusive inclusion, such that processes, methods, articles, or apparatuses that comprise a list of elements are not limited to those elements, but can include other elements not expressly listed or inherent to such processes, methods, articles, or apparatuses. Without further limitation, an element preceded by "comprises a" does not, without more constraints, foreclose the existence of additional identical elements in the process, method, article, or apparatus that comprises the recited element.

[0084] Those skilled in the art will appreciate that the features of the different embodiments can be combined with each other in any manner within the scope of the embodiments, and form different embodiments.

[0085] It can be understood that the above implementation is only an exemplary implementation adopted for illustrating the principles of the present application, and the present application is not limited thereto. Various modifications and improvements can be made by those of ordinary skill in the art without departing from the spirit and essence of the present application, and these modifications and improvements are also considered to be within the protection scope of the present application.

Claims

1. A scheduling method for network cutover tasks, characterized in that, include: Set a scheduling cycle; Obtain information on cutover tasks within the scheduling period, including the priority level of the cutover tasks, which indicates the necessity of scheduling the cutover tasks within the scheduling period. Conflict comparison is performed on all the cutover tasks, and a conflict level is generated for each cutover task, the conflict level indicating the severity of the conflict between the cutover task and the other cutover tasks within the scheduling period; The scheduling results are output through a preset scheduling model, which schedules all the cutover tasks with the priority level as a strong constraint and the conflict level as a weak constraint. The scheduling model is preset with different scores for different priority levels and different scores for different conflict levels, where the score for the priority level is positive and the score for the conflict level is negative. For priority levels and conflict levels of the same grade, the score of the priority level is greater than the absolute value of the score of the conflict level. For two adjacent priority levels and conflict levels, the score of the lower priority level is less than or equal to the absolute value of the score of the higher conflict level. The scheduling model sums the scores of different priority levels and different conflict levels, and schedules all cutover tasks based on the solution with the highest total score. For two adjacent priority levels and conflict levels, the difference between the absolute values ​​of the score of the lower priority level and the score of the lower conflict level is greater than the difference between the absolute values ​​of the score of the higher priority level and the score of the higher conflict level.

2. The scheduling method for network cutover tasks according to claim 1, characterized in that, The scheduling model also has a preset task density score, which is negative. If the difference in the number of cutover tasks scheduled in different time periods within the scheduling cycle is greater than or equal to a preset amount, the scheduling model will also consider the task density score when solving the problem.

3. The scheduling method for network cutover tasks according to claim 2, characterized in that, The absolute value of the task density score is between the score of the highest priority level and the score of the lowest priority level, and / or the task density score is less than the score of the highest conflict level.

4. The scheduling method for network cutover tasks according to claim 2, characterized in that, The preset different time periods include two adjacent days, and / or the preset amount includes a multiple.

5. The scheduling method for network cutover tasks according to claim 1, characterized in that, The cutover task information also includes the cutover task number, name, and cutover time.

6. A scheduling device for network cutover tasks, characterized in that, include: The settings module is used to set the scheduling period; The acquisition module is used to acquire information about the cutover task, including the priority level of the cutover task, which indicates the scheduling necessity of the cutover task within the scheduling period. The comparison module is used to perform conflict comparison on all the cutover tasks and generate a conflict level for each cutover task, wherein the conflict level indicates the severity of the conflict of the cutover task within the scheduling period. The processing module is used to output scheduling results through a preset scheduling model, wherein the scheduling model schedules all the cutover tasks with the priority level as a strong constraint and the conflict level as a weak constraint. The scheduling model is preset with different scores for different priority levels and different scores for different conflict levels, where the score for the priority level is positive and the score for the conflict level is negative. For priority levels and conflict levels of the same grade, the score of the priority level is greater than the absolute value of the score of the conflict level. For two adjacent priority levels and conflict levels, the score of the lower priority level is less than or equal to the absolute value of the score of the higher conflict level. The scheduling model sums the scores of different priority levels and different conflict levels, and schedules all cutover tasks based on the solution with the highest total score. For two adjacent priority levels and conflict levels, the difference between the absolute values ​​of the score of the lower priority level and the score of the lower conflict level is greater than the difference between the absolute values ​​of the score of the higher priority level and the score of the higher conflict level.

7. An electronic device, characterized in that, include: One or more processors; A memory having stored one or more programs thereon, which, when executed by one or more processors, cause the one or more processors to implement the method according to any one of claims 1-5; One or more I / O interfaces are connected between the processor and the memory and configured to enable information interaction between the processor and the memory.

8. A computer-readable medium, characterized in that, It stores a computer program that, when executed by a processor, implements the method according to any one of claims 1-5.

Images