CN115409289A

CN115409289A - Concrete order scheduling method and device and storage medium

Info

Publication number: CN115409289A
Application number: CN202211334397.9A
Authority: CN
Inventors: 罗振宇; 邹国庆; 李剑波; 李志勇; 黄勇军; 谭青山; 侯桂荣; 向洪; 郑祖恩; 李脉
Original assignee: Hunan Communications Research Institute Co ltd
Current assignee: Hunan Communications Research Institute Co ltd
Priority date: 2022-10-28
Filing date: 2022-10-28
Publication date: 2022-11-29
Anticipated expiration: 2042-10-28
Also published as: CN115409289B

Abstract

The embodiment of the application provides a concrete order scheduling method, a concrete order scheduling device and a storage medium. The concrete order scheduling method comprises the following steps: acquiring information of K concrete orders and information of order codes, wherein the information of the order codes comprises the number n of production objects for executing the concrete orders, the production scheduling number m of each production object, and the strength and time of each concrete order; distributing K concrete orders into order codes to obtain N initial scheduling schemes, wherein N is an integer larger than 1; and optimizing by adopting strategies such as bidirectional cooperative global optimization and the like based on the information of the K concrete orders to obtain a global optimal target scheduling scheme for guiding a production object to execute the K concrete orders. The embodiment of the application can effectively improve the scheduling efficiency, reduce the labor intensity, avoid missing orders in the scheduling process and improve the coverage of the mixing plant.

Description

Concrete order scheduling method and device and storage medium

Technical Field

The present application relates to the field of data processing technologies, and in particular, to a method and an apparatus for scheduling concrete orders, and a storage medium.

Background

In the construction process of highways, bridges and the like, concrete construction under the jurisdiction of a standard section is subject to practical constraints of large number of points, wide distribution, large concrete strength grade span, time consumption, urgent isomerism and the like, and the concrete mixing and other types of orders need to be reasonably scheduled. In the related art, concrete orders are usually produced by manual production scheduling, and the problems of low production scheduling efficiency, high labor intensity, easiness in missing the orders and the like exist.

Disclosure of Invention

The embodiment of the application provides a concrete order scheduling method, a concrete order scheduling device and a storage medium, and aims to solve the problems that in the related art, the scheduling of concrete orders is manually performed, so that the scheduling efficiency is low, the labor intensity is high, and orders are easy to miss.

In order to solve the technical problem, the present application is implemented as follows:

in a first aspect, an embodiment of the present application provides a concrete order scheduling method, including:

acquiring information of K concrete orders and information of order codes, wherein the information of the order codes comprises the number n of production objects for executing the concrete orders and the scheduling number m of each production object, and K, m and n are integers greater than 1 and less than or equal to mxn;

distributing K concrete orders into order codes to obtain N initial scheduling schemes, wherein N is an integer larger than 1;

and optimizing the initial scheduling scheme by adopting a bidirectional cooperative global optimization strategy based on the information of the K concrete orders to obtain a globally optimal target scheduling scheme for guiding a production object to execute the K concrete orders.

In a second aspect, an embodiment of the present application further provides a concrete order scheduling apparatus, including:

the acquiring module is used for acquiring information of K concrete orders and information of order codes, wherein the information of the order codes comprises the number n of production objects for executing the concrete orders and the scheduling number m of each production object, and K, m and n are integers greater than 1 and less than or equal to mxn;

the distribution module is used for distributing the K concrete orders into order codes to obtain N initial scheduling schemes, wherein N is an integer larger than 1;

and the determining module is used for optimizing the initial scheduling scheme by adopting a bidirectional cooperative global optimization strategy based on the information of the K concrete orders to obtain a global optimal target scheduling scheme and guiding the production object to execute the K concrete orders.

In a third aspect, an embodiment of the present application further provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the method when executing the computer program.

In a fourth aspect, the present application further provides a computer-readable storage medium, where a computer program is stored, and when executed by a processor, the computer program implements the method described above.

The concrete order scheduling method provided by the embodiment of the application obtains information of K concrete orders and information of order codes, wherein the information of the order codes comprises the number N of production objects used for executing the concrete orders and the scheduling number m of each production object, the K concrete orders are distributed into the order codes to obtain N initial scheduling schemes, the initial scheduling schemes are optimized by adopting a bidirectional cooperative global optimization strategy based on the information of the K concrete orders to obtain a global optimal target scheduling scheme, K, m, N and N are integers larger than 1, and K is smaller than or equal to mxn. According to the method, the production objects and the production scheduling quantity of the production objects are embodied in an order encoding mode, the K concrete orders are distributed to the N initial production scheduling schemes obtained by the order encoding mode, each initial production scheduling scheme can embody the production scheduling mode of the concrete orders well, and based on the information of the K concrete orders, a target production scheduling scheme for guiding the production objects to execute the concrete orders can be automatically determined by combining the application of a bidirectional cooperative global optimization strategy, so that the process of manual production scheduling is avoided.

Drawings

Fig. 1 is a schematic flowchart of a method for scheduling a concrete order according to an embodiment of the present disclosure;

FIG. 2 is a diagram of an exemplary encoding for an initial scheduling scheme;

FIG. 3 is a schematic diagram of an example of a shift initial scheduling scheme;

FIG. 4 is a schematic diagram of another example of a shift initial scheduling scheme;

FIG. 5 is a flow chart illustrating a concrete order scheduling method in an exemplary embodiment;

fig. 6 is a schematic structural diagram of a concrete order scheduling apparatus according to an embodiment of the present application.

Detailed Description

To make the technical problems, technical solutions and advantages to be solved by the present application clearer, the following detailed description is made with reference to the accompanying drawings and specific embodiments. In the following description, specific details such as specific configurations and components are provided only to help the embodiments of the present application be fully understood. Accordingly, it will be apparent to those skilled in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the present application. In addition, descriptions of well-known functions and constructions are omitted for clarity and conciseness.

Unless otherwise defined, technical or scientific terms used herein shall have the ordinary meaning as understood by one of ordinary skill in the art to which this application belongs. As used in this application, the terms "first," "second," and the like do not denote any order, quantity, or importance, but rather are used to distinguish one element from another. Also, the use of the terms "a" or "an" and the like do not denote a limitation of quantity, but rather denote the presence of at least one.

As shown in fig. 1, a method for scheduling a concrete order according to an embodiment of the present application includes:

step 101, acquiring information of K concrete orders and information of order codes, wherein the information of the order codes comprises the number n of production objects for executing the concrete orders and the scheduling number m of each production object, and K, m and n are integers greater than 1 and less than or equal to mxn;

step 102, distributing K concrete orders into order codes to obtain N initial scheduling schemes, wherein N is an integer larger than 1;

and 103, optimizing the initial scheduling scheme by adopting a bidirectional cooperative global optimization strategy based on the information of the K concrete orders to obtain a global optimal target scheduling scheme, wherein the target scheduling scheme is used for guiding a production object to execute the K concrete orders.

Taking the concrete order as a concrete mixing order as an example, the concrete order scheduling method in the embodiment of the application may be executed by a concrete mixing station. Of course, it is easily understood that the method execution subject may specifically be an electronic device or a server, and the execution subject may be located at a mixing station or a cloud. The mixing station is referred to herein as the main body of execution of the method, and it will be further appreciated that the practice of the present application may be practiced.

In connection with application scenarios of road construction or building construction, in which multiple construction points may be generated simultaneously, each construction point having a concrete use requirement, the mixing plant will accordingly obtain multiple concrete orders, where the multiple concrete orders may correspond to the K concrete orders.

Each concrete order typically has corresponding information such as the time or urgency the concrete order requires completion, the strength and type of concrete, the importance of the concrete order, the corresponding shipping location for the concrete order, the number of the concrete order, and so forth. It will be readily understood that there are some examples of the information about the concrete order, and the information about the concrete order applied in the actual concrete order scheduling process may be one or more of the above examples, or may be other types of information, which are not exemplified here.

In step 101, the mixing station may also obtain order-coded information. As shown above, the order encoded information includes the number n of production objects for executing the concrete order, and the production scheduling number m for each production object.

In a concrete mixing scenario, the production object may be a mixer, and n may be considered the number of mixers. Scheduling can be performed for each mixer, and by means of preset settings or default settings, at most m concrete orders can be scheduled for each mixer. Accordingly, n mixers can schedule up to m × n concrete orders.

Literally, it is understood that an order code may be thought of as a series of codes, each code corresponding to a code bit. In this embodiment, the order code may include m × n code bits arranged in sequence, and each code bit may be configured with one concrete order.

In step 102, the mixing plant may allocate K concrete orders into the order code to obtain N initial scheduling plans.

For example, when K is equal to mxn, K concrete orders may occupy all of the coding bits on the order code, and the concrete orders and the coding bits are in a one-to-one correspondence relationship. In different initial scheduling scenarios, the K concrete orders may differ in their position in the order code.

In other examples, when K is less than mxn, some of the order codes are occupied by concrete orders, and some of the code bits are empty in the initial scheduling scheme. The distribution of K concrete orders or the distribution of empty coding bits may differ among different initial scheduling schemes.

As shown in FIG. 2, FIG. 2 is an example of an initial scheduling scheme. In this example, n is equal to 3, corresponding to 3 blenders, denoted as machine 1, machine 2, and machine 3, respectively. Each blender is allocated 5 coded bits, i.e. m equals 5 in this example. The order code can be obtained by arranging 15 code bits in 3 mixers in sequence.

Further, in the example shown in fig. 2, K may be equal to 10, each concrete order may have a corresponding order number, corresponding to order 1 to order 10, and order 1 to order 10 are randomly allocated into the order code, i.e. the initial scheduling scheme shown in fig. 2 may be obtained.

As can be seen from the initial scheduling scheme shown in fig. 2, machine 1 will have concrete order 2 and order 8 in sequence, machine 2 will have concrete order 4, order 6, order 9, and order 10 in sequence, and machine 3 will have concrete order 1, order 3, order 5, and order 7 in sequence. As can be seen from the above, the initial scheduling scheme obtained by setting the order code and allocating the K concrete orders to the order code can clearly reflect the production objects corresponding to the concrete orders and the production sequences corresponding to the productions.

Of course, the above is an example of the initial scheduling scheme, and in practical applications, the values of K, m, and n may be set according to actual situations.

In some embodiments, the K concrete orders are allocated to the order codes randomly or according to a preset allocation rule, which is not limited herein.

In step 103, the mixing plant may optimize the initial scheduling scheme by using a bidirectional collaborative global optimization strategy based on information of the K concrete orders to obtain a globally optimal target scheduling scheme, which is used to guide a production object to execute the K concrete orders.

As exemplified above, the information of the concrete order may include the time required to complete, and the encoded bits of the concrete order in the initial schedule may affect the actual production time of the concrete order. For example, for a concrete order which is relatively urgent at a time, the concrete order is arranged on the 4 th coding bit of the machine 1 in the initial production scheduling scheme 1, and is arranged on the 1 st coding bit of the machine 2 in the initial production scheduling scheme 2, so that the concrete order is produced based on the initial production scheduling scheme 1, which may result in overtime; and production is based on the initial schedule 2, the emergency concrete order can be completed within a desired time. Purely from the perspective of the emergency concrete order, the scheduling scheme 2 is more suitable as a target scheduling scheme.

Further, the number of the concrete orders is multiple, and from a global perspective, if an initial scheduling scheme enables that K concrete orders can all be completed within a corresponding expected time, the initial scheduling scheme may be determined as a target scheduling scheme.

Of course, the above is an exemplary description of the determination of the target scheduling scheme in step 103. It is also mentioned above that the information of the concrete order may also include other content, such as the location of transportation, the degree of importance, the strength of the concrete, etc., and accordingly also in the concrete order when determining the target scheduling scheme.

For example, different mixers may be located at different mixing stations, and the locations of the concrete demand addresses for the K concrete orders may be different, and based on the initial scheduling scheme, the corresponding delivery times and delivery costs may be determined. In a certain target scheduling scheme, it may be necessary to optimize the overall transportation time and transportation cost, in addition to meeting the production time requirement.

When one mixing station produces concrete of different strength types in sequence, mixing equipment needs to be cleaned, so that extra cleaning time is increased, and when a target production scheduling scheme is determined, a plurality of concrete orders of the same strength type need to be placed at adjacent coding positions as much as possible.

For simplicity of illustration, the manner in which the target scheduling scheme is determined in step 103 is not exhaustive. In general, based on the information of the K concrete orders, corresponding constraint conditions can be generated, so that the determined target scheduling scheme can relatively meet the requirement constraint of each concrete order in the global aspect.

In step 103, in the process of obtaining the global optimal target scheduling scheme, the initial scheduling scheme is further optimized by using at least a bidirectional cooperative global optimization strategy, so as to further ensure that the global optimal target scheduling scheme can be obtained.

As to the specific application of the bidirectional cooperative global optimization strategy in the present application, the following embodiments will be described.

In connection with the above example, an order code is composed of n parts, each part represents the scheduling condition of a machine, and a machine is configured to support at most m scheduling. As shown in fig. 2, fig. 2 is an initial schedule with 10 concrete orders, a production schedule of 3 machines (n = 3). Each machine in the figure is scheduled up to 5 times (m = 5) and the concrete orders above it are scheduled sequentially from left to right, with the serial number of the concrete order or the indication that there is no scheduling in each coding bit (alternatively called a basic element or gene) in the figure, which may be called a basic unit. For example, in FIG. 2, base unit order 8 indicates that the concrete order is scheduled to be produced second on machine 1.

It will be readily appreciated that the coding bit in which the concrete order is located, or the order of the concrete order, may vary from one initial scheduling scheme to another.

The N initial scheduling schemes described above can be considered as a population and are noted asPEach initial scheduling plan is a populationPOne individual of (1), asP _i Wherein, in the step (A),i=1,2, …, N. Initial scheduling schemeP _i Can be recorded asP _ij Wherein, in the step (A),j=1,2, …, m × n. In order to distinguish different concrete orders, a number may be set for each concrete order, and the concrete order is assigned to an order code, where the order code may be embodied as writing the number of each concrete order into one coding bit, and a coding bit in which the number of the concrete order is not written may be null or represented by number 0.

Hereinafter, each embodiment will be explained based on the above definitions regarding the population, the individual, and the like.

In one embodiment, K concrete orders are assigned to the order code, resulting in N initial scheduling scenarios comprising:

distributing K concrete orders into order codes according to R modes to obtain R initial scheduling schemes, wherein R is a positive integer smaller than N;

and transforming concrete orders in the R initial production scheduling schemes to obtain N initial production scheduling schemes, wherein the N initial production scheduling schemes comprise the R initial production scheduling schemes.

In this embodiment, the N initial scheduling schemes may be obtained mainly in two ways, one of which is to directly allocate K concrete orders to order codes to obtain the R initial scheduling schemes, and the other of which is to transform the R initial scheduling schemes to indirectly obtain the remaining initial scheduling schemes.

In the process of obtaining R initial scheduling schemes, K concrete orders can be distributed to the coding bits of order codes in a random distribution mode; alternatively, the K concrete orders may be allocated to the coding bits of the order codes according to a preset allocation rule, and the like, which is not specifically limited herein.

Binding epistatic relation populationPBy way of illustration, when R initial scheduling schemes are obtained, it is believed that a preliminary population is obtained, which may include R individuals. To increase the number of individuals in a population more conveniently and quickly, a population pair may be usedPExisting individuals are transformed, e.g., the coding bit of a concrete order in one individual is transformed, or concrete orders in the same coding bit in two individuals are exchanged, etc., and if new individuals can be formed, these new individuals can be added to the populationPIn (1). Adding new individual can make populationPThe number of individuals in (a) is increased from R to N, which correspond to the N initial scheduling schemes described above.

In this embodiment, on the basis of R types of initial scheduling schemes obtained in a distributed manner, more initial scheduling schemes can be obtained more efficiently through a conversion manner, and the increase of the initial scheduling schemes is helpful to further determine a target scheduling scheme that better meets the requirements of information of K concrete orders, so as to improve the rationality of scheduling concrete orders.

Optionally, the R initial production scheduling schemes include a first production scheduling scheme and a second production scheduling scheme, and the information of the concrete order includes an order number of the concrete order;

transforming concrete orders in the R initial scheduling schemes to obtain N initial scheduling schemes, wherein the N initial scheduling schemes comprise:

determining K first concrete orders from the K concrete orders, wherein K is a positive integer less than or equal to K;

determining k first coding positions of the k first concrete orders in a first production scheme and k second coding positions of the k first concrete orders in a second production scheme according to order numbers of the k first concrete orders;

exchanging k first concrete orders in the k first coding positions and k first concrete orders in the k second coding positions to obtain a third production scheduling scheme and a fourth production scheduling scheme;

the coding bits occupied by the k first concrete orders in the third production scheduling scheme are k first coding bits, the sequence of the k first concrete orders in the third production scheduling scheme is the sequence of the k first concrete orders in the second production scheduling scheme, and the N initial production scheduling schemes comprise a third production scheduling scheme and a fourth production scheduling scheme.

This embodiment is a refinement of one possible approach to transforming concrete orders in R initial scheduling scenarios. For ease of understanding, the transformation process of the present embodiment is described below with reference to the corresponding example of fig. 3.

As shown in fig. 3, an expression of order coding forms of the first and second schedules is shown in fig. 3. The first and second schedules may be in the R initial schedules described above, which may be randomly assigned K concrete orders to the order code.

In the order code, some code bits have words such as order 1, order 2 … …, order 10, etc., which may correspond to the order number. The order number may be set without specific limitation, and may be obtained by sorting according to data of types such as order time or demand size of the concrete order, for example.

In the example of fig. 3, k =4 is set, i.e. 4 first concrete orders are selected for exchange, respectively order 4, order 6, order 9 and order 1. By means of the order numbers of the first concrete orders, the coded bits (corresponding to k first coded bits) of the first production plan and the coded bits (corresponding to k second coded bits) of the second production plan can be queried.

As shown in fig. 3, a third and a fourth schedule may be obtained by exchanging k first concrete orders between the first and the second schedule. The exchange result of the k first concrete orders should satisfy the following rules: the coding bits occupied by the k first concrete orders in the third production schedule are k first coding bits, and the order of the k first concrete orders in the third production schedule is the order of the k first concrete orders in the second production schedule. Since the third and fourth schedules are not limited to the order here, it can be considered that the fourth schedule also satisfies similar rules.

As can be seen in the example of fig. 3 in particular, in the third production schedule, the 4 first concrete orders, i.e., order 1, order 4, order 9, and order 6, are located in the 6 th, 7 th, 8 th, and 11 th coding bits, respectively, which correspond to the coding bits of the 4 first concrete orders in the first production schedule in a one-to-one manner. Meanwhile, the sequence of the order 1, the order 4, the order 9 and the order 6 is consistent with the sequence of the 4 first concrete orders in the second scheduling scheme.

Similarly, the coding bits occupied by the 4 first concrete orders in the fourth production scheduling are in one-to-one correspondence with the coding bits occupied by the 4 first concrete orders in the second production scheduling, and meanwhile, the sequence of the 4 first concrete orders in the fourth production scheduling is consistent with the sequence of the 4 first concrete orders in the first production scheduling.

Through the transformation mode, the third scheduling scheme and the fourth scheduling scheme can be ensured not to have the defect or the repetition of the concrete order, and the rationality and the feasibility of the scheduling schemes are ensured. In addition, the initial scheduling scheme obtained by exchanging the first concrete order can be well guaranteed, the method can be distinguished from the existing R scheduling schemes, and the efficiency of the process of obtaining N initial scheduling schemes is improved.

In some examples, the value of k may be preset or randomly determined, and the k first concrete orders may be selected by preset rules or randomly selected.

Optionally, the R initial scheduling schemes include a fifth scheduling scheme;

transforming concrete orders in the R initial production scheduling schemes to obtain N initial production scheduling schemes, wherein the N initial production scheduling schemes comprise:

exchanging the concrete order of the third coding position in the fifth production scheduling scheme with the concrete order of the fourth coding position in the fifth production scheduling scheme to obtain a sixth production scheduling scheme;

the third encoding bit and the fourth encoding bit are associated with different production objects, and the N initial production schemes comprise a sixth production scheme.

This embodiment can be regarded as another concrete order conversion manner different from the previous embodiment. For the convenience of understanding the implementation process of the present embodiment, the following description is also provided with an example.

As shown in fig. 4, in the fifth production scenario of fig. 4, the third encoding bit may correspond to the 2 nd encoding bit, wherein the concrete order is order 8, and the fourth encoding bit may correspond to the 7 th encoding bit, wherein the concrete order is order 6.

And exchanging the concrete order of the third coding position in the fifth production scheduling scheme with the concrete order of the fourth coding position in the fifth production scheduling scheme to obtain a sixth production scheduling scheme. In the sixth production scenario, as shown in fig. 4, the concrete order on the 2 nd encoding site is replaced with order 6, and the concrete order on the 7 th encoding site is replaced with order 8.

In order to ensure the difference between the sixth production scenario and the fifth production scenario, in this embodiment, when the exchanged concrete orders are selected, the concrete orders on the coding positions associated with different production objects in the fifth production scenario may be selected. For example, in the example shown in FIG. 4, order 8 and order 6 are interacted with, respectively, a concrete order on the encoding bit associated with machine 1 and a concrete order on the encoding bit associated with machine 2.

Similar to the previous embodiment, the present embodiment can also ensure the rationality and feasibility of the sixth scheduling scheme, and will not be further described herein.

Optionally, the information of the concrete order includes a preset weight of the concrete order and a required completion time of the order;

optimizing the initial scheduling scheme by adopting a bidirectional cooperative global optimization strategy based on the information of the K concrete orders to obtain a global optimal target scheduling scheme, wherein the method comprises the following steps:

respectively determining the completion condition of each concrete order in each initial scheduling scheme, wherein the completion condition of the concrete order indicates whether the concrete order can be completed within the time required by the order;

respectively determining the fitness corresponding to each initial scheduling scheme according to the completion condition of the concrete order and the preset weight of the concrete order;

determining a target scheduling scheme from the N initial scheduling schemes according to the fitness;

adopting a bidirectional cooperative local optimization strategy to adjust the concrete order on the coding bit of the target scheduling scheme to obtain an optimized scheduling scheme;

and under the condition that the expected order completion time of the concrete order in the optimized production scheduling scheme is superior to that of the concrete order in the target production scheduling scheme, updating the optimized production scheduling scheme into the target production scheduling scheme.

The bidirectional collaborative global optimization strategy in the embodiment comprises a strategy for globally determining a target scheduling scheme based on fitness and a bidirectional collaborative local optimization strategy.

In connection with the above examples, any initial scheduling scheme may be considered an individualP _i The fitness corresponding to the initial scheduling scheme can be recorded as

. In one embodiment of the method of the present invention,

can be calculated by the following formula:

（1）

in the above formula, the first and second carbon atoms are,

may represent a preset weight for the concrete order,

may be used to indicate the completion of the concrete order.

In combination with the above-mentioned text,P _ij indicating an initial scheduling schemeP _i To (1)jThe encoded bits, in an initial scheduling scheme,P _ij the concrete order in the encoded bits can be considered deterministic, and thus, in equation (1), can be identifiedP _ij To refer to a concrete order, the concrete order may be identified below to avoid repeated explanationP _ij To indicate.

As for the preset weight of the concrete order, the preset weight may be preset, or may also be predetermined according to the urgency of the concrete order, and the higher the urgency, the larger the preset weight.

The completion of the concrete order indicates whether the concrete order can be completed within the required completion time of the order. For example, the information of the concrete order may include the required amount of the concrete order and the required completion time of the order, the information of the order code may include the production rate, and the ratio of the required amount to the production rate is solved, so that the expected completion time of the order can be obtained. And comparing the predicted completion time with the order required completion time to determine whether the concrete order can be completed within the order required completion time, thereby obtaining the completion condition of the concrete order.

Of course, in practice, transportation time, time consumed by queuing the concrete order at the production object, etc. may also need to be considered in determining whether the concrete order can be completed within the required completion time for the order.

In connection with an example, provided

、

、

Respectively representing concrete ordersP _ij The expected production completion time and the order required completion time, then:

（2）

is provided with

Ordering concreteP _ij The desired start time of the time of day,uordering concreteP _ij To the target machine (i.e. coded bits)P _ij And the number of the production object to which it belongs), andvordering concreteP _ij At the target machineuThe sequence number on the row is as follows:

（3）

（4）

（5）

wherein the content of the first and second substances,

which represents a rounding-down operation, the rounding-down operation,S _u ordering concreteP _ij At the rate of production of the target machine,

ordering concreteP _ij The expected start time of the queue, i.e. the time spent queuing at the production object,

ordering concreteP _ij The required amount of (c).

According to one embodiment of the present application, the information of the concrete order includes an order type of the concrete order;

respectively determining the completion condition of each concrete order in each initial scheduling scheme, wherein the completion condition comprises the following steps:

acquiring a fifth coding position of a second concrete order in the initial scheduling scheme, wherein the second concrete order is any concrete order;

under the condition that the fifth coding bit indicates that the second concrete order is not the first task of any production object, acquiring the expected processing time of the second concrete order, the transportation time of the second concrete order, the order type of the third concrete order and the expected production completion time of the third concrete order, wherein the third concrete order is the previous concrete order of the second concrete order;

determining the expected completion time of the order of the second concrete order according to the expected processing time of the second concrete order, the transportation time of the second concrete order, the order type of the third concrete order and the expected production completion time of the third concrete order;

and determining the completion condition of the second concrete order according to the expected completion time of the order and the required completion time of the order.

As indicated above, in an initial scheduling scheme, the relationship between the concrete order and the coding bit is determined, the coding bitP _ij The concrete order of (c) can also be recordedConcrete orderP _ij . In this embodiment, the second concrete order is any concrete order, and the concrete order can be directly usedP _ij Indicating that the fifth coded bit can be correspondingly coded bitP _ij And (4) showing.

In the above examples, the desired start time is introduced

Expected processing time

And time of delivery

Determining expected completion time (correspondences) for an order

) The calculation method of (2). In this embodiment, the expected start time is set

The factors considered are further defined.

Specifically, the second concrete orderP _ij Desired start time of

Considering the order type of the second concrete order, the order type of the third concrete order, and the expected production completion time of the third concrete order, this can be expressed by the formula:

（6）

wherein, the first and the second end of the pipe are connected with each other,

the desired production completion time for the third concrete order,

indicating the order type of the second concrete order,

indicating the order type of the third concrete order,Ctime overhead due to order type differences.

Taking a production scene of concrete mixing as an example, the order type may be a concrete strength type, and when concrete of different strength types is produced successively by one machine, the mixing equipment needs to be cleaned, which further brings time overheadC. Conversely, when the machine produces concrete of the same strength type one after the other, the above-mentioned time overhead can generally be considered equal to 0.

As can be seen from the basis of equation (6),

in effect, an iterative process, for a concrete order at the first encoding position of a machine,

may be equal to

Then, the concrete order on the subsequent coding bit,

can be obtained by iterative operation.

As for the process of determining the completion of the second concrete order according to the desired completion time of the order and the required completion time of the order, the above formula (2) can be referred to, and the description thereof will not be repeated.

The embodiment of the application provides a calculation scheme of the fitness, the fitness can be used for quantifying the time requirement and the emergency requirement of a concrete order, and based on the fitness, a target production scheduling scheme can be determined from N initial production scheduling schemes conveniently and reasonably.

In this embodiment, the process of adjusting the concrete orders on the coding bit of the target scheduling plan to obtain the optimized scheduling plan has a certain similarity to the process of transforming the concrete orders in the R kinds of initial scheduling plans to obtain the new initial scheduling plan described above. There is a distinction between the two.

Specifically, as indicated above, the coding sites may be referred to as genes, and the process of transforming concrete orders in R initial schedules to obtain a new initial schedule may be considered as a gene-undirected crossover and mutation process, i.e., to expand the populationPThe number of individuals in the population is targeted without considering whether the crossed or mutated gene becomes more optimal.

In this embodiment, the obtained optimized scheduling scheme needs to be compared with the target scheduling scheme, and the optimized scheduling scheme is updated to the target scheduling scheme when the expected completion time of the order of the concrete order in the target scheduling scheme is better than the expected completion time of the order in the target scheduling scheme. In other words, in this embodiment, the process of adjusting the concrete order on the coding site of the target scheduling plan to obtain the optimized scheduling plan may be regarded as a directional variation process of the gene, so as to enable the obtained target scheduling plan to guide production more reasonably.

Optionally, adjusting the concrete order on the coding bit of the target scheduling plan by using a bidirectional collaborative local optimization strategy, including at least one of:

exchanging the concrete order on the sixth coding position in the target scheduling scheme with the concrete order on the previous coding position of the sixth coding position, wherein the sixth coding position is any coding position with the serial number more than or equal to 2;

exchanging the concrete order on the seventh coding position in the target scheduling scheme with the concrete order on the next coding position of the seventh coding position, wherein the sixth coding position is any coding position with the serial number smaller than mxn;

exchanging the concrete order on the eighth coding bit in the target scheduling scheme with the concrete order on the ninth coding bit in the target scheduling scheme, wherein the difference value between the serial number of the eighth coding bit and the serial number of the ninth coding bit is integral multiple of m.

In the face of the challenges of huge search space and discrete feasible areas caused by a large number of concrete orders, the embodiment of the application designs a bidirectional cooperative local optimization strategy to improve the search efficiency and the local search capability of the algorithm. The strategy mainly considers the influence of the intensity type and the urgency degree among orders on the individual quality and the populationPEach of the individuals inP _i And (6) optimizing.

In this embodiment, the concrete order on the sixth encoding bit in the target scheduling plan is exchanged with the concrete order on the previous encoding bit of the sixth encoding bit, which may be considered as a forward search of the bidirectional search.

Taking a production scene of concrete mixing as an example, the forward search mainly improves the production efficiency by adjusting the scheduling on the same mixing machine. In a specific operation, one concrete order (corresponding to the concrete order on the sixth encoding position) in the target scheduling scheme is exchanged with the previous concrete order, and whether the completion time of the adjusted concrete order is advanced or not is judged, and the two adjusted concrete orders can complete the order on time.

Namely satisfy

，

And is provided with

In which

Indicating the adjusted order completion time, which is calculated as shown in equation (7) and equation (8). If these conditions are met, the search continues to loop forward. If not, ending the forward search and updating the targetAnd (5) standard scheduling production scheme.

（7）

（8）

In this embodiment, the concrete order at the seventh encoding position in the target scheduling plan is exchanged with the concrete order at the subsequent encoding position of the seventh encoding position, which may be considered as a backward search of the bidirectional search.

The back search optimizes the placement of subsequent concrete orders, primarily by placing concrete orders that cannot currently be placed (corresponding to concrete orders at the seventh coding bit) back. And (4) the algorithm arranges the current concrete order backwards until the concrete order which cannot be arranged is touched, the backward search is finished, and the target arrangement scheme is updated.

In this embodiment, the concrete order at the eighth encoding position in the target production scheduling scheme is exchanged with the concrete order at the ninth encoding position in the target production scheduling scheme, which may be regarded as a collaborative search of the bidirectional search.

The collaborative search mainly optimizes the concrete orders between different mixers (corresponding to the concrete order at the eighth encoding position and the concrete order at the ninth encoding position). In the optimization process, if the interchanged scheduling meets one of the following conditions, the adjustment is accepted: 1) After adjustment, two concrete orders can be completed, and the completion time is advanced; 2) The expected completion time of the concrete order behind both concrete orders is advanced.

Namely satisfy

And is

Or, satisfy

And is provided with

。

Otherwise, continuing to search backwards until the non-scheduling position is searched. The correlation calculation is as follows:

（9）

（10）

（11）

（12）

expression findingjAndmthe remainder between.

The concrete order scheduling method provided in the embodiment of the present application is described below with reference to a specific application example. As shown in fig. 5, in the concrete mixing production scenario, the concrete order scheduling method may include steps 501 to 507.

Step 501, initializing a population.

In the step, demand orders (corresponding to the concrete orders) of construction point concrete in a certain day are read, wherein each order comprises a construction point (B), concrete demand (R), strength type (M), required completion time (T) and urgency degree (E); the information of the beam yard and the mixing station related equipment comprises the mixing speed (S) of each mixing equipment and the transportation time (D) from the beam yard to each construction point; algorithm parameters (crossover operator α, mutation algorithm β).

Orders are ordered from as little as big according to their completion time (sequence number starting from 1). Then a population (a collection of several production schedules) with N individuals (one individual for each production schedule) is generated by randomly placing orders into the mixing apparatus in sequence. The method can increase the feasibility rate of the scheme, and further improve the quality of the population.

By distributing all orders into order codes, a plurality of individuals (corresponding to the initial scheduling scheme) can be obtained, and the fitness value of each population individual is calculated based on the above formula (1), wherein the larger the fitness value is, the better the scheduling scheme corresponding to the individual is.

Step 502, judging whether the algorithm meets the end condition.

The cutoff condition of the algorithm can be related to the order size, the number of orders is set to be n, the algorithm is ended when the iteration time t of the algorithm is greater than 1000n, and the optimal production scheduling scheme (corresponding to the target production scheduling scheme) is output.

Step 503, performing multipoint random feasible intersection operation.

This step may be considered as an operation process to obtain the third and fourth schedules described above.

In particular, interleaving is an important way to exchange information between individuals. The traditional random multi-point crossing operation generally adopts the steps of randomly selecting the gene positions (corresponding to coding positions) of two parents and then selecting gene segments for interchange according to the gene positions. The traditional random multipoint crossing does not consider the gene position information difference (the gene position can represent order scheduling or idle identification) and the gene sequence difference in the application, and the adoption of the traditional random multipoint crossing operation can cause the order scheduling for multiple times, the scheduling is disordered and the like, so that the crossing operation can obtain high-efficiency feasible offspring and the like, and the searching efficiency of the algorithm is influenced.

Therefore, the step provides a multipoint random feasible intersection operation. Random selectionk(an integer of random parameters) gene positions are correspondingly exchanged by order numbers, and the operation is carried outEnsuring that the order in the crossed filial individual scheme is arranged only once. The specific operating pseudo code is shown in algorithm 1. The algorithm only needs to traverse two individuals once respectively at most, and the calculation complexity isO(n), but ensures that the descendants generated by the parent conform to the constraint that the order is only scheduled once, and improves the feasibility of the descendants. The crossover operation is only performed when one [0,1 ] is randomly generated]Is less than the crossover factorαIs executed.

Fig. 3 is an example of performing the crossover operation, where k =4 blue gene positions are randomly selected, and the corresponding order numbers are 4,6,9,1 respectively; in the next operation, another parent is scanned, and if the corresponding number of the gene position is selected as described above, the genes are exchanged until all the selected genes are not replaced one by one.

Algorithm 1: multipoint random feasible crossover operation

Inputting: parent individualsP _a AndP _b

and (3) outputting: experiment individualP' _a AndP' _b

1： P' _a =P _a ,P' _b =P _b

2: randomly generating an integerk(1≤k≤nm)

3: random generation haskOne is not repeated and is represented by the sequence in [1,nm]set of sequence numbers inW

4： while i≤nmdo

5： if P _ai ∈W then

6： while j≤nm do

7： If P _bj ∈W then

8：

, j=j+1;i=i+1;

9: break;

10： end if

11： j=j+1;

12： end while

13: break;

14： end if

15： i=i+1;

16： end for

In step 504, mutation operations are performed.

This step may be considered as the operation to obtain the sixth production schedule hereinabove.

Specifically, when a randomly generated one [0,1 ] is generated]Is less than the variation factorβMutation operation is performed. The variant operation flow is specifically as follows: firstly, randomly selecting two gene sites, and if the two gene sites are not order numbers, newly selecting the two gene sites until the two selected gene sites have normal production scheduling; then, if the order numbers are all order numbers, the positions of the order numbers are directly exchanged, if only one order number is the order number, the order adjustment treatment is carried out after the exchange, namely, the position of the non-production-arranged gene is moved backwards until the rear part is also the non-production-arranged gene position, and the position of the production-arranged gene is moved forwards until the front part is also the production-arranged gene position. FIG. 4 is an example of a mutation operation. In this example, the loci corresponding to

individual orders

6 and 8 are selected and then interchanged to create a new individual.

Step 505, select operation.

The selection operation aims at selecting expected individuals from the parent population and the experimental population as the next generation population, and the specific operation of the step is as follows: and randomly selecting two individuals from the parent population and the experimental population, storing the individuals with high fitness to the next generation until N next generation individuals are selected, and finishing the selection operation. And the scheme with the highest fitness is saved.

Step 506, a bidirectional collaborative local optimization strategy.

This step can be implemented using the above two-way search algorithm. The forward search (rows 2 to 10 of algorithm 2) of the bidirectional search, the bidirectional search algorithm are divided into the backward search (rows 11 to 17 of algorithm 2) of the bidirectional search and the collaborative search (rows 19 to 23 of algorithm 2) of the bidirectional search.

And 2, algorithm: bidirectional collaborative local optimization strategy

Inputting:P _i

and (3) outputting:P' _i

1：for q =1,...,nm do

2: j=q;

3: while

>1 do

4: if

&&

&&

then

5: Mid ₌ P _ij ; P _ij= P _ij-1 ；P _ij-1= Mid；

6: else

7: break;

8: end if

9: j=j-1;

10: end while

11: j=q

12: if

=0 then

13: K=(

+1)×m

14:while j<K and P _ij+1 ≠0 do

15: Mid ₌ P _ij; P _{ij =+1} P _ij: P _ij= Mid;j=j+1;

16: end while

17: end if

18: end for

19: for j=1,...,nm do

20: If (

&&

)or (

&&

) then

21: Mid ₌ P _ij; P _ij+m= P _ij: P _ij+m= Mid;

22: end if

23: end for

24: P' _i =P _i

the specific idea of the above pseudo code is described above, and is not described herein again.

And step 507, outputting the optimal scheduling scheme.

The optimal scheduling scheme may be regarded as the target scheduling scheme that is finally output after optimization in the foregoing embodiment.

When the method is applied to a concrete mixing production scene, the information technology and the intelligent calculation method are adopted, efficient global scheduling optimization is carried out on concrete production, and the method has important practical significance on the aspects of improving the construction efficiency and the project engineering progress, reducing the construction number of mixing stations, reducing temporary land, reducing the pollution of the temporary land to the environment and the like.

As shown in fig. 6, an embodiment of the present application further provides a concrete order scheduling apparatus, including:

an obtaining module 601, configured to obtain information of K concrete orders and information of order codes, where the information of the order codes includes a number n of production objects used for executing the concrete orders, and a production scheduling number m of each production object, where K, m, and n are integers greater than 1, and K is less than or equal to mxn;

the allocation module 602 is configured to allocate the K concrete orders to order codes to obtain N initial scheduling schemes, where N is an integer greater than 1;

the determining module 603 is configured to optimize the initial scheduling scheme by using a bidirectional cooperative global optimization strategy based on information of the K concrete orders to obtain a globally optimal target scheduling scheme, and is configured to instruct a production object to execute the K concrete orders.

Optionally, the assigning module 602 includes:

the distribution unit is used for distributing the K concrete orders into order codes according to R modes to obtain R initial production scheduling schemes, wherein R is a positive integer smaller than N;

and the transformation unit is used for transforming the concrete orders in the R initial production scheduling schemes to obtain N initial production scheduling schemes, wherein the N initial production scheduling schemes comprise the R initial production scheduling schemes.

Optionally, the R initial production scheduling plans include a first production scheduling plan and a second production scheduling plan, and the information of the concrete order includes an order number of the concrete order;

the transformation unit includes:

the first determining subunit is used for determining K first concrete orders from the K concrete orders, wherein K is a positive integer less than or equal to K;

the second determining subunit is configured to determine, according to the order numbers of the k first concrete orders, k first coding bits of the k first concrete orders in the first production plan and k second coding bits of the k first concrete orders in the second production plan;

the first exchange unit is used for exchanging k first concrete orders in the k first coding positions and k first concrete orders in the k second coding positions to obtain a third production scheduling scheme and a fourth production scheduling scheme;

the coding positions occupied by the k first concrete orders in the third production scheduling scheme are k first coding positions, the sequence of the k first concrete orders in the third production scheduling scheme is the sequence of the k first concrete orders in the second production scheduling scheme, and the N initial production scheduling schemes comprise a third production scheduling scheme and a fourth production scheduling scheme.

Optionally, the R initial scheduling schemes include a fifth scheduling scheme;

the transformation unit includes:

the second exchange unit is used for exchanging the concrete order of the third coding bit in the fifth production scheduling scheme with the concrete order of the fourth coding bit in the fifth production scheduling scheme to obtain a sixth production scheduling scheme;

the third encoding bit and the fourth encoding bit are associated with different production objects, and the N initial production scheduling schemes comprise a sixth production scheduling scheme.

Optionally, the information of the concrete order includes a preset weight of the concrete order and a required order completion time;

the determining module 603 includes:

the first determining unit is used for respectively determining the completion condition of each concrete order in each initial scheduling scheme, and the completion condition of the concrete order indicates whether the concrete order can be completed within the order required completion time or not;

the second determining unit is used for respectively determining the fitness corresponding to each initial scheduling scheme according to the completion condition of the concrete order and the preset weight of the concrete order;

the third determining unit is used for determining a target production scheduling scheme from the N initial production scheduling schemes according to the fitness;

the adjusting module is used for adjusting the concrete orders on the coding positions of the target scheduling scheme by adopting a bidirectional collaborative local optimization strategy to obtain an optimized scheduling scheme;

and the updating module is used for updating the optimized scheduling scheme into the target scheduling scheme under the condition that the expected order completion time of the concrete order in the optimized scheduling scheme is superior to the expected order completion time of the concrete order in the target scheduling scheme.

Optionally, the information of the concrete order comprises an order type of the concrete order;

the first determination unit includes:

the first acquiring subunit is configured to acquire a fifth coding bit of a second concrete order in the initial scheduling scheme, where the second concrete order is any concrete order;

the second obtaining subunit is configured to, when the fifth coding bit indicates that the second concrete order is not the first task of any production object, obtain expected processing time of the second concrete order, transportation time of the second concrete order, an order type of a third concrete order, and expected production completion time of the third concrete order, where the third concrete order is a previous concrete order of the second concrete order;

a third determining subunit, configured to determine an expected completion time of the order of the second concrete order according to the expected processing time of the second concrete order, the transportation time of the second concrete order, the order type of the third concrete order, and the expected production completion time of the third concrete order;

and the fourth determining subunit is used for determining the completion condition of the second concrete order according to the expected completion time of the order and the required completion time of the order.

Optionally, the adjustment module may comprise at least one of:

the first exchanging unit is used for exchanging the concrete order on the sixth coding bit in the target scheduling scheme with the concrete order on the previous coding bit of the sixth coding bit, and the sixth coding bit is any coding bit with the serial number more than or equal to 2;

the second exchange unit is used for exchanging the concrete order on the seventh coding bit in the target scheduling scheme with the concrete order on the next coding bit of the seventh coding bit, and the sixth coding bit is any coding bit with the serial number smaller than mxn;

and the third exchanging unit is used for exchanging the concrete order on the eighth coding bit in the target production scheduling scheme with the concrete order on the ninth coding bit in the target production scheduling scheme, and the difference value between the serial number of the eighth coding bit and the serial number of the ninth coding bit is integral multiple of m.

The concrete order scheduling device provided in the embodiment of the present application is a device authority corresponding to the concrete order scheduling method in the above embodiment, and the method embodiment can be applied to the device embodiment and achieve the same technical effect, and is not described herein again.

The embodiment of the application also provides an electronic device, which comprises a memory, a processor and a computer program stored in the memory and capable of running on the processor, wherein the processor implements the concrete order scheduling method when executing the computer program.

The embodiment of the application also provides a computer readable storage medium, which stores a computer program, and the computer program is executed by a processor to implement the concrete order scheduling method.

It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules, so as to perform all or part of the functions described above. Each functional unit and module in the embodiments may be integrated in one processing unit, or each unit may exist alone physically, or two or more units are integrated in one unit, and the integrated unit may be implemented in a form of hardware, or in a form of software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working processes of the units and modules in the system may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

In the above embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to the related descriptions of other embodiments for parts that are not described or illustrated in a certain embodiment.

Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

In the embodiments provided in the present application, it should be understood that the disclosed apparatus/terminal device and method may be implemented in other ways. For example, the above-described apparatus/terminal device embodiments are merely illustrative, and for example, a module or a unit may be divided into only one type of logic function, and another division manner may be provided in actual implementation, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

Units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.

The integrated modules/units, if implemented in the form of software functional units and sold or used as separate products, may be stored in a computer readable storage medium. Based on such understanding, all or part of the flow in the method according to the embodiments described above may be implemented by a computer program, which is stored in a computer readable storage medium and used by a processor to implement the steps of the embodiments of the methods described above. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer readable medium may include: any entity or device capable of carrying computer program code, recording medium, U.S. disk, removable hard disk, magnetic disk, optical disk, computer Memory, read-Only Memory (ROM), random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, software distribution media, and the like.

The above embodiments are only used to illustrate the technical solutions of the present application, and not to limit the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present application and are intended to be included within the scope of the present application.

Claims

1. A method of scheduling concrete orders, comprising:

distributing the K concrete orders into the order codes to obtain N initial scheduling schemes, wherein N is an integer greater than 1;

optimizing the initial scheduling scheme by adopting a bidirectional cooperative global optimization strategy based on the information of the K concrete orders to obtain a global optimal target scheduling scheme for guiding the production object to execute the K concrete orders;

distributing the K concrete orders into the order codes to obtain N initial scheduling schemes, wherein the N initial scheduling schemes comprise:

distributing the K concrete orders into the order codes according to R modes to obtain R initial scheduling schemes, wherein R is a positive integer smaller than N;

transforming concrete orders in the R initial production scheduling schemes to obtain N initial production scheduling schemes, wherein the N initial production scheduling schemes comprise the R initial production scheduling schemes;

the information of the concrete order comprises preset weight of the concrete order and order required completion time;

and optimizing the initial scheduling scheme by adopting a bidirectional cooperative global optimization strategy based on the information of the K concrete orders to obtain a global optimal target scheduling scheme, wherein the method comprises the following steps of:

and updating the optimized production scheduling scheme to the target production scheduling scheme under the condition that the expected order completion time of the concrete order in the optimized production scheduling scheme is superior to the expected order completion time of the concrete order in the target production scheduling scheme.

2. The method of claim 1, wherein the R initial production schedules comprise a first production schedule and a second production schedule, and the information of the concrete order comprises an order number of the concrete order;

the step of transforming the concrete orders in the R initial scheduling schemes to obtain the N initial scheduling schemes comprises the following steps:

determining k first coding positions of the k first concrete orders in the first production scheme and k second coding positions of the k first concrete orders in the second production scheme according to the order numbers of the k first concrete orders;

exchanging k first concrete orders in the k first coding positions with k first concrete orders in the k second coding positions to obtain a third production scheduling scheme and a fourth production scheduling scheme;

the coding positions occupied by the k first concrete orders in the third production scheduling scheme are the k first coding positions, the sequence of the k first concrete orders in the third production scheduling scheme is the sequence of the k first concrete orders in the second production scheduling scheme, and the N initial production scheduling schemes include the third production scheduling scheme and the fourth production scheduling scheme.

3. The method of claim 1, wherein the R initial scheduling scenarios include a fifth scheduling scenario;

wherein the third encoding bit and the fourth encoding bit are associated with different production objects, and the N initial production schedules include the sixth production schedule.

4. The method of claim 1, wherein the determining the fitness corresponding to each initial scheduling scheme according to the completion condition of the concrete order and the preset weight of the concrete order comprises:

calculating the initial scheduling scheme according to the following formulaP _i Corresponding fitness

：

A preset weight representing the concrete order,

indicating the completion of the concrete order,P _ij representing the initial scheduling schemeP _i To (1)jCoded bit

Wherein:

、

、

respectively representing concrete ordersP _ij A desired production completion time, and an order required completion time.

5. The method of claim 1, wherein the information of the concrete order comprises an order type of the concrete order;

the determining the completion condition of each concrete order in each initial scheduling scheme respectively comprises the following steps:

acquiring a fifth coding bit of a second concrete order in the initial scheduling scheme, wherein the second concrete order is any one of the concrete orders;

acquiring the expected processing time of the second concrete order, the transportation time of the second concrete order, the order type of a third concrete order and the expected production completion time of the third concrete order under the condition that the fifth coding bit indicates that the second concrete order is not the first task of any production object, wherein the third concrete order is the previous concrete order of the second concrete order;

determining the expected order completion time of the second concrete order according to the expected processing time of the second concrete order, the transportation time of the second concrete order, the order type of a third concrete order and the expected production completion time of the third concrete order;

6. The method of claim 1, wherein said adapting the concrete order on the coding bit of the target production schedule using a bi-directional co-local optimization strategy comprises at least one of:

exchanging the concrete order on the sixth coding position in the target scheduling scheme with the concrete order on the previous coding position of the sixth coding position, wherein the sixth coding position is any coding position with a serial number more than or equal to 2;

exchanging the concrete order on the seventh coding position in the target scheduling scheme with the concrete order on the next coding position of the seventh coding position, wherein the sixth coding position is any coding position with a serial number smaller than mxn;

exchanging the concrete order on the eighth coding position in the target scheduling scheme with the concrete order on the ninth coding position in the target scheduling scheme, wherein the difference value between the serial number of the eighth coding position and the serial number of the ninth coding position is an integral multiple of m.

7. A concrete order scheduling apparatus, comprising:

the distribution module is used for distributing the K concrete orders into the order codes to obtain N initial scheduling schemes, wherein N is an integer larger than 1;

a determining module, configured to determine a target production scheduling plan from the N initial production scheduling plans based on information of the K concrete orders, where the target production scheduling plan is used to instruct the production object to execute the K concrete orders;

the distribution module includes:

the transformation unit is used for transforming the concrete orders in the R initial production scheduling schemes to obtain N initial production scheduling schemes, wherein the N initial production scheduling schemes comprise the R initial production scheduling schemes;

the information of the concrete order comprises preset weight of the concrete order and the required completion time of the order;

the determining module comprises:

8. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1 to 6.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, the processor implementing the method of any one of claims 1 to 6 when executing the computer program.