CN115409289B

CN115409289B - Concrete order scheduling method, device and storage medium

Info

Publication number: CN115409289B
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: 2024-04-02
Anticipated expiration: 2042-10-28
Also published as: CN115409289A

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 order coding information, wherein the order coding information comprises the number n of production objects for executing the concrete orders, the production quantity m of each production object, and the intensity and time of each concrete order; distributing K concrete orders into order codes to obtain N initial production schemes, wherein N is an integer greater than 1; based on the information of the K concrete orders, strategies such as bidirectional collaborative global optimization and the like are adopted for optimization, and a globally optimal target production scheme is obtained and used for guiding a production object to execute the K concrete orders. According to the embodiment of the application, the production efficiency can be effectively improved, the labor intensity is reduced, the missing of orders in the production process is avoided, and the coverage range of the stirring station is improved.

Description

Concrete order scheduling method, device and storage medium

Technical Field

The present disclosure 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 jurisdiction of a standard section is subjected to realistic constraints of large number of points, wide distribution, large span of concrete strength grade, use of dosage, urgent isomerism and the like, and reasonable production scheduling of concrete stirring and other types of orders is required. In the related art, manual production is usually used for concrete orders, and the problems of low production efficiency, high labor intensity, easy omission of orders and the like exist.

Disclosure of Invention

The embodiment of the application provides a concrete order scheduling method, a device and a storage medium, which are used for solving the problems of low scheduling efficiency, high labor intensity and easy omission of orders caused by manual concrete order scheduling in the related technology.

In order to solve the technical problems, the application is realized as follows:

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

obtaining information of K concrete orders and order coding information, wherein the order coding information comprises the number n of production objects for executing the concrete orders, and the production quantity m of each production object, wherein K, m and n are integers larger than 1, and K is smaller than or equal to m multiplied by n;

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

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

In a second aspect, embodiments of the present application further provide a concrete order scheduling device, including:

the system comprises an acquisition module, a storage module and a control module, wherein the acquisition module is used for acquiring information of K concrete orders and order coding information, the order coding information comprises the number n of production objects for executing the concrete orders, the production quantity m of each production object is an integer greater than 1, and K is smaller than or equal to m multiplied by n;

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

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

In a third aspect, embodiments of the present application further provide an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the above method when executing the computer program.

In a fourth aspect, embodiments of the present application further provide a computer readable storage medium storing a computer program, where the computer program implements the method described above when executed by a processor.

According to the concrete order scheduling method, information of K concrete orders and information of order codes are obtained, 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 to the order codes to obtain N initial scheduling schemes, the initial scheduling schemes are optimized by adopting a bidirectional collaborative global optimization strategy based on the information of the K concrete orders, and a global optimal target scheduling scheme is obtained, wherein K, m, N and N are integers larger than 1, and K is smaller than or equal to m multiplied by N. According to the method, the production objects and the production quantity of the production objects are embodied in an order coding mode, K concrete orders are distributed to N initial production scheduling schemes obtained by the order coding, each initial production scheduling scheme can better embody the production scheduling mode of the concrete orders, based on information of the K concrete orders, the target production scheduling scheme for guiding the production objects to execute each concrete order can be automatically determined by combining with application of a bidirectional collaborative global optimization strategy, and the manual production scheduling process is avoided.

Drawings

Fig. 1 is a schematic flow chart of a concrete order scheduling method according to an embodiment of the present application;

FIG. 2 is an exemplary diagram of an initial scheduling scheme corresponding code;

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 delivery method in one specific embodiment;

fig. 6 is a schematic structural view of a concrete order delivery device according to an embodiment of the present application.

Detailed Description

In order to make the technical problems, technical solutions and advantages to be solved by the present application more apparent, the following detailed description will be given with reference to the accompanying drawings and the specific embodiments. In the following description, specific details such as specific configurations and components are provided merely to facilitate a thorough understanding of embodiments of the present application. It will therefore be apparent to those skilled in the art that various changes and modifications can be made to the embodiments described herein without departing from the scope and spirit of the application. In addition, descriptions of well-known functions and constructions are omitted for clarity and conciseness.

Unless defined otherwise, technical or scientific terms used herein should be given the ordinary meaning as understood by one of ordinary skill in the art to which this application belongs. The terms "first," "second," and the like, as used herein, do not denote any order, quantity, or importance, but rather are used to distinguish one element from another. Likewise, 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 concrete order scheduling method provided in an embodiment of the present application includes:

step 101, obtaining information of K concrete orders and order coding information, wherein the order coding information comprises the number n of production objects for executing the concrete orders, and the production quantity m of each production object, wherein K, m and n are integers larger than 1, and K is smaller than or equal to m multiplied by n;

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

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

Taking a concrete order as an example of a concrete mixing order, the concrete order scheduling method of the embodiment of the application may be performed by a mixing station of concrete. Of course, it is readily understood that the method execution subject may be embodied as an electronic device or a server, etc., and that these execution subjects may be located at a mixing station or cloud, etc. The mixing station is referred to herein as the subject of the method, and may be used to facilitate an understanding of the practice of the present application.

In connection with application scenarios of road construction or house construction, a plurality of construction points may be generated simultaneously, each construction point having a use requirement for concrete, and accordingly, the mixing station will obtain a plurality of concrete orders, where the plurality of concrete orders may correspond to the above-mentioned K concrete orders.

Each concrete order typically has corresponding information such as the time or degree of urgency that the concrete order requires to be completed, the strength and type of the concrete, the importance of the concrete order, the location of transportation to which the concrete order corresponds, the number of the concrete order, and the like. It will be readily appreciated that some examples of information about concrete orders are provided herein, and that in actual concrete order production, the information about concrete orders that are applied may be one or more of the above examples, or may be other types of information, not illustrated herein.

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

In a concrete mixing scenario, the production object may be a mixer, and n may be considered as the number of mixers. The production can be performed for each mixer, and each mixer can be made to perform production for m concrete orders at most through preset settings or default settings. Accordingly, n mixers can be used to schedule up to m x n concrete orders.

Literally, an order code may be considered a string 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 have a concrete order arranged thereon.

In step 102, the mixing station may distribute K concrete orders into order codes, resulting in N initial production scheduling schemes.

In combination with some examples, when K is equal to m×n, K concrete orders may occupy all of the coded bits on the order code, with the concrete orders and the coded bits being in a one-to-one correspondence. In different initial production schemes, there may be differences in the location of the K concrete orders in the order code.

In other examples, when K is less than m n, some of the order codes are occupied by concrete orders, and some of the code bits are empty in the initial production schedule. The distribution of K concrete orders or the distribution of space-coded bits may be different in different initial production schemes.

As shown in fig. 2, fig. 2 is an example of an initial production schedule. In this example, n is equal to 3, corresponding to 3 mixers, denoted as machine 1, machine 2 and machine 3, respectively. Each mixer is assigned 5 coded bits, i.e. m equals 5 in this example. The order code can be obtained by arranging 15 coding bits in total in 3 mixers in sequence.

Furthermore, in the example shown in FIG. 2, K may be equal to 10, each concrete order may have a corresponding order number, corresponding to orders 1 through 10, and orders 1 through 10 may be randomly assigned to the order codes, i.e., the initial scheduling scheme shown in FIG. 2 may be achieved.

As can be seen from the initial scheduling scheme shown in fig. 2, machine 1 will be in turn concrete order 2 and order 8, machine 2 will be in turn concrete order 4, order 6, order 9 and order 10, and machine 3 will be in turn concrete order 1, order 3, order 5 and order 7. The above can clearly reflect the production objects corresponding to each concrete order and the production sequences corresponding to each production by setting the order codes and distributing the K concrete orders to the initial production arrangement scheme obtained by the order codes.

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

In some embodiments, the K concrete orders may be allocated to the order codes in a random manner, or may be allocated according to a preset allocation rule, which is not limited herein.

In step 103, the mixing station may optimize the initial production schedule by using a bidirectional collaborative global optimization strategy based on the information of the K concrete orders, so as to obtain a globally optimal target production schedule for guiding the production object to execute the K concrete orders.

As exemplified above, the information of a concrete order may include the time required to complete, and the code bits of the concrete order in the initial production schedule may affect the actual production time of the concrete order. For example, for a concrete order that is more time critical, the initial schedule 1 is placed on the 4 th encoding site of machine 1, and the initial schedule 2 is placed on the 1 st encoding site of machine 2, then the production is based on initial schedule 1, potentially resulting in a concrete order time-out; and production is based on the initial production schedule 2, the emergency concrete order may be completed in the desired time. From the perspective of the emergency concrete order alone, the scheduling scheme 2 is more suitable as a target scheduling scheme.

Further, the number of concrete orders is plural, and from a global point of view, if an initial scheduling scheme can enable all of the K concrete orders to be completed within a corresponding desired time, the initial scheduling scheme may be determined as a target scheduling scheme.

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

For example, different mixers may be located at different mixing stations, and the concrete demand address locations for the K concrete orders may also be different, and based on the initial production schedule, the corresponding resulting transit times and transit costs may be determined. In addition to meeting the production time requirements, global transportation time and transportation costs may be required to be optimized in certain targeted production schemes.

When one mixing station produces concrete of different strength types in succession, the mixing equipment needs to be cleaned, and thus extra cleaning time is increased, and when determining a target production schedule, multiple concrete orders of the same strength type may need to be considered to be placed in 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 herein. In general, based on the information of the K concrete orders, corresponding constraints can be generated, thereby enabling the determined target production scheduling scheme to be compared globally to meet the demand constraints of the respective concrete orders.

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

As for the specific application of the bidirectional collaborative 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 representing the scheduling of a machine, which is set up to support m scheduling. As shown in fig. 2, fig. 2 is a one-time production scheduling with 10 concrete orders, 3 machines (n=3), resulting in an initial scheduling scenario. Each machine in the figure performs production 5 times at most (m=5), and concrete orders thereon are sequentially produced from left to right, each coding position in the figure (or called a basic element or gene) is a serial number of the concrete order or an identifier indicating that no production is performed, and the concrete order in the coding position can be called a basic unit. For example, in fig. 2, the base unit order 8 indicates that the concrete order is being produced on the second one arranged on the machine 1.

It will be readily appreciated that in different initial production schemes, the coding positions in which the concrete orders are located, or the order of the concrete orders, may be different.

The N initial scheduling methodsA case can be considered a population, noted asPEach initial scheduling scheme is a populationPOne of the individuals is marked asP _i Wherein, the method comprises the steps of, wherein,i=1, 2, …, N. Initial scheduling schemeP _i Each coded bit in (a) may be noted asP _ij Wherein, the method comprises the steps of, wherein, j=1, 2, …, m×n. In order to facilitate distinguishing different concrete orders, a number may be set for each concrete order, the concrete order may be allocated to an order code, the number of each concrete order may be written into a code bit in the order code, the code bit not written with the number of the concrete order may be empty, or the number 0 may be used to indicate.

Various embodiments will be described below based on the above definitions of populations, individuals, etc.

In one embodiment, K concrete orders are distributed into order codes, resulting in N initial production schedules, including:

distributing 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 changing concrete orders in the R initial scheduling schemes to obtain N initial scheduling schemes, wherein the N initial scheduling schemes comprise the R initial scheduling schemes.

In this embodiment, the N initial scheduling schemes may be mainly obtained in two manners, where one manner is to directly distribute K concrete orders into order codes to obtain the R initial scheduling schemes, and the other manner may be to transform the R initial scheduling schemes to indirectly obtain the remaining initial scheduling schemes.

In the process of obtaining R initial production schemes, K concrete orders can be distributed to the coding positions of order codes in a random distribution mode; alternatively, the K concrete orders may be distributed to the order code coding bits, etc. by a preset distribution rule, which is not specifically limited herein.

Combining upper levels with respect to populationPIn the case of R initial production schedules, it can be considered that a preliminary schedule is obtainedMay include R individuals. To more conveniently and quickly increase the number of individuals in the population, the population can be usedPExisting individuals, e.g. by transforming the code positions of concrete orders in one individual, or by exchanging concrete orders in the same code position in two individuals, etc., if new individuals can be formed, these new individuals can be added to the populationPIs a kind of medium. The addition of new individuals can make the populationPThe number of individuals in (a) is increased from R to N, and N individuals correspond to the N initial scheduling schemes.

In this embodiment, on the basis of the R initial scheduling schemes obtained in the allocation manner, more initial scheduling schemes can be obtained more efficiently in a transformation manner, and the increase of the initial scheduling schemes is helpful for further determining a target scheduling scheme which better meets the information requirements of K concrete orders, and improving the rationality of concrete order scheduling.

Optionally, the R initial production schemes comprise a first production scheme and a second production scheme, and the information of the concrete order comprises an order number of the concrete order;

transforming concrete orders in the R initial scheduling schemes to obtain N initial scheduling schemes, wherein the method comprises the following steps:

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 bits of the k first concrete orders in the first production scheme and k second coding bits 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 k first coding positions and k first concrete orders in k second coding positions to obtain a third production scheme and a fourth production scheme;

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

This embodiment is a refinement of one possible solution to transforming concrete orders in R initial production schemes. For ease of understanding, the transformation process of the present embodiment is described below in connection with the corresponding example of fig. 3.

As shown in fig. 3, the representation of the order encoded form of the first scheduling scheme and the second scheduling scheme is shown in fig. 3. The first and second schedules may be present in the R initial schedules described above, which may be obtained by randomly distributing K concrete orders into order codes.

In order coding, some coding bits include text, such as order 1, order 2 … …, order 10, etc., which may correspond to the order numbers described above. The order number may be set without specific limitation, and may be obtained by sorting according to the order time of the concrete order or the data of the type such as the amount of demand, etc. by combining some examples.

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

As shown in fig. 3, a third and fourth scheduling scheme may be obtained by exchanging k first concrete orders between the first and second scheduling schemes. And the exchange results of the k first concrete orders should satisfy the following rules: the k first concrete orders in the third production scheme occupy k first coding bits, and the order of the k first concrete orders in the third production scheme is the order of the k first concrete orders in the second production scheme. Since the third scheduling scheme and the fourth scheduling scheme herein are not limited in order, the fourth scheduling scheme can be considered to satisfy similar rules.

Specifically, as can be seen in the example of fig. 3, in the third production arrangement, the 4 first concrete orders, order 1, order 4, order 9, and order 6, are located in the 6 th, 7 th, 8 th, and 11 th coding positions, respectively, which are in one-to-one correspondence with the coding positions of the 4 first concrete orders in the first production arrangement. At the same time, the order 1, order 4, order 9, and order 6 are in the same order as the order of the 4 first concrete orders in the second scheduling scheme.

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

Through the above conversion mode, the third production arrangement scheme and the fourth production arrangement scheme can be ensured that the missing or repeated concrete orders can not occur, and the rationality and feasibility of the production arrangement schemes are ensured. In addition, the initial scheduling scheme obtained by exchanging the first concrete orders can be better ensured, the method is different 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;

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

wherein the third code bit is associated with a different production object than the fourth code bit, and the N initial production schemes include a sixth production scheme.

This embodiment may be considered another way of transforming concrete orders that is different from the previous embodiment. To facilitate understanding of the implementation of this embodiment, the following is also described in conjunction with an example.

As shown in fig. 4, in the fifth scheduling scheme of fig. 4, the third coding bit may correspond to the 2 nd coding bit, where the concrete order is order 8, and the fourth coding bit may correspond to the 7 th coding bit, where the concrete order is order 6.

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

In order to ensure the difference between the sixth production arrangement and the fifth production arrangement, the present embodiment may select the concrete order on the coding position associated with the different production objects in the fifth production arrangement when selecting the exchanged concrete order. For example, in the example shown in FIG. 4, an order 8 and an order 6 are interacted with, a concrete order at the coded location associated with machine 1 and a concrete order at the coded location associated with machine 2, respectively.

Similar to the previous embodiment, the present embodiment can also ensure the rationality and feasibility of the sixth production schedule, and will not be described again.

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

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

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

according to the completion condition of the concrete order and the preset weight of the concrete order, the corresponding fitness of each initial production arrangement scheme is respectively determined;

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

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

and updating the optimized production scheduling scheme to the target production scheduling scheme under the condition that the expected completion time of the order of the concrete order in the optimized production scheduling scheme is superior to the expected completion time of the order of the concrete order in 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 conjunction with the above examples, any initial scheduling regimen may be considered an individualP _i The corresponding fitness of the initial scheduling scheme can be recorded as. In one embodiment, the ∈ ->The calculation can be made by the following formula:

（1）

in the above-mentioned method, the step of,may represent a preset weight of the concrete order,/-or->May be used to indicate completion of a concrete order.

In combination with the above-mentioned description,P _ij representing an initial scheduling programP _i The first of (3)jThe number of coded bits, in an initial scheduling scheme,P _ij the concrete order in the coded bits can be considered to be deterministic and therefore, in equation (1), can be identified by identification P _ij To refer to a concrete order, the concrete order may be identified below to avoid repetitive descriptionP _ij To represent.

As for the preset weight of the concrete order, it may be preset, or may be predetermined according to the emergency degree of the concrete order, and the higher the emergency degree, the greater the preset weight.

The completion of the concrete order indicates whether the concrete order can be completed within the order demand completion time. For example, the information of the concrete order may include the demand of the concrete order and the order demand completion time, the information of the order code may include the production rate, and the ratio of the demand to the production rate is solved to obtain the expected completion time of the order. Comparing the predicted completion time with the order required completion time, it can be determined whether the concrete order can be completed within the order required completion time, and further the completion situation of the concrete order is obtained.

Of course, in practical applications, it may also be necessary to consider the time of transportation, the time spent queuing a concrete order at a production object, etc., in determining whether the concrete order can be completed within the order demand completion time.

In combination with an example, set up 、/>、/>Respectively represent concrete ordersP _ij The desired production completion time and the order requirement completion time, then:

（2）

is provided withFor concrete ordersP _ij Is used to determine the desired start time of the (c) signal,ufor concrete ordersP _ij Is the target machine of production (i.e. code bitP _ij And the number of the belonging production object), andvfor concrete ordersP _ij At the target machineuThe production sequence numbers are as follows:

（3）

（4）

（5）

wherein,representing a down-rounding operation,S _u for concrete ordersP _ij At the production rate of the target machine, +.>For concrete ordersP _ij Is the time spent queuing at the production object, +.>For concrete ordersP _ij Is not required.

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

determining the completion of each concrete order in each initial scheduling scheme, respectively, comprising:

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

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 when 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 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 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 one initial production scenario, the relationship between the concrete order and the coded bits is determinedP _ij The concrete order can also be recorded as a concrete orderP _ij . In this embodiment, the second concrete order is any concrete order, and the concrete order can be used directlyP _ij Representing, correspondingly, the fifth code bit can also be used as the code bitP _ij And (3) representing.

In the above examples, the start time according to the desire is describedDesired processing time->Transport time->Determining the order desired completion time (corresponding +.>) Is calculated by the method. In this embodiment, +.>The factors considered are further defined.

Specifically, the second concrete orderP _ij Is set to the desired start time of (1) Taking into account the order type of the second concrete order, the order type of the third concrete order, and the desired production completion time of the third concrete order, the following can be expressed by the formula:

（6）

wherein,for the desired production completion time of the third concrete order,/-for>Representing the order type of the second concrete order, +.>Representing the order type of the third concrete order,Cis a time overhead due to the difference in order types.

Taking a concrete stirring production scene as an example, the order type can be the strength type of concrete, and when one machine is used for producing concrete with different strength types in sequence, the order type can be the strength type of concreteStirring equipment is cleaned, thereby bringing about time costC. Conversely, when the machine produces concrete of the same strength type in succession, the above-mentioned time overhead can then generally be considered equal to 0.

As can be seen based on the formula (6),in fact a continuous iterative process, for the concrete order on the first coded position of a machine, < >>May be equal to->In the latter order of concrete on the rear coding position,/->Can be obtained by iterative operation.

As for the process of determining the completion of the second concrete order based on the order desired completion time and the order required completion time, reference may be made to the above formula (2), and the description will not be repeated here.

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

In this embodiment, the process of adjusting the concrete orders on the coding positions of the target production scheduling schemes to obtain the optimized production scheduling schemes has a certain similarity with the process of transforming the concrete orders in the R initial production scheduling schemes to obtain the new initial production scheduling schemes. But there is also a certain difference 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 production runs to arrive at a new initial production run may be considered as gene-unoriented crossover and mutationThe process, i.e. to expand the populationPThe number of individuals in (a) is targeted without regard to whether the genes after crossover or mutation become more optimal.

In this embodiment, the obtained optimal scheduling scheme needs to be compared with the target scheduling scheme, and the optimal scheduling scheme is updated to the target scheduling scheme under the condition that the order expected completion time of the concrete order in the target scheduling scheme is better than the order expected completion time of the concrete order. In other words, in this embodiment, the process of adjusting the concrete order at the coding position of the target production schedule to obtain the optimized production schedule may be regarded as the directional mutation process of the gene, so that the obtained target production schedule can guide production more reasonably.

Optionally, a bidirectional collaborative local optimization strategy is adopted to adjust the concrete order on the coding position of the target production scheme, including at least one of the following:

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

exchanging the concrete order on the seventh coding bit in the target production scheme with the concrete order on the next coding bit of the seventh coding bit, wherein the sixth coding bit is any coding bit with the serial number smaller than m multiplied by n;

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

In face of the discrete challenges of huge search space and feasible area caused by a large number of concrete orders, the embodiment of the application designs a bidirectional collaborative local optimization strategy to improve the search efficiency and local search capability of an algorithm. The strategy mainly considers the influence of intensity type and urgency degree among orders on individual quality and population PEach individual of (3)P _i And (5) optimizing.

In this embodiment, the exchange of the concrete order on the sixth code bit in the target production scheme with the concrete order on the previous code bit of the sixth code bit may be regarded as a forward search of the bidirectional search.

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

Namely meet the following requirements

，

And->Wherein->The adjusted order completion time is represented, and its calculation is shown in formula (7) and formula (8). If these conditions are met, the loop continues to search forward. If not, the forward search is ended, and the target scheduling scheme is updated.

（7）

（8）

In this embodiment, exchanging the concrete order at the seventh code bit in the target production schedule with the concrete order at the next code bit in the seventh code bit may be regarded as a backward search of the bi-directional search.

The backward search optimizes the production of the following concrete orders, mainly by placing the concrete order that is currently not able to be produced (corresponding to the concrete order at the seventh coded position) in the backward row. And the algorithm is used for arranging the current concrete order backwards until the concrete order which cannot be arranged is met, and updating the target arrangement scheme after the backward search is finished.

In this embodiment, exchanging the concrete order at the eighth code position in the target production schedule with the concrete order at the ninth code position in the target production schedule may be regarded as a collaborative search for the bi-directional search.

The collaborative search is mainly optimized for concrete orders between different stirrers (corresponding to the concrete order at the eighth encoding level and the concrete order at the ninth encoding level). In the process of optimizing again, if the interchanged production meets one of the following conditions, the adjustment is accepted: 1) After adjustment, both concrete orders can be completed, and the completion time is advanced; 2) The expected completion time of the concrete orders following both concrete orders is advanced.

Namely meet the following requirementsAnd->Or, satisfy->And->。

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

（9）

（10）

（11）

（12）

Wherein,representation calculationjAnd (3) withmThe remainder between.

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

Step 501, population initialization.

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

Orders are ordered from less to greater (sequence number starting from 1) according to their completion time. A population (set of scheduling schemes) of N individuals (one individual for each scheduling scheme) is then generated in a manner that sequentially randomly schedules orders to the stirring device. The method can increase the feasibility rate of the scheme, thereby improving the quality of the population.

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

Step 502, it is determined whether the algorithm satisfies an end condition.

The cutoff condition of the algorithm may be related to the order size, and if the number of orders is n, the algorithm ends when the algorithm iteration number t >1000n, and outputs the optimal scheduling scheme (corresponding to the target scheduling scheme).

At step 503, a multi-point random feasible interleaving operation.

This step may be considered as an operation procedure to obtain the third and fourth scheduling schemes above.

In particular, crossover operations are an important way of information interaction between individuals. Conventional random multipoint crossover operations generally involve randomly selecting the gene positions (corresponding to the coding positions) of two parent individuals, and then selecting gene segments for interchange based on these gene positions. The conventional random multipoint crossover does not consider the difference of gene level information (the gene level can represent order scheduling or idle identification) and gene order difference in the application, and the conventional random multipoint crossover operation can cause repeated order scheduling, scheduling disorder and the like, so that the crossover operation is low in efficiency and feasibility and offspring, and the searching efficiency of an algorithm is further affected.

To this end, this step proposes a multipoint randomly feasible interleaving operation. Randomly selectkCorresponding order number interchange is performed for (an integer number of random parameters) the order number interchange ensures that orders are only ordered once in the crossed child individual schemes. The specific operation pseudocode is shown in algorithm 1. The algorithm only needs to traverse two individuals at most once, and the calculation complexity is thatO(n), but ensures that the offspring generated by the parent meets the constraint that the order is only scheduled once, improving the feasibility of the offspring. The interleaving operation is only performed when one [0,1 ] is randomly generated]The number between is less than the crossover factorαIs executed.

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

Algorithm 1: multi-point random feasible cross operation

Input: father individualsP _a AndP _b

and (3) outputting: experimental individualsP' _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 at [1 ], nm]Sequence number set in (a)W

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

Step 504, mutation operation.

This step may be considered as an operation to obtain the sixth scheduling scheme above.

Specifically, when a [0,1 ] is randomly generated]The number between them is less than the variation factorβAnd performing mutation operation. The mutation operation flow is specifically as follows: firstly, randomly selecting two gene positions, and if the two gene positions are not the order numbers, selecting the two gene positions from the new one until the two selected gene positions have normal production; then, if the order numbers are all the order numbers, the positions of the order numbers are directly interchanged, if only one order number is adopted, the order adjustment treatment is carried out after the interchange, namely, the non-productive gene positions are moved backwards until the latter non-productive gene positions are also arranged, and the productive gene positions are moved forwards until the former genes are also arranged. Fig. 4 is an example of a mutation operation. In this example, the loci corresponding to the individual order 6 and order 8 are selected and then interchanged to create a new individual.

Step 505, select operation.

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

Step 506, bi-directional collaborative local optimization strategy.

This step may be implemented using the bi-directional search algorithm described above. The forward search of the bidirectional search (algorithm 2 lines 2-10), the bidirectional search algorithm is divided into the backward search of the bidirectional search (algorithm 2 lines 11-17) and the collaborative search of the bidirectional search (algorithm 2 lines 19-23).

Algorithm 2: bidirectional collaborative local optimization strategy

Input: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 ideas of the above pseudo code are described above and will not be repeated here.

And step 507, outputting an optimal scheduling scheme.

The optimal scheduling scheme can be considered as the target scheduling scheme which is finally output after being optimized in the above embodiment.

When the method is applied to a concrete mixing production scene, the method adopts an informatization technology and an intelligent calculation method, and has important practical significance in the aspects of improving the construction efficiency and project engineering progress, reducing the number of mixing stations, reducing temporary land, reducing the pollution to the environment and the like.

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

the acquiring module 601 is configured to acquire information of K concrete orders and order code information, where the order code information includes a number n of production objects for executing the concrete orders, and a production quantity m of each production object, where K, m, n are integers greater than 1, and K is less than or equal to m×n;

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

the determining module 603 is configured to optimize the initial production scheduling scheme by adopting a bidirectional collaborative global optimization strategy based on information of the K concrete orders, so as to obtain a globally optimal target production scheduling scheme, which is used for guiding a production object to execute the K concrete orders.

Optionally, the allocation module 602 includes:

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

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

the conversion unit includes:

a first determining subunit, configured to determine K first concrete orders from K concrete orders, where K is a positive integer less than or equal to K;

the second determining subunit is used for determining k first coding bits of the k first concrete orders in the first production scheme and k second coding bits of the k first concrete orders in the second production scheme according to the order numbers of the k first concrete orders;

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

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

the conversion unit includes:

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

the determining module 603 includes:

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

The second determining unit is used for determining the adaptability of each initial production scheme respectively according to the completion condition of the concrete order and the preset weight of the concrete order;

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

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

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

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

the first determination unit includes:

the first acquisition subunit is used for acquiring a fifth coding position of a second concrete order in the initial production scheme, wherein the second concrete order is any concrete order;

a second obtaining subunit, configured to obtain, when the fifth coding bit indicates that the second concrete order is not the first task of any production object, an expected processing time of the second concrete order, a transportation time of the second concrete order, an order type of a third concrete order, and an 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 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 determination 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 include at least one of:

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

the second exchanging unit is used for exchanging the concrete order on the seventh coding bit in the target production 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 m multiplied by n;

and the third exchanging unit is used for exchanging the concrete order on the eighth coding bit in the target production scheme with the concrete order on the ninth coding bit in the target production scheme, and the difference value between the serial number of the eighth coding bit and the serial number of the ninth coding bit is an integer 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 may be applied to the device embodiment and achieve the same technical effects, which is not described herein again.

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

The embodiment of the application also provides a computer readable storage medium, wherein the computer readable storage medium stores a computer program, and the computer program realizes the concrete order scheduling method when being executed by a processor.

It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-described division of the functional units and modules is illustrated, and in practical application, the above-described functional distribution may be performed by different functional units and modules according to needs, i.e. the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-described functions. The functional units and modules in the embodiment may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit, where the integrated units may be implemented in a form of hardware or a form of a 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 process of the units and modules in the above system may refer to the corresponding process in the foregoing method embodiment, which is not described herein again.

In the foregoing embodiments, the descriptions of the embodiments are emphasized, and in part, not described or illustrated in any particular embodiment, reference is made to the related descriptions of other embodiments.

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 solution. 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 manners. For example, the apparatus/terminal device embodiments described above are merely illustrative, e.g., the division of modules or units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection via interfaces, devices or units, which may be in electrical, mechanical or other forms.

The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.

The integrated modules/units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the present application may implement all or part of the flow of the method of the above embodiment, or may be implemented by a computer program to instruct related hardware, where the computer program may be stored in a computer readable storage medium, where the computer program, when executed by a processor, may implement the steps of each of the method embodiments described above. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, executable files or in some intermediate form, etc. The computer readable medium may include: any entity or device capable of carrying computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer Memory, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), an electrical carrier signal, a telecommunications signal, a software distribution medium, and so forth.

The above embodiments are only for illustrating the technical solution of the present application, and are not limiting thereof; 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 scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present application, and are intended to be included in the scope of the present application.

Claims

1. A method of scheduling concrete orders, comprising:

obtaining 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, the production quantity m of each production object is an integer greater than 1, K, m and n are integers less than or equal to m multiplied by n, m is the maximum production quantity of each production object on the concrete orders, which is preset or default, and the order codes comprise coding bits sequentially arranged in m multiplied by n;

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

Optimizing the initial production scheduling scheme by adopting a bidirectional collaborative global optimization strategy based on the information of the K concrete orders to obtain a globally optimal target production scheduling scheme, wherein the target production scheduling scheme is used for guiding the production object to execute the K concrete orders;

the K concrete orders are distributed to the order codes to obtain N initial production scheduling schemes, which comprise the following steps:

the K concrete orders are distributed to the order codes in R modes to obtain R initial production schemes, wherein R is a positive integer smaller than N;

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

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

the optimizing the initial production scheduling scheme by adopting a bidirectional collaborative global optimization strategy based on the information of the K concrete orders to obtain a globally optimal target production scheduling scheme comprises the following steps:

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 order required completion time;

According to the completion condition of the concrete order and the preset weight of the concrete order, respectively determining the adaptability of each initial production arrangement scheme;

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

updating the optimized production scheduling scheme to the target production scheduling scheme under the condition that the expected completion time of the order of the concrete order in the optimized production scheduling scheme is better than the expected completion time of the order of the concrete order in the target production scheduling scheme;

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

said determining the completion of each of said concrete orders in each of said initial production runs, respectively, comprising:

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

acquiring a desired processing time of the second concrete order, a transportation time of the second concrete order, an order type of a third concrete order, and a desired production completion time of the third concrete order, the third concrete order being a previous concrete order of the second concrete order, in a case where the fifth encoding bit indicates that the second concrete order is not a first task of any of the production objects;

Determining an order expected 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;

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;

the determining the adaptability of each initial production scheme according to the completion condition of the concrete order and the preset weight of the concrete order comprises the following steps:

the initial scheduling scheme is calculated according to the following formulaCorresponding fitness->：

；

Representing a preset weight of said concrete order,/-or->Indicating the completion of the concrete order,P _ij representing the initial scheduling schemeP _i The first of (3)jEncoded bits

Wherein:

；

、/>、/>respectively represent concrete ordersP _ij A transportation time, a desired production completion time, and an order requirement completion time;

wherein:

；

for concrete ordersP _ij Is used to determine the desired start time of the (c) signal,ufor concrete ordersP _ij Is used for the production target machine of the (c),vfor concrete orders P _ij At the target machineuSequence number on the upper part,/->Representing a down-rounding operation,S _u for concrete ordersP _ij At the production rate of the target machine, +.>For concrete ordersP _ij Is used in the production of the fuel,M(P _ij )representing ordersP _ij C is the cleaning time cost of stirring equipment when one machine sequentially produces concrete with different strength types;

the bidirectional collaborative local optimization strategy comprises bidirectional searching, wherein the bidirectional searching comprises forward searching, backward searching and collaborative searching;

the forward search includes swapping one concrete order in the target production schedule with a previous concrete order and determining whether a condition is met，/>And is also provided withWherein->Representing the adjusted order completion time; if yes, continuing to circularly search forward; if not, finishing forward searching and updating the target scheduling scheme;

wherein:

；

the backward searching comprises the steps that the current concrete order is always backward arranged until the concrete order which cannot be arranged is met, the backward searching is finished, and the target arrangement scheme is updated;

the collaborative search comprises adjusting concrete orders among different production objects and judging whether the concrete orders meet the requirementAnd- >Or whether or not to satisfy->And is also provided withIf yes, updating the target scheduling scheme; otherwise, continuing to search backwards until the non-scheduling production position is searched;

wherein:

；

。

2. the method of claim 1, wherein the R initial scheduling schemes include a first scheduling scheme and a second scheduling scheme, and the information of the concrete order includes an order number of the concrete order;

the concrete orders in the R initial production schemes are transformed to obtain the N initial production schemes, and the method comprises the following steps:

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 scheme and a fourth production scheme;

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

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

wherein the third encoded bits are associated with the different production objects than the fourth encoded bits, the N initial production schemes including the sixth production scheme.

4. The method of claim 1, wherein adjusting the concrete order at the coded bits of the target production schedule using a bi-directional collaborative local optimization strategy comprises at least one of:

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

exchanging the concrete order on a seventh coding bit in the target production arrangement scheme with the concrete order on a later coding bit of the seventh coding bit, wherein the seventh coding bit is any coding bit with the serial number smaller than m multiplied by n;

5. A concrete order scheduling device, comprising:

the system comprises an acquisition module, a storage module and a storage module, wherein the acquisition module is used for acquiring information of K concrete orders and information of order codes, the information of the order codes comprises the number n of production objects used for executing the concrete orders, the production quantity m of each production object is an integer greater than 1, K, m and n are all integers less than or equal to m multiplied by n, m is the maximum production quantity of each production object to the concrete orders, which is preset or set by default, and the order codes comprise coding bits sequentially arranged by m multiplied by n;

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

the determining module is used for determining a target production scheme from the N initial production schemes based on the information of the K concrete orders, wherein the target production scheme is used for guiding the production objects to execute the K concrete orders;

The distribution module comprises:

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

the determining module includes:

The updating module is used for updating the optimized production scheduling scheme into 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;

；

Wherein:

；

wherein:

；

for concrete ordersP _ij Is used to determine the desired start time of the (c) signal,ufor concrete ordersP _ij Is used for the production target machine of the (c),vfor concrete ordersP _ij At the target machineuSequence number on the upper part,/->Representing a down-rounding operation,S _u for concrete ordersP _ij At the production rate of the target machine, +.>For concrete ordersP _ij Is used in the production of the fuel, M(P _ij )representing ordersP _ij C is the cleaning time cost of stirring equipment when one machine sequentially produces concrete with different strength types;

wherein:

；

the collaborative search comprises adjusting concrete orders among different production objects and judging whether the concrete orders meet the requirementAnd->Or whether or not to satisfy->And is also provided withIf yes, updating the target scheduling scheme; otherwise, continuing to search backwards until the non-scheduling production position is searched;

wherein:

；

。

6. a computer readable storage medium storing a computer program, characterized in that the computer program when executed by a processor implements the method according to any one of claims 1 to 4.

7. 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 4 when the computer program is executed by the processor.