CN113793030A

CN113793030A - Material scheduling method and device and storage medium

Info

Publication number: CN113793030A
Application number: CN202111078120.XA
Authority: CN
Inventors: 刘义俊; 刘孝阳
Original assignee: Wuxi Weiint Data Technology Co ltd
Current assignee: Wuxi Weiint Data Technology Co ltd
Priority date: 2021-09-15
Filing date: 2021-09-15
Publication date: 2021-12-14

Abstract

The application discloses a material scheduling method, a material scheduling device and a storage medium, which relate to the technical field of computers, and the method comprises the following steps: acquiring production configuration information of a production workshop; acquiring production manufacturing information according to the production configuration information at the initial time of a sampling period; constructing a time loss matrix according to the production and manufacturing information; each row of the time loss matrix corresponds to a device which has been fed or called, each column corresponds to a device which can be fed or taken, and the value of the matrix represents the time loss; solving the time loss matrix; and scheduling the material according to the solving result of the time loss matrix. The problem that an existing scheduling scheme is possibly inaccurate is solved, real-time scheduling is carried out according to production and manufacturing information of a production workshop, and the material scheduling accuracy is improved.

Description

Material scheduling method and device and storage medium

Technical Field

The invention relates to a material scheduling method, a material scheduling device and a storage medium, and belongs to the technical field of computers.

Background

With the rapid development of industrial 4.0, big data and artificial intelligence technologies, the construction of an intelligent factory becomes a core technology for the transformation of a production factory, and an intelligent logistics scheduling system is a key step for realizing the intelligent factory.

An existing intelligent scheduling method includes: establishing a production scheduling model taking the evaluation index and the production period of the loading point as optimization targets, and then performing forward and backward pre-scheduling on the production scheduling model by utilizing a genetic algorithm, wherein the pre-scheduling still outputs a fixed scheduling result; and finally, classifying the disturbance information of the workshop, determining the starting rescheduling grade according to the disturbance grade, and outputting the rescheduling result.

However, in the above scheme, the level of disturbance needs to be defined, which has a certain subjectivity, so that the determined scheduling scheme cannot meet the actual scheduling requirement, that is, the existing scheduling scheme may not be accurate.

Disclosure of Invention

The invention aims to provide a material scheduling method, a material scheduling device and a storage medium, which are used for solving the problems in the prior art.

In order to achieve the purpose, the invention provides the following technical scheme:

according to a first aspect, an embodiment of the present invention provides a material scheduling method, where the method includes:

acquiring production configuration information of a production workshop, wherein the production configuration information comprises: the position information of an automatic navigation device AGV, the processing time and the loading time of the X procedure, the processing time and the loading time of the X +1 procedure and the storage time of the materials in a cache region are configured in the production workshop, X is more than or equal to 1 and less than N, and N is the maximum value of the procedures in the production workshop;

acquiring production manufacturing information according to the production configuration information at the initial time of a sampling period; the manufacturing information includes: blanking time of the X procedure, material calling time of the X +1 procedure, transportation time from the material of the i-th equipment to the j-th equipment and equipment idle time of the X +1 procedure;

constructing a time loss matrix according to the production and manufacturing information; each row of the time loss matrix corresponds to a device which has been fed or called, each column corresponds to a device which can be fed or taken, and the value of the matrix represents the time loss;

solving the time loss matrix;

and scheduling the material according to the solving result of the time loss matrix.

Optionally, the constructing a time loss matrix according to the manufacturing information includes:

determining whether material scheduling is needed at any time in the sampling period according to the blanking time of the X procedure and the material calling time of the X +1 procedure;

and if the judgment result is that the material scheduling is required, constructing the time loss matrix according to the production and manufacturing information.

Optionally, the determining whether to perform material scheduling according to the blanking time of the X procedure and the material calling time of the X +1 procedure at any time in the sampling period includes:

if T _ Cueernt-T _ ZR _ XL_i< 0, i ∈ {1,2, …, M }, and T _ Cueernt-T _ KS _ JL_j<0, j belongs to {1,2, …, N }, and determining that the material scheduling is not needed;

if T _ Cueernt-T _ ZR _ XL_i0 but T _ Cueernt-T _ KS _ JL_jIf the current time is less than 0, determining that M devices which have been blanked in the X procedure need to be scheduled, wherein M is more than or equal to 1 and less than or equal to M;

if T _ Cueernt-T _ ZR _ XL_i< 0, i ∈ {1,2, …, M } and T _ Cueernt-T _ KS _ JL_jIf j is more than 0 and belongs to {1,2, …, N }, determining that N devices called in the X +1 procedure need to be scheduled, wherein N is more than or equal to 1 and less than or equal to N;

if T _ Cueernt-T _ ZR _ XL_iIs more than 0 and T _ Cueert-T _ KS _ JL_jIf the current working procedure is more than 0, determining that m devices which have been blanked in the X working procedure and n devices which have been called in the X +1 working procedure need to be scheduled;

wherein T _ Cueert is the current time, and T _ ZR _ XL_iT _ KS _ JL is the blanking time of the ith equipment in the X procedure_jThe material calling time of the jth equipment in the process X + 1; i belongs to {1,2,3, …, M }, wherein M is the total number of the devices in the Xth process; j is belonged to {1,2,3, …, N }, and N is the total number of the devices in the X +1 th procedure.

Optionally, if T _ Cueernt-T _ ZR _ XL_i>0, but T _ Cueert-T _ KS _ JL_j< 0, said constructing said time loss matrix based on said manufacturing information, comprising:

acquiring a first time loss matrix of material loading positions of m pieces of equipment which are blanked in the X procedure to N pieces of equipment in the X +1 procedure;

acquiring a second time loss matrix of m devices which are blanked in the X procedure to h devices in a cache region in the X +1 procedure, wherein h is the number of all idle cache regions at the T _ Cueert moment;

and determining the final time loss matrix according to the first time loss matrix and the second time loss matrix.

Optionally, the determining the final time loss matrix according to the first time loss matrix and the second time loss matrix includes:

merging the first time matrix and the second time matrix to obtain an initial feeding time loss matrix;

taking the first m columns with the minimum time loss in each row of the initial feeding time loss matrix, and obtaining a union of all the taken columns, wherein m is a positive integer;

and taking the time loss from each row of the initial feeding time loss matrix to all the columns of the union set to obtain the final time loss matrix.

Optionally, if T _ Cueernt-T _ ZR _ XL_i< 0 and T _ Cueernt-T _ KS _ JL_j(> 0), said constructing said time loss matrix from said production manufacturing information comprising:

determining a priority coefficient omega for the materials in the cache region of the (X +1) th procedure according to the storage time of the materials;

acquiring transportation time T _ YS from No. q device to No. f device_qf(ii) a Wherein Q belongs to (1, Q), F belongs to (1,2,3 …, F); q is all unlocked called material equipment KS in the X +1 procedure_qF is the total number of all the buffer areas in which the materials are stored at the current moment;

according to the priority coefficient omega and the transportation time T _ YS_qfCalculating KS_qA third time loss matrix to all buffer areas that are material at the current time;

obtaining KS_qApparatus ZR to unlocked X sequence_rThe fourth time loss matrix of (1);

and calculating the final time loss matrix according to the third time loss matrix and the fourth time loss matrix.

Optionally, the calculating a final time loss matrix according to the third time loss matrix and the fourth time loss matrix includes:

merging the third time loss matrix and the fourth time loss matrix to obtain an initial material calling time loss matrix;

taking the column of the first Q name with the minimum time loss in each row in the initial material calling time loss matrix, and merging all the taken columns;

and taking the time loss from all rows in the initial material-calling time loss matrix to all the concentrated columns to obtain the final time loss matrix.

Optionally, if T _ Cueernt-T _ ZR _ XL_iIs more than 0 and T _ Cueert-T _ KS _ JL_j(> 0), said constructing said time loss matrix from said production manufacturing information comprising:

constructing a fifth time loss matrix from the m blanked devices in the X procedure to the loading level in the X +1 procedure and the buffer area without materials in the X +1 procedure according to the production and manufacturing information;

updating the value of n;

and constructing a sixth time loss matrix according to the updated n value.

In a second aspect, there is provided a material scheduling apparatus, the apparatus comprising a memory and a processor, the memory having at least one program instruction stored therein, the processor implementing the method according to the first aspect by loading and executing the at least one program instruction.

In a third aspect, there is provided a computer storage medium having stored therein at least one program instruction which is loaded and executed by a processor to implement the method of the first aspect.

Acquiring production configuration information of a production workshop, and acquiring production manufacturing information according to the production configuration information at the initial moment of a sampling period; constructing a time loss matrix according to the production and manufacturing information; each row of the time loss matrix corresponds to a device which has been fed or called, each column corresponds to a device which can be fed or taken, and the value of the matrix represents the time loss; solving the time loss matrix; scheduling the materials according to the solving result of the time loss matrix; the problem that an existing scheduling scheme is possibly inaccurate is solved, real-time scheduling is carried out according to production and manufacturing information of a production workshop, and the material scheduling accuracy is improved.

The foregoing description is only an overview of the technical solutions of the present invention, and in order to make the technical solutions of the present invention more clearly understood and to implement them in accordance with the contents of the description, the following detailed description is given with reference to the preferred embodiments of the present invention and the accompanying drawings.

Drawings

FIG. 1 is a schematic illustration of a workflow of a streamlined production plant provided by an embodiment of the present invention;

fig. 2 is a schematic diagram of an implementation environment related to a material scheduling method according to an embodiment of the present invention;

fig. 3 is a flowchart of a method of scheduling a material according to an embodiment of the present invention.

Detailed Description

The technical solutions of the present invention will be described clearly and completely with reference to the accompanying drawings, and it should be understood that the described embodiments are some, but not all embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

In the description of the present invention, it should be noted that the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer", etc., indicate orientations or positional relationships based on the orientations or positional relationships shown in the drawings, and are only for convenience of description and simplicity of description, but do not indicate or imply that the device or element being referred to must have a particular orientation, be constructed and operated in a particular orientation, and thus, should not be construed as limiting the present invention. Furthermore, the terms "first," "second," and "third" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.

In the description of the present invention, it should be noted that, unless otherwise explicitly specified or limited, the terms "mounted," "connected," and "connected" are to be construed broadly, e.g., as meaning either a fixed connection, a removable connection, or an integral connection; can be mechanically or electrically connected; they may be connected directly or indirectly through intervening media, or they may be interconnected between two elements. The specific meanings of the above terms in the present invention can be understood in specific cases to those skilled in the art.

In addition, the technical features involved in the different embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.

First, for ease of understanding, a brief description of an application scenario related to the present application will be provided.

For a production workshop with a production process in a pipeline mode, a plurality of parallel devices are used for producing in each process, each device is provided with a buffer area, the capacity of each buffer area is 1, and the materials are produced by sequentially passing through all the processes from the first process. The material is processed on any one piece of equipment in the current process and then passes through the next process. The work flow diagram is shown in figure 1.

In the production process of a production workshop, two production modes are provided, wherein the first mode is 'feeding type' production from front to back, and the second mode is 'material calling type' pulling production from back to front. The feeding means that the equipment in the X procedure has the materials which are processed and need to be sent to the X +1 procedure, the material calling means that the equipment in the X +1 procedure is idle, and a material calling request is sent to the X procedure.

After the production of the X procedure is completed, the material needs to be conveyed to the X +1 procedure, and each device of the X +1 procedure is provided with a buffer area. When the blanking is finished by the equipment in the X procedure, the material is preferentially sent to a feeding port in the X +1 procedure and then sent to a cache region in the X +1 procedure. And for the X +1 procedure, when the equipment calls materials, the materials are preferentially taken from the cache area of the X +1 procedure, and then the materials are taken from the feed opening of the X procedure. The storage time of the materials in the cache area of the X +1 procedure is 900 seconds, and the shorter the remaining storage time of the materials is, the higher the priority of use is.

The method is a complex time-varying process, and how to make a decision in real time under the condition that factory production information changes in real time is to realize real-time optimal matching among a feeding port of an X procedure, a feeding port of an X +1 procedure and an X +1 cache region, so that the time loss in the production process is minimum. Namely: at any given time T _ Cueert, the X procedure has m equipment baiting, which are respectively marked as ZR_iI ∈ (1, m); in the X +1 procedure, n equipment called materials are provided, and are respectively marked as KS_jJ ∈ (1, n), and the buffer area of the X +1 process is recorded as HCW_kK belongs to {1,2,3, …, K }, where K is the total number of buffers; the idle time of each device in the X +1 process is RES _ KS_gAnd G belongs to (1, G), wherein G is the total number of all devices participating in time T _ Cueernt matching in the (X +1) procedure. That is, m devices are required to be found in the loading level of the X +1 process and the free buffer area of the X +1 process to be matched with the X process, and n devices are required to be found in the buffer areas with materials in the X process and the X +1 process to be matched with the X +1 process, so that the m devices and the X +1 process are required to be matched with the X process

And (4) minimizing.

The method of the application is to perform distribution scheduling on the material distribution in the process.

Referring to fig. 2, a schematic diagram of an implementation environment related to a material scheduling method provided in various embodiments of the present application is shown, and as shown in fig. 2, the implementation environment may include: a plant MCS (Material Control System), a plant device and a Material scheduling platform. Wherein:

and the MCS system is used for recording the time when the action occurs. For example, the feeding time and the discharging time of each process, the initial storage time of the material in the buffer area, the processing time of each process, the idle time of each process, and the like, which are not limited in this embodiment.

The equipment of the plant may include AGV (Automated Guided Vehicle) carts for transporting materials for each process.

And the material scheduling platform is in communication connection with the MCS system and the workshop equipment in a wired or wireless mode and is used for scheduling the materials of each process in the assembly line.

Referring to fig. 3, a flowchart of a method of a material scheduling method according to an embodiment of the present application is shown, where the method is used in the material scheduling platform shown in fig. 2, and as shown in fig. 3, the method includes:

step 301, obtaining production configuration information of a production workshop;

the production configuration information includes: the automatic navigation device AGV's that workshop configuration positional information, the process time and the material loading time of the X process, the process time and the material loading time of the X +1 process and the time of depositing in of the material of buffer memory district, 1 is less than or equal to X < N, and N is the maximum value of the process of workshop.

The material scheduling system may obtain the production configuration information from the MCS system of the plant and the equipment of the plant. The contents of the plant configuration information may be as shown in table 1.

TABLE 1

Step 302, obtaining production and manufacturing information according to the production configuration information at the initial time of a sampling period;

the manufacturing information includes: blanking time of the X procedure, material calling time of the X +1 procedure, transportation time from the material of the i-th equipment to the j-th equipment and equipment idle time of the X +1 procedure;

wherein, each time mentioned above is the latest time.

The material dispatching platform can firstly determine to obtain a sampling period. In practical implementation, the determination method for determining the sampling period may include the following two ways:

the first method comprises the following steps: and carrying out simulation test according to a simulation experiment, calculating actual time loss according to different sampling periods, and determining a final sampling period according to each time loss obtained by calculation. For example, the period with the least time loss is selected as the final sampling period.

And the second method comprises the following steps: and determining a sampling period according to the actual production condition in the workshop production process. Specifically, the actual production condition may include a total production amount of the workshop, a total equipment amount num _ of _ demand of the current process, and a startup time t _ of _ running of each equipment_iI ∈ {1,2, …, num _ of _ demand }, the resulting acquisition period is determined as follows:

the manufacturing information shown in table 2 is collected at the start of each sampling period.

TABLE 2

The processing time of each process is fixed, and the feeding time of each process can be obtained in real time in step 301, so that the blanking time of each process can be calculated according to the production and manufacturing information obtained in step 301, for example, the calculation formula of the blanking time of the X process is as follows: t _ ZR _ SL_iThe + T _ X, X +1 process is the same, and will not be described herein.

Step 303, constructing a time loss matrix according to the production and manufacturing information; each row of the time loss matrix corresponds to a device which has been fed or called, each column corresponds to a device which can be fed or taken, and the value of the matrix represents the time loss;

in practical implementation, the steps include:

firstly, determining whether material scheduling is needed or not at any time in a sampling period according to the blanking time of the X procedure and the material calling time of the X +1 procedure;

if T _ Cueernt-T _ ZR _ XL_i< 0, and T _ Cueert-T _ KS _ JL_j<And 0, indicating that no material is discharged in the process X at the current moment, and no material is called in the process X + 1. Namely: and determining that material scheduling is not needed.

If T _ Cueernt-T _ ZR _ XL_i>0, but T _ Cueert-T _ KS _ JL_jIf < 0, the current time is proved, the X procedure has equipment blanking, the X procedure has m equipment blanking, and the equipment blanking is respectively recorded as ZR_iI belongs to {1,2, …, m }, and the X +1 process has no material. Namely: at this moment, m pieces of equipment which are subjected to blanking in the X process are required to be scheduled, and m pieces of equipment are extracted from the feeding level in the X +1 process or the idle buffer area in the X +1 process for matching. And determining that M devices which have been blanked in the X procedure need to be scheduled, wherein M is more than or equal to 1 and less than or equal to M.

If T _ Cueernt-T _ ZR _ XL_i< 0 and T _ Cueernt-T _ KS _ JL_jIf the material is more than 0, the current time is proved that no equipment is used for blanking in the process X, but equipment is called in the process X +1, and n equipment is called in the process X +1 and are respectively marked as KS_jJ ∈ (1, n). Namely: at the moment, N pieces of called material equipment in the X +1 procedure need to be scheduled, N pieces of equipment are extracted from the cache areas with the materials in the X procedure and the X +1 procedure for matching, and N is more than or equal to 1 and less than or equal to N.

If T _ Cueernt-T _ ZR _ XL_iIs more than 0 and T _ Cueert-T _ KS _ JL_jIf the material is more than 0, the current time is proved to have the X procedure blanking and the X +1 procedure material calling. The X procedure has m equipment baiting, respectively marked as ZR_iI belongs to {1,2, …, m }, and n equipment call materials are obtained in the X +1 working procedure and are respectively marked as KS_jJ ∈ (1, n). Namely: at the moment, m pieces of equipment which are blanked in the X procedure and n pieces of called equipment in the X +1 procedure need to be respectively scheduled;

wherein, T _ ZR _ XL_iT _ KS _ JL is the blanking time of the ith equipment in the X procedure_jThe material calling time of the jth equipment in the process X + 1;i belongs to {1,2,3, …, M }, wherein M is the total number of the devices in the Xth process; j is belonged to {1,2,3, …, N }, and N is the total number of the devices in the X +1 th procedure.

Secondly, if the judgment result is that material scheduling is needed, the time loss matrix is constructed according to the production and manufacturing information.

In a first possible embodiment, if T _ Cueert-T _ ZR _ XL_i>0, but T _ Cueert-T _ KS _ JL_jIf < 0, the method comprises the following steps:

(1) acquiring a first time loss matrix of the feeding positions of m pieces of equipment fed in the X procedure to N pieces of equipment in the X +1 procedure;

the first time loss may be demonstrated as Δ T_ij＝α*[T_KS_JL_j-(T_ZR_XL_i+T_YS_ij)]I belongs to {1,2, …, m }, j belongs to {1,2, …, N }, wherein alpha belongs to (0,1) is a priority coefficient, and the material representing the blanking position of the X process is preferentially sent to the loading position of the (X +1) process.

(2) Acquiring a second time loss matrix of m devices which are blanked in the X procedure to h devices in the cache region in the X +1 procedure, wherein h is the number of all idle cache regions at the T _ Cueernt moment;

no material is stored in the buffer area, and the condition T _ Current-T _ HCW _ CR is met_k<0, K belongs to {1,2, …, K }, finding out all buffers which are free at the moment of T _ Current, totaling h stations, and marking as KS_sAnd s belongs to {1,2, …, h }, calculating a second time loss matrix from m pieces of equipment which are blanked in the X process to the equipment in the h buffer areas in the (X +1) process, wherein the calculation formula is as follows: delta T_is＝T_YS_is。

(3) And determining the final time loss matrix according to the first time loss matrix and the second time loss matrix.

A. Merging the first time matrix and the second time matrix to obtain an initial feeding time loss matrix ZK_initial；

B. Taking the initial feeding time loss matrix ZK_initialThe first m columns with the minimum time loss of each row are obtained, and a union U of all the taken columns is obtained;

C. get instituteThe time loss from each row of the initial feeding time loss matrix to all columns in the union U is obtained to obtain the final time loss matrix ZK_final。

In a second possible embodiment, if T _ Cueert-T _ ZR _ XL_i< 0, i ∈ {1,2, …, M } and T _ Cueernt-T _ KS _ JL_j>0, j ∈ {1,2, …, N }, the step includes:

(1) determining a priority coefficient omega for the materials in the cache region of the (X +1) th procedure according to the storage time of the materials;

the storage time of the materials is as follows: t _ Current-T _ HCW _ CR_kK is equal to {1,2, …, K }. The priority coefficient is given according to the fuzzy mathematical theory, and the priority coefficient shown in the table 3 is obtained through membership calculation:

T_Current-T_HCW_CR_k	ω
		(0，180]	0.7
(180,360]	0.6
		(360,540]	0.5
(540,720]	0.3
		(720,900)	0.1
others	Current k number buffer is unavailable

TABLE 3

(2) Acquiring the transportation time T _ YS from the No. q equipment to the No. f equipment_qf(ii) a Wherein Q belongs to (1, Q), F belongs to (1,2,3 …, F); q is the total number of all unlocked called material devices in the process X +1, and F is the total number of all buffer areas storing materials at the current moment;

(3) according to the priority coefficient omega and the transportation time T _ YS_qfCalculating KS_qA third time loss matrix to all buffer areas that are material at the current time;

the third time loss matrix is: delta T_qf＝ω*T_YS_qf。

(4) Obtaining KS_qApparatus ZR to unlocked X sequence_rThe fourth time loss matrix of (1);

r ∈ (1, R), R being the total number of unlocked devices, the fourth time loss matrix calculated is: delta T_qr＝[T_KS_JL_q-(T_ZR_XL_r+T_YS_qr)]。

(5) And calculating the final time loss matrix according to the third time loss matrix and the fourth time loss matrix.

A. Merging the third time loss matrix and the fourth time loss matrix to obtain an initial material calling time loss matrix KZ_initial；

B. Taking the initial material calling time loss matrix KZ_initialAcquiring a union E of all the taken columns of the front Q names with the minimum time loss in each row;

if the number of columns is less than Q, virtual devices are added to form a new column and then complement the new column.

C. Taking the initial material calling time loss matrix KZ_initialAnd (4) time loss from all the rows to all the columns in the union E to obtain a final time loss matrix.

The time loss from each row to the virtual device in the union E, that is, the virtual column, is infinite.

In a third possible embodiment, if T _ Cueert-T _ ZR _ XL_i>0, i ∈ {1,2, …, M } and T _ Cueernt-T _ KS _ JL_j>0, j ∈ {1,2, …, N }, the step includes:

firstly, constructing a fifth time loss matrix of loading positions from m pieces of equipment which are unloaded in the X procedure to the X +1 procedure and a buffer zone without materials in the X +1 procedure according to the production and manufacturing information;

the calculation of the fifth time-loss matrix is similar to the first possible calculation, and is not repeated here.

Secondly, updating the value of n;

after the first step, part of the devices in the X +1 th procedure are locked, and at this time, the locked devices are not available for use. At this time, the value of n is updated, and the updated value of n is n-m.

Thirdly, the time loss matrix is constructed according to the updated value of the n.

If n is 0, go on to step 304; if n >0, time loss matrices from the device which called and is not locked in the step X +1 to the device which is not locked in the step X and the device in the buffer area with material in the step X +1 are calculated, and at this time, the calculation of the time loss matrices is similar to that in the second possible embodiment, and will not be described again here.

That is to say, in a third possible implementation manner, a time loss matrix of loading positions from m pieces of equipment which are subjected to blanking in the X process to the X +1 process and a buffer position without material in the X +1 process is calculated first, at this time, the calculation manner is the same as that of the first possible calculation manner, an algorithm is called to solve the time loss matrix after the calculation is completed, and the equipment of the corresponding X process and the equipment of the X +1 process are locked according to the solution result; then, the locked devices are removed from the device for calling the material in the X +1 process, and the devices that are not locked and have called the material are matched, at this time, the time loss matrix from the device for calling the material in the X +1 process and not locked to the device for not locked in the X process and the device for having the material in the cache region in the X +1 process needs to be calculated, and the specific calculation mode is the same as the second possible calculation mode, and is not described herein again.

Step 304, solving the time loss matrix;

in practical implementation, the time loss matrix calculated in step 303 may be solved according to a genetic algorithm. Specifically, the method comprises the following steps:

t1: initialization: initializing population size num, iteration times iteration and cross probability P_cProbability of mutation P_m。

T2: and (3) encoding: constructing two-dimensional matrix code according to the size of the time loss matrix, wherein the size of the code matrix is the same as that of the time loss matrix, and the matrix value is X_ijE {0,1}, wherein 0 represents that no material transportation is generated between the equipment No. i and the equipment No. j; 1 represents that material transportation is generated between the equipment I and the equipment J; each row and each column of each chromosome have only one 1, and the values of all the other positions are 0; according to this rule, num chromosomes are initialized to form an initial population pop.

T3: calculating a fitness value: taking the fitness function as:

d is the row number of the two-dimensional matrix code, and l is the column number of the two-dimensional matrix code. Recording the minimum fitness value in the current population, comparing the minimum fitness value with the minimum fitness value in the previous round, wherein the initial fitness value is 100000 as large as f_min。

T4: stopping conditions are as follows: if the iteration number reaches iteration and the fitness f of the iteration number is the second_iteration≤f_minThe iteration is stopped. Decoding the solution result, outputting the optimal individual, otherwise, turning to T5.

T5: selecting: selecting two individuals to perform genetic operation according to the survival probability of the individuals by adopting a roulette mode to form a new individual, and storing the new individual into a new _ pop group, wherein the survival probability of the individual is

f_iNum is the total number of individuals in the population, for the fitness value of each individual.

T6: genetic operation: crossing and mutation, setting the crossing probability P_cGenerating a pseudo-random number P of (0,1) if P ≧ P_cThe two chromosomes are crossed, the cross points are randomly selected, and the crossing has two modes, namely local crossing in a line where the cross points are located, and integral crossing after the line where the cross points are located. The mutation is in the form of a partial gene mutation, resulting in a pseudo-random number q of (0,1) if q.gtoreq.P_mAnd (3) generating variation, randomly selecting variation points, and mutating 1 of the row where the variation points are located to be 0.

T7: repairing: and repairing illegal solutions generated in the crossing process. Both crossing and mutation may cause the situation that a row or column has more than one 1, if a row or column has more than one 1, the 1 with larger time loss of the material is shifted to the row or column without 1, and the original 1 is set to 0.

T8: if the number of the new _ pop of the new population reaches num, replacing pop with the new _ pop, and returning to T3;

and 305, scheduling the material according to the solving result of the time loss matrix.

And after the material scheduling platform calculates and obtains a solving result, scheduling the material according to the solving result. And during actual implementation, material scheduling is carried out according to the position of the AGV trolley and the solving result. Specifically, decoding the solution result, sending the decoding result to an MCS (modulation and coding scheme) system, locking the blanked equipment in the X process and the selected equipment participating in matching in the X +1 process by the MCS system according to the decoding result, updating the total number n of the equipment called in the X +1 process, and driving the AGV to implement scheduling if the n of the equipment called in the X +1 process is 0; otherwise, go to step 303.

In summary, by acquiring the production configuration information of the production workshop, the production manufacturing information is acquired according to the production configuration information at the beginning of the sampling period; constructing a time loss matrix according to the production and manufacturing information; each row of the time loss matrix corresponds to a device which has been fed or called, each column corresponds to a device which can be fed or taken, and the value of the matrix represents the time loss; solving the time loss matrix; scheduling the materials according to the solving result of the time loss matrix; the problem that an existing scheduling scheme is possibly inaccurate is solved, real-time scheduling is carried out according to production and manufacturing information of a production workshop, and the material scheduling accuracy is improved.

The equipment information of the production workshop is in dynamic change all the time, and the quantity of the equipment for calling and blanking is arbitrary at any time, so that the method and the device realize the real-time establishment of the workshop time loss matrix at any time, the construction process has robustness, and the scheduling accuracy is improved.

In addition, the time loss matrix is solved through the genetic algorithm, the time required by matrix solving is shortened, and the real-time performance of material scheduling is guaranteed.

This application realizes real-time output scheduling scheme, makes the idle time of equipment reach the minimum to improve equipment's rate of utilization, and reduced the circulation number of times of material, saved a large amount of transit time, can increase substantially production efficiency.

According to the storage time of the materials in the cache region, different priority coefficients are given to the materials in the cache region through membership degree analysis according to a fuzzy mathematical theory, and under the condition that other conditions are the same, the materials stored firstly are used firstly, and then the materials stored are used later.

The application also provides a material scheduling device, which comprises a memory and a processor, wherein at least one program instruction is stored in the memory, and the processor loads and executes the at least one program instruction to realize the method.

The present application also provides a computer storage medium having stored therein at least one program instruction, which is loaded and executed by a processor to implement the method as described above.

The technical features of the embodiments described above may be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the embodiments described above are not described, but should be considered as being within the scope of the present specification as long as there is no contradiction between the combinations of the technical features.

The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims

1. A method for scheduling materials, the method comprising:

acquiring production manufacturing information according to the production configuration information at the initial time of a sampling period; the manufacturing information includes: blanking time of the X procedure, material calling time of the X +1 procedure, transportation time from the material of the i-th equipment to the j-th equipment and equipment idle time of the X +1 procedure, wherein i and j are positive integers;

solving the time loss matrix;

2. The method of claim 1, wherein said constructing a time loss matrix from said production manufacturing information comprises:

3. The method according to claim 2, wherein the determining whether the material scheduling is required according to the blanking time of the X-th procedure and the blanking time of the X + 1-th procedure at any time in the sampling period comprises:

if T _ Cueernt-T _ ZR _ XL_i< 0, and T _ Cueert-T _ KS _ JL_j<0, determining that material scheduling is not needed;

if T _ Cueernt-T _ ZR _ XL_i< 0, and T _ Cueert-T _ KS _ JL_jIf the number is more than 0, determining that N devices called in the X +1 procedure need to be scheduled, wherein N is more than or equal to 1 and less than or equal to N;

wherein T _ Cueert is the current time, and T _ ZR _ XL_iT _ KS _ JL is the blanking time of the device No. i in the X procedure_jThe material calling time of the j device in the X +1 procedure is the material calling time; i belongs to {1,2,3, …, M }, wherein M is the total number of the devices in the Xth process; j is belonged to {1,2,3, …, N }, and N is the total number of the devices in the X +1 th procedure.

4. The method of claim 3Characterised in that if T _ Cueernt-T _ ZR _ XL_i>0, but T _ Cueert-T _ KS _ JL_j< 0, said constructing said time loss matrix based on said manufacturing information, comprising:

5. The method of claim 4, wherein determining the final time loss matrix from the first time loss matrix and the second time loss matrix comprises:

6. Method according to claim 3, characterized in that if T _ Cueernt-T _ ZR _ XL_i< 0 and T _ Cueernt-T _ KS _ JL_j(> 0), said constructing said time loss matrix from said production manufacturing information comprising:

acquiring transportation time T _ YS from No. q device to No. f device_qf(ii) a Wherein Q belongs to (1, Q), F belongs to (1,2,3 …, F); q is the sum of all unlocked in the X +1 processMaterial calling equipment KS_qF is the total number of all the buffer areas in which the materials are stored at the current moment;

7. The method of claim 6, wherein computing the final time loss matrix from the third time loss matrix and the fourth time loss matrix comprises:

taking the front Q-name column with the minimum time loss in each row in the initial material calling time loss matrix, and obtaining a union set of all the taken columns;

8. Method according to claim 3, characterized in that if T _ Cueernt-T _ ZR _ XL_iIs more than 0 and T _ Cueert-T _ KS _ JL_j(> 0), said constructing said time loss matrix from said production manufacturing information comprising:

updating the value of n;

and constructing a sixth time loss matrix according to the updated n value.

9. A material scheduling apparatus comprising a memory and a processor, wherein the memory has at least one program instruction stored therein, and the processor is configured to load and execute the at least one program instruction to implement the method of any one of claims 1 to 8.

10. A computer storage medium having stored therein at least one program instruction which is loaded and executed by a processor to implement the method of any one of claims 1 to 8.