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

Abstract

The invention discloses a scheduling method for network cutover tasks, and belongs to the technical field of communication. The method comprises the following steps: setting a scheduling period; information of the cutover tasks in the scheduling period is obtained, the information of the cutover tasks comprises priority levels of the cutover tasks, and the priority levels represent the scheduling necessity degree of the cutover tasks in the scheduling period; conflict comparison is carried out on all the cutover tasks, conflict levels are generated for the cutover tasks, and the conflict levels represent the severity of conflicts between the cutover tasks and other cutover tasks in the scheduling period; and outputting a scheduling result through a preset scheduling model, wherein the scheduling model schedules all the cutover tasks by taking the priority level as a strong constraint condition and taking the conflict level as a weak constraint condition. According to the method, the network cutover tasks can be automatically scheduled, on the premise that the cutover tasks which must be scheduled in the scheduling period are scheduled, the cutover tasks with higher priority levels can be scheduled as much as possible, and conflicts among the cutover tasks are reduced as much as possible.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to a method, device, electronic device and storage medium for scheduling a network cutover task. Background Art

[0002] With the development of communication services, transmission networks are becoming more and more complex. Adjustments to network structure, replacement of network lines, changes in network equipment configuration, addition or replacement of network equipment, etc. require the cutover of equipment and lines in the network. Network cutover needs to consider the impact on other links, other provinces, and the relationship between the primary and backup optical fibers. It is necessary to ensure the smooth operation of the primary, backup, and security links of the current network, and it is also necessary to balance the urgency of each province's needs, the priority of needs, the needs of upper-layer bearer services, and avoid conflicts.

[0003] At present, major network operators mainly use manual scheduling to schedule network cutover tasks. Each province submits a work order for network cutover tasks, and the workers review the work order based on their personal experience and formulate a scheduling strategy. This manual scheduling method for network cutover tasks will cause a waste of manpower, and the scheduling efficiency is low, prone to errors, and the scheduling effect is poor. Summary of the invention

[0004] To this end, the present invention provides a method, device, electronic device and storage medium for scheduling network cutover tasks to solve the problems in the prior art of waste of manpower, low scheduling efficiency, easy errors and poor scheduling effect caused by manual scheduling of network cutover tasks.

[0005] In order to achieve the above object, the first aspect of the present invention provides a method for scheduling a network cutover task, comprising:

[0006] Set the scheduling cycle;

[0007] Acquire information of a cutover task within the scheduling period, wherein the information of the cutover task includes a priority level of the cutover task, and the priority level indicates a necessity of scheduling the cutover task within the scheduling period;

[0008] Performing a conflict comparison on all the cutover tasks, and generating a conflict level for the cutover task, the conflict level indicating the severity of the conflict between the cutover task and the other cutover tasks within the scheduling period;

[0009] The scheduling result is outputted through a preset scheduling model, and the scheduling model schedules all the cutover 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 for different priority levels and different scores for different conflict levels, the score for the priority level is a positive value, and the score for the conflict level is a negative value;

[0011] For 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; for the priority level and the conflict level of two adjacent 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;

[0012] The scheduling model sums the scores of the different priority levels and the scores of the different conflict levels according to the preset settings, and schedules all the cutover tasks with the solution with the largest total score.

[0013] Optionally, for the priority levels and conflict levels of two adjacent 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.

[0014] Optionally, the scheduling model also presets a task density score, and the task density score is a negative value. If the difference in the number of the cutover tasks scheduled in different time periods preset within the scheduling cycle is greater than or equal to a preset amount, the scheduling model will also use the task density score when solving the problem.

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

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

[0017] Optionally, the information of the cutover task also includes the number, name and cutover time of the cutover task.

[0018] A second aspect of the present invention provides a scheduling device for a network cutover task, comprising:

[0019] Setting module, used to set the scheduling cycle;

[0020] An acquisition module, configured to acquire information of a cutover task, wherein the information of the cutover task includes a priority level of the cutover task, and the priority level indicates a degree of necessity of scheduling the cutover task within the scheduling period;

[0021] A comparison module, configured to perform conflict comparison on all the cutover tasks and generate a conflict level for the cutover tasks, wherein the conflict level indicates the severity of the conflict of the cutover tasks within the scheduling period;

[0022] The processing module is used to output a scheduling result through a preset scheduling model, wherein the scheduling model schedules all the cutover tasks with the priority level as a strong constraint condition and the conflict level as a weak constraint condition.

[0023] A third aspect of the present invention provides an electronic device, comprising:

[0024] one or more processors;

[0025] a memory having one or more programs stored thereon, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement a method for scheduling a network cutover task according to the first aspect of the present invention;

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

[0027] A fourth aspect of the present invention provides a computer-readable medium having a computer program stored thereon, wherein when the program is executed by a processor, a method for scheduling a network cutover task provided by the first aspect of the present invention is implemented.

[0028] The present invention has the following advantages:

[0029] The scheduling method, device, electronic device and storage medium of the network cutover task provided by the present invention set a scheduling period, obtain priority information indicating the degree of necessity of scheduling the cutover task within the scheduling period, and perform conflict comparison on all the cutover tasks within the scheduling period, generate a conflict level indicating the severity of the conflict of the cutover task within the scheduling period for the cutover task, and schedule all the cutover tasks with the priority as a strong constraint and the conflict level as a weak constraint through a preset scheduling model, and output the scheduling result, so that the network cutover task can be automatically scheduled, and the cutover tasks with higher priority can be scheduled as much as possible under the premise of scheduling the cutover tasks that must be scheduled within the scheduling period, and the conflicts between the cutover tasks can be minimized, thereby solving the problems of manpower waste, low scheduling efficiency, easy error and poor scheduling effect caused by manual scheduling of network cutover tasks in the prior art, thereby reducing manpower waste, improving scheduling efficiency, reducing the probability of scheduling errors and improving scheduling effect. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] The accompanying drawings are used to provide further understanding of the present invention and constitute a part of the specification. Together with the following specific embodiments, they are used to explain the present invention, but do not constitute a limitation of the present invention.

[0031] Figure 1 A flowchart of a method for scheduling a network cutover task provided by an embodiment of the present invention;

[0032] Figure 2 A schematic diagram of the structure of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0033] The specific implementation of the present invention is described in detail below in conjunction with the accompanying drawings. It should be understood that the specific implementation described here is only used to illustrate and explain the present invention, and is not used to limit the present invention.

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

[0035] The terms used in the present invention are only used to describe specific embodiments and are not intended to limit the present invention. As used in the present invention, 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 terms “comprising” and / or “made of…” are used in the present invention, it specifies the existence of the stated features, integers, steps, operations, elements and / or components, but does not exclude the existence or addition of one or more other features, integers, steps, operations, elements, components and / or groups thereof.

[0037] The embodiments of the present invention may be described with reference to plan views and / or cross-sectional views by way of ideal schematic views of the present invention. Therefore, the exemplary illustrations may be modified according to manufacturing techniques and / or tolerances.

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

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

[0040] S1, set the scheduling cycle;

[0041] S2, obtaining information of the cutover task within the scheduling period, the information of the cutover task including the priority level of the cutover task, the priority level indicating the necessity of scheduling the cutover task within the scheduling period;

[0042] S3, performing conflict comparison on all cutover tasks and generating a conflict level for the cutover task, the conflict level indicating the severity of the conflict between the cutover task and other cutover tasks within the scheduling period;

[0043] S4, outputting the scheduling result through the preset scheduling model. The scheduling model schedules all the cutover tasks with the priority level as a strong constraint and the conflict level as a weak constraint.

[0044] The scheduling method, device, electronic device and storage medium of the network cutover task provided by the embodiment of the present invention, by setting a scheduling period, obtaining priority information indicating the degree of necessity of scheduling the cutover task within the scheduling period, and performing conflict comparison on all the cutover tasks within the scheduling period, generating a conflict level indicating the severity of the conflict of the cutover task within the scheduling period for the cutover task, can schedule all the cutover tasks with the priority as a strong constraint condition and the conflict level as a weak constraint condition through a preset scheduling model, and output the scheduling result, so that the network cutover task can be automatically scheduled, and the cutover tasks with higher priority can be scheduled as much as possible under the premise of scheduling the cutover tasks that must be scheduled within the scheduling period, and the conflicts between the cutover tasks can be minimized, thereby solving the problems of manpower waste, low scheduling efficiency, easy error and poor scheduling effect caused by manual scheduling of network cutover tasks in the prior art, thereby reducing manpower waste, improving scheduling efficiency, reducing the probability of scheduling errors and improving scheduling effect.

[0045] In actual applications, the information of the cutover task can be presented in the form of a work order.

[0046] Optionally, setting the scheduling cycle may include setting a scheduling start date and time, and a scheduling end date and time. However, the method of setting the scheduling cycle is not limited thereto.

[0047] Optionally, the priority level may include a first priority level and a second priority level. The first priority level may indicate that the cutover task must be scheduled within the scheduling period, and the second priority level may indicate that the cutover task has priority in scheduling within the scheduling period. The necessity of the cutover task of the first priority level is higher than the necessity of the cutover task of the second priority level. That is, within the scheduling period, the cutover task of the first priority level is scheduled with a higher priority than the cutover task of the second priority level. However, the setting method of the priority level is not limited to this.

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

[0049] In practical applications, conflicts between each cutover task and other cutover tasks can be compared based on the hierarchical association of the cutover task's optical cable segment core, WDM optical amplifier segment, SDH multiplexing segment, and service circuit, and a conflict level can be generated for the cutover task with conflicts. However, the way of comparing conflicts for all cutover tasks is not limited to the order.

[0050] In practical applications, the scheduling model can schedule all cutover tasks with priority as a strong constraint and conflict level as a weak constraint. In this way, the cutover tasks of the first priority that must be scheduled can be scheduled within the scheduling cycle, and the cutover tasks of the second priority that do not have to be scheduled can be scheduled according to their conflict levels. For example, for the cutover tasks of the second priority and the first level of conflict, since they are cutover tasks that do not have to be scheduled and the severity of the conflict between them and the other cutover tasks is high, they can be scheduled according to other actual conditions. The setting is performed to schedule it within the scheduling period, or not schedule it within the scheduling period. For the cutover tasks with the second priority and the second level conflict, although they are cutover tasks that do not have to be scheduled, the severity of the conflict between them and the other cutover tasks is low. Therefore, they can be scheduled within the scheduling period, so that the network cutover tasks can be automatically scheduled, and on the premise of scheduling the cutover tasks that must be scheduled within the scheduling period, as many cutover tasks with higher priorities as possible can be scheduled, and the conflicts between cutover tasks can be minimized.

[0051] In one embodiment of the present invention, the scheduling model may be preset with different scores for different priority levels and different scores for different conflict levels, the priority score being a positive value and the conflict score being a negative value; for priority levels and conflict levels of the same level, the priority score is greater than the absolute value of the conflict score, and for priority levels and conflict levels of two adjacent levels, the priority score of the lower level is less than or equal to the absolute value of the conflict score of the higher level; the scheduling model sums the different scores for different priority levels and the different scores for different conflict levels, and schedules all cutover tasks with the solution with the largest total score.

[0052] That is to say, in actual application, when the scheduling model sums up different scores of different preset priority levels and different scores of different conflict levels, and schedules all cutover tasks with the solution with the largest total score, the priority level of the cutover task is a plus point item, and the conflict level is a minus point item. By making the priority level and 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 levels and conflict levels of two adjacent 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, 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 cutover tasks of the first priority level that must be scheduled will definitely be scheduled, and the cutover tasks of the second priority level and the second level conflict will definitely be scheduled, and the cutover tasks of the second priority level and the first level conflict can be set according to other actual conditions, and they will be scheduled within the scheduling period, or they will not be scheduled within the scheduling period.

[0053] Such a design is because in actual applications, considering the timeliness of scheduling, the cutover task of the first priority should be scheduled even under the first level conflict. Therefore, the deduction of the cutover task of the first level conflict should be less than the increase of the cutover task of the first priority. In addition, considering the timeliness of scheduling, the cutover task of the second priority should be scheduled as much as possible even under the second level conflict. Therefore, the deduction of the cutover task of the second level conflict should be less than the increase of the cutover task of the second priority. Considering the risk of scheduling, the cutover task of the second priority should not be scheduled under the first level conflict. Therefore, the deduction of the first level conflict should be greater than or equal to the increase of the cutover task of the second priority.

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

[0055] In one embodiment of the present invention, for two adjacent levels of priority 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 may be greater than the difference between the absolute values ​​of the score of the higher priority level and the score of the higher conflict level.

[0056] For example, the difference in absolute value between the score of the second priority and the score of the second level conflict may be 25, and the difference in absolute value between the score of the first priority and the score of the first level conflict may be 20. This design is due to the consideration of the timeliness of scheduling. Although the second level conflict should be avoided as much as possible, it should not excessively hinder the scheduling of the second priority cutover task. Therefore, the deduction of the cutover task of the second level conflict should be significantly less than the increase of the cutover task of the second priority.

[0057] In one embodiment of the present invention, the scheduling model may also preset a task density score, where the task density score is a negative value. If the difference in the number of cutover tasks scheduled in different time periods preset within the scheduling cycle is greater than or equal to a preset amount, the scheduling model will also use the task density score when solving the problem.

[0058] That is to say, in actual applications, when the scheduling model performs sum scheduling, if the difference in the number of cutover tasks scheduled in different time periods preset within the scheduling cycle is greater than or equal to the preset amount, it is necessary to subtract points so that the density of cutover tasks scheduled within the scheduling cycle can be adjusted and more cutover tasks can be scheduled.

[0059] The density of scheduled cutover tasks also needs to be considered, so that the scheduled cutover tasks can be sorted according to the number of scheduled cutover tasks in the scheduling week.

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

[0061] By making the absolute value of the task density score between the highest priority score and the lowest priority score, for example, the task density score can be -40 points, and its absolute value is between the first priority score of 50 points and the second priority score of 30 points. In this way, when the difference in the number of cutover tasks scheduled in different preset time periods within the scheduling cycle is greater than or equal to the preset amount, the first priority cutover tasks can be avoided from being eliminated, and the second priority cutover tasks can be scheduled to a time period within the scheduling cycle when the number of cutover tasks is too small, so that more cutover tasks can be scheduled.

[0062] By making the score of task density smaller than the score of the highest level of conflict, for example, the score of task density can be -40 points, and the score of first-level conflict can be -30 points. In this way, when the difference in the number of cutover tasks scheduled in different preset time periods within the scheduling cycle is greater than or equal to the preset amount, the cutover tasks of the first-level conflict and the cutover tasks of the second-level conflict can be scheduled to a time period in the scheduling cycle when the number of cutover tasks is too small, so that more cutover tasks can be scheduled.

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

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

[0065] For example, the multiple can be one, and if the number of cutover tasks scheduled on two consecutive days in the scheduling cycle is greater than or equal to one, the scheduling model will subtract the score of the task density from the score of the task density (for example, -40 points), and if the number of cutover tasks scheduled on two consecutive days in the scheduling cycle is greater than or equal to one, the scheduling model will subtract the score of the task density. However, the multiple is not limited to this.

[0066] In an embodiment of the present invention, the information of the cutover task may further include the number, name and cutover time of the cutover task.

[0067] The step division of the above methods is only for the purpose of clear description. When implemented, they can be combined into one step or some steps can be split and decomposed into multiple steps. As long as they include the same logical relationship, they are all within the scope of protection of this patent; adding insignificant modifications to the algorithm or process or introducing insignificant designs without changing the core design of the algorithm and process are all within the scope of protection of this patent.

[0068] In a second aspect, an embodiment of the present invention provides a scheduling device for a network cutover task, comprising a setting module, an acquisition module, a comparison module and a processing module, wherein the setting module is used to set a scheduling period; the acquisition module is used to acquire information about the cutover task, the information about the cutover task including a priority level of the cutover task, the priority level indicating the necessity of scheduling the cutover task within the scheduling period; the comparison module is used to perform a conflict comparison on all the cutover tasks, and generate a conflict level for the cutover task, the conflict level indicating the severity of the conflict of the cutover task within the scheduling period; the processing module is used to output a scheduling result through a preset scheduling model, the scheduling model uses the priority level as a strong constraint and the conflict level as a weak constraint to schedule all the cutover tasks.

[0069] The scheduling device for network cutover tasks provided by the embodiment of the present invention sets a scheduling period through a setting module, obtains priority information indicating the degree of necessity of scheduling the cutover tasks within the scheduling period through an acquisition module, performs conflict comparison on all cutover tasks within the scheduling period through a comparison module, generates a conflict level indicating the severity of the conflict of the cutover tasks within the scheduling period for the cutover tasks, and schedules all cutover tasks with priority as a strong constraint and conflict level as a weak constraint through a preset scheduling model through a processing module, and outputs a scheduling result, thereby being able to automatically schedule the network cutover tasks, and being able to schedule as many cutover tasks with higher priorities as possible under the premise of scheduling the cutover tasks that must be scheduled within the scheduling period, and minimizing conflicts between cutover tasks, thereby being able to solve the problems of manpower waste, low scheduling efficiency, easy errors, and poor scheduling effect caused by manual scheduling of network cutover tasks in the prior art, thereby being able to reduce manpower waste, improve scheduling efficiency, reduce the probability of scheduling errors, and improve scheduling effect.

[0070] The functions or modules included in the device provided in the embodiment of the present invention can be used to execute the method described in the first aspect method embodiment above. Its specific implementation and technical effects can refer to the description of the above method embodiment. For the sake of brevity, they will not be repeated here.

[0071] It should be noted that all modules involved in this embodiment are logic modules. In practical applications, a logic unit may be a physical unit, or a part of a physical unit, or may be implemented as a combination of multiple physical units. In addition, in order to highlight the innovative part of the present invention, this embodiment does not introduce units that are not closely related to solving the technical problem proposed by the present invention, but this does not mean that there are no other units in this embodiment.

[0072] Reference Figure 2 In a third aspect, an embodiment of the present invention provides an electronic device, comprising:

[0073] One or more processors 901;

[0074] A memory 902 storing one or more programs, which, when executed by one or more processors, enables the one or more processors to implement the method for scheduling a network cutover task provided in an embodiment of the present invention;

[0075] One or more I / O interfaces 903 are connected between the processor and the memory and are configured to implement information exchange between the processor and the memory.

[0076] The electronic device provided by the embodiment of the present invention can automatically schedule the network cutover tasks with the help of the scheduling method for network cutover tasks provided by the embodiment of the present invention, and can schedule as many cutover tasks with higher priorities as possible on the premise of scheduling the cutover tasks that must be scheduled within the scheduling period, and minimize the conflicts between the cutover tasks, thereby solving the problems of manpower waste, low scheduling efficiency, easy errors, and poor scheduling effect caused by manual scheduling of network cutover tasks in the prior art, thereby reducing manpower waste, improving scheduling efficiency, reducing the probability of scheduling errors, and improving scheduling effects.

[0077] Among them, the processor 901 is a device with data processing capabilities, including but not limited to a central processing unit (CPU); the memory 902 is a device with data storage capabilities, including but not limited to random access memory (RAM, more specifically SDRAM, DDR, etc.), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory (FLASH); the I / O interface (read-write 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 (Bus), etc.

[0078] In one embodiment of the present invention, 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, an embodiment of the present invention further provides a computer-readable medium having a computer program stored thereon. When the program is executed by a processor, the method for scheduling network cutover tasks provided by an embodiment of the present invention is implemented. To avoid repeated description, the specific steps of the method for scheduling network cutover tasks provided by an embodiment of the present invention are not repeated here.

[0080] The computer-readable medium provided by the embodiment of the present invention can automatically schedule the network cutover tasks with the help of the scheduling method for network cutover tasks provided by the embodiment of the present invention, and can schedule as many cutover tasks with higher priorities as possible while minimizing conflicts between cutover tasks on the premise of scheduling the cutover tasks that must be scheduled within the scheduling period, thereby solving the problems of manpower waste, low scheduling efficiency, easy errors, and poor scheduling effect caused by manual scheduling of network cutover tasks in the prior art, thereby reducing manpower waste, improving scheduling efficiency, reducing the probability of scheduling errors, and improving scheduling effects.

[0081] It will be appreciated by those skilled in the art that all or some of the steps, systems, and functional modules / units in the invented method described above may be implemented as software, firmware, hardware, and appropriate combinations thereof. In hardware implementations, the division between the functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed by several physical components in cooperation. Some physical components or all physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or non-transitory medium) and a communication medium (or temporary medium). As known to those skilled in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media include, but are 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, it is well known to those skilled in the art that communication media typically contain 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 may include any information delivery media.

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

[0083] It should be noted that, in this article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or device including the element.

[0084] Those skilled in the art will understand that although some embodiments described herein include certain features included in other embodiments but not other features, the combination of features from different embodiments is meant to be within the scope of the present embodiment and to form different embodiments.

[0085] It is to be understood that the above embodiments are merely exemplary embodiments used to illustrate the principles of the present invention, but the present invention is not limited thereto. For those of ordinary skill in the art, various modifications and improvements can be made without departing from the spirit and essence of the present invention, and these modifications and improvements are also considered to be within the scope of protection of the present invention.

Claims

1. A method for scheduling a network cutover task, characterized in that: include: Set the scheduling cycle; Acquire information of a cutover task within the scheduling period, wherein the information of the cutover task includes a priority level of the cutover task, and the priority level indicates a necessity of scheduling the cutover task within the scheduling period; Performing a conflict comparison on all the cutover tasks, and generating a conflict level for the 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 result is outputted through a preset scheduling model, and the scheduling model schedules all the cutover tasks with the priority level as a strong constraint condition and the conflict level as a weak constraint condition.

2. The method for scheduling a network cutover task according to claim 1, characterized in that: The scheduling model is preset with different scores for different priority levels and different scores for different conflict levels, the score for the priority level is a positive value, and the score for the conflict level is a negative value; For 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; for the priority level and the conflict level of two adjacent 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 the different priority levels and the scores of the different conflict levels according to the preset settings, and schedules all the cutover tasks with the solution with the largest total score.

3. The method for scheduling a network cutover task according to claim 2, characterized in that: For the priority levels and conflict levels of two adjacent 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.

4. The method for scheduling a network cutover task according to claim 2, characterized in that: The scheduling model also presets a task density score, and the task density score is a negative value. If the difference in the number of the cutover tasks scheduled in different time periods preset within the scheduling cycle is greater than or equal to a preset amount, the scheduling model will also be solved based on the task density score.

5. The method for scheduling a network cutover task according to claim 4, characterized in that: An absolute value of the score of the task density is between the score of the highest priority level and the score of the lowest priority level, and / or the score of the task density is smaller than the score of the highest conflict level.

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

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

8. A device for scheduling a network cutover task, characterized in that: include: Setting module, used to set the scheduling cycle; An acquisition module, configured to acquire information of a cutover task, wherein the information of the cutover task includes a priority level of the cutover task, and the priority level indicates a degree of necessity of scheduling the cutover task within the scheduling period; A comparison module, configured to perform conflict comparison on all the cutover tasks and generate a conflict level for the cutover tasks, wherein the conflict level indicates the severity of the conflict of the cutover tasks within the scheduling period; The processing module is used to output a scheduling result through a preset scheduling model, wherein the scheduling model schedules all the cutover tasks with the priority level as a strong constraint condition and the conflict level as a weak constraint condition.

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

10. A computer-readable medium, characterized in that A computer program is stored thereon, and when the program is executed by a processor, the method according to any one of claims 1 to 7 is implemented.

Images