CN110209133A - With the single machine production dispatching method and system for deteriorating maintenance duration - Google Patents
With the single machine production dispatching method and system for deteriorating maintenance duration Download PDFInfo
- Publication number
- CN110209133A CN110209133A CN201910492439.3A CN201910492439A CN110209133A CN 110209133 A CN110209133 A CN 110209133A CN 201910492439 A CN201910492439 A CN 201910492439A CN 110209133 A CN110209133 A CN 110209133A
- Authority
- CN
- China
- Prior art keywords
- individual
- probability
- data base
- duration
- harmony data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B19/00—Programme-control systems
- G05B19/02—Programme-control systems electric
- G05B19/418—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS], computer integrated manufacturing [CIM]
- G05B19/41865—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS], computer integrated manufacturing [CIM] characterised by job scheduling, process planning, material flow
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B2219/00—Program-control systems
- G05B2219/30—Nc systems
- G05B2219/32—Operator till task planning
- G05B2219/32252—Scheduling production, machining, job shop
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/02—Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]
Abstract
The present invention provides the single machine production dispatching method and system of a kind of band deterioration maintenance duration, this method comprises: the parameter of S110, setting harmonic search algorithm；The initial harmony data base of S120, building；S130, the individual similarity for calculating current harmony data base, adaptive and sound memory retain probability and adaptive pitch adjusts probability；S140, a new individual is generated；S150, current harmony data base is updated；S160, judge whether current the number of iterations reaches the maximum number of iterations: if so, regarding the maximum individual of fitness value in current harmony data base as optimal solution and exporting；Otherwise, it enables the number of iterations add 1, and returns to S130.Fitness value maximum safeguards the sum of duration minimum in the application, to solve the problems, such as to make to safeguard that the sum of duration is minimum during Single Machine Scheduling.
Description
Technical field
This application involves single machine production dispatching technique fields, and in particular to a kind of band deteriorates the single machine production tune of maintenance duration
Spend method and system.
Background technique
The optimization problem of Single Machine Scheduling with linear deterioration maintenance time is in the production for be prevalent in manufacturing enterprise,
Such as aluminum profile processing, plastic products processing, integrated circuit board production.The mistake of n workpiece is specifically processed on one device
Journey, equipment generally require to safeguard to guarantee the normal process to subsequent workpiece after lasting processing a period of time.As shown in Figure 1,
The maintenance of equipment has a time window [x1, x2], equipment is in continuous work x1It is to be typically without to safeguard before, in continuous work
X2It must be safeguarded before.Equipment is unable to workpieces processing in maintenance, and processing of any one workpiece in equipment is to connect
Continuous, and the processing duration of any one workpiece can be determined in advance, the processing duration of any one workpiece is no more than equipment
The limit time x of continuous work2.So-called linear deterioration maintenance duration refers to maintenance duration with the Continuous maching duration of equipment
Linear increase.Every time after maintenance, it is 0 that the stream time of equipment, which retracts,.A length of processing duration when the total activation of one equipment
The sum of summation with maintenance the sum of duration, i.e. manufacture span (be meant that at the time of processed since unit one to last one
A workpiece at the time of completing the process between duration).Wherein, the sum of duration is processed as the processing of all workpiece in this equipment
The sum of duration, the sum of maintenance duration are the sum of each maintenance duration in this equipment.That is, within a dispatching cycle,
It may need to carry out multiple plant maintenance.Due to the sum of the processing duration of all workpiece in an equipment be it is determining, to make
The total activation duration of one equipment is minimum, then needs to make to safeguard the sum of duration minimum, therefore make to safeguard during Single Machine Scheduling
The sum of duration minimum is problem to be solved.
Summary of the invention
(1) the technical issues of solving
In view of the deficiencies of the prior art, this application provides a kind of band deteriorate maintenance duration single machine production dispatching method and
System.
(2) technical solution
In a first aspect, the application provides a kind of single machine production dispatching method of band deterioration maintenance duration, comprising:
S110, the parameter that harmonic search algorithm is arranged, the parameter includes the quantity of the preservable individual of harmony data base
M, and sound memory retains the max-thresholds of probability and sound memory retains the minimum threshold of probability, tone adjusts the maximum threshold of probability
Value, tone adjust the minimum threshold and maximum number of iterations of probability；
S120, initial harmony data base is constructed, includes m individual in the harmony data base, each individual includes
Primary vector and secondary vector, the primary vector indicate processing sequence of each workpiece in equipment, and secondary vector indicates institute
State the maintenance point of equipment；The generating process of each individual includes: the primary vector for generating the individual at random, and according to default rule
Then generate the secondary vector of the individual；
S130, the individual similarity for calculating current harmony data base；Retained according to the individual similarity and sound memory
The max-thresholds of probability and the minimum threshold for retaining probability with sound memory calculate the adaptive harmony note of current harmony data base
Recall reservation probability；The max-thresholds of probability and the minimum threshold of tone adjusting probability are adjusted according to the individual similarity, tone,
The adaptive pitch for calculating current harmony data base adjusts probability；
S140, retain probability and adaptive pitch adjusting probability according to the adaptive and sound memory, generate one
New individual；
S150, current harmony data base is updated according to the new individual；
S160, judge whether current the number of iterations reaches the maximum number of iterations:
If so, the maximum individual of fitness value in current harmony data base as optimal solution and is exported；One by one
The fitness value of body is the inverse of total maintenance duration of the individual within a dispatching cycle；
Otherwise, it enables the number of iterations add 1, and returns to S130.
Second aspect, the application provide a kind of single machine production scheduling system of band deterioration maintenance duration, comprising:
Parameter setting module, the parameter for executing S110, harmonic search algorithm being arranged, the parameter include and sound memory
The quantity m and sound memory of the preservable individual in library retain probability max-thresholds and sound memory retain probability minimum threshold,
Tone adjusts the max-thresholds of probability, tone adjusts the minimum threshold and maximum number of iterations of probability；
Data base constructs module, for executing S120, constructing initial harmony data base, includes in the harmony data base
M individual, each individual include primary vector and secondary vector, and the primary vector indicates each workpiece adding in equipment
Work sequence, secondary vector indicate the maintenance point of the equipment；The generating process of each individual includes: to generate the individual at random
Primary vector, and generate according to preset rules the secondary vector of the individual；
Probability evaluation entity, the individual similarity for executing S130, calculating current harmony data base；According to described
Body similarity and sound memory retain the max-thresholds of probability and retain the minimum threshold of probability with sound memory, calculate current sum
The adaptive and sound memory in sound memory library retains probability；According to the individual similarity, tone adjust probability max-thresholds and
Tone adjusts the minimum threshold of probability, and the adaptive pitch for calculating current harmony data base adjusts probability；
New individual generation module, for executing S140, retaining probability according to described adaptive and sound memory and described adaptive
It answers tone to adjust probability, generates a new individual；
Data base update module, for executing S150, being updated according to the new individual to current harmony data base；
Iteration judgment module, for executing S160, judging whether current the number of iterations reaches the maximum number of iterations:
If so, the smallest individual of fitness value in current harmony data base as optimal solution and is exported；The adaptation of an individual
Angle value is the inverse of total maintenance duration of the individual within a dispatching cycle；Otherwise, the number of iterations is enabled to add 1, and described in return
S130 is executed in probability evaluation entity.
The third aspect, the application provide a kind of computer equipment, including memory, processor and storage are on a memory simultaneously
The computer program that can be run on a processor, the processor realize what first aspect provided when executing the computer program
The step of method.
Fourth aspect, the application provide a kind of computer readable storage medium, and computer readable storage medium stores thereon
The step of having computer program, the method that first aspect provides is realized when the computer program is executed by processor.
(3) beneficial effect
The embodiment of the invention provides single machine production dispatching methods and system that a kind of band deteriorates maintenance duration, generate initial
Harmony data base, calculate its individual similarity, so according to individual similarity calculation adaptively and sound memory retain probability with
Adaptive pitch adjust probability, and then based on the two probability generate a new individual, and using the new individual to and sound memory
Library is updated, and after updating repeatedly to harmony data base, choosing the maximum individual of fitness value therein and being used as most has solution,
Fitness value maximum safeguards the sum of duration minimum, to solve to make the sum of maintenance duration is the smallest to ask during Single Machine Scheduling
Topic.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
It obtains other drawings based on these drawings.
Fig. 1 is a kind of relation schematic diagram between the linear deterioration maintenance duration of equipment and equipment Continuous maching duration；
Fig. 2 is the flow diagram with the single machine production dispatching method for deteriorating maintenance duration in the embodiment of the present application；
Fig. 3 is the arrangement of time schematic diagram of a dispatching cycle in the embodiment of the present application；
Time relationship schematic diagram when Fig. 4 a~Fig. 4 c is a=0 in the embodiment of the present application；
Time relationship schematic diagram when Fig. 5 a and Fig. 5 b are a in the embodiment of the present application < 0；
Time relationship schematic diagram when Fig. 6 is a in the embodiment of the present application > 0；
Fig. 7 is the structural block diagram with the single machine production scheduling system for deteriorating maintenance duration in the embodiment of the present application；
Fig. 8 is the structural block diagram of computer equipment in the embodiment of the present application.
Specific embodiment
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art
Every other embodiment obtained without creative efforts, shall fall within the protection scope of the present invention.
In a first aspect, the application provides a kind of single machine production dispatching method of band deterioration maintenance duration, as shown in Fig. 2, should
Method includes:
S110, the parameter that harmonic search algorithm is arranged, the parameter includes the quantity of the preservable individual of harmony data base
M, and sound memory retain probability max-thresholds HMCRmaxAnd sound memory retains the minimum threshold HMCR of probabilitymin, tone adjust
The max-thresholds PAR of probabilitymax, tone adjust probability minimum threshold PARminWith maximum number of iterations C；
It will be appreciated that quantity m is maximum quantity individual in harmony data base.
S120, initial harmony data base is constructed, includes m individual in the harmony data base, each individual includes
Primary vector and secondary vector, the primary vector indicate processing sequence of each workpiece in equipment, and secondary vector indicates institute
State the maintenance point of equipment；The generating process of each individual includes: the primary vector for generating the individual at random, and according to default rule
Then generate the secondary vector of the individual；
It will be appreciated that m individual represents m solution.
It will be appreciated that each individual includes two parts, a part is primary vector Γ, and another part is secondary vector
Φ, primary vector Γ indicate processing sequence of each workpiece in equipment, i.e. Γ indicates workpiece with the fully intermeshing that workpiece is numbered
Processing sequence.The primary vector Γ of i-th of individualiIt can be expressed as Γi=(γ1, γ2... γi..., γn), wherein workpiece is compiled
Number γi∈ { 1,2,3 ... ..., n }, n are the quantity of workpiece.Secondary vector indicates the maintenance point of the equipment, can specifically use
Binary coding representation maintenance point, the secondary vector Φ of i-th of individuali=(μ1, μ2... μi..., μn), μi∈ { 0,1 }, if μi=
1, it indicates in workpiece γiPlant maintenance is carried out immediately after processing is completed, if μi=0, it indicates in workpiece γiContinue after processing is completed
Process next workpiece.
For example, an individual indicates are as follows:
The primary vector Γ of the individual=(Isosorbide-5-Nitrae, 3,5,2) is indicated according to workpiece 1, workpiece 4, workpiece 3, workpiece 5 and workpiece
2 sequence is processed；Secondary vector Φ=(0,0,1,0,1) means that plant maintenance point is separately positioned on workpiece 3 and workpiece 2
After processing is completed.
In some embodiments, if the preset rules may include: a=0, in [x1, x2] on any point set
Standby maintenance, corresponding maintenance duration are identical；Can also include: the preset rules further include: if a < 0, maintenance point closer to
x1, corresponding maintenance duration is shorter；If can also include: a > 0, maintenance point be closer to x2, corresponding maintenance duration is shorter.Its
In, it is preset constant that the calculation formula of linear deterioration maintenance duration, which is y=a+bx, a and b, and x is located at [x1, x2] in range, x is
The Continuous maching duration of the equipment, y are the maintenance duration after Continuous maching duration x.
The setting principle of above-mentioned preset rules is illustrated below:
Such as Fig. 3, if nwFor total maintenance times in a dispatching cycle, S is a dispatching cycle, and the sum of processing duration is
S1, the sum of maintenance duration is S2.If each Continuous maching duration immediately begins to safeguard after reaching x ', x ' ∈ [x1, x2]。
Safeguard the time once needed are as follows: y '=a+bx ' (1)
The duration of dispatching cycle are as follows: S=nw×(x′+y′) (2)
Total maintenance times are as follows: nw=S1/x′ (3)
(1) and (3) formula are substituted into (2) formula to obtain: (S1/ x ') × (x '+a+bx ')=S1+S2 (4)
It carries out abbreviation to above-mentioned (4) formula to obtain: S2=S1b+S1a/x′ (5)
Since a is the constant being arranged in advance, for different a, the calculated result of above-mentioned (5) formula can be different, below for
Different a are illustrated respectively:
1, as a=0, above-mentioned (5) formula becomes: S2=S1b
Obviously, the sum of duration S is safeguarded2It is unrelated with x ', and be constant S1B, so in [x1, x2] on any one moment into
Row plant maintenance, the sum of maintenance duration S2It is all most short.
2, as a < 0, above-mentioned (5) formula becomes: S2=S1b-|S1a/x′|
Obviously, x ' is smaller, the sum of maintenance duration S2With regard to smaller.Due to x ' ∈ [x1, x2], and a, b and S1It is constant, institute
X is taken with x '1When, S2It is minimum.So when safeguard all be located at x every time1Point can make maintenance duration of the equipment within a dispatching cycle it
And minimum.
3, as a > 0, above-mentioned (5) formula is variable are as follows: S2=S1b+|S1a/x′|
Obviously, x ' is bigger, the sum of maintenance duration S2With regard to smaller.Due to x ' ∈ [x1, x2], and a, b and S1It is constant, institute
X is taken with x '2When, S2It is minimum.So when safeguard all be located at x every time2Point can make maintenance duration of the equipment within a dispatching cycle it
And minimum.
Based on above-mentioned preset rules, the process for generating the secondary vector of the individual can also be divided into three kinds of situations:
1, as a=0, the process for generating the secondary vector of an individual be may include steps of:
S121, determination [x1, x2] relationship with the processing time duration of workpiece:
It will be appreciated that relationship here refers to preset condition mentioned below.
(1) if meeting the first preset condition, in [x1, x2] dimension is arranged in the either work in range after processing is completed
Shield point；First preset condition are as follows:
andandand
Time relationship shown in above-mentioned first preset condition, that is, Fig. 4 a, due to a=0, in [x1, x2] range set
Standby maintenance, safeguards the sum of duration all within a dispatching cycle.And in [x1, x2] range completes the processing of multiple workpiece,
Therefore plant maintenance can be carried out after any work pieces process is completed wherein.It in practice, can be according to the inclined of operator
It is good to determine, it maintenance times reduced for preference, may be provided at close to x2Workpiece γk+mAfter the completion；Preference is reduced every
Secondary maintenance duration, it may be provided at close to x1Workpiece γkAfter the completion.For example, being arranged maintenance point in workpiece γkAfter the completion, i.e.,
Take μ1=μ2=...=μk-1=0, μk=1.
(2) if meeting the second preset condition, one maintenance point of setting after the completion of k-th of work pieces process, described second
Preset condition are as follows:
andand
Time relationship shown by above-mentioned second preset condition, that is, Fig. 4 b, due to a=0, in [x1, x2] range progress
Plant maintenance safeguards the sum of duration all within a dispatching cycle, however in [x1, x2] range, only workpiece γkIt completes
Processing, therefore a maintenance point, i.e. μ are set after the completion of k-th of work pieces process1=μ2=...=μk-1=0, μk=1.
(3) if meeting third preset condition, a maintenance point, the third are set after the completion of k-th of work pieces process
Preset condition are as follows:
and
Time relationship shown in above-mentioned third preset relation, that is, Fig. 4 c, due to a=0, in [x1, x2] range set
Standby maintenance, safeguards the sum of duration all within a dispatching cycle, however in [x1, x2] range, it completes to process without workpiece,
Maintenance point cannot be later than x again2, therefore maintenance point can only be arranged closest to x1Workpiece γkAfter completing processing, i.e. μ1=μ2
=...=μk-1=0, μk=1.
Wherein,For the processing duration of i-th of workpiece, k+g+1 is less than or equal in the equipment need the workpiece sum of processing
N, k and g are the integer more than or equal to 1；For the processing time duration from the 1st workpiece to -1 workpiece of kth.
S122, judge whether all workpiece of the equipment complete the process:
If so, determining the secondary vector of the individual according to the setting position of each maintenance point；
Otherwise, the Continuous maching duration of the equipment is zeroed, and by the processing sequence of the workpiece after the maintenance point
Number resetting, and return step S121.
It will be appreciated that the processing sequence of the workpiece after the maintenance point is numbered resetting, i.e., by the after maintenance
The processing sequence number of one workpiece is set to 1, the processing sequence number of second workpiece after maintenance is set to 2 ...,
That is using the unit one after maintenance as the unit one for finding next maintenance point, after safeguarding second
A workpiece is as second workpiece ... for finding next maintenance point.
If not processing there are also workpiece, return step S121, the maintenance point of remaining unprocessed workpiece is found, until all
Work pieces process complete, can determine all maintenance points in this way, and then determine secondary vector.
2, as a < 0, the process for generating the secondary vector of an individual be may include steps of:
S123, determination [x1, x2] relationship with the processing time duration of workpiece:
(1) if meeting the 4th preset condition, one maintenance point of setting after the completion of k-th of work pieces process, the described 4th
Preset condition are as follows:
and
Time relationship shown in above-mentioned four preset conditions, that is, Fig. 5 a, due to a < 0, equipment is in x1It puts and safeguard most preferably,
But the process of a workpiece cannot interrupt, therefore can be by x1On the right side of point and near x1The workpiece completion point conduct of point
A maintenance point will be arranged in one maintenance point after the completion of k-th of work pieces process.That is: μ1=μ2=...=μk-1=0, μk
=1.
(2) if meeting the 5th preset condition, one maintenance point of setting after the completion of k-th of work pieces process, the described 5th
Preset condition are as follows:
and
Above-mentioned 5th preset condition be Figure 5b shows that time relationship, due to a < 0, equipment is in x1It puts and safeguard most preferably,
But as shown in Figure 5 b, in [x1, x2] maintenance point that not can be set, maintenance cannot be later than x again2, therefore maintenance point is set
It sets in x1Left side and closest to x1Point, that is, be arranged after the completion of k-th of work pieces process, it may be assumed that
μ1=μ2=...=μk-1=0, μk=1.
S124, judge whether all workpiece of the equipment complete the process:
If so, determining the secondary vector of the individual according to the setting position of each maintenance point；
Otherwise, the Continuous maching duration of the equipment is zeroed, and by the processing sequence of the workpiece after the maintenance point
Number resetting, and return step S123.
3, as a > 0, the process for generating the secondary vector of an individual be may include steps of:
S125, determination [x1, x2] relationship with the processing time duration of workpiece:
If meeting the 6th preset condition, a maintenance point is set after the completion of k-th of work pieces process, the described 6th is default
Condition are as follows:
and
Above-mentioned 6th preset condition is time relationship illustrated in fig. 6, due to a > 0, in x2Point carries out maintenance
It is optimal, and maintenance point cannot be later than x2, therefore maintenance point is arranged in x2Workpiece completion point before point, it may be assumed that
μ1=μ2=...=μk-1=0, μk=1.
S126, judge whether all workpiece of the equipment complete the process:
If so, determining the secondary vector of the individual according to the setting position of each maintenance point；
Otherwise, the Continuous maching duration of the equipment is zeroed, and by the processing sequence of the workpiece after the maintenance point
Number resetting, and return step S125.
It will be appreciated that finding the maintenance of remaining unprocessed workpiece if not processing there are also workpiece, return step S125
Point can determine all maintenance points, and then determine secondary vector until all work pieces process are completed in this way.
It will be appreciated that the heuristic rule that above-mentioned preset rules are arranged for foundation single machine production scheduling problem, the rule
It can then make the secondary vector generated more reasonable on the basis of shortening dispatching cycle, so that the individual made has well
Performance.
S130, the individual similarity for calculating current harmony data base；Retained according to the individual similarity and sound memory
The max-thresholds of probability and the minimum threshold for retaining probability with sound memory calculate the adaptive harmony note of current harmony data base
Recall reservation probability；The max-thresholds of probability and the minimum threshold of tone adjusting probability are adjusted according to the individual similarity, tone,
The adaptive pitch for calculating current harmony data base adjusts probability；
The diversity solved in current harmony data base can be measured with individual phase recency D, and the application is a by measuring
The phase recency D of the primary vector Γ of body evaluates the diversity of individuals in harmony data base.When individual more in harmony data base
When sample is deteriorated, Xiang Jindu D is with regard to larger；And when diversity individual in harmony data base improves, Xiang Jindu D is just smaller.
For example, there is m individual in current harmony data base, by the set of the jth position genic value of this m individual
It is denoted as Πj, i.e. ΠjFor the set of the jth position genic value of first vector of m individual in current harmony data base；CijTable
Show the jth position genic value in the primary vector of i-th of individual in ΠjThe number of middle appearance；It needs to process in the n equipment
The sum of workpiece.The phase recency of the jth position gene of so this m individual are as follows:
In turn, the phase recency of this m individual are as follows:
Wherein, n is the digit of gene in the quantity and an individual of workpiece, which can be known as to the first formula,
Therefore the individual similarity of current harmony data base can be calculated using the first formula.
In practical application, it has been proposed that being measured using the difference of ideal adaptation angle value individual more in harmony data base
Sample, but the error that this method generates is very big, and because of the individual that ideal adaptation angle value is equal, gene may not be consistent, individual
Difference sometimes also can be larger.And individual similarity is determined using the similarity of primary vector here, from work pieces process sequence
Similarity measure individual similarity, be solid using the secondary vector that preset rules determine since work pieces process sequence is fixed
Fixed, therefore individual is fixed, therefore the accuracy for measuring diversity of individuals can be improved using the similarity of primary vector,
Reduce error.
In practical applications, described adaptive and sound memory reservation probability can be calculated using the second formula, described second
Formula includes:
In formula, HMCR is that the adaptive and sound memory retains probability, HMCRmaxFor the maximum for retaining probability with sound memory
Threshold value, HMCRminFor the minimum threshold for retaining probability with sound memory.
In practical applications, the adaptive pitch can be calculated using third formula and adjusts probability, the third formula
Include:
In formula, PAR is that the adaptive pitch adjusts probability, PARmaxThe max-thresholds of probability, PAR are adjusted for tonemin
The minimum threshold of probability is adjusted for tone.
Here probability and tone adjusting probability are retained with sound memory using adaptive, rather than fixed harmony is used to remember
Recall and retain probability and tone adjusting probability, avoids fixed retaining with sound memory and lacked brought by probability and tone adjusting probability
Point, for example, retaining disadvantage brought by probability and tone adjusting probability with sound memory according to fixed, when in harmony data base
Diversity of individuals it is preferable when search speed it is slower, and local optimum is easily fallen into when individual reaches unanimity.And the application base
Diversity of individuals in harmony data base is measured in individual phase recency, dynamically calculates accordingly and sound memory retains probability and tone
Adjust probability.When phase recency individual in harmony data base is smaller, illustrate that the diversity of individual is good, automatically increases harmony note
Recall reservation probability, reduction tone adjusts probability and accelerates the search speed of algorithm to protect the defect individual in harmony data base.
When phase recency individual in harmony data base is larger, illustrate that the diversity of individual is poor, automatically reduces and sound memory retains generally
Rate, increase tone adjust probability and avoid algorithm from falling into local optimum to increase diversity individual in harmony data base.
S140, retain probability and adaptive pitch adjusting probability according to the adaptive and sound memory, generate one
New individual；
In practical applications, step S140 can be specifically included:
S141, the initial value that i is arranged are 1, and construct corresponding set Xi, the set XiIn include that current harmony is remembered
Recall in library i-th bit genic value in the primary vector of all individuals；
For example, a primary vector is (5,3, Isosorbide-5-Nitrae, 2), if i is 1, i-th bit genic value is 5；If i=5, i-th bit
Genic value is 2.
S142, in the set XiThe i-th bit gene of primary vector of one value of middle random selection as the new individual
Value；
For example, the primary vector of new individual is denoted as Γnew, ΓnewI-th bit genic value be denoted asHere using with
The mode of machine selection determinesΓ is determined below by step S143newI+1 position genic value.
S143, the first random number ξ is generated, judges whether the first random number ξ is less than the adaptive and sound memory and protects
Stay probability HMCR:
If so, generate random integers j of the value in [1, m] range, in j-th of individual of current harmony data base
Position h where i-th bit genic value described in primary vector, if in current harmony data base in the primary vector of j-th of individual
H+1 genic values occurred in preceding i genic value not in the primary vector of the new individual, then by the h+1 bases
Because being worth the i+1 position genic value of the primary vector as the new individual；If the first of j-th of individual in current harmony data base
H+1 genic values in vector occurred in preceding i genic values of the primary vector of the new individual, and current harmony is remembered
Recall in library in the primary vector of j-th of individual near near position h and the preceding i genic value not in the primary vector of the new individual
The i+1 position genic value of primary vector of the middle value occurred as the new individual；
Otherwise, do not occur in preceding i genic values of primary vector of the random selection one in the new individual in [1, n]
I+1 position genic value of the integer crossed as the primary vector of the new individual；N is the workpiece for needing to process in the equipment
Number；
It will be appreciated that when the first random number ξ is less than HMCR, and though in current harmony data base j-th individual the
Whether h+1 genic values occurred in preceding i genic value in the primary vector of the new individual in one vector, new individual
The i+1 position genic value of primary vector was occurred in preceding i genic value not in the primary vector of the new individual.?
When one random number ξ is greater than or equal to HMCR, the i+1 position genic value of the primary vector of new individual is not also the of the new individual
Occurred in preceding i genic value in one vector.That is, no matter in which way determine new individual primary vector i-th+
1 genic value, the value all occurred in preceding i genic value not in the primary vector of new individual, can guarantee new individual in this way
It falls in feasible zone.
The new individual that traditional harmonic search algorithm generates may not be in the feasible zone of solution.For example, there is 4 workpiece needs
It is processed on equipment A, the new individual obtained using traditional harmonic search algorithm are as follows:
As it can be seen that No. 3 workpiece will be processed 2 times, and the processing of No. 2 workpiece is missed, and is unsatisfactory for production scheduling
Constraint condition, which is infeasible, therefore is not fallen in feasible zone, and the application to the generation process of new individual into
Improvement is gone, the i+1 position genic value of the primary vector of new individual must be the preceding i base in the primary vector of the new individual
Because of the value not occurred in value, it thus is avoided that the case where workpiece 3 is processed twice, ensure that the new individual of generation all falls within solution
In feasible zone.
S144, it enables i add 1, and judges the whether small n of i: if so, and returning to S143；Otherwise, S145 is executed；
It will be appreciated that all values in the primary vector of new individual are determined to arrive new individual as i=n
Primary vector.After obtaining the primary vector of new individual, primary vector can be finely adjusted below by step S146.
S145, the second random number is generated, judges whether second random number is less than the adaptive pitch and adjusts probability:
If so, random integers p and q of two values in [1, n] range are generated, by the primary vector of the new individual
In pth position genic value and q genic values carry out location swaps；
Otherwise, S146 is executed；
That is, being carried out when the second random number is less than adaptive pitch and adjusts probability to the primary vector of new individual
Otherwise fine tuning keeps the primary vector of new individual constant.
S146, the secondary vector that the new individual is generated according to the preset rules, by the primary vector of the new individual
The new individual is merged into secondary vector.
Here preset rules hereinbefore it is stated that, which is not described herein again.
For example, the primary vector of new individual is Γnew, secondary vector Φnew, the new individual of formation are as follows:
S150, current harmony data base is updated according to the new individual；
Specifically, step S150 may include:
S151, the fitness for calculating each individual in the fitness value and current harmony data base of the new individual
Value, and select the minimum fitness value in current harmony data base；
It will be appreciated that can using the inverse of the sum of maintenance duration within a dispatching cycle as fitness value,
That is calculating the sum of the maintenance duration in a dispatching cycle under new individual, and in current harmony data base
The sum of the maintenance duration in a dispatching cycle under each individual.The sum of maintenance duration in one dispatching cycle is lower,
I.e. fitness value is bigger, illustrates that the individual is more excellent.
S152, judge whether the fitness value of the new individual is greater than the minimum fitness value:
If so, by the corresponding individual of the new individual replacement minimum fitness value；
Otherwise, keep harmony data base constant.
It will be appreciated that judging whether the fitness value of new individual is greater than the minimum fitness value, that is, judge new individual
Whether better than the worst individual in current harmony data base.If the fitness value of new individual is greater than the minimum fitness value,
Illustrate that new individual better than the worst individual in current harmony data base, replaces current harmony data base with new individual at this time
In worst individual, to realize update to harmony data base.
S160, judge whether current the number of iterations reaches the maximum number of iterations:
If so, the maximum individual of fitness value in current harmony data base as optimal solution and is exported；One by one
The fitness value of body is the inverse of total maintenance duration of the individual within a dispatching cycle；
Otherwise, it enables the number of iterations add 1, and returns to S130.
In practice, maximum number of iterations can according to need setting, when updating repeatedly it to initial harmony data base
Afterwards, select an optimum individual as optimal solution from the harmony data base that final updating is completed.
Single machine production dispatching method provided by the present application generates initial harmony data base, calculates its individual similarity, into
And adaptively retains probability and adaptive pitch with sound memory according to individual similarity calculation and adjust probability, and then based on the two
Probability generates a new individual, and is updated using the new individual to harmony data base, multiple when updating to harmony data base
Later, the maximum individual of fitness value therein is chosen as most there is solution, fitness value maximum safeguards the sum of duration minimum, from
And it solves the problems, such as to make to safeguard that the sum of duration is minimum during Single Machine Scheduling.
Further, a kind of preset rules being used in step S121~S126 and generating new individual, this rule is based on
The actual features of single machine production scheduling problem propose processing mode under three circumstances, so that being determined according to preset rules
Secondary vector it is with good performance.A kind of generation method of new individual is provided in step S141~S146, in this method
In identified new individual primary vector i+1 position genic value in the primary vector of new individual in preceding i genic value all
Do not occurred, and can guarantee that new individual is fallen in feasible zone in this way.When calculating individual similarity, counted using the first formula
It calculates, i.e., calculates individual similarity using the similarity of primary vector, the accuracy for measuring diversity of individuals can be improved in this way,
Reduce error.Based on individual similarity, adaptive adjustment and sound memory retain probability and tone adjusting probability, accelerate searching for algorithm
Suo Sudu avoids algorithm from falling into local optimum.
Second aspect, the application provides a kind of single machine production scheduling system of band deterioration maintenance duration, as shown in fig. 7, should
Device 200 includes:
Parameter setting module 210, the parameter for executing S110, harmonic search algorithm being arranged, the parameter includes harmony
The quantity m and sound memory of the preservable individual of data base retain the max-thresholds of probability and the Minimum Threshold of sound memory reservation probability
Value, tone adjust the max-thresholds of probability, tone adjusts the minimum threshold and maximum number of iterations of probability；
Data base constructs module 220, for executing S120, constructing initial harmony data base, in the harmony data base
Including m individual, each individual includes primary vector and secondary vector, and the primary vector indicates each workpiece in equipment
Processing sequence, secondary vector indicates the maintenance point of the equipment；The generating process of each individual includes: to generate this at random
The primary vector of body, and generate according to preset rules the secondary vector of the individual；
Probability evaluation entity 230, the individual similarity for executing S130, calculating current harmony data base；According to institute
It states individual similarity and sound memory retains the max-thresholds of probability and retains the minimum threshold of probability with sound memory, calculate current
Harmony data base adaptive and sound memory retain probability；The maximum threshold of probability is adjusted according to the individual similarity, tone
Value and tone adjust the minimum threshold of probability, and the adaptive pitch for calculating current harmony data base adjusts probability；
New individual generation module 240, for execute S140, retain probability according to described adaptive and sound memory and it is described from
It adapts to tone and adjusts probability, generate a new individual；
Data base update module 250, for executing S150, being carried out more according to the new individual to current harmony data base
Newly；
Iteration judgment module 260, for executing S160, judging whether current the number of iterations reaches the greatest iteration time
Number: if so, the maximum individual of fitness value in current harmony data base as optimal solution and is exported；An individual is fitted
Answering angle value is the inverse of total maintenance duration of the individual within a dispatching cycle；Otherwise, it enables the number of iterations add 1, and returns to institute
It states and executes S130 in probability evaluation entity.
In some embodiments, if the preset rules include: a=0, in [x1,x2] on any point carry out equipment dimension
Shield, corresponding maintenance duration are identical；Wherein, it is preset normal that the calculation formula of linear deterioration maintenance duration, which is y=a+bx, a and b,
Number, x are located at [x1,x2] in range, x is the Continuous maching duration of the equipment, and y is in the maintenance after Continuous maching duration x
It is long；Corresponding, the process for the secondary vector that the data base building module generates the individual according to preset rules includes:
S121, as a=0, determine [x1,x2] relationship with the processing time duration of workpiece:
If meeting the first preset condition, in [x1,x2] maintenance is arranged in the either work in range after processing is completed
Point；First preset condition are as follows:
andandand
If meeting the second preset condition, a maintenance point is set after the completion of k-th of work pieces process, described second is default
Condition are as follows:
andand
If meeting third preset condition, a maintenance point is set after the completion of k-th of work pieces process, the third is default
Condition are as follows:
and
Wherein,For the processing duration of i-th of workpiece, k+g+1 is less than or equal in the equipment need the workpiece sum of processing
N, k and g are the integer more than or equal to 1；For the processing time duration from the 1st workpiece to -1 workpiece of kth；
S122, judge whether all workpiece of the equipment complete the process:
If so, determining the secondary vector of the individual according to the setting position of each maintenance point；
Otherwise, the Continuous maching duration of the equipment is zeroed, and by the processing sequence of the workpiece after the maintenance point
Number resetting, and return step S121.
In some embodiments, the preset rules further include: if a < 0, maintenance point is closer to x1, when corresponding maintenance
Length is shorter；Corresponding, the data base building module generates the process of the secondary vector of the individual according to preset rules further include:
S123, as a < 0, determine [x1, x2] relationship with the processing time duration of workpiece:
If meeting the 4th preset condition, a maintenance point is set after the completion of k-th of work pieces process, the described 4th is default
Condition are as follows:
and
If meeting the 5th preset condition, a maintenance point is set after the completion of k-th of work pieces process, the described 5th is default
Condition are as follows:
and
S124, judge whether all workpiece of the equipment complete the process:
If so, determining the secondary vector of the individual according to the setting position of each maintenance point；
Otherwise, the Continuous maching duration of the equipment is zeroed, and by the processing sequence of the workpiece after the maintenance point
Number resetting, and return step S123.
In some embodiments, the preset rules further include: if a > 0, maintenance point is closer to x2, when corresponding maintenance
Length is shorter；Corresponding, the process for the secondary vector that the data base building module generates the individual according to preset rules includes:
S125, as a > 0, determine [x1, x2] relationship with the processing time duration of workpiece:
If meeting the 6th preset condition, a maintenance point is set after the completion of k-th of work pieces process, the described 6th is default
Condition are as follows:
and
S126, judge whether all workpiece of the equipment complete the process:
If so, determining the secondary vector of the individual according to the setting position of each maintenance point；
Otherwise, the Continuous maching duration of the equipment is zeroed, and by the processing sequence of the workpiece after the maintenance point
Number resetting, and return step S125.
In some embodiments, probability evaluation entity is specifically used for calculating the individual similarity, institute using the first formula
Stating the first formula includes:
Wherein, D is the individual similarity, and n is the sum for the workpiece for needing to process in the equipment, CijIt indicates i-th
Jth position genic value in the primary vector of individual is in ΠjThe number of middle appearance；ΠjFor m individual in current harmony data base
First vector jth position genic value set；And/or
Probability evaluation entity is specifically used for calculating described adaptive and sound memory reservation probability using the second formula, and described the
Two formula include:
In formula, HMCR is that the adaptive and sound memory retains probability, HMCRmaxFor the maximum for retaining probability with sound memory
Threshold value, HMCRminFor the minimum threshold for retaining probability with sound memory；
And/or
Probability evaluation entity is specifically used for calculating the adaptive pitch adjusting probability using third formula, and the third is public
Formula includes:
In formula, PAR is that the adaptive pitch adjusts probability, PARmaxThe max-thresholds of probability, PAR are adjusted for tonemin
The minimum threshold of probability is adjusted for tone.
In some embodiments, new individual generation module is specifically used for:
S141, the initial value that i is arranged are 1, and construct corresponding set Xi, the set XiIn include that current harmony is remembered
Recall in library i-th bit genic value in the primary vector of all individuals；
S142, in the set XiThe i-th bit gene of primary vector of one value of middle random selection as the new individual
Value；
S143, the first random number is generated, judges whether first random number is less than the adaptive and sound memory and retains
Probability:
If so, generate random integers j of the value in [1, m] range, in j-th of individual of current harmony data base
Position h where i-th bit genic value described in primary vector, if in current harmony data base in the primary vector of j-th of individual
H+1 genic values occurred in preceding i genic value not in the primary vector of the new individual, then by the h+1 bases
Because being worth the i+1 position genic value of the primary vector as the new individual；If the first of j-th of individual in current harmony data base
H+1 genic values in vector occurred in preceding i genic values of the primary vector of the new individual, and current harmony is remembered
Recall in library in the primary vector of j-th of individual near near position h and the preceding i genic value not in the primary vector of the new individual
The i+1 position genic value of primary vector of the middle value occurred as the new individual；
Otherwise, do not occur in preceding i genic values of primary vector of the random selection one in the new individual in [1, n]
I+1 position genic value of the integer crossed as the primary vector of the new individual；N is the workpiece for needing to process in the equipment
Number；
S144, it enables i add 1, and judges the whether small n of i: if so, and returning to S143；Otherwise, S145 is executed；
S145, the second random number is generated, judges whether second random number is less than the adaptive pitch and adjusts probability:
If so, random integers p and q of two values in [1, n] range are generated, by the primary vector of the new individual
In pth position genic value and q genic values carry out location swaps；
Otherwise, S146 is executed；
S146, the secondary vector that the new individual is generated according to the preset rules, by the primary vector of the new individual
The new individual is merged into secondary vector.
In some embodiments, data base update module is specifically used for:
The fitness value of each individual in the fitness value and current harmony data base of the new individual is calculated, and
Select the minimum fitness value in current harmony data base；
Judge whether the fitness value of the new individual is greater than the minimum fitness value:
If so, by the corresponding individual of the new individual replacement minimum fitness value；
Otherwise, keep harmony data base constant.
The third aspect, the application provide a kind of computer equipment, which includes memory, processor and be stored in storage
On device and the computer program that can run on a processor, the processor realize first aspect when executing the computer program
The step of method of middle offer.
Fig. 8 shows the internal structure chart of computer equipment in one embodiment.As shown in figure 8, the computer equipment packet
Including the computer equipment includes processor, memory, network interface, input unit and the display screen connected by system bus
Deng.Wherein, memory includes non-volatile memory medium and built-in storage.The non-volatile memory medium of the computer equipment is deposited
Operating system is contained, computer program can also be stored with, when which is executed by processor, may make that processor is real
Existing single machine production dispatching method.Computer program can also be stored in the built-in storage, which is held by processor
When row, processor may make to execute single machine production dispatching method.The display screen of computer equipment can be liquid crystal display or
Electric ink display screen, the input unit of computer equipment can be the touch layer covered on display screen, be also possible to computer
Key, trace ball or the Trackpad being arranged on device housings can also be external keyboard, Trackpad or mouse etc..
It will be understood by those skilled in the art that structure shown in Fig. 8, only part relevant to application scheme is tied
The block diagram of structure does not constitute the restriction for the computer equipment being applied thereon to application scheme, specific computer equipment
It may include perhaps combining certain components or with different component layouts than more or fewer components as shown in the figure.
In one embodiment, single machine production dispatching device provided by the present application can be implemented as a kind of computer program
Form, computer program can be run in computer equipment as shown in Figure 8.Composition can be stored in the memory of computer equipment
Each program module of the positioning device, the computer program that each program module is constituted execute processor in this specification
Step in the single machine production scheduling of each embodiment of the application of description.
Fourth aspect, the application provide a kind of computer readable storage medium, are stored thereon with computer program, the meter
The step of method that first aspect provides is realized when calculation machine program is executed by processor.
It will be appreciated that computer equipment and fourth aspect that the device of second aspect offer, the third aspect provide mention
The storage medium of confession is corresponding with the method that first aspect provides, the contents such as explanation, citing, beneficial effect in relation to content
Can be with reference to the corresponding portion in first aspect, details are not described herein again.
It should be noted that, in this document, relational terms such as first and second and the like are used merely to a reality
Body or operation are distinguished with another entity or operation, are deposited without necessarily requiring or implying between these entities or operation
In any actual relationship or order or sequence.Moreover, the terms "include", "comprise" or its any other variant are intended to
Non-exclusive inclusion, so that the process, method, article or equipment including a series of elements is not only wanted including those
Element, but also including other elements that are not explicitly listed, or further include for this process, method, article or equipment
Intrinsic element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that
There is also other identical elements in process, method, article or equipment including the element.
The above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although with reference to the foregoing embodiments
Invention is explained in detail, those skilled in the art should understand that: it still can be to aforementioned each implementation
Technical solution documented by example is modified or equivalent replacement of some of the technical features；And these modification or
Replacement, the spirit and scope for technical solution of various embodiments of the present invention that it does not separate the essence of the corresponding technical solution.
Claims (10)
1. the single machine production dispatching method that a kind of band deteriorates maintenance duration characterized by comprising
S110, be arranged harmonic search algorithm parameter, the parameter include the preservable individual of harmony data base quantity m and
Sound memory retains the max-thresholds of probability and sound memory retains the minimum threshold of probability, tone adjusts max-thresholds, the sound of probability
The minimum threshold and maximum number of iterations of tune section probability；
S120, initial harmony data base is constructed, includes m individual in the harmony data base, each individual includes first
Vector sum secondary vector, the primary vector indicate processing sequence of each workpiece in equipment, set described in secondary vector expression
Standby maintenance point；The generating process of each individual includes: the primary vector for generating the individual at random, and raw according to preset rules
At the secondary vector of the individual；
S130, the individual similarity for calculating current harmony data base；Retain probability according to the individual similarity and sound memory
Max-thresholds and with sound memory retain probability minimum threshold, calculate current harmony data base adaptive and sound memory guarantor
Stay probability；The max-thresholds of probability and the minimum threshold of tone adjusting probability are adjusted according to the individual similarity, tone, are calculated
The adaptive pitch of current harmony data base adjusts probability；
S140, retain probability and adaptive pitch adjusting probability according to the adaptive and sound memory, generate one new
Body；
S150, current harmony data base is updated according to the new individual；
S160, judge whether current the number of iterations reaches the maximum number of iterations:
If so, the maximum individual of fitness value in current harmony data base as optimal solution and is exported；An individual
Fitness value is the inverse of total maintenance duration of the individual within a dispatching cycle；
Otherwise, it enables the number of iterations add 1, and returns to S130.
2. the method according to claim 1, wherein if the preset rules include: a=0, in the dimension of equipment
Protect time window [x1,x2] on any point carry out plant maintenance, corresponding maintenance duration is identical；Wherein, linear deterioration safeguards duration
Calculation formula be y=a+bx, a and b be preset constant, x is located at [x1,x2] in range, x is the Continuous maching of the equipment
Duration, y are the maintenance duration after Continuous maching duration x；
It is corresponding, the secondary vector that the individual is generated according to preset rules, comprising:
S121, as a=0, determine [x1,x2] relationship with the processing time duration of workpiece:
If meeting the first preset condition, in [x1,x2] maintenance point is arranged in the either work in range after processing is completed；Institute
State the first preset condition are as follows:
With
If meeting the second preset condition, a maintenance point, second preset condition are set after the completion of k-th of work pieces process
Are as follows:
If meeting third preset condition, a maintenance point, the third preset condition are set after the completion of k-th of work pieces process
Are as follows:
Wherein,For the processing duration of i-th of workpiece, k+g+1 be less than or equal in the equipment to need workpiece the sum n, k of processing and
G is the integer more than or equal to 1；For the processing time duration from the 1st workpiece to -1 workpiece of kth；
S122, judge whether all workpiece of the equipment complete the process:
If so, determining the secondary vector of the individual according to the setting position of each maintenance point；
Otherwise, the Continuous maching duration of the equipment is zeroed, and the processing sequence of the workpiece after the maintenance point is numbered
Resetting, and return step S121.
3. according to the method described in claim 2, it is characterized in that, the preset rules further include: if a < 0, maintenance point is got over
Close to x1, corresponding maintenance duration is shorter；
It is corresponding, the secondary vector that the individual is generated according to preset rules, further includes:
S123, as a < 0, determine [x1, x2] relationship with the processing time duration of workpiece:
If meeting the 4th preset condition, a maintenance point, the 4th preset condition are set after the completion of k-th of work pieces process
Are as follows:
If meeting the 5th preset condition, a maintenance point, the 5th preset condition are set after the completion of k-th of work pieces process
Are as follows:
S124, judge whether all workpiece of the equipment complete the process:
If so, determining the secondary vector of the individual according to the setting position of each maintenance point；
Otherwise, the Continuous maching duration of the equipment is zeroed, and the processing sequence of the workpiece after the maintenance point is numbered
Resetting, and return step S123.
4. according to the method described in claim 3, it is characterized in that, the preset rules further include: if a > 0, maintenance point is got over
Close to x2, corresponding maintenance duration is shorter；
It is corresponding, the secondary vector that the individual is generated according to preset rules, further includes:
S125, as a > 0, determine [x1, x2] relationship with the processing time duration of workpiece:
If meeting the 6th preset condition, a maintenance point, the 6th preset condition are set after the completion of k-th of work pieces process
Are as follows:
S126, judge whether all workpiece of the equipment complete the process:
If so, determining the secondary vector of the individual according to the setting position of each maintenance point；
Otherwise, the Continuous maching duration of the equipment is zeroed, and the processing sequence of the workpiece after the maintenance point is numbered
Resetting, and return step S125.
5. the method according to claim 1, wherein
The individual similarity for calculating current harmony data base, comprising: the individual similarity is calculated using the first formula,
First formula includes:
Wherein, D is the individual similarity, and n is the sum for the workpiece for needing to process in the equipment, CijIndicate i-th of individual
Primary vector in jth position genic value in ΠjThe number of middle appearance；ΠjIt is the of m individual in current harmony data base
The set of the jth position genic value of one vector；
And/or
The adaptive and sound memory for calculating current harmony data base retains probability, comprising: calculates institute using the second formula
It states adaptive and sound memory and retains probability, second formula includes:
In formula, HMCR is that the adaptive and sound memory retains probability, HMCRmaxFor with sound memory retain probability max-thresholds,
HMCRminFor the minimum threshold for retaining probability with sound memory；
And/or
The adaptive pitch of the current harmony data base of the calculating adjusts probability, comprising: described certainly using the calculating of third formula
It adapts to tone and adjusts probability, the third formula includes:
In formula, PAR is that the adaptive pitch adjusts probability, PARmaxThe max-thresholds of probability, PAR are adjusted for toneminFor sound
The minimum threshold of tune section probability.
6. the method according to claim 1, wherein according to described adaptive and sound memory reservation probability and described
Adaptive pitch adjusts probability, generates a new individual, comprising:
S141, the initial value that i is arranged are 1, and construct corresponding set Xi, the set XiIn include current harmony data base
In all individuals primary vector in i-th bit genic value；
S142, in the set XiThe i-th bit genic value of primary vector of one value of middle random selection as the new individual；
S143, the first random number is generated, judges whether first random number is less than the adaptive and sound memory and retains probability:
If so, random integers j of the value in [1, m] range is generated, the first of j-th of individual of current harmony data base
The position h where gene identical with the new individual i-th bit genic value is found out in vector, if jth in current harmony data base
H+1 genic values occurred in preceding i genic value not in the primary vector of the new individual in the primary vector of individual,
Then using the h+1 genic values as the i+1 position genic value of the primary vector of the new individual；If current harmony data base
In j-th individual primary vector in h+1 genic values in preceding i genic values of the primary vector of the new individual out
Now cross, by current harmony data base j-th individual primary vector near near position h and not the first of the new individual
The i+1 position genic value of primary vector of the value occurred in preceding i genic value in vector as the new individual；
Otherwise, do not occurred in preceding i genic values of primary vector of the random selection one in the new individual in [1, n]
I+1 position genic value of the integer as the primary vector of the new individual；N is for the workpiece for needing to process in the equipment
Number；
S144, it enables i add 1, and judges the whether small n of i: if so, and returning to S143；Otherwise, S145 is executed；
S145, the second random number is generated, judges whether second random number is less than the adaptive pitch and adjusts probability:
If so, random integers p and q of two values in [1, n] range are generated, it will be in the primary vector of the new individual
Pth position genic value and q genic values carry out location swap；
Otherwise, S146 is executed；
S146, the secondary vector that the new individual is generated according to the preset rules, by the primary vector of the new individual and
Two vectors merge into the new individual.
7. the method according to claim 1, wherein being carried out according to the new individual to current harmony data base
It updates, comprising:
The fitness value of each individual in the fitness value and current harmony data base of the new individual is calculated, and is chosen
Minimum fitness value in current harmony data base out；
Judge whether the fitness value of the new individual is greater than the minimum fitness value:
If so, by the corresponding individual of the new individual replacement minimum fitness value；
Otherwise, keep harmony data base constant.
8. the single machine production that a kind of band deteriorates maintenance duration dispatches system characterized by comprising
Parameter setting module, the parameter for executing S110, harmonic search algorithm being arranged, the parameter includes harmony data base can
The quantity m and sound memory of the individual of preservation retain the max-thresholds of probability and minimum threshold, the tone of sound memory reservation probability
Adjust the max-thresholds of probability, the minimum threshold and maximum number of iterations of tone adjusting probability；
Data base constructs module, includes m in the harmony data base for executing S120, constructing initial harmony data base
Individual, each individual includes primary vector and secondary vector, and the primary vector indicates processing of each workpiece in equipment
Sequentially, secondary vector indicates the maintenance point of the equipment；Generating process of each individual includes: generate the individual at random the
One vector, and generate according to preset rules the secondary vector of the individual；
Probability evaluation entity, the individual similarity for executing S130, calculating current harmony data base；According to the individual phase
Retain the max-thresholds of probability like degree and sound memory and retain the minimum threshold of probability with sound memory, calculates current harmony note
The adaptive and sound memory for recalling library retains probability；The max-thresholds and tone of probability are adjusted according to the individual similarity, tone
The minimum threshold for adjusting probability, the adaptive pitch for calculating current harmony data base adjust probability；
New individual generation module, for executing S140, retaining probability and the adaptive sound according to the adaptive and sound memory
Tune section probability generates a new individual；
Data base update module, for executing S150, being updated according to the new individual to current harmony data base；
Iteration judgment module, for executing S160, judging whether current the number of iterations reaches the maximum number of iterations: if
It is then as optimal solution and to export the maximum individual of fitness value in current harmony data base；The fitness of an individual
Value is the inverse of total maintenance duration of the individual within a dispatching cycle；Otherwise, it enables the number of iterations add 1, and returns described general
S130 is executed in rate computing module.
9. a kind of computer equipment including memory, processor and stores the meter that can be run on a memory and on a processor
Calculation machine program, which is characterized in that the processor realizes any one of claims 1 to 7 institute when executing the computer program
The step of stating method.
10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program
The step of method described in any one of claims 1 to 7 is realized when being executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910492439.3A CN110209133B (en) | 2019-06-06 | 2019-06-06 | Single machine production scheduling method and system with deterioration maintenance duration |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910492439.3A CN110209133B (en) | 2019-06-06 | 2019-06-06 | Single machine production scheduling method and system with deterioration maintenance duration |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110209133A true CN110209133A (en) | 2019-09-06 |
| CN110209133B CN110209133B (en) | 2020-09-08 |
Family
ID=67791354
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910492439.3A Active CN110209133B (en) | 2019-06-06 | 2019-06-06 | Single machine production scheduling method and system with deterioration maintenance duration |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110209133B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120130929A1 (en) * | 2010-11-24 | 2012-05-24 | International Business Machines Corporation | Controlling quarantining and biasing in cataclysms for optimization simulations |
| CN107230023A (en) * | 2017-06-12 | 2017-10-03 | 合肥工业大学 | Based on the production and transportation coordinated dispatching method and system for improving harmony search |
| CN107291911A (en) * | 2017-06-26 | 2017-10-24 | 北京奇艺世纪科技有限公司 | A kind of method for detecting abnormality and device |
| CN108416511A (en) * | 2018-02-10 | 2018-08-17 | 杭州后博科技有限公司 | It is a kind of based on the patrol task method of adjustment and system of safeguarding duration |
| CN109343479A (en) * | 2018-09-18 | 2019-02-15 | 合肥工业大学 | Flowshop production scheduling method and system based on the adaptive harmonic search algorithm of multiple target |
-
2019
- 2019-06-06 CN CN201910492439.3A patent/CN110209133B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120130929A1 (en) * | 2010-11-24 | 2012-05-24 | International Business Machines Corporation | Controlling quarantining and biasing in cataclysms for optimization simulations |
| CN107230023A (en) * | 2017-06-12 | 2017-10-03 | 合肥工业大学 | Based on the production and transportation coordinated dispatching method and system for improving harmony search |
| CN107291911A (en) * | 2017-06-26 | 2017-10-24 | 北京奇艺世纪科技有限公司 | A kind of method for detecting abnormality and device |
| CN108416511A (en) * | 2018-02-10 | 2018-08-17 | 杭州后博科技有限公司 | It is a kind of based on the patrol task method of adjustment and system of safeguarding duration |
| CN109343479A (en) * | 2018-09-18 | 2019-02-15 | 合肥工业大学 | Flowshop production scheduling method and system based on the adaptive harmonic search algorithm of multiple target |
Non-Patent Citations (4)
| Title |
|---|
| M. KOUKI: "《Optimal integrated maintenance policy based on quality deterioration》", 《2014 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING》 * |
| 赵传立: "《Scheduling Problems under Linear Deterioration》", 《自动化学报》 * |
| 赵传立: "《恶化率与工件无关的线性加工时间调度问题》", 《数学的实践与认识》 * |
| 马英: "《带不可用时间段和恶化加工时间的单机调度》", 《系统工程学报》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110209133B (en) | 2020-09-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Liu et al. | NCTU-GR 2.0: Multithreaded collision-aware global routing with bounded-length maze routing | |
| US7853949B2 (en) | Method and apparatus for assigning fractional processing nodes to work in a stream-oriented computer system | |
| Doush et al. | Flow shop scheduling with blocking using modified harmony search algorithm with neighboring heuristics methods | |
| Maltry et al. | A critical analysis of recursive model indexes | |
| Bornea et al. | Adaptive join operators for result rate optimization on streaming inputs | |
| Zhao et al. | Dynamic regret of online markov decision processes | |
| CN114139712B (en) | Quantum circuit processing method, quantum circuit processing device, electronic device and storage medium | |
| CN113064907B (en) | Content updating method based on deep reinforcement learning | |
| CN110209133A (en) | With the single machine production dispatching method and system for deteriorating maintenance duration | |
| CN116151384B (en) | Quantum circuit processing method and device and electronic equipment | |
| CN111159573B (en) | Item-based content recommendation method | |
| Bornea et al. | Double index nested-loop reactive join for result rate optimization | |
| CN103763302B (en) | Web service combination generating method | |
| CN112711535B (en) | Particle swarm optimization-based combined test data generation method under constraint | |
| CN111211559B (en) | Power grid impedance estimation method based on dynamic step length firefly algorithm | |
| Kattan et al. | An enhanced parallel & distributed implementation of the harmony search based supervised training of artificial neural networks | |
| Boman et al. | A multilevel algorithm for reducing the envelope of sparse matrices | |
| Das et al. | Multi-number cvt-xor arithmetic operations in any base system and its significant properties | |
| JP5283054B2 (en) | Information processing apparatus and method, and program | |
| CN110059814A (en) | A kind of lookup tabular form convolution algorithm hardware configuration based on FPGA | |
| CN112306859A (en) | Improved software self-adaptive testing method | |
| Zhang et al. | Efficient super greedy boosting for classification | |
| Huang et al. | Towards Green AI in Fine-tuning Large Language Models via Adaptive Backpropagation | |
| Park | Additive Schwarz Methods for Convex Optimization–Convergence Theory and Acceleration | |
| Zhang et al. | An efficient algorithm for web service selection based on local selection in large scale |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |