WO2021068350A1

WO2021068350A1 - Resource-constrained project scheduling method and apparatus, and computer device and storage medium

Info

Publication number: WO2021068350A1
Application number: PCT/CN2019/118398
Authority: WO
Inventors: 杜艳艳
Original assignee: 平安科技（深圳）有限公司
Priority date: 2019-10-12
Filing date: 2019-11-14
Publication date: 2021-04-15
Also published as: CN111105066B; CN111105066A

Abstract

A resource-constrained project scheduling method and apparatus, and a computer device and a storage medium. The method comprises acquiring requirement analysis data of an IT development project file to be predicted (S110); extracting, according to a preset keyword set, corresponding procedure information from the requirement analysis data to form a procedure information set (S120); allocating an initial priority value to each procedure in the procedure information set to obtain an initial weight procedure information set (S130); acquiring the optimal bat position of each procedure by means of a bat algorithm to update the initial weight procedure information set in order to obtain the current weight procedure information set (S140); and decoding the current weight procedure information set by means of serial scheduling to obtain the corresponding minimum project duration (S150). The method improves the prediction accuracy of the minimum duration of an IT project, and effectively prevents a nondeterministic polynomial problem from occurring in the prediction of the minimum duration of the IT project.

Description

Resource-constrained project scheduling method, device, computer equipment, and storage medium

This application claims the priority of a Chinese patent application filed with the Chinese Patent Office on October 12, 2019, the application number is 201910969189.8, and the application name is "Resource-constrained project scheduling methods, devices, computer equipment, and storage media", all of which The content is incorporated in this application by reference.

Technical field

This application relates to the field of data processing technology, and in particular to a resource-constrained project scheduling method, device, computer equipment and storage medium.

Background technique

Resource-constrained project scheduling problem (RCPSP) requires reasonable allocation of limited resources on the premise of meeting process timing constraints and resource constraints, and appropriate arrangements for the start and end time of each process, so that the project's construction period can reach Optimal. To solve RCPSP, it is necessary to determine a feasible start time for each process, find a suitable schedule that meets the logical constraints and resource constraints between processes, and then achieve the goal of minimizing the project duration.

For example, the development of IT projects (ie, information technology projects) can also be regarded as a resource-constrained project, which also has the problem of resource-constrained project scheduling. If the existing technology is adopted, there are the following two problems:

1) Because it is calculated based on resource constraints and the generated process scheduling sequence, there is an NP-hard problem (NP-hard problem represents a non-deterministic polynomial problem, NP-hard problem is such a problem, as long as one of the problems can be Solved in P time, then all NP problems can be solved in P time);

2) In addition, there is no existing reference in judging the priority values of different processes in IT project development, and the initial setting will cause the priority values to be inappropriate, resulting in inaccurate estimates of the minimum construction period.

Summary of the invention

The embodiments of the application provide a resource-constrained project scheduling method, device, computer equipment, and storage medium, aiming to solve the problem of non-deterministic polynomials in the minimum construction period prediction of IT projects in the prior art, and the minimum estimated The problem of inaccurate duration.

In the first aspect, an embodiment of the present application provides a resource-constrained project scheduling method, which includes:

Receive the IT development project file to be predicted uploaded by the client, and obtain the demand analysis data of the IT development project file to be predicted; extract the corresponding process information from the demand analysis data according to the preset keyword set to form a process information set; Wherein, each process information includes process name, process number, process time required; each process in the process information set is assigned an initial priority value to obtain the initial weight process information set; wherein, each initial priority The value range is [0,1]; the optimal bat position of each process in the initial weighted process information set is obtained through the bat algorithm, and the initial weighted process information set is updated to obtain the current weighted process information set; The current weighted process information set is decoded to obtain the minimum project duration corresponding to the IT development project file to be predicted; and the minimum project duration corresponding to the IT development project file to be predicted is sent to the user terminal.

In the second aspect, an embodiment of the present application provides a resource-constrained project scheduling device, which includes:

The demand data acquisition unit is used to receive the IT development project file to be predicted uploaded by the user terminal, and to obtain the demand analysis data of the IT development project file to be predicted; the process information acquisition unit is used to set the demand analysis according to the preset keywords The corresponding process information is extracted from the data to form a process information set; among them, each process information includes process name, process serial number, and process time required; an initial weight set acquisition unit for combining each process in the process information set Assign an initial priority value to obtain the initial weighted process information set; among them, the value range of each initial priority value is [0,1]; the current weight set acquisition unit is used to obtain the initial weighted process information through the bat algorithm The optimal bat position of each process in the set is updated to obtain the current weighted process information set by updating the initial weighted process information set; the minimum project duration acquisition unit is used to decode the current weighted process information set through serial scheduling to obtain The minimum project duration corresponding to the IT development project document to be predicted; and the duration information sending unit for sending the minimum project duration corresponding to the IT development project document to be predicted to the user terminal.

In a third aspect, an embodiment of the present application provides a computer device, which includes a memory, a processor, and a computer program stored on the memory and running on the processor, and the processor executes the computer The program implements the resource-constrained project scheduling method described in the first aspect.

In a fourth aspect, the embodiments of the present application also provide a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the processor executes the above-mentioned first On the one hand, the resource-constrained project scheduling method.

Description of the drawings

In order to explain the technical solutions of the embodiments of the present application more clearly, the following will briefly introduce the drawings used in the description of the embodiments. Obviously, the drawings in the following description are some embodiments of the present application. Ordinary technicians can obtain other drawings based on these drawings without creative work.

FIG. 1 is a schematic diagram of an application scenario of a resource-constrained project scheduling method provided by an embodiment of the application;

2 is a schematic flowchart of a resource-constrained project scheduling method provided by an embodiment of the application;

Fig. 3 is a schematic diagram of a sub-flow of a resource-constrained project scheduling method provided by an embodiment of the application;

4 is a schematic diagram of another sub-flow of the resource-constrained project scheduling method provided by an embodiment of the application;

FIG. 5 is a schematic diagram of another sub-flow of the resource-constrained project scheduling method provided by an embodiment of the application;

FIG. 6 is a schematic block diagram of a resource-constrained project scheduling device provided by an embodiment of the application;

FIG. 7 is a schematic block diagram of subunits of a resource-constrained project scheduling device provided by an embodiment of the application;

FIG. 8 is a schematic block diagram of another subunit of the resource-constrained project scheduling apparatus provided by an embodiment of the application;

9 is a schematic block diagram of another subunit of the resource-constrained project scheduling device provided by an embodiment of the application;

FIG. 10 is a schematic block diagram of a computer device provided by an embodiment of the application.

Detailed ways

The technical solutions in the embodiments of the present application will be described clearly and completely in conjunction with the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, rather than all of them. Based on the embodiments in this application, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the protection scope of this application.

It should be understood that when used in this specification and appended claims, the terms "including" and "including" indicate the existence of the described features, wholes, steps, operations, elements and/or components, but do not exclude one or The existence or addition of multiple other features, wholes, steps, operations, elements, components, and/or collections thereof.

It should also be understood that the terms used in the specification of this application are only for the purpose of describing specific embodiments and are not intended to limit the application. As used in the specification of this application and the appended claims, unless the context clearly indicates other circumstances, the singular forms "a", "an" and "the" are intended to include plural forms.

It should be further understood that the term "and/or" used in the specification and appended claims of this application refers to any combination and all possible combinations of one or more of the associated listed items, and includes these combinations .

Please refer to Figure 1 and Figure 2. Figure 1 is a schematic diagram of an application scenario of a resource-constrained project scheduling method provided by an embodiment of this application; Figure 2 is a schematic flow chart of a resource-constrained project scheduling method provided by an embodiment of this application. The project-limited scheduling method is applied to the server, and the method is executed by application software installed in the server.

As shown in Figure 2, the method includes steps S110 to S160.

S110. Receive the IT development project document to be predicted uploaded by the user terminal, and obtain the demand analysis data of the IT development project document to be predicted.

In this embodiment, when an IT development project is in progress, there is generally a standard software development process. The software development process is the general process of software design ideas and methods, including the software requirements analysis, the design of software functions and implementation algorithms and methods, the software's overall structure design and module design, coding and debugging, program joint debugging and testing, and A series of operations such as writing and submitting programs to meet customer needs and solve customer problems. If there is a higher demand, the software needs to be maintained, upgraded, and scrapped. When the software development process of the IT development project is completed and organized, the IT development project document is obtained, and the first part of the general IT development project document is the demand analysis data. By locating the page number range corresponding to the first-level title name (needs analysis) of the IT development project file, you can obtain the demand analysis data.

In order to predict the minimum construction period of a target IT project, the user can use the user terminal (such as smart phone, tablet computer, etc.) to upload the IT development project file to be predicted. After the server receives the IT development project file to be predicted, it can obtain the demand analysis data by locating the page range corresponding to the first-level title name (ie, demand analysis) of the IT development project file to be predicted, and then it can be predicted The IT development project file is a data basis for forecasting the minimum project duration.

S120. Extract corresponding process information from the demand analysis data according to a preset keyword set to form a process information set; wherein, each process information includes a process name, a process serial number, and a process required time.

In this embodiment, when the server receives the IT development project file to be predicted uploaded by the client, and extracts the demand analysis data according to the IT development project file to be predicted, the corresponding process information can be extracted from the demand analysis data, To form a collection of process information. For example, the corresponding process information can be extracted from the demand analysis data according to a preset keyword set, and after each process information is known, the process information set can be combined to obtain the process information set.

In an embodiment, as shown in FIG. 3, step S120 includes:

S121: Retrieve and locate target data content that includes the same key as the keyword set in the demand analysis data; S122. Obtain process information included in the target data content to form a process information set.

In this embodiment, the keyword set includes product characteristics, product structure, and status descriptions. When writing a requirement analysis document at the initial stage of an IT development project, the key content can be extracted according to the requirement analysis document. For example, the preset keyword set includes: product characteristics, product structure, status description and other keywords. Among them, the keyword set of product features specifically includes function point 1, function point 2, ..., function point N.

According to the preset keyword set, the corresponding process information is extracted from the demand analysis data to form the process information set, that is, the key processes of specific positioning function point 1, function point 2,..., function point N are in the demand analysis data And extract the corresponding process name and time required for the process (generally, the process name and process time required for the process will be listed in the general demand analysis data. As long as you locate the heading such as function point 1, you can quickly get the following The name of the process and the time required for the process), and the process number is numbered according to the order of the extracted function points (for example, the process number of the function point 1 is the default process number 1).

S130. Assign an initial priority value to each process in the process information set to obtain an initial weighted process information set; wherein, the value range of each initial priority value is [0, 1].

In this embodiment, when the process information set is obtained, the process number J of the process information set is the dimension of the space (using the conventional method of the bat algorithm), then the priority values of the J processes correspond to the J-dimensional coordinates , That is, the value of each dimension represents the priority value of a process. Under the premise of meeting resource constraints and logical constraints, processes with higher priority values are prioritized.

A virtual bat is a point in the J-dimensional space, and its position can be expressed as X _i (x _i1 ,x _i2 ,...,x _ij ), where 0<x _ij <1 corresponds to the priority value of the jth process . Under normal circumstances, when a priority-based coding scheme is used, the initial bat position is randomly generated, and the value of each dimension is a random number on [0, 1]. Through the above initial assignment, the priority value of each process in the process information set is initialized.

S140: Obtain the optimal bat position of each process in the initial weighted process information set by the bat algorithm, so as to update the initial weighted process information set to obtain the current weighted process information set.

In this embodiment, the bat algorithm used is a meta-heuristic optimization algorithm that uses different pulse emission rates and loudness based on the echolocation behavior of microbats. The idealization of the echolocation of bats can be summarized as follows: each virtual bat has a random flying speed v _i at the position x _i (the solution of the problem), and the bats have different frequencies or wavelengths, loudness Ai, and pulse rate r. When the bat hunts and finds its prey, it changes the frequency, pulse volume and pulse emission rate, and selects the best solution until the target stops or the conditions are met. This is essentially the use of tuning technology to control the dynamic behavior of the bat colony, balance and adjust the relevant parameters of the algorithm to obtain the optimal bat algorithm.

In an embodiment, as shown in FIG. 4, step S140 includes:

S141. Use the initial priority value of each point in the initial weight process information set as the initial bat position; S142. Obtain the optimal bat position according to the bat algorithm, and use the optimal bat position to determine the initial value of each point in the initial weight process information set. The priority value is updated to the current priority value to obtain the current weighted process information set.

In this embodiment, the equation of the bat algorithm is as follows:

f _i =f _min +(f _max -f _min )β; (1.1)

When using the bat algorithm to calculate the optimal bat position of each bat, first obtain each initial bat position as the input of the above equation 1.2 and combine equation 1.1 and equation 1.3 to iterate the equation to obtain the initial weight process information set For the optimal bat position of each point, the value corresponding to the optimal bat position of each point is used as the current priority value, and the initial priority value of each point in the initial weight process information set is updated to the current priority value to obtain the current weight Process information collection. Since the optimal current priority value of each process is obtained, the construction period will be further shortened when the processes are rearranged according to the new current priority value.

In an embodiment, step S142 includes:

The initial bat position corresponding to each point in the initial weighting process information set is taken as the initial position of each bat in the bat algorithm, and the maximum pulse volume, maximum pulse rate, search pulse frequency range, volume attenuation coefficient, and search frequency are set according to the initialization. The enhancement coefficient, search accuracy and the initial position of each bat are iterated in the bat algorithm until the optimal bat position corresponding to each point is obtained.

In this embodiment, in order to use the bat algorithm to calculate the optimal bat position corresponding to each point more clearly, the bat algorithm is described in detail below. The Bat algorithm includes the following steps:

41) Population initialization, that is, a set of initial solutions distributed by bats in a J-dimensional space in a random manner, maximum pulse volume A ₀ , maximum pulse rate R ₀ , search pulse frequency range [f _min , f _max ], volume attenuation coefficient α, the enhancement coefficient γ of the search frequency, the search accuracy ε. 42) Randomly initialize the position x _{i of} each bat, and find the current optimal solution x* (x* represents the optimal bat position of each bat) according to the fitness value; 43) the evolution of the bat population In Equation 1.1-Equation 1.3, iterate; in Equation 1.1-Equation 1.3, β belongs to [0,1] is a uniformly distributed random number; f _i is the search pulse frequency of bat i, f _i ∈[f _min , f _max ];

with

Respectively represent the speed of bat i at t and t+1;

with

Respectively represent the position of bat i at t and t+1; x* represents the optimal bat position of each bat. 44) Generate a uniformly distributed random number rand, if rand>R ₀ , randomly perturb the optimal bat position of each bat to generate a new solution, and perform out-of-bounds processing on the new solution; 45) Generate a uniformly distributed random number rand, if rand<Ai and f(xi)<f(x*), then accept step 44) to generate a new solution, and then update it according to the following formula:

46) Sort the fitness values of all bats to find the current optimal solution and optimal value of each bat;

47) Repeat steps 42) to 45) until the set optimal solution conditions are met;

48) Output the global optimal value and optimal solution of each bat.

Using the steps of the basic bat algorithm to find the optimal bat position Xi, the current priority value of the corresponding process can be obtained. Moreover, the current priority value of the process obtained by the above method can arrange the sequence and duration of each process more rationally.

S150. Decode the current weighted process information set through serial scheduling to obtain the minimum project duration corresponding to the IT development project file to be predicted.

In this embodiment, when the initial priority value of each point in the initial weighted process information set is updated to the current priority value to obtain the current weighted process information set, a serial scheduling scheme can be used to control the bat Decoding, and then get a feasible scheduling plan.

In an embodiment, as shown in FIG. 5, step S150 includes:

S151. Perform an initialization operation on the resource list; wherein, initialize the scheduling sequence number to 1; S152. Extract the current process sequence number from the current weighted process information set, and assign the extracted current process sequence number to the scheduling sequence number; S153, according to the scheduling sequence number Obtain the previous process corresponding to the scheduling sequence number and the latest end process time corresponding to the previous process from the demand analysis data as the earliest start time corresponding to the scheduling sequence number; S154, determine the current process location corresponding to the scheduling sequence number Whether the required resource reaches the resource upper limit threshold of the resource list; S155. If the resource required by the current process corresponding to the scheduling sequence number reaches the resource upper limit threshold of the resource list, calculate and obtain according to the time required for the current process and the earliest start time corresponding to the scheduling sequence number The end time corresponding to the scheduling sequence number; S156. Determine whether the scheduling sequence number is less than the total number of processes in the demand analysis data; if the scheduling sequence number is less than the total number of processes in the demand analysis data, perform step S157; if the scheduling sequence number is greater than or equal to the aforementioned For the total number of processes in the demand analysis data, perform step S158; S157, increment the scheduling sequence number by 1 to obtain the updated scheduling sequence number, and return to step S153; S158, according to the end time corresponding to the current scheduling sequence number, and according to the scheduling sequence number as The difference between the earliest start time corresponding to 1 is regarded as the minimum project duration.

In an embodiment, as shown in FIG. 5, after step S154, the method further includes:

S159. If the resource required by the current process corresponding to the scheduling sequence number does not reach the resource upper limit threshold of the resource list, postpone the earliest starting time corresponding to the scheduling sequence number by one day to obtain the updated starting time corresponding to the scheduling sequence number, and update according to the scheduling sequence number After the start time, the resources required by the current process are updated to obtain the updated resources required by the current process, and step S155 is returned to.

In this embodiment, the optimization goal of the classic resource-constrained project scheduling problem is to minimize the project duration, which is calculated based on resource constraints and the generated process scheduling sequence. The specific solution process is as follows:

51) Initialize the resource list, initialize the scheduling sequence number No to 1, let No=k=1; 52) Extract the current process sequence number in the current weighted process information set and assign the extracted value to No, find all the previous numbers of No Sequence process, find out the end time of the process that ends the latest, and use this time as the earliest start time of No. ST(No); 53) Determine whether the resources required for the current process corresponding to No reach the upper limit of system resources, and if yes, turn to 54); If not, go to 55); 54) Calculate the end time FT(No) of No according to the time required for the current process; among them, the resource allocation method of priority preemption mode is adopted, and the used resources are reduced from the resource list at the same time And update the resource list. That is to say, once the current process is executed, resources will be preempted from the resource list, the preempted resources will be subtracted from the resource list, and the resource list will be updated. 55) Extend the earliest start time of the current process by one day, that is, ST(No)=ST(No)+1, recalculate the resource supply, and go to 53); 56) If k<J, k=k+1, go to To 52); otherwise, output the latest end time of the current process, that is, the minimum duration of the project.

It can be seen that by adopting the serial scheduling scheme to decode the bat, a feasible scheduling scheme can be obtained as the minimum construction period of the project.

S160. Send the minimum project duration corresponding to the IT development project file to be predicted to the user terminal.

In this embodiment, after the prediction of the minimum project duration corresponding to the IT development project to be predicted is completed in the server, the minimum project duration needs to be sent to the user terminal for timely notification.

This method realizes the improvement of the accuracy of the minimum construction period prediction of IT projects, and effectively avoids the non-deterministic polynomial problem in the minimum construction period prediction of IT projects.

An embodiment of the present application also provides a resource-constrained project scheduling device, which is configured to execute any embodiment of the foregoing resource-constrained project scheduling method. Specifically, please refer to FIG. 6, which is a schematic block diagram of a resource-constrained project scheduling apparatus provided by an embodiment of the present application. The resource-constrained project scheduling apparatus 100 can be configured in a server.

As shown in FIG. 6, the resource-constrained project scheduling device 100 includes a demand data acquisition unit 110, a process information acquisition unit 120, an initial weight set acquisition unit 130, a current weight set acquisition unit 140, a minimum project duration acquisition unit 150, and a construction period information transmission unit. Unit 160.

The demand data obtaining unit 110 is configured to receive the IT development project file to be predicted uploaded by the user terminal, and obtain the demand analysis data of the IT development project file to be predicted.

The process information acquisition unit 120 is configured to extract corresponding process information from the demand analysis data according to a preset keyword set to form a process information set; wherein, each process information includes process name, process serial number, and process requirements. time.

In an embodiment, as shown in FIG. 7, the process information acquiring unit 120 includes:

The target data content obtaining unit 121 is configured to retrieve and locate target data content that includes the same key as the keyword set in the demand analysis data;

The process combination unit 122 is used to obtain process information included in the target data content to form a process information set.

The initial weight set acquisition unit 130 is configured to assign an initial priority value to each process in the process information set to obtain an initial weighted process information set; wherein, the value range of each initial priority value is [0, 1].

The current weight set obtaining unit 140 is configured to obtain the optimal bat position of each process in the initial weight process information set through the bat algorithm, so as to update the initial weight process information set to obtain the current weight process information set.

In an embodiment, as shown in FIG. 8, the current weight set obtaining unit 140 includes:

The initial bat position acquiring unit 141 is configured to use the initial priority value of each point in the initial weighting process information set as the initial bat position;

The iterative unit 142 is configured to obtain the optimal bat position according to the bat algorithm, and update the initial priority value of each point in the initial weighted procedure information set to the current priority value through the optimal bat position to obtain the current weighted procedure information set .

In an embodiment, the iteration unit 142 is further configured to:

The minimum project duration obtaining unit 150 is configured to decode the current weighted process information set through serial scheduling to obtain the minimum project duration corresponding to the IT development project file to be predicted.

In an embodiment, as shown in FIG. 9, the minimum project duration obtaining unit 150 includes:

The initialization unit 151 is used to initialize the resource list; wherein, the scheduling sequence number is initialized and assigned to 1;

The scheduling sequence number assignment unit 152 is configured to extract the current process sequence number in the current weighted process information set, and assign the extracted current process sequence number to the scheduling sequence number;

The start time obtaining unit 153 is configured to obtain, from the demand analysis data according to the scheduling sequence number, the preceding process corresponding to the scheduling sequence number, and the latest end process time corresponding to the preceding process, as the earliest start corresponding to the scheduling sequence number time;

The first judging unit 154 is configured to judge whether the resource required by the current process corresponding to the scheduling sequence number reaches the resource upper limit threshold of the resource list;

The end time obtaining unit 155 is configured to calculate and obtain the end corresponding to the scheduling sequence number based on the time required for the current process and the earliest start time corresponding to the scheduling sequence number if the resources required by the current process corresponding to the scheduling sequence number reach the resource upper limit threshold of the resource list time;

The second judging unit 156 is used to judge whether the scheduling sequence number is less than the total number of processes in the demand analysis data; if the scheduling sequence number is less than the total number of processes in the demand analysis data, the scheduling sequence number is automatically incremented by 1 to obtain the updated scheduling Sequence number step; if the scheduling sequence number is greater than or equal to the total number of processes in the demand analysis data, the difference between the end time corresponding to the current scheduling sequence number and the earliest start time corresponding to the scheduling sequence number 1 is used as the minimum project duration step;

The dispatch sequence number auto-increment unit 157 is used to automatically increment the dispatch sequence number by 1 to obtain the updated dispatch sequence number, and return to execute the preceding procedure corresponding to the dispatch sequence number obtained from the demand analysis data according to the dispatch sequence number, and corresponding to the preceding procedure The latest end process time of is used as the step of the earliest start time corresponding to the scheduling sequence number;

The minimum project duration calculation unit 158 is configured to use the difference between the end time corresponding to the current scheduling sequence number and the earliest start time corresponding to the scheduling sequence number 1 as the minimum project duration.

In an embodiment, as shown in FIG. 9, the minimum project duration obtaining unit 150 further includes:

The start time adjustment unit 159 is configured to postpone the earliest start time corresponding to the scheduling sequence number by one day to obtain the updated start time corresponding to the scheduling sequence number if the resources required by the current process corresponding to the scheduling sequence number have not reached the resource upper limit threshold of the resource list, And according to the updated starting time corresponding to the scheduling sequence number, the resources required by the current process are updated to obtain the updated resources required by the current process, and step S155 is returned to.

The duration information sending unit 160 is configured to send the minimum project duration corresponding to the IT development project file to be predicted to the user terminal.

The device realizes the improvement of the accuracy of the minimum construction period prediction of the IT project, and effectively avoids the non-deterministic polynomial problem in the minimum construction period prediction of the IT project.

The foregoing resource-constrained project scheduling apparatus may be implemented in the form of a computer program, and the computer program may run on a computer device as shown in FIG. 10.

Please refer to FIG. 10, which is a schematic block diagram of a computer device according to an embodiment of the present application. The computer device 500 is a server, and the server may be an independent server or a server cluster composed of multiple servers.

10, the computer device 500 includes a processor 502, a memory, and a network interface 505 connected through a system bus 501, where the memory may include a non-volatile storage medium 503 and an internal memory 504.

The non-volatile storage medium 503 can store an operating system 5031 and a computer program 5032. When the computer program 5032 is executed, the processor 502 can execute the resource-constrained project scheduling method.

The processor 502 is used to provide computing and control capabilities, and support the operation of the entire computer device 500.

The internal memory 504 provides an environment for the operation of the computer program 5032 in the non-volatile storage medium 503. When the computer program 5032 is executed by the processor 502, the processor 502 can execute the resource-constrained project scheduling method.

The network interface 505 is used for network communication, such as providing data information transmission. Those skilled in the art can understand that the structure shown in FIG. 10 is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device 500 to which the solution of the present application is applied. The specific computer device 500 may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.

Wherein, the processor 502 is configured to run a computer program 5032 stored in a memory to implement the resource-constrained project scheduling method disclosed in the embodiment of the present application.

Those skilled in the art can understand that the embodiment of the computer device shown in FIG. 10 does not constitute a limitation on the specific configuration of the computer device. In other embodiments, the computer device may include more or less components than those shown in the figure. Or some parts are combined, or different parts are arranged. For example, in some embodiments, the computer device may only include a memory and a processor. In such an embodiment, the structures and functions of the memory and the processor are consistent with the embodiment shown in FIG. 10, and will not be repeated here.

It should be understood that in this embodiment of the application, the processor 502 may be a central processing unit (Central Processing Unit, CPU), and the processor 502 may also be other general-purpose processors, digital signal processors (Digital Signal Processors, DSPs), Application Specific Integrated Circuit (ASIC), Field-Programmable Gate Array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. Among them, the general-purpose processor may be a microprocessor or the processor may also be any conventional processor.

In another embodiment of the present application, a computer-readable storage medium is provided. The computer-readable storage medium may be a non-volatile computer-readable storage medium. The computer-readable storage medium stores a computer program, where the computer program is executed by a processor to implement the resource-constrained project scheduling method disclosed in the embodiments of the present application.

The storage medium is a physical, non-transitory storage medium, such as a U disk, a mobile hard disk, a read-only memory (Read-Only Memory, ROM), a magnetic disk, or an optical disk, etc., which can store program codes. medium.

Those skilled in the art can clearly understand that, for the convenience and conciseness of description, the specific working process of the above-described equipment, device, and unit can refer to the corresponding process in the foregoing method embodiment, which will not be repeated here.

The above are only specific implementations of this application, but the protection scope of this application is not limited to this. Anyone familiar with the technical field can easily think of various equivalents within the technical scope disclosed in this application. Modifications or replacements, these modifications or replacements shall be covered within the scope of protection of this application. Therefore, the protection scope of this application should be subject to the protection scope of the claims.

Claims

A resource-constrained project scheduling method, including:

Receive the IT development project document to be predicted uploaded by the client, and obtain the demand analysis data of the IT development project document to be predicted;

Extract corresponding process information from the demand analysis data according to a preset keyword set to form a process information set; wherein, each process information includes process name, process serial number, and process required time;

Assign an initial priority value to each process in the process information set to obtain an initial weighted process information set; wherein, the value range of each initial priority value is [0,1];

Obtain the optimal bat position of each process in the initial weighted process information set through the bat algorithm to update the initial weighted process information set to obtain the current weighted process information set;

Decode the current weighted process information set through serial scheduling to obtain the minimum project duration corresponding to the IT development project file to be predicted; and

The minimum project duration corresponding to the IT development project file to be predicted is sent to the user terminal.
The resource-constrained project scheduling method according to claim 1, wherein the keyword set includes product characteristics, product structure, and status description;

The extracting corresponding process information from the demand analysis data according to a preset keyword set to form a process information set includes:

Retrieve and locate the target data content with the same key as the keyword set in the demand analysis data;

The process information included in the content of the target data is acquired to form a process information set.
The resource-constrained project scheduling method according to claim 1, wherein the optimal bat position of each process in the initial weighted process information set is obtained by the bat algorithm to update the initial weighted process information set to obtain the current weighted process information set ,include:

Use the initial priority value of each point in the initial weight process information set as the initial bat position;

The optimal bat position is obtained according to the bat algorithm, and the initial priority value of each point in the initial weighted procedure information set is updated to the current priority value through the optimal bat position to obtain the current weighted procedure information set.
The resource-constrained project scheduling method according to claim 3, wherein the obtaining the optimal bat position according to the bat algorithm comprises:

The initial bat position corresponding to each point in the initial weighting process information set is taken as the initial position of each bat in the bat algorithm, and the maximum pulse volume, maximum pulse rate, search pulse frequency range, volume attenuation coefficient, and search frequency are set according to the initialization. The enhancement coefficient, search accuracy and the initial position of each bat are iterated in the bat algorithm until the optimal bat position corresponding to each point is obtained.
The resource-constrained project scheduling method according to claim 1, wherein the decoding of the current weighted process information set through serial scheduling to obtain the minimum project duration corresponding to the to-be-predicted IT development project file includes :

Initialize the resource list; among them, initialize the scheduling sequence number to 1;

Extract the current process sequence number in the current weighted process information set, and assign the extracted current process sequence number to the scheduling sequence number;

Obtain, from the demand analysis data according to the scheduling sequence number, the preamble process corresponding to the scheduling sequence number and the latest end process time corresponding to the preamble process as the earliest start time corresponding to the scheduling sequence number;

Determine whether the resources required by the current process corresponding to the scheduling sequence number reach the upper limit threshold of the resource list;

If the resources required by the current process corresponding to the scheduling sequence number reach the resource upper limit threshold of the resource list, calculate and obtain the end time corresponding to the scheduling sequence number according to the time required for the current process and the earliest start time corresponding to the scheduling sequence number;

Determine whether the scheduling sequence number is less than the total number of processes in the demand analysis data; if the scheduling sequence number is less than the total number of processes in the demand analysis data, perform the step of incrementing the scheduling sequence number by 1 to obtain the updated scheduling sequence number; if the scheduling sequence number is greater than Or equal to the total number of processes in the demand analysis data, and execute the step of taking the difference between the end time corresponding to the current scheduling sequence number and the earliest starting time corresponding to the scheduling sequence number 1 as the minimum project duration;

Increment the scheduling sequence number by 1 to obtain the updated scheduling sequence number, and return to the execution to obtain the preceding process corresponding to the scheduling sequence number in the demand analysis data according to the scheduling sequence number, and the latest end process time corresponding to the preceding process as The step of the earliest start time corresponding to the scheduling sequence number;

The difference between the end time corresponding to the current scheduling sequence number and the earliest start time corresponding to the scheduling sequence number 1 is used as the minimum project duration.
The method for scheduling resource-constrained projects according to claim 5, wherein after determining whether the resource required by the current process corresponding to the scheduling sequence number reaches the upper resource threshold of the resource list, the method further comprises:

If the resources required by the current process corresponding to the scheduling sequence number do not reach the resource upper limit threshold of the resource list, the earliest start time corresponding to the scheduling sequence number is postponed by one day to obtain the updated starting time corresponding to the scheduling sequence number, and the update starts according to the corresponding scheduling sequence number The start time updates the resources required by the current process to obtain the updated resources required by the current process, and returns to the step of judging whether the resources required by the current process corresponding to the scheduling sequence number reach the resource upper limit threshold of the resource list.
The resource-constrained project scheduling method according to claim 1, wherein said obtaining the demand analysis data of the IT development project document to be predicted comprises:

By locating the page number range corresponding to the first-level title name of the IT development project file, the demand analysis data can be obtained.
The resource-constrained project scheduling method according to claim 2, wherein said acquiring process information included in said target data content to form a process information set comprises:

Obtain the location position of each process in the demand analysis data, extract the corresponding process name and process time required after the location location of each process, and number each process according to the sequence of the extracted process.
A resource-constrained project scheduling device, including:

The demand data acquisition unit is used to receive the IT development project file to be predicted uploaded by the client, and obtain the demand analysis data of the IT development project file to be predicted;

The process information acquisition unit is used to extract corresponding process information from the demand analysis data according to a preset keyword set to form a process information set; wherein each process information includes process name, process number, and process time required ；

The initial weight set obtaining unit is used to assign an initial priority value to each process in the process information set to obtain the initial weight process information set; wherein, the value range of each initial priority value is [0,1 ];

The current weight set acquisition unit is used to obtain the optimal bat position of each process in the initial weight process information set through the bat algorithm, so as to update the initial weight process information set to obtain the current weight process information set;

The minimum project duration obtaining unit is configured to decode the current weighted process information set through serial scheduling to obtain the minimum project duration corresponding to the IT development project document to be predicted; and

The construction period information sending unit is used to send the minimum project construction period corresponding to the IT development project document to be predicted to the user terminal.
The resource-constrained project scheduling device according to claim 9, wherein the current weight set acquisition unit comprises:

The initial bat position acquisition unit is configured to use the initial priority value of each point in the initial weighting process information set as the initial bat position;

The iterative unit is used to obtain the optimal bat position according to the bat algorithm, and update the initial priority value of each point in the initial weighted procedure information set to the current priority value through the optimal bat position to obtain the current weighted procedure information set.
A computer device includes a memory, a processor, and a computer program that is stored on the memory and can run on the processor, and the processor implements the following steps when the processor executes the computer program:

Receive the IT development project document to be predicted uploaded by the client, and obtain the demand analysis data of the IT development project document to be predicted;

Extract corresponding process information from the demand analysis data according to a preset keyword set to form a process information set; wherein, each process information includes process name, process serial number, and process required time;

Assign an initial priority value to each process in the process information set to obtain an initial weighted process information set; wherein, the value range of each initial priority value is [0,1];

Obtain the optimal bat position of each process in the initial weighted process information set through the bat algorithm to update the initial weighted process information set to obtain the current weighted process information set;

Decode the current weighted process information set through serial scheduling to obtain the minimum project duration corresponding to the IT development project file to be predicted; and

The minimum project duration corresponding to the IT development project file to be predicted is sent to the user terminal.
The computer device according to claim 11, wherein the keyword set includes product characteristics, product structure, and status descriptions;

The extracting corresponding process information from the demand analysis data according to a preset keyword set to form a process information set includes:

Retrieve and locate the target data content with the same key as the keyword set in the demand analysis data;

The process information included in the content of the target data is acquired to form a process information set.
The computer device according to claim 11, wherein the obtaining the optimal bat position of each process in the initial weighting process information set by the bat algorithm to update the initial weighting process information set to obtain the current weighting process information set comprises:

Use the initial priority value of each point in the initial weight process information set as the initial bat position;

The optimal bat position is obtained according to the bat algorithm, and the initial priority value of each point in the initial weighted procedure information set is updated to the current priority value through the optimal bat position to obtain the current weighted procedure information set.
The computer device according to claim 13, wherein said obtaining the optimal bat position according to the bat algorithm comprises:

The initial bat position corresponding to each point in the initial weighting process information set is taken as the initial position of each bat in the bat algorithm, and the maximum pulse volume, maximum pulse rate, search pulse frequency range, volume attenuation coefficient, and search frequency are set according to the initialization. The enhancement coefficient, search accuracy and the initial position of each bat are iterated in the bat algorithm until the optimal bat position corresponding to each point is obtained.
11. The computer device according to claim 11, wherein said decoding said current weighted process information set through serial scheduling to obtain said minimum project duration corresponding to said IT development project file to be predicted comprises:

Initialize the resource list; among them, initialize the scheduling sequence number to 1;

Extract the current process sequence number in the current weighted process information set, and assign the extracted current process sequence number to the scheduling sequence number;

Obtain, from the demand analysis data according to the scheduling sequence number, the preamble process corresponding to the scheduling sequence number and the latest end process time corresponding to the preamble process as the earliest start time corresponding to the scheduling sequence number;

Determine whether the resources required by the current process corresponding to the scheduling sequence number reach the upper limit threshold of the resource list;

If the resources required by the current process corresponding to the scheduling sequence number reach the resource upper limit threshold of the resource list, calculate and obtain the end time corresponding to the scheduling sequence number according to the time required for the current process and the earliest start time corresponding to the scheduling sequence number;

Determine whether the scheduling sequence number is less than the total number of processes in the demand analysis data; if the scheduling sequence number is less than the total number of processes in the demand analysis data, perform the step of incrementing the scheduling sequence number by 1 to obtain the updated scheduling sequence number; if the scheduling sequence number is greater than Or equal to the total number of processes in the demand analysis data, and execute the step of taking the difference between the end time corresponding to the current scheduling sequence number and the earliest starting time corresponding to the scheduling sequence number 1 as the minimum project duration;

Increment the scheduling sequence number by 1 to obtain the updated scheduling sequence number, and return to the execution to obtain the preceding process corresponding to the scheduling sequence number in the demand analysis data according to the scheduling sequence number, and the latest end process time corresponding to the preceding process as The step of the earliest start time corresponding to the scheduling sequence number;

The difference between the end time corresponding to the current scheduling sequence number and the earliest start time corresponding to the scheduling sequence number 1 is used as the minimum project duration.
The computer device according to claim 15, wherein after the determining whether the resource required by the current process corresponding to the scheduling sequence number reaches the upper resource threshold of the resource list, the method further comprises:

If the resources required by the current process corresponding to the scheduling sequence number do not reach the resource upper limit threshold of the resource list, the earliest start time corresponding to the scheduling sequence number is postponed by one day to obtain the updated starting time corresponding to the scheduling sequence number, and the update starts according to the corresponding scheduling sequence number The start time updates the resources required by the current process to obtain the updated resources required by the current process, and returns to the step of judging whether the resources required by the current process corresponding to the scheduling sequence number reach the resource upper limit threshold of the resource list.
The computer device according to claim 11, wherein said obtaining the demand analysis data of the IT development project file to be predicted comprises:

By locating the page number range corresponding to the first-level title name of the IT development project file, the demand analysis data can be obtained.
The computer device according to claim 12, wherein said acquiring process information included in said target data content to form a process information set comprises:

Obtain the location position of each process in the demand analysis data, extract the corresponding process name and process time required after the location location of each process, and number each process according to the sequence of the extracted process.
A computer-readable storage medium that stores a computer program that, when executed by a processor, causes the processor to perform the following operations:

Receive the IT development project document to be predicted uploaded by the client, and obtain the demand analysis data of the IT development project document to be predicted;

Extract corresponding process information from the demand analysis data according to a preset keyword set to form a process information set; wherein, each process information includes process name, process serial number, and process required time;

Assign an initial priority value to each process in the process information set to obtain an initial weighted process information set; wherein, the value range of each initial priority value is [0,1];

Obtain the optimal bat position of each process in the initial weighted process information set through the bat algorithm to update the initial weighted process information set to obtain the current weighted process information set;

Decode the current weighted process information set through serial scheduling to obtain the minimum project duration corresponding to the IT development project file to be predicted; and

The minimum project duration corresponding to the IT development project file to be predicted is sent to the user terminal.
The computer-readable storage medium according to claim 19, wherein the keyword set includes product characteristics, product structure, and status descriptions;

The extracting corresponding process information from the demand analysis data according to a preset keyword set to form a process information set includes:

Retrieve and locate the target data content with the same key as the keyword set in the demand analysis data;

The process information included in the content of the target data is acquired to form a process information set.