CN108563200A - A kind of Job Scheduling method and device of the multiple target based on ant group algorithm - Google Patents
A kind of Job Scheduling method and device of the multiple target based on ant group algorithm Download PDFInfo
- Publication number
- CN108563200A CN108563200A CN201810289311.2A CN201810289311A CN108563200A CN 108563200 A CN108563200 A CN 108563200A CN 201810289311 A CN201810289311 A CN 201810289311A CN 108563200 A CN108563200 A CN 108563200A
- Authority
- CN
- China
- Prior art keywords
- workpiece
- processed
- ant
- current
- target
- 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
- 238000000034 method Methods 0.000 title claims abstract description 104
- 239000003016 pheromone Substances 0.000 claims abstract description 85
- 239000011159 matrix material Substances 0.000 claims abstract description 70
- 238000012804 iterative process Methods 0.000 claims abstract description 62
- 238000005265 energy consumption Methods 0.000 claims abstract description 39
- 230000008569 process Effects 0.000 claims description 63
- 241000257303 Hymenoptera Species 0.000 claims description 12
- 230000007704 transition Effects 0.000 claims description 8
- 238000010276 construction Methods 0.000 claims description 2
- 238000005457 optimization Methods 0.000 description 10
- 238000005406 washing Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 101100037618 Neurospora crassa (strain ATCC 24698 / 74-OR23-1A / CBS 708.71 / DSM 1257 / FGSC 987) ant-1 gene Proteins 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 101150091111 ACAN gene Proteins 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000001954 sterilising effect Effects 0.000 description 2
- 238000004659 sterilization and disinfection Methods 0.000 description 2
- 239000000686 essence Substances 0.000 description 1
- 238000009415 formwork Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
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] or 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] or 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]
Landscapes
- Engineering & Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Manufacturing & Machinery (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Automation & Control Theory (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- General Factory Administration (AREA)
Abstract
The invention discloses a kind of Job Scheduling method and device of the multiple target based on ant group algorithm, method includes：When previous iteration, the first preset quantity ant is established, establishes empty batch；Pheromone Matrix and Target Preference vector are obtained, and obtains current processing equipment；Empty batch is currently criticized as the first of current processing equipment；First workpiece to be processed is dispatched in first current batch；Second workpiece to be processed is added in current candidate list until all second workpieces to be processed are all scheduled；Pheromone Matrix of the update when the next iteration of previous iteration；Judge whether be equal to the second predetermined threshold value when the corresponding iterations of previous iteration；If it is not, update iterations, and return to the step of execution establishes empty batch；If so, will work as previous iterative process in global optimum completion duration and the corresponding scheduling scheme of global optimum's energy consumption as target dispatch method.Using the embodiment of the present invention, the Multiobjective Scheduling of workpiece may be implemented.
Description
Technical field
The present invention relates to a kind of Job Scheduling methods of multiple target, are more particularly to a kind of multiple target based on ant group algorithm
Job Scheduling method and device.
Background technology
Batch processor scheduling (referred to as batch scheduling) problem is a kind of combinatorial optimization problem for having very strong application background, is existed
Many fields in real life, for example, the carrying out washing treatment field of the Sterile services of hospital or the manufacture field of workpiece.With
For the carrying out washing treatment field of the Sterile services of hospital, after the completion of surgical operation, need to reusable medical instrument
It is sterilized and is sterilized, because they can be reused after sterilization.The significance level being each set with is different, washs every group
It is different to be set with duration.Washing facility has fixed capacity, as long as being no more than the capacity, they can be simultaneously
Handle multiple suits.In addition, due to the sense of organization and trackability required in the special requirement of medical device, a suit is usual
It can only be washed in a washing facility, not allow to separate.Therefore, it can efficiently be washed using these washing facilitys, it will
The efficiency of sterilization treatment can be seriously affected.Regard workpiece as by that will be set with, automatic washing device regards batch processor as, can will cover
The washing problem of dress is abstracted as the minimization problem that workpiece in parallel batch processor always weights completion duration.Moreover, workpiece always adds
Power completion duration (may also be referred to as weighting flow time) is also the key parameter for reducing processing inventory cost, and therefore, solving should
Problem is very important the efficient management and scheduling of realizing resource.In addition, in practical applications, it can be by batch processor
Treat as process equipment.
Currently, carrying out batch processing Scheduling Design usually using ant group algorithm.Under normal conditions, in iterative process each time
In, for each process equipment in the process equipment of the corresponding preset quantity of each ant, then multiple batches of construction will wait for
Workpieces processing be dispatched to this ant it is all batches corresponding in；Successively by the structure criticized to all ants and work to be processed
The scheduling of part.Then using when the corresponding globally optimal solution of previous iteration as Pheromone Matrix when next iteration it is newer according to
According to, and then next iteration is carried out, until last time iteration selects globally optimal solution.It should be noted that global optimum
Xie Wei, first time iteration to the optimal solution generated during previous iteration.
Batch processor scheduling is carried out in the prior art, is based on the power one of each batch processor i.e. process equipment
It causes, carries out single object optimization, that is, be processed the optimization of duration.But in practical application scene, each process equipment
Power there may be difference, be scheduled according to the dispatching method of the prior art, although can exist processing duration it is most short,
The higher problem of energy consumption cannot take into account the optimization of multiple target, that is, the optimization of processing duration and process equipment energy consumption simultaneously, because
This, the Job Scheduling for how carrying out multiple target is a technical problem to be solved urgently.
Invention content
Technical problem to be solved by the present invention lies in provide a kind of Job Scheduling of the multiple target based on ant group algorithm
Method and device, to realize the Job Scheduling of multiple target.
The present invention is to solve above-mentioned technical problem by the following technical programs：
An embodiment of the present invention provides a kind of Job Scheduling method of the multiple target based on ant group algorithm, the method packets
It includes：
When previous iteration, the first preset quantity ant is established, for current in the first preset quantity ant
Ant establishes empty batch；
Obtain the Pheromone Matrix of each target in the multiple target and preset for the current ant
Target Preference vector, and for each process equipment in the second preset quantity process equipment, obtain each target with it is corresponding
Target Preference vector product and minimum process equipment, and using the process equipment as current processing equipment；Wherein, institute
Stating target includes：Energy consumption, process time；
Described empty batch is currently criticized as the first of the current processing equipment；And it is first in workpiece to be processed is to be added
During work Job Scheduling is currently criticized to described first；By in the workpiece to be processed, in addition to first workpiece to be processed
Two workpieces to be processed are added described first and currently criticize in corresponding current candidate list；
Judge whether the workpiece to be processed not being scheduled；
The step of current ant in the first preset quantity ant establishes empty batch is executed if so, returning；
Until the workpiece to be processed is all scheduled in corresponding batch of the current ant；
If it is not, by the first preset quantity ant, an ant in addition to the current ant is as current
Ant, and return and execute the step of current ant in the first preset quantity ant establishes empty batch, until institute
It is all scheduled to state the corresponding workpiece to be processed of the first preset quantity ant；
It will be when the completion duration minimum value obtained in previous iterative process and all iteration before previous iteration
Smaller value in the completion duration minimum value obtained in the process works as the corresponding global optimum of previous iteration complete working hour as described
It is long；It will be obtained with all iterative process before previous iteration when the energy consumption minimum value obtained in previous iterative process
Energy consumption minimum value in smaller value, as it is described work as the corresponding global optimum's energy consumption of previous iteration；
Work as previous iterative process using all in previous iterative process ants corresponding scheduling schemes as described
Disaggregation；
According to when the corresponding Pheromone Matrix of previous iteration, global information element rate of volatilization and when previous iteration is corresponding
The set of solution, Pheromone Matrix of the update when the next iteration of previous iteration；
Judge described when whether the corresponding iterations of previous iteration are equal to the second predetermined threshold value；
If it is not, by when the corresponding iterations of previous iteration and the first predetermined threshold value and as when previous iteration it is corresponding
Iterations, and it is described when previous iteration to return to execution, the first preset quantity ant is established, for the first preset quantity
The step of current ant in a ant establishes empty batch；
If so, global optimum's completion duration and the corresponding scheduling scheme of global optimum's energy consumption in previous iterative process will be worked as
As target dispatch method.
Optionally, described by the workpiece to be processed in a kind of specific implementation mode of the embodiment of the present invention, remove institute
It states the addition of the second workpiece to be processed except the first workpiece to be processed described first currently to criticize in corresponding current candidate list, wrap
It includes：
By in the workpiece to be processed, the second workpiece to be processed in addition to first workpiece to be processed is added described the
One currently criticizes in corresponding current candidate list, while the size of each second workpiece to be processed is less than the current processing
The residual capacity of equipment；Wherein, total capacity and institute of the residual capacity of the current processing equipment for the current processing equipment
State the difference of the overall size of the first workpiece to be processed；
According to the Pheromone Matrix of the corresponding each target of every 1 second workpiece to be processed in the current candidate list, institute
State the pheromones weight of the corresponding each target of the second workpiece to be processed, second workpiece to be processed about completion duration
Heuristic information, calculates the probability that second workpiece to be processed is scheduled in described first current batch, and according to will be maximum
Corresponding second workpiece to be processed of the probability be dispatched in described first current batch；
Using the set of maximum second workpiece to be processed of the transition probability and first workpiece to be processed as first
Workpiece to be processed, and by the workpiece to be processed, the second workpiece to be processed in addition to first workpiece to be processed is added
Described first currently criticizes in corresponding candidate list, and currently criticizes corresponding candidate list using described first and arranged as current candidate
Table；And it returns and executes the information according to the corresponding each target of every 1 second workpiece to be processed in the current candidate list
Prime matrix, the pheromones weight of the corresponding each target of second workpiece to be processed, second workpiece to be processed about
The heuristic information of completion duration calculates the step for the probability that second workpiece to be processed is scheduled in described first current batch
Suddenly, until the described first residual capacity currently criticized is less than the size of any one of workpiece to be processed.
Optionally, described according in the current candidate list in a kind of specific implementation mode of the embodiment of the present invention
The Pheromone Matrix of the corresponding each target of every 1 second workpiece to be processed, the corresponding each target of second workpiece to be processed
Pheromones weight, the heuristic information about completion duration of second workpiece to be processed, calculate described second to be processed
Workpiece is scheduled to the probability in described first current batch, including：
Using formula,Second calculated in the candidate artifacts set is waited for
Workpiece is dispatched to the described first selected probability currently criticized, wherein
For the Pheromone Matrix of target x, wxFor the corresponding pheromones weights of target x；ηki,uIt is added the c times for workpiece u
The heuristic information of k-th batch about machine complete duration of a ant of iteration on i-th machine；α and β is institute
The empirical value of setting；U is the identification information of the second workpiece to be added；K is the first number currently criticized；I is current processing equipment
Number；C is when the corresponding iterations of previous iteration；∑ is summing function；J is the number of the second workpiece to be processed；X is target
Number；CLkiSet for the second workpiece to be processed for including in the current candidate list.
Optionally, in a kind of specific implementation mode of the embodiment of the present invention, the basis works as the corresponding letter of previous iteration
Prime matrix, global information element rate of volatilization and the set when the corresponding solution of previous iteration are ceased, update is next when previous iteration
The Pheromone Matrix of secondary iteration, including：
Using formula,Previous iteration is worked as in update
Next iteration Pheromone Matrix, wherein
For when the corresponding Pheromone Matrix of the next iteration of previous iteration；ρgFor global information element volatility；To work as the corresponding Pheromone Matrix of previous iteration；For in previous iteration, workpiece v divides with workpiece j same
The inverse of one batch of obtained desired value；NDS is the set of the corresponding solution of the c times iteration；Sol is the solution in the set of solution；C is
When the corresponding iterations of previous iteration.
Optionally, it in a kind of specific implementation mode of the embodiment of the present invention, judges whether not to be scheduled described
Workpiece to be processed judging result be it is no in the case of, the method further includes：
This is ranked up corresponding batch of the current ant according to the sequence of the arrival time criticized from small to large.
Optionally, described described to work as in previous iterative process in a kind of specific implementation mode of the embodiment of the present invention
The corresponding scheduling scheme of all ants as the disaggregation for working as previous iterative process, including：
Work as previous iterative process using all in previous iterative process ants corresponding scheduling schemes as described
Disaggregation；It is concentrated from the solution and deletes Pareto by the corresponding scheduling scheme of domination solution, the Pareto will be deleted and dominated solution pair
Disaggregation after the scheduling scheme answered is as the disaggregation for working as previous iterative process.
The embodiment of the present invention additionally provides a kind of Job Scheduling device of the multiple target based on ant group algorithm, described device packet
It includes：Establish module, acquisition module, scheduler module, the first judgment module, the first setup module, the second setup module, third setting
Module, update module, the second judgment module, the 4th setup module and the 5th setup module, wherein
It is described to establish module, for when previous iteration, the first preset quantity ant being established, for the first present count
Current ant in amount ant establishes empty batch；
The acquisition module, the Pheromone Matrix for obtaining each target in the multiple target and preset needle
To the Target Preference of current ant vector, and for each process equipment in the second preset quantity process equipment,
Obtain each target and the product of corresponding Target Preference vector and minimum process equipment, and using the process equipment as working as
Preceding process equipment；Wherein, the target includes：Energy consumption, process time；
The scheduler module, for currently criticizing described empty batch as the first of the current processing equipment；And it will be to be added
The first workpiece to be processed in work workpiece is dispatched in described first current batch；By in the workpiece to be processed, described first is removed
The second workpiece to be processed except workpiece to be processed is added described first and currently criticizes in corresponding current candidate list；
First judgment module, for judging whether the workpiece to be processed not being scheduled；If so, being built described in triggering
Formwork erection block；If it is not, triggering first setup module；
First setup module, for by the first preset quantity ant, one in addition to the current ant
Ant as current ant, and trigger it is described establish module, until the first preset quantity ant is corresponding to be added
Work workpiece is all scheduled；
Second setup module, for will work as the completion duration minimum value obtained in previous iterative process with it is described current
Smaller value in the completion duration minimum value obtained in all iterative process before secondary iteration works as previous iteration pair as described
The global optimum's completion duration answered；By when the energy consumption minimum value that is obtained in previous iterative process with described before previous iteration
Smaller value in the energy consumption minimum value obtained in all iterative process works as the corresponding global optimum's energy of previous iteration as described
Consumption；
The third setup module, being used for will be described when the corresponding scheduling scheme conduct of all ants in previous iterative process
The disaggregation when previous iterative process；
The update module, for according to when the corresponding Pheromone Matrix of previous iteration, global information element rate of volatilization with
And the set when the corresponding solution of previous iteration, Pheromone Matrix of the update when the next iteration of previous iteration；
Second judgment module is preset for judging described when whether the corresponding iterations of previous iteration are equal to second
Threshold value；If it is not, triggering the 4th setup module；If so, triggering the 5th setup module, wherein
4th setup module, for will work as the corresponding iterations of previous iteration and the first predetermined threshold value and conduct
When the corresponding iterations of previous iteration, and triggers and described establish module；
5th setup module, for global optimum's completion duration and global optimum's energy in previous iterative process will to be worked as
Corresponding scheduling scheme is consumed as target dispatch method.
Optionally, in a kind of specific implementation mode of the embodiment of the present invention, the scheduler module is additionally operable to：
By in the workpiece to be processed, the second workpiece to be processed in addition to first workpiece to be processed is added described the
One currently criticizes in corresponding current candidate list, while the size of each second workpiece to be processed is less than the current processing
The residual capacity of equipment；Wherein, total capacity and institute of the residual capacity of the current processing equipment for the current processing equipment
State the difference of the overall size of the first workpiece to be processed；
According to the Pheromone Matrix of the corresponding each target of every 1 second workpiece to be processed in the current candidate list, institute
State the pheromones weight of the corresponding each target of the second workpiece to be processed, second workpiece to be processed about completion duration
Heuristic information, calculates the probability that second workpiece to be processed is scheduled in described first current batch, and according to will be maximum
Corresponding second workpiece to be processed of the probability be dispatched in described first current batch；
Using the set of maximum second workpiece to be processed of the transition probability and first workpiece to be processed as first
Workpiece to be processed, and by the workpiece to be processed, the second workpiece to be processed in addition to first workpiece to be processed is added
Described first currently criticizes in corresponding candidate list, and currently criticizes corresponding candidate list using described first and arranged as current candidate
Table；And it returns and executes the information according to the corresponding each target of every 1 second workpiece to be processed in the current candidate list
Prime matrix, the pheromones weight of the corresponding each target of second workpiece to be processed, second workpiece to be processed about
The heuristic information of completion duration calculates the step for the probability that second workpiece to be processed is scheduled in described first current batch
Suddenly, until the described first residual capacity currently criticized is less than the size of any one of workpiece to be processed.
Optionally, in a kind of specific implementation mode of the embodiment of the present invention, the scheduler module is additionally operable to：
Using formula,Second calculated in the candidate artifacts set is waited for
Workpiece is dispatched to the described first selected probability currently criticized, wherein
For the Pheromone Matrix of target x, wxFor the corresponding pheromones weights of target x；ηki,uIt is added the c times for workpiece u
The heuristic information of k-th batch about machine complete duration of a ant of iteration on i-th machine；α and β is institute
The empirical value of setting；U is the identification information of the second workpiece to be added；K is the first number currently criticized；I is current processing equipment
Number；C is when the corresponding iterations of previous iteration；∑ is summing function；J is the number of the second workpiece to be processed；X is target
Number；CLkiSet for the second workpiece to be processed for including in the current candidate list.
Optionally, in a kind of specific implementation mode of the embodiment of the present invention, the update module is additionally operable to：
Using formula,Previous iteration is worked as in update
Next iteration Pheromone Matrix, wherein
For when the corresponding Pheromone Matrix of the next iteration of previous iteration；ρgFor global information element volatility；To work as the corresponding Pheromone Matrix of previous iteration；For in previous iteration, workpiece v divides with workpiece j same
The inverse of one batch of obtained desired value；NDS is the set of the corresponding solution of the c times iteration；Sol is the solution in the set of solution；C is
When the corresponding iterations of previous iteration.
The present invention has the following advantages compared with prior art：
It is then inclined according to the target of setting by the way that Target Preference vector is arranged for each target using the embodiment of the present invention
Empty batch of corresponding process equipment of good vector selection, can filter out the process equipment for carrying out multiple-objection optimization, and then realize work
The Multiobjective Scheduling of part.
Description of the drawings
Fig. 1 is that a kind of flow of the Job Scheduling method of the multiple target based on ant group algorithm provided in an embodiment of the present invention is shown
It is intended to；
Fig. 2 a be it is provided in an embodiment of the present invention it is a kind of current corresponding batch of ant is ranked up before schematic diagram；
Fig. 2 b be it is provided in an embodiment of the present invention it is a kind of current corresponding batch of ant is ranked up after schematic diagram；
Fig. 3 is a kind of Job Scheduling method of the multiple target based on ant group algorithm provided in an embodiment of the present invention relative to existing
There is the effect of optimization schematic diagram of technology；
Fig. 4 is that a kind of structure of the Job Scheduling device of the multiple target based on ant group algorithm provided in an embodiment of the present invention is shown
It is intended to.
Specific implementation mode
It elaborates below to the embodiment of the present invention, the present embodiment is carried out lower based on the technical solution of the present invention
Implement, gives detailed embodiment and specific operating process, but protection scope of the present invention is not limited to following implementation
Example.
To solve prior art problem, an embodiment of the present invention provides a kind of workpiece tune of the multiple target based on ant group algorithm
Spend method and device, first below just the multiple target provided in an embodiment of the present invention based on ant group algorithm Job Scheduling method into
Row is introduced.
Fig. 1 is that a kind of flow of the Job Scheduling method of the multiple target based on ant group algorithm provided in an embodiment of the present invention is shown
It is intended to；, as shown in Figure 1, the method includes：
S101：When previous iteration, the first preset quantity ant is established, in the first preset quantity ant
Current ant establishes empty batch.
Specifically, by taking first time iteration as an example, and using first time iteration as working as previous iteration.Start when previous iteration
When, establish a ant.Can be that every ant number is：1、2、3、……、a.Then the ant -1 that number is 1 is used as and is worked as
Preceding ant, for empty batch of this ant foundation, the identification information of the sky batch is to criticize -1.
It is understood that empty batch can be understood as a kind of tool pictograph formula criticized, it can includes to be scheduled wait for criticize
The sky of workpieces processing batch, and the sky for the workpiece to be processed that has not been scheduled are criticized.In addition, empty batch of capacity is not more than the appearance of process equipment
Amount；For example, the capacity of process equipment is the workpiece to be processed that can process 100 units, then empty batch of capacity can be less than or
Equal to the capacity of process equipment.In scheduling, the capacity of process equipment can be fully used, and can not also be fully used.
The size s of each workpiece to be processed can be differed.In addition, the step of establishing empty batch for a ant can be simultaneously
Row execute, can also since the 1st ant, according to ant number from small to large be sequence, carry out successively；It can also be from
The a ant starts, and according to the sequence from big to small of the number of ant, carries out successively；The embodiment of the present invention does not make this
Go out to limit.
S102：Obtain each target in the multiple target Pheromone Matrix and it is preset for it is described it is current only
The Target Preference vector of ant, and for each process equipment in the second preset quantity process equipment, obtain each target
With the product of corresponding Target Preference vector and minimum process equipment, and using the process equipment as current processing equipment；
Wherein, the target includes：Energy consumption, process time.
In practical applications, in first time iteration, the value of each element in the Pheromone Matrix of each target can be with
It is preset, the value being arranged between 0 to 1, for example, could be provided as 0.1；In addition to first time iteration its when previous
When iteration, when the Pheromone Matrix of previous iteration is the Pheromone Matrix when the last iteration of previous iteration.For example, the 8th time
The Pheromone Matrix of each target when iteration updated Pheromone Matrix when being the 7th iteration.
In addition, the Target Preference vector of current ant can be the preference that preset current ant is directed to each target
It is worth the one-dimensional matrix of composition, for example, current ant a has been directed to the corresponding preference amounts of duration ACan be 0.6, current ant
Ant a has been directed to the corresponding preference amounts of duration ACan be 0.4；And then byWithForm the Target Preference of current ant to
Amount
The value of the above preference amount illustrates, in the corresponding scheduling scheme of current ant, more stresses the duration that completes.
It should be noted that the value of the corresponding preference amount of each target of any ant and be 1.
S103：Described empty batch is currently criticized as the first of the current processing equipment；And by workpiece to be processed
One workpiece to be processed is dispatched in described first current batch；Will in the workpiece to be processed, except first workpiece to be processed it
The second outer workpiece to be processed is added described first and currently criticizes in corresponding current candidate list.
Specifically, can be by the workpiece to be processed, the second work to be processed in addition to first workpiece to be processed
Part is added described first and currently criticizes in corresponding current candidate list, while the size of each second workpiece to be processed is less than
The residual capacity of the current processing equipment；Wherein, the residual capacity of the current processing equipment is the current processing equipment
Total capacity and first workpiece to be processed overall size difference；
According to the Pheromone Matrix of the corresponding each target of every 1 second workpiece to be processed in the current candidate list, institute
State the pheromones weight of the corresponding each target of the second workpiece to be processed, second workpiece to be processed about completion duration
Heuristic information, calculates the probability that second workpiece to be processed is scheduled in described first current batch, and according to will be maximum
Corresponding second workpiece to be processed of the probability be dispatched in described first current batch；
Using the set of maximum second workpiece to be processed of the transition probability and first workpiece to be processed as first
Workpiece to be processed, and by the workpiece to be processed, the second workpiece to be processed in addition to first workpiece to be processed is added
Described first currently criticizes in corresponding candidate list, and currently criticizes corresponding candidate list using described first and arranged as current candidate
Table；And it returns and executes the information according to the corresponding each target of every 1 second workpiece to be processed in the current candidate list
Prime matrix, the pheromones weight of the corresponding each target of second workpiece to be processed, second workpiece to be processed about
The heuristic information of completion duration calculates the step for the probability that second workpiece to be processed is scheduled in described first current batch
Suddenly, until the described first residual capacity currently criticized is less than the size of any one of workpiece to be processed.
Specifically, formula can be utilized,Calculate the candidate artifacts collection
The second workpiece to be added in conjunction is dispatched to the described first selected probability currently criticized, wherein
For the Pheromone Matrix of target x, wxFor the corresponding pheromones weights of target x；ηki,uIt is added the c times for workpiece u
The heuristic information of k-th batch about machine complete duration of a ant of iteration on i-th machine；α and β is institute
The empirical value of setting；U is the identification information of the second workpiece to be added；K is the first number currently criticized；I is current processing equipment
Number；C is when the corresponding iterations of previous iteration；∑ is summing function；J is the number of the second workpiece to be processed；X is target
Number；CLkiSet for the second workpiece to be processed for including in the current candidate list.
Illustratively,
The first step：- 1 is criticized as the corresponding current processing equipment of ant -1, process equipment -1 by what is established in S101 steps
First current batch.Again workpiece -1 is randomly choosed in n workpiece to be processed to be dispatched in batch -1 as the first workpiece to be processed.
In being scheduled to batch -1 due to the workpiece -1 in n workpiece to be processed, it is a that n-1 is there remains in n workpiece to be processed
Workpiece to be processed.For batch -1 structure candidate list -1；It is added to candidate from remaining n-1 workpiece to be processed selection workpiece to be processed
In list -1.
The workpiece to be processed being added into candidate list -1 needs to meet：All second in candidate list -1 are to be processed
Residual capacity of the sum of the size of workpiece no more than process equipment -1, wherein residual capacity is the total capacity of process equipment -1
Subtract the capacity after being scheduled to the workpiece to be processed size of the process equipment.
Second step can utilize formula,Calculate the candidate list -1
The second workpiece to be added be dispatched to batch -1 selected probability, wherein
For the Pheromone Matrix of target x, wxFor the corresponding pheromones weights of target x；ηki,uFor the second workpiece to be processed u
The heuristic information of k-th batch about machine complete duration of a ant of the c times iteration on i-th machine is added,
C values are 1, a values be 1, i values be 1, k values are 1；α and β is set empirical value；U is the mark of the second workpiece to be added
Know information；K is the number for criticizing -1；I is the number of current processing equipment；C is when the corresponding iterations of previous iteration；∑ is to ask
And function；J is the number of the second workpiece to be processed；X is the number of target, and the value range of x is 1 and 2；CLkiIt is described current
The set for the second workpiece to be processed for including in candidate list.
Third walks：
After the completion of the transition probability of the second all workpieces to be processed calculates in current candidate list, candidate list -1,
The second workpieces to be processed of j that the maximum number of transition probability is are dispatched in criticizing -1, since the second workpiece to be processed j is scheduled
To in batch -1, then new batch -1 corresponding first workpiece to be processed contains the second workpiece to be processed j and first waiting for before
Workpieces processing.By in not scheduled workpiece to be processed, the second workpiece to be processed in addition to the first workpiece to be processed is added the
One currently criticizes in corresponding new candidate list -2, and, each the second workpiece to be processed in the new candidate list -2
Size is less than the new residual capacity for criticizing -1；New is criticized -1 as first current batch, by new candidate list -2 as currently
Candidate list.In practical applications can by new candidate list -2 as the current candidate list in next step, that is,
Candidate list -1, and the step of executing aforementioned third step is returned, until the described first residual capacity currently criticized is less than any one
The size of a workpiece to be processed.
It is understood that the first residual capacity currently criticized is less than the size of any workpiece to be processed, it can
Think, the first residual capacity currently criticized is zero；Or first the residual capacity currently criticized not enough accommodate any one described in wait for
Workpieces processing.
S104：Judge whether the workpiece to be processed not being scheduled；If so, executing S101；If it is not, executing S105：.
Illustratively, after for -1 scheduling process is criticized, judge the work to be processed for being whether to have not scheduled
Part, if so, executing S105 steps.
S105：By in the first preset quantity ant, an ant in addition to the current ant is as current
Ant, and return and execute the step of current ant in the first preset quantity ant establishes empty batch, until institute
It is all scheduled to state the corresponding workpiece to be processed of the first preset quantity ant.
Illustratively, by the next ant of ant -1, ant -2 is used as current ant, and returns and execute S101 steps
Suddenly.Until the corresponding workpiece to be processed of the first preset quantity ant is all scheduled.
For example, the corresponding n workpiece to be processed of ant -1, n workpiece to be processed are all scheduled to corresponding batch of ant -1
In；Similar, each workpieces to be processed of the corresponding n of ant -2 are all scheduled in corresponding batch of ant -2.
In a kind of specific implementation mode of the embodiment of the present invention, this is right according to the sequence of the arrival time criticized from small to large
Corresponding batch of the current ant is ranked up.
Illustratively, Fig. 2 a be it is provided in an embodiment of the present invention it is a kind of current corresponding batch of ant is ranked up before
Schematic diagram, as shown in Figure 2 a, t are time shaft.After the completion of current ant corresponds to n workpiece to be processed and be all scheduled, n are waited for
Workpieces processing has been scheduled in five batches, and wherein has crowd B in five batches11, crowd B21It is scheduled to process equipment M1；And M1's
Processing sequence is crowd B11, crowd B21；Criticize B11Arrival time be 3, crowd B21Reach the time be 12.Criticize B12, crowd B22, crowd B32It is adjusted
It spends to process equipment M2；And M2Processing sequence be crowd B12, crowd B22, crowd B32；Criticize B12Arrival time be 5, crowd B22Arrival when
Between for 2, crowd B32Arrival time be 3.
It is understood that arrival time, which is workpiece to be processed, is scheduled to taking for process equipment.
Fig. 2 b be it is provided in an embodiment of the present invention it is a kind of current corresponding batch of ant is ranked up after schematic diagram, figure
Shown in 2b, the sequence criticized after sorting according to arrival time is：
Process equipment M1：Criticize B22, crowd B32, crowd B12；
Process equipment M2：B11, crowd B21。
Using the above embodiment of the present invention, criticizing for the corresponding each process equipment of each ant can be ranked up,
And then preferentially process arrival time it is short batch, shorten processing duration.
S106：It will be when the completion duration minimum value obtained in previous iterative process and the owning before previous iteration
Smaller value in the completion duration minimum value obtained in iterative process, as described when the corresponding global optimum's completion of previous iteration
Duration；It will be obtained with all iterative process before previous iteration when the energy consumption minimum value obtained in previous iterative process
To energy consumption minimum value in smaller value, as it is described work as the corresponding global optimum's energy consumption of previous iteration.
Illustratively, the corresponding completion duration of each ant in the 10th iterative process is calculated, for example, completion duration is most
Short is ant -4；Then by the completion duration of ant -4 compared with the minimum value of the completion duration in preceding 9 iterative process, if ant
The completion duration of ant -4 is most short then using the corresponding completion duration of ant -4 as the 10th corresponding global optimum of iteration complete working hour
It is long；If the completion duration of ant -4 is more than, the completion duration in preceding 9 iterative process, then by the completion in preceding 9 iterative process
Duration is as the corresponding global optimum's completion duration of the 10th iteration.
It is similar, in the 10th iterative process the corresponding power consumption values of each ant also handle in the manner described above.
It is understood that global optimum's power consumption values are, the minimum in all secondary iterative process before previous iteration
Power consumption values；Similar, complete working hour is a length of, the minimum completion duration in all secondary iterative process before previous iteration.
S107：Will it is described when in previous iterative process the corresponding scheduling scheme of all ants work as previous iteration mistake as described
The disaggregation of journey.
In a kind of specific implementation mode of the embodiment of the present invention, described it can will work as all ants in previous iterative process
Corresponding scheduling scheme is as the disaggregation for working as previous iterative process；It is concentrated from the solution and deletes Pareto by domination solution correspondence
Scheduling scheme, the Pareto will be deleted and dominated the disaggregation after solving corresponding scheduling scheme as described when previous iteration mistake
The disaggregation of journey.
S108：According to when the corresponding Pheromone Matrix of previous iteration, global information element rate of volatilization and working as previous iteration
The set of corresponding solution, Pheromone Matrix of the update when the next iteration of previous iteration.
Specifically, formula can be utilized,Update
When the Pheromone Matrix of the next iteration of previous iteration, wherein
For when the corresponding Pheromone Matrix of the next iteration of previous iteration；ρgFor global information element volatility；To work as the corresponding Pheromone Matrix of previous iteration；For in previous iteration, workpiece v divides with workpiece j same
The inverse of one batch of obtained desired value；NDS is the set of the corresponding solution of the c times iteration；Sol is the solution in the set of solution；C is
When the corresponding iterations of previous iteration.
S109：Judge described when whether the corresponding iterations of previous iteration are equal to the second predetermined threshold value；If it is not, executing
S1010；If so, executing S1011.
Illustratively, it according to the iterations when previous iteration, compares, is judged when previous iteration with the second predetermined threshold value
Whether iterations are equal to the second predetermined threshold value, if so, explanation, iterations have had reached maximum iteration, execute
S1012 steps；If it is not, illustrating that iterations are also not up to maximum iteration, S1011 steps are executed.
S1010：By when the corresponding iterations of previous iteration and the first predetermined threshold value and as when previous iteration it is corresponding
Iterations, and return execute S101 steps.
Illustratively, when the corresponding iterations of previous iteration be 1, if preset value be 1, using 1-2=2 as first
The iterations of the next iteration of secondary iteration, and return and execute S101 steps.
In practical applications, the corresponding iterations of first time iteration can be indicated with 100, and second of iteration is corresponding repeatedly
Generation number can indicate that the corresponding iterations of third time iteration can be indicated with 700 with 400, and corresponding preset value is 300.
The embodiment of the present invention is not defined the characteristic manner of iterations.
S1011：Global optimum's completion duration and the corresponding dispatching party of global optimum's energy consumption in previous iterative process will be worked as
Case is as target dispatch method.
Illustratively, if the 45th iteration is maximum iteration, when by the 45th iteration optimal completion duration with
And the ant of global optimum's energy consumption minimum is corresponding, the correspondence of workpiece to be processed and process equipment is as target dispatch side
Method.
It is understood that since completion duration and energy consumption are respectively provided with corresponding weight, it is obtained in S1011 steps
The target dispatch method obtained has the optimum balance of completion duration and energy consumption.Certainly, in practical applications, it can be completion duration
Larger weight is set, to obtain the shorter target dispatch method of completion duration.
In practical applications, can also using when the corresponding dispatching method of the set of the solution obtained in previous iterative process as
Target dispatch method.
Fig. 3 is a kind of Job Scheduling method of the multiple target based on ant group algorithm provided in an embodiment of the present invention relative to existing
There is the effect of optimization schematic diagram of technology, as shown in figure 3, the 301 Job Scheduling method to be obtained using the embodiment of the present invention corresponds to
Energy consumption and processing duration；The 302 corresponding energy consumption of Job Scheduling method and processing duration to be obtained using the prior art, wherein
Horizontal axis is completion date；The longitudinal axis is machine energy consumption.Obviously, using the embodiment of the present invention, compared with the existing technology, machine is reduced
Energy consumption and processing duration.
Further it will be understood that 301 be the one group of non-domination solution obtained using the embodiment of the present invention, relative to application
The solution 302 that the prior art obtains, the non-domination solution obtained using the embodiment of the present invention it is more, and 302 corresponding solutions are all
It is dominated by the solution in 301, that is, applies the quality higher of the solution of acquisition of the embodiment of the present invention.
It is emphasized that machine energy consumption refers to, the corresponding institute of target dispatch method obtained using the embodiment of the present invention
There is the sum of the energy consumption of process equipment；Completion date refers to being processed to the last one batch at the time of processing first batch is corresponding certainly
At it is corresponding at the time of between duration.
Using embodiment illustrated in fig. 1 of the present invention, by the way that Target Preference vector is arranged for each target, then according to setting
Empty batch of corresponding process equipment of Target Preference vector selection, can filter out the process equipment for carrying out multiple-objection optimization, Jin Ershi
The Multiobjective Scheduling of workpiece is showed.
Corresponding with embodiment illustrated in fig. 1 of the present invention, the embodiment of the present invention additionally provides a kind of based on the more of ant group algorithm
The Job Scheduling device of target.
Fig. 4 is that a kind of structure of the Job Scheduling device of the multiple target based on ant group algorithm provided in an embodiment of the present invention is shown
It is intended to, as shown in figure 4, described device includes：Establish module 201, acquisition module 202, scheduler module 203, the first judgment module
204, the first setup module 205, the second setup module 206, third setup module 207, update module 208, the second judgment module
209, the 4th setup module 2010 and the 5th setup module 2011, wherein
It is described to establish module 201, it is pre- for first for when previous iteration, establishing the first preset quantity ant
If current ant in quantity ant establishes empty batch；
The acquisition module 202, Pheromone Matrix for obtaining each target in the multiple target and preset
For the Target Preference vector of the current ant, and set for each processing in the second preset quantity process equipment
It is standby, each target and the product of corresponding Target Preference vector and minimum process equipment are obtained, and the process equipment is made
For current processing equipment；Wherein, the target includes：Energy consumption, process time；
The scheduler module 203, for currently criticizing described empty batch as the first of the current processing equipment；And it will wait for
The first workpiece to be processed in workpieces processing is dispatched in described first current batch；It will be in the workpiece to be processed, except described the
The second workpiece to be processed except one workpiece to be processed is added described first and currently criticizes in corresponding current candidate list；
First judgment module 204, for judging whether the workpiece to be processed not being scheduled；If so, triggering institute
It states and establishes module 201；If it is not, triggering first setup module 205；
First setup module 205, for by the first preset quantity ant, in addition to the current ant
One ant triggers as current ant and establishes module 201, until the first preset quantity ant is corresponding to be added
Work workpiece is all scheduled；
Second setup module 206, for will work as the completion duration minimum value obtained in previous iterative process with it is described
Smaller value in the completion duration minimum value obtained in all iterative process before previous iteration changes as described when previous
For corresponding global optimum completion duration；By when the energy consumption minimum value that is obtained in previous iterative process with it is described when previous iteration it
Smaller value in the energy consumption minimum value obtained in preceding all iterative process works as the corresponding global optimum of previous iteration as described
Energy consumption；
The third setup module 207, being used for will be described when the corresponding scheduling scheme of all ants in previous iterative process
As the disaggregation when previous iterative process；
The update module 208, for according to when the corresponding Pheromone Matrix of previous iteration, global information element rate of volatilization
And the set when the corresponding solution of previous iteration, Pheromone Matrix of the update when the next iteration of previous iteration；
Second judgment module 209, it is described when whether the corresponding iterations of previous iteration are equal to second for judging
Predetermined threshold value；If it is not, triggering the 4th setup module 2010；If so, triggering the 5th setup module 2011, wherein
4th setup module 2010, for will work as the corresponding iterations of previous iteration and the first predetermined threshold value and
As when the corresponding iterations of previous iteration, and triggers and described establish module 201；
5th setup module 2011, for will work as in previous iterative process global optimum's completion duration and it is global most
The corresponding scheduling scheme of excellent energy consumption is as target dispatch method.
Using embodiment illustrated in fig. 4 of the present invention, by the way that Target Preference vector is arranged for each target, then according to setting
Empty batch of corresponding process equipment of Target Preference vector selection, can filter out the process equipment for carrying out multiple-objection optimization, Jin Ershi
The Multiobjective Scheduling of workpiece is showed.
In a kind of specific implementation mode of the embodiment of the present invention, the scheduler module 203 is additionally operable to：
By in the workpiece to be processed, the second workpiece to be processed in addition to first workpiece to be processed is added described the
One currently criticizes in corresponding current candidate list, while the size of each second workpiece to be processed is less than the current processing
The residual capacity of equipment；Wherein, total capacity and institute of the residual capacity of the current processing equipment for the current processing equipment
State the difference of the overall size of the first workpiece to be processed；
According to the Pheromone Matrix of the corresponding each target of every 1 second workpiece to be processed in the current candidate list, institute
State the pheromones weight of the corresponding each target of the second workpiece to be processed, second workpiece to be processed about completion duration
Heuristic information, calculates the probability that second workpiece to be processed is scheduled in described first current batch, and according to will be maximum
Corresponding second workpiece to be processed of the probability be dispatched in described first current batch；
Using the set of maximum second workpiece to be processed of the transition probability and first workpiece to be processed as first
Workpiece to be processed, and by the workpiece to be processed, the second workpiece to be processed in addition to first workpiece to be processed is added
Described first currently criticizes in corresponding candidate list, and currently criticizes corresponding candidate list using described first and arranged as current candidate
Table；And it returns and executes the information according to the corresponding each target of every 1 second workpiece to be processed in the current candidate list
Prime matrix, the pheromones weight of the corresponding each target of second workpiece to be processed, second workpiece to be processed about
The heuristic information of completion duration calculates the step for the probability that second workpiece to be processed is scheduled in described first current batch
Suddenly, until the described first residual capacity currently criticized is less than the size of any one of workpiece to be processed.
In a kind of specific implementation mode of the embodiment of the present invention, the scheduler module 203 is additionally operable to：
Using formula,Second calculated in the candidate artifacts set is waited for
Workpiece is dispatched to the described first selected probability currently criticized, wherein
For the Pheromone Matrix of target x, wxFor the corresponding pheromones weights of target x；ηki,uIt is added the c times for workpiece u
The heuristic information of k-th batch about machine complete duration of a ant of iteration on i-th machine；α and β is institute
The empirical value of setting；U is the identification information of the second workpiece to be added；K is the first number currently criticized；I is current processing equipment
Number；C is when the corresponding iterations of previous iteration；∑ is summing function；J is the number of the second workpiece to be processed；X is target
Number；CLkiSet for the second workpiece to be processed for including in the current candidate list.
In a kind of specific implementation mode of the embodiment of the present invention, the update module 208 is additionally operable to：
Using formula,Previous iteration is worked as in update
Next iteration Pheromone Matrix, wherein
For when the corresponding Pheromone Matrix of the next iteration of previous iteration；ρgFor global information element volatility；To work as the corresponding Pheromone Matrix of previous iteration；For in previous iteration, workpiece v divides with workpiece j same
The inverse of one batch of obtained desired value；NDS is the set of the corresponding solution of the c times iteration；Sol is the solution in the set of solution；C is
When the corresponding iterations of previous iteration.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all essences in the present invention
All any modification, equivalent and improvement etc., should all be included in the protection scope of the present invention made by within refreshing and principle.
Claims (10)
1. a kind of Job Scheduling method of the multiple target based on ant group algorithm, which is characterized in that the method includes：
When previous iteration, the first preset quantity ant is established, for current ant in the first preset quantity ant
Ant establishes empty batch；
Obtain the Pheromone Matrix of each target in the multiple target and the preset target for the current ant
Preference vector, and for each process equipment in the second preset quantity process equipment, obtain each target and corresponding mesh
The product of preference vector and minimum process equipment is marked, and using the process equipment as current processing equipment；Wherein, the mesh
Mark includes：Energy consumption, process time；
Described empty batch is currently criticized as the first of the current processing equipment；And by the first work to be processed in workpiece to be processed
Part is dispatched in described first current batch；By in the workpiece to be processed, second in addition to first workpiece to be processed waits for
Workpieces processing is added described first and currently criticizes in corresponding current candidate list；
Judge whether the workpiece to be processed not being scheduled；
The step of current ant in the first preset quantity ant establishes empty batch is executed if so, returning；Until
The workpiece to be processed is all scheduled in corresponding batch of the current ant；
If it is not, by the first preset quantity ant, an ant in addition to the current ant as current ant,
And return and execute the step of current ant in the first preset quantity ant establishes empty batch, until described first
The corresponding workpiece to be processed of preset quantity ant is all scheduled；
It will be when the completion duration minimum value obtained in previous iterative process and all iterative process before previous iteration
In smaller value in obtained completion duration minimum value, as described when the corresponding global optimum of previous iteration completes duration；It will
When the energy obtained in the energy consumption minimum value and all iterative process before previous iteration obtained in previous iterative process
The smaller value in minimum value is consumed, works as the corresponding global optimum's energy consumption of previous iteration as described；
Using the corresponding scheduling scheme of all in previous iterative process ants as the disaggregation when previous iterative process；
According to when the corresponding Pheromone Matrix of previous iteration, global information element rate of volatilization and when the corresponding solution of previous iteration
Set, Pheromone Matrix of the update when the next iteration of previous iteration；
Judge described when whether the corresponding iterations of previous iteration are equal to the second predetermined threshold value；
If it is not, by when the corresponding iterations of previous iteration and the first predetermined threshold value and as when the corresponding iteration of previous iteration
Number, and it is described when previous iteration to return to execution, the first preset quantity ant is established, for the first preset quantity ant
The step of current ant in ant establishes empty batch；
If so, global optimum's completion duration and the corresponding scheduling scheme conduct of global optimum's energy consumption in previous iterative process will be worked as
Target dispatch method.
2. a kind of multiple target Job Scheduling method based on ant group algorithm according to claim 1, which is characterized in that described
By in the workpiece to be processed, the second workpiece to be processed in addition to first workpiece to be processed is added described first current batch
In corresponding current candidate list, including：
By in the workpiece to be processed, the second workpiece to be processed in addition to first workpiece to be processed is added described first and works as
In preceding batch of corresponding current candidate list, and the size of each second workpiece to be processed is less than the current processing equipment
Residual capacity；Wherein, the residual capacity of the current processing equipment is the total capacity and described first of the current processing equipment
The difference of the overall size of workpiece to be processed；
According to the Pheromone Matrix of the corresponding each target of every 1 second workpiece to be processed in the current candidate list, described
The pheromones weight of the corresponding each target of two workpieces to be processed, the inspiration about completion duration of second workpiece to be processed
Formula information, calculates the probability that second workpiece to be processed is scheduled in described first current batch, and according to by maximum institute
Corresponding second workpiece to be processed of probability is stated to be dispatched in described first current batch；
Maximum second workpiece to be processed of the transition probability and the set of first workpiece to be processed is to be added as first
Work workpiece, and by the workpiece to be processed, described in the second workpiece to be processed in addition to first workpiece to be processed is added
First currently criticizes in corresponding candidate list, and currently criticizes corresponding candidate list as current candidate list using described first；
And it returns and executes the pheromones according to the corresponding each target of every 1 second workpiece to be processed in the current candidate list
Matrix, the pheromones weight of the corresponding each target of second workpiece to be processed, second workpiece to be processed about complete
The heuristic information of working hour length calculates the step for the probability that second workpiece to be processed is scheduled in described first current batch
Suddenly, until the described first residual capacity currently criticized is less than the size of any one of workpiece to be processed.
3. a kind of multiple target Job Scheduling method based on ant group algorithm according to claim 2, which is characterized in that described
It is waited for according to the Pheromone Matrix of the corresponding each target of every 1 second workpiece to be processed in the current candidate list, described second
The pheromones weight of the corresponding each target of workpieces processing, the heuristic letter about completion duration of second workpiece to be processed
Breath calculates the probability that second workpiece to be processed is scheduled in described first current batch, including：
Using formula,It calculates second to be processed in the candidate artifacts set
Part is dispatched to the described first selected probability currently criticized, wherein
For the Pheromone Matrix of target x, wxFor the corresponding pheromones weights of target x；ηki,uThe c times iteration is added for workpiece u
K-th batch on i-th machine of a ant the duration that completes about machine heuristic information；α and β is set
Empirical value；U is the identification information of the second workpiece to be added；K is the first number currently criticized；I is the number of current processing equipment；
C is when the corresponding iterations of previous iteration；∑ is summing function；J is the number of the second workpiece to be processed；X is the volume of target
Number；CLkiSet for the second workpiece to be processed for including in the current candidate list.
4. a kind of multiple target Job Scheduling method based on ant group algorithm according to claim 3, which is characterized in that described
According to when the corresponding Pheromone Matrix of previous iteration, global information element rate of volatilization and collection when the corresponding solution of previous iteration
It closing, the Pheromone Matrix of the next iteration of previous iteration is worked as in update, including：
Using formula,Update is when under previous iteration
The Pheromone Matrix of an iteration, wherein
For when the corresponding Pheromone Matrix of the next iteration of previous iteration；ρgFor global information element volatility；
To work as the corresponding Pheromone Matrix of previous iteration；For in previous iteration, workpiece v divides with workpiece j at same batch
The inverse of obtained desired value；NDS is the set of the corresponding solution of the c times iteration；Sol is the solution in the set of solution；C is when previous
The corresponding iterations of iteration.
5. a kind of multiple target Job Scheduling method based on ant group algorithm according to claim 1, which is characterized in that in institute
State the workpiece to be processed for judging whether not to be scheduled judging result be it is no in the case of, the method further includes：
This is ranked up corresponding batch of the current ant according to the sequence of the arrival time criticized from small to large.
6. a kind of multiple target Job Scheduling method based on ant group algorithm according to claim 1, which is characterized in that described
Using the corresponding scheduling scheme of all in previous iterative process ants as the disaggregation for working as previous iterative process, wrap
It includes：
Using the corresponding scheduling scheme of all in previous iterative process ants as the disaggregation when previous iterative process；
It is concentrated from the solution and deletes Pareto by the corresponding scheduling scheme of domination solution, the Pareto will deleted, corresponding tune is solved by domination
Disaggregation after degree scheme is as the disaggregation for working as previous iterative process.
7. a kind of Job Scheduling device of the multiple target based on ant group algorithm, which is characterized in that described device includes：Establish mould
Block, acquisition module, scheduler module, the first judgment module, the first setup module, the second setup module, third setup module, update
Module, the second judgment module, the 4th setup module and the 5th setup module, wherein
It is described to establish module, for when previous iteration, establishing the first preset quantity ant, for the first preset quantity
Current ant in ant establishes empty batch；
The acquisition module, Pheromone Matrix for obtaining each target in the multiple target and preset is directed to institute
The Target Preference vector of current ant is stated, and for each process equipment in the second preset quantity process equipment, is obtained
Each target and the product of corresponding Target Preference vector and minimum process equipment, and using the process equipment as currently adding
Construction equipment；Wherein, the target includes：Energy consumption, process time；
The scheduler module, for currently criticizing described empty batch as the first of the current processing equipment；And by work to be processed
The first workpiece to be processed in part is dispatched in described first current batch；By in the workpiece to be processed, it is to be added to remove described first
The second workpiece to be processed except work workpiece is added described first and currently criticizes in corresponding current candidate list；
First judgment module, for judging whether the workpiece to be processed not being scheduled；If so, triggering is described to establish mould
Block；If it is not, triggering first setup module；
First setup module, for by the first preset quantity ant, an ant in addition to the current ant
Ant as current ant, and trigger it is described establish module, until the corresponding work to be processed of the first preset quantity ant
Part is all scheduled；
Second setup module changes with described when previous for that will work as the completion duration minimum value obtained in previous iterative process
Smaller value in the completion duration minimum value obtained in all iterative process before instead of, as described when previous iteration is corresponding
Global optimum's completion duration；It will be when the energy consumption minimum value obtained in previous iterative process and the owning before previous iteration
Smaller value in the energy consumption minimum value obtained in iterative process works as the corresponding global optimum's energy consumption of previous iteration as described；
The third setup module, for will be described described in the corresponding scheduling scheme of all ants is used as in previous iterative process
When the disaggregation of previous iterative process；
The update module when the corresponding Pheromone Matrix of previous iteration, global information element rate of volatilization and is worked as basis
The set of the corresponding solution of previous iteration, Pheromone Matrix of the update when the next iteration of previous iteration；
Second judgment module, it is described when whether the corresponding iterations of previous iteration are equal to the second default threshold for judging
Value；If it is not, triggering the 4th setup module；If so, triggering the 5th setup module, wherein
4th setup module, for will work as the corresponding iterations of previous iteration and the first predetermined threshold value and as current
The corresponding iterations of secondary iteration, and trigger and described establish module；
5th setup module, for global optimum's completion duration and global optimum's energy consumption pair in previous iterative process will to be worked as
The scheduling scheme answered is as target dispatch method.
8. a kind of multiple target Job Scheduling device based on ant group algorithm according to claim 7, which is characterized in that described
Scheduler module is additionally operable to：
By in the workpiece to be processed, the second workpiece to be processed in addition to first workpiece to be processed is added described first and works as
In preceding batch of corresponding current candidate list, while the size of each second workpiece to be processed is less than the current processing equipment
Residual capacity；Wherein, the residual capacity of the current processing equipment is the total capacity and described the of the current processing equipment
The difference of the overall size of one workpiece to be processed；
According to the Pheromone Matrix of the corresponding each target of every 1 second workpiece to be processed in the current candidate list, described
The pheromones weight of the corresponding each target of two workpieces to be processed, the inspiration about completion duration of second workpiece to be processed
Formula information, calculates the probability that second workpiece to be processed is scheduled in described first current batch, and according to by maximum institute
Corresponding second workpiece to be processed of probability is stated to be dispatched in described first current batch；
Maximum second workpiece to be processed of the transition probability and the set of first workpiece to be processed is to be added as first
Work workpiece, and by the workpiece to be processed, described in the second workpiece to be processed in addition to first workpiece to be processed is added
First currently criticizes in corresponding candidate list, and currently criticizes corresponding candidate list as current candidate list using described first；
And it returns and executes the pheromones according to the corresponding each target of every 1 second workpiece to be processed in the current candidate list
Matrix, the pheromones weight of the corresponding each target of second workpiece to be processed, second workpiece to be processed about complete
The heuristic information of working hour length calculates the step for the probability that second workpiece to be processed is scheduled in described first current batch
Suddenly, until the described first residual capacity currently criticized is less than the size of any one of workpiece to be processed.
9. a kind of multiple target Job Scheduling device based on ant group algorithm according to claim 8, which is characterized in that described
Scheduler module is additionally operable to：
Using formula,It calculates second to be processed in the candidate artifacts set
Part is dispatched to the described first selected probability currently criticized, wherein
For the Pheromone Matrix of target x, wxFor the corresponding pheromones weights of target x；ηki,uThe c times iteration is added for workpiece u
K-th batch on i-th machine of a ant the duration that completes about machine heuristic information；α and β is set
Empirical value；U is the identification information of the second workpiece to be added；K is the first number currently criticized；I is the number of current processing equipment；
C is when the corresponding iterations of previous iteration；∑ is summing function；J is the number of the second workpiece to be processed；X is the volume of target
Number；CLkiSet for the second workpiece to be processed for including in the current candidate list.
10. a kind of multiple target Job Scheduling device based on ant group algorithm according to claim 9, which is characterized in that institute
Update module is stated, is additionally operable to：
Using formula,Update is when under previous iteration
The Pheromone Matrix of an iteration, wherein
For when the corresponding Pheromone Matrix of the next iteration of previous iteration；ρgFor global information element volatility；
To work as the corresponding Pheromone Matrix of previous iteration；For in previous iteration, workpiece v divides with workpiece j at same batch
The inverse of obtained desired value；NDS is the set of the corresponding solution of the c times iteration；Sol is the solution in the set of solution；C is when previous
The corresponding iterations of iteration.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810289311.2A CN108563200B (en) | 2018-04-03 | 2018-04-03 | Multi-target workpiece scheduling method and device based on ant colony algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810289311.2A CN108563200B (en) | 2018-04-03 | 2018-04-03 | Multi-target workpiece scheduling method and device based on ant colony algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108563200A true CN108563200A (en) | 2018-09-21 |
| CN108563200B CN108563200B (en) | 2021-02-09 |
Family
ID=63533982
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810289311.2A Active CN108563200B (en) | 2018-04-03 | 2018-04-03 | Multi-target workpiece scheduling method and device based on ant colony algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108563200B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109872091A (en) * | 2019-04-18 | 2019-06-11 | 安徽大学 | A kind of Job Scheduling method and device based on ant group algorithm |
| CN110161997A (en) * | 2019-06-12 | 2019-08-23 | 安徽大学 | Flow-shop scheduling and device based on ant colony and simulated annealing |
| CN110942251A (en) * | 2019-11-27 | 2020-03-31 | 安徽大学 | Batch scheduling method based on joint ant colony algorithm |
| CN111160711A (en) * | 2019-12-06 | 2020-05-15 | 安徽大学 | Parallel machine batch scheduling method based on ant colony algorithm |
| CN111210125A (en) * | 2019-12-27 | 2020-05-29 | 安徽大学 | Multi-target workpiece batch scheduling method and device based on historical information guidance |
| CN112817319A (en) * | 2021-01-08 | 2021-05-18 | 刘连英 | AGV dispatching method and system and computer readable storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20110116568A (en) * | 2010-04-19 | 2011-10-26 | 목포대학교산학협력단 | Routing method based on spanning tree in wireless sensor and actor network |
| CN105117795A (en) * | 2015-08-12 | 2015-12-02 | 安徽大学 | Dynamic feed combination selection system and selection method based on ant colony algorithm |
| CN105528675A (en) * | 2015-12-04 | 2016-04-27 | 合肥工业大学 | Production distribution scheduling method based on ant colony algorithm |
| CN106970604A (en) * | 2017-05-15 | 2017-07-21 | 安徽大学 | Multi-target workpiece scheduling algorithm based on ant colony algorithm |
| CN107330561A (en) * | 2017-07-05 | 2017-11-07 | 青岛大学附属医院 | A kind of multiple target bank bridge berth scheduling optimization method based on ant group algorithm |
-
2018
- 2018-04-03 CN CN201810289311.2A patent/CN108563200B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20110116568A (en) * | 2010-04-19 | 2011-10-26 | 목포대학교산학협력단 | Routing method based on spanning tree in wireless sensor and actor network |
| CN105117795A (en) * | 2015-08-12 | 2015-12-02 | 安徽大学 | Dynamic feed combination selection system and selection method based on ant colony algorithm |
| CN105528675A (en) * | 2015-12-04 | 2016-04-27 | 合肥工业大学 | Production distribution scheduling method based on ant colony algorithm |
| CN106970604A (en) * | 2017-05-15 | 2017-07-21 | 安徽大学 | Multi-target workpiece scheduling algorithm based on ant colony algorithm |
| CN107330561A (en) * | 2017-07-05 | 2017-11-07 | 青岛大学附属医院 | A kind of multiple target bank bridge berth scheduling optimization method based on ant group algorithm |
Non-Patent Citations (1)
| Title |
|---|
| 葛君伟 等: ""一种基于改进蚁群算法的多目标优化云计算任务调度策略"", 《微电子学与计算机》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109872091A (en) * | 2019-04-18 | 2019-06-11 | 安徽大学 | A kind of Job Scheduling method and device based on ant group algorithm |
| CN110161997A (en) * | 2019-06-12 | 2019-08-23 | 安徽大学 | Flow-shop scheduling and device based on ant colony and simulated annealing |
| CN110161997B (en) * | 2019-06-12 | 2021-11-05 | 安徽大学 | Flow shop scheduling method and device based on ant colony and simulated annealing algorithm |
| CN110942251A (en) * | 2019-11-27 | 2020-03-31 | 安徽大学 | Batch scheduling method based on joint ant colony algorithm |
| CN110942251B (en) * | 2019-11-27 | 2022-09-30 | 安徽大学 | Batch scheduling method based on joint ant colony algorithm |
| CN111160711A (en) * | 2019-12-06 | 2020-05-15 | 安徽大学 | Parallel machine batch scheduling method based on ant colony algorithm |
| CN111210125A (en) * | 2019-12-27 | 2020-05-29 | 安徽大学 | Multi-target workpiece batch scheduling method and device based on historical information guidance |
| CN111210125B (en) * | 2019-12-27 | 2022-10-11 | 安徽大学 | Multi-target workpiece batch scheduling method and device based on historical information guidance |
| CN112817319A (en) * | 2021-01-08 | 2021-05-18 | 刘连英 | AGV dispatching method and system and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108563200B (en) | 2021-02-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108563200A (en) | A kind of Job Scheduling method and device of the multiple target based on ant group algorithm | |
| CN108665139A (en) | A kind of Job Scheduling method and device based on ant group algorithm | |
| CN106970604B (en) | Multi-target workpiece scheduling algorithm based on ant colony algorithm | |
| Chaudhry et al. | Minimizing total tardiness for the machine scheduling and worker assignment problems in identical parallel machines using genetic algorithms | |
| CN105892994B (en) | A kind of mobile robot mission planning is with performing abnormal conditions processing method and processing device | |
| CN110969362A (en) | Multi-target task scheduling method and system under cloud computing system | |
| CN110389816A (en) | Method, apparatus and computer program product for scheduling of resource | |
| CN109255546A (en) | Flexible job shop scheduling method based on more heuristic information Ant ColonySystems | |
| CN108762927A (en) | The multiple target method for scheduling task of mobile cloud computing | |
| CN106412067A (en) | Data layered generation method based on fuzzy testing of industrial control protocol | |
| Chaves et al. | Hybrid metaheuristic for the assembly line worker assignment and balancing problem | |
| CN106940662A (en) | A kind of multi-task planning method of mobile terminal | |
| Pongchairerks | Particle swarm optimization algorithm applied to scheduling problems | |
| Chatterjee et al. | Work capacity of freelance markets: Fundamental limits and decentralized schemes | |
| Yan et al. | Modified bottleneck-based heuristic for large-scale job-shop scheduling problems with a single bottleneck | |
| Hurkens | Incorporating the strength of MIP modeling in schedule construction | |
| Kumar et al. | Comparing the effectiveness of workload balancing objectives in FMS loading | |
| Akyol et al. | Multi-machine earliness and tardiness scheduling problem: an interconnected neural network approach | |
| CN104915250B (en) | It is a kind of to realize the method for making MapReduce data localization in the industry | |
| Teppan | Dispatching rules revisited-a large scale job shop scheduling experiment | |
| CN110990130A (en) | Reproducible self-adaptive computation unloading layered service quality optimization method | |
| Rokou et al. | Multi-project flexible resource profiles project scheduling with Ant Colony Optimization | |
| Dhingra et al. | Hybrid genetic algorithm for multicriteria scheduling with sequence dependent set up time | |
| CN110297704B (en) | Particle swarm optimization method and system integrating reverse learning and heuristic perception | |
| Morandin et al. | An adaptive genetic algorithm based approach for production reactive scheduling of manufacturing systems |
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 |