CN105512753A - Hybrid harmony search-based flexible job shop scheduling method - Google Patents
Hybrid harmony search-based flexible job shop scheduling method Download PDFInfo
- Publication number
- CN105512753A CN105512753A CN201510855677.8A CN201510855677A CN105512753A CN 105512753 A CN105512753 A CN 105512753A CN 201510855677 A CN201510855677 A CN 201510855677A CN 105512753 A CN105512753 A CN 105512753A
- Authority
- CN
- China
- Prior art keywords
- solution
- scheduling
- fjss
- harmony
- search
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/04—Manufacturing
-
- 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/30—Computing systems specially adapted for manufacturing
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Health & Medical Sciences (AREA)
- Manufacturing & Machinery (AREA)
- Development Economics (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to a hybrid harmony search-based flexible job shop scheduling method. The hybrid harmony search-based flexible job shop scheduling method comprises the following steps that: 1) solution vectors of FJSS (flexible job shop scheduling) to be solved are defined; 2) solution vectors in harmony search are converted into codes of feasible solutions of the FJSS; 3) a harmony search algorithm framework is adopted to perform harmony search, at firstly, a plurality of solution vectors are initialized randomly, and the maximum number of iterations is set, and at each iteration, a new solution vector is generated through harmony search; 4) the new solution vectors are converted into corresponding scheduling solutions, and the scheduling solutions are expressed by disjunctive graphs; 5) after the new scheduling solutions are generated, public key operation-based local search which is put forwards is executed with a certain probability based on the disjunctive graphs, and the disjunctive graphs are adjusted through the local search, so that improved scheduling solutions can be obtained, and then, the improved scheduling solutions are converted into solution vectors, and the obtained solution vectors are refined, and the refined solution vectors are adopted to replace the solution vectors before the local search, and the next iteration of harmony search is executed further; and 6) after the execution of the search is completed, an optimal solution vector is decoded, so that a final scheduling solution of the FJSS can be obtained.
Description
Technical field
The invention belongs to computer utility and production scheduling technical field, relate to crucial scheduling problem involved in the commercial production such as semiconductor production, automobile assembling, weaving, i.e. Flexible Job-shop Scheduling Problems (FlexibleJobShopScheduling, FJSS), particularly about a kind of flexible job shop scheduling based method based on mixing harmony search algorithm.
Background technology
In musical performance, musicians rely on oneself memory, and by repeatedly adjusting the tone of each musical instrument in band, finally reach a beautiful harmony state, the people such as Korea S scholar GeemZW, by the inspiration of this phenomenon, propose harmonic search algorithm.By musical instrument i (i=1,2 ..., n) be analogous to i-th variable in optimization problem, the tone of each musical instrument is analogous to the value of each variable, the harmony R of each musical instrument tone
j(j=1,2 ..., m) be analogous to the jth group solution vector of optimization problem, the evaluation effect of music is analogous to objective function.Basic harmonic search algorithm produces m group initial solution (harmony) and puts into harmony data base (HarmonyMemory, HM), searches for new variable with probability HMCR in HM, searches in the scope allowed in HM exogenousd variables with probability 1-HMCR; Then algorithm produces local dip with probability P AR to new variable; Judge whether the objective function of new explanation belongs to the poorest solution in HM, if so, then replaces it; Then continuous iteration is until meet stopping criterion.Major parameter based on harmonic search algorithm has harmony data base size m, data base retains probability (HarmonyMemoryConsideringRate, HMCR) harmony conciliation rate (PitchAdjustingRate, PAR), wherein arranging of algorithm parameter affects algorithm convergence efficiency and speed of convergence, and basic harmony search algorithm process is:
Step 1) initiation parameter data base size m, data base retain probability HMCR, harmony conciliation rate PAR, disturbance factor bw, algorithm iteration times N I;
Step 2) the random m group initial solution that produces puts into HM, the wherein row vector of HM matrix
represent a solution of optimization problem;
Step 3) separate generation new explanation [x by the current m group being in HM
1' x
2' ... x
n'], for each decision variable x
i' concrete the rule produced has following 3: data base is selected, tone adjusts and Stochastic choice.First an equally distributed random number rand () between [0,1] is produced, if rand () is less than HMCR, x
i' produced by data base selective rule, otherwise produced by random rule.Secondly, a decision variable x
iif ' produced by data base rule, then also need to adjust through tone with the probability of PAR.The rule that data base is selected, tone adjusts is respectively as shown in formula (2), formula (3) and formula (4):
wherein a ∈ (1,2 ..., m) (2)
x
i′＝x
i′±rand()×bw(3)
x
i′＝LB
i+rand()×(UB
i-LB
i)(4)
In formula, UB
iand LB
ibe respectively the bound scope of i-th decision variable, a refers to and separates x
ii-th decision variable, bw is that algorithm parameter refers to bandwidth.
Step 4) upgrade HM.If the new solution vector [x produced
1' x
2' ... x
n'] be better than solution the worst in HM, then replace this worst solution in HM with current new explanation.
Step 5) repeat step 3) and step 4) until reach the iterations of specifying.
In recent years, harmonic search algorithm was widely used in solving combinatorial optimization problem as a kind of global optimization method, in the important combinatorial optimization problems such as traveling salesman problem, pipe laying problem, bus routing problem, be obtained for successful application.In the evolution of harmony search algorithm, many mutation are there is.By the inspiration of the swarm intelligence thought in particle cluster algorithm, Omran and Mahdavi proposes global optimum's harmonic search algorithm (gHS), and the tone regulation rule of this algorithm to basic harmonic search algorithm changes.Suppose that the optimum solution in HM is:
Then tone regulation rule is:
wherein, k is the random integers (5) between 1 to n
The people such as LingWang consider the structure of keeping optimization better, are revised as further by tone regulation rule:
But described several harmonic search algorithm all can not directly apply to and solve FJSS problem above, because the operator operation of harmony search algorithm is all based on real coding, the original object of algorithm is for solving continuous optimization problems, and FJSS is the problem of a discrete optimization, often there is the problem being easily absorbed in local better solution in harmony search algorithm in search procedure.
Summary of the invention
For the problems referred to above, the object of this invention is to provide a kind of flexible job shop scheduling based method based on mixing harmony search algorithm that can strengthen the local search ability of harmony search algorithm.
For achieving the above object, the present invention takes following technical scheme: a kind of flexible job shop scheduling based method based on mixing harmony search algorithm, is characterized in that comprising following content: 1) define the solution vector that certain will solve FJSS; 2) solution vector in harmony search algorithm is converted to the coding of FJSS feasible solution; 3) adopt harmonic search algorithm framework to carry out harmony search algorithm, i.e. first some solution vectors of random initializtion, setting maximum iteration time, per in generation, produces a new solution vector by harmony search algorithm operator; 4) conversion of new solution vector solution is dispatched solution accordingly, scheduling is separated and is adopted extracting figure to represent; 5) after producing new scheduling solution, perform the Local Search based on public key operation proposed with certain probability based on extracting figure, by Local Search, extracting figure is adjusted, the scheduling solution be improved, and then the scheduling solution of improvement is converted to solution vector, the solution vector obtained after adopting Local Search substitutes the solution vector before Local Search, continues to perform harmony search algorithm of future generation; 6) search for complete after, the solution vector of optimum being carried out decoding obtains the scheduling solution of final FJSS.
Further, described step 1) define the solution vector that certain will solve FJSS, be specially: solution vector is expressed as
n representation dimension amount, the variable range of every one dimension is all [-1,1], and the dimension n of solution vector is the twice of solved FJSS scheduling problem operation number summation, wherein, the first half of solution vector
represent the machine choice information of all operations, latter half
represent the sequencing information of all operations.
Further, described step 2) solution vector in harmony search algorithm is converted to the coding of FJSS feasible solution, transfer algorithm adopts different switching strategies respectively for machine choice part and operation sequencing part, is specially: (1) is in machine choice part, specific practice: first by [-1,1] the linear transformed mappings of the real number in the real number in [1, m], and then gets immediate integer, to any x ∈ [-1,1], the integer z in corresponding [1, m] is:
Wherein, round () is for getting an immediate integer of real number, and special circumstances are as m=1, to any x ∈ [-1,1], and z=1; (2) in operation sequencing part, the conversion method based on LPV rule is used.
The present invention is owing to taking above technical scheme, it has the following advantages: 1, harmony of the present invention adopts real number vector representation, vector magnitude is the twice of all operation sums, two parts equal sized by this vector fractional integration series, first half represents machine choice, latter half represents operation sequencing, can realize this real number vector and FJSS feasible solution encode between mutual conversion, enable harmony search algorithm directly apply to Flexible Job-shop Scheduling Problems.2, the present invention embeds local searching operator after harmony search algorithm produces new explanation step, and new explanation local search algorithm obtained is converted to solution vector, then the solution vector before Local Search is replaced, the new solution vector obtained is utilized to continue harmony search algorithm process, therefore the local search approach based on public key operation of the present invention's proposition, enhance the local search ability of harmony search algorithm, balance can be reached between global search and Local Search, in sum, the present invention can be widely used in and carry out in efficient scheduling medium scale flexible job shop system.
Accompanying drawing explanation
Fig. 1 is FJSS feasible solution coding structure schematic diagram of the present invention;
Fig. 2 is FJSS feasible solution of the present invention coding schematic diagram;
Fig. 3 is operation sequencing part transition diagram of the present invention;
Fig. 4 is FJSS problem extracting figure model of the present invention;
Fig. 5 of the present inventionly dynamically represents subsystem operations process flow diagram.
Embodiment
Below in conjunction with accompanying drawing, detailed description is carried out to the present invention.But should be appreciated that being provided only of accompanying drawing understands the present invention better, they not should be understood to limitation of the present invention.
Flexible Job-shop Scheduling Problems (FlexibleJobShopScheduling, FJSS) two scheduling decisions are related to: machine choice (MachineSelection, and operation sequencing (OperationSequence, OS) MS).As shown in Figure 1, the genetic coding of a feasible solution can be made up of machine choice part MS and these two parts of operation sequencing part OS.
Table 1FJSS scheduling problem example
Machine choice partial-length has L position, wherein the operation total number of L corresponding to solved FJSS problem.Every arranges according to the order operated in workpiece and workpiece successively with integer representation, the serial number that the processing machine that each integer representation current operation is selected is concentrated at alternative machines, is not corresponding machine number.For the FJSS problem shown in table 1, machine choice part is all operations of workpiece 1 and workpiece 2 successively, operation O
11have 5 machines to select, corresponding 3 represent that alternative machines concentrates the 3rd machine, namely at machine M
3upper processing.In like manner operate O
12there are two machine M
2and M
4can select, 2 expressions corresponding in Fig. 2 are at machine M
4upper processing.
In operation sequencing part, after the processing machine of operation is determined, to the similar general JSP problem of sequence of operation.The coded system based on operation that this part adopts Gen to propose is encoded, and coding figure place is also L.Each recruitment piece number direct coding, the workpiece number order occurred represents the priority processing sequence between this work piece operations, namely this part coding is compiled from left to right, for the workpiece j that the h time occurs, represent h the operation of workpiece j, and the number of times that workpiece j occurs equals the operation sum n of this workpiece
j.The advantage of coding like this is that coding flexibility is very high, can meet the various complex situations such as scheduling scale changes, work piece operations number is indefinite, and each coded system represents the feasible solution of a scheduling.Still for the FJSS problem shown in table 1, as shown in Figure 2, being encoded to [22112] of operation sequencing part.Then the 1st 2 represents the 1st operation of workpiece 2, the 2nd operation of the 2nd 2 expression workpiece 2, and by that analogy, the processing priority converting each operation to is:
The present invention is based on WindowsXP operating system, VisualStudio2010 is adopted to realize, the setting of flexible job shop system job number, machine number, basic parameter such as operation number, each operation available machines used situation etc. can be completed, and according to different device contexts and process requirements, various machining path can be configured for each operating flexibility.Based on above-mentioned thinking, the present invention proposes, based on the flexible job shop scheduling based method of mixing harmony search algorithm, can carry out efficient scheduling, and dispatching effect to be better than current some existing advanced algorithms to the medium scale flexible job shop system configured.This dispatching method is based on .NET development platform, based on Object-oriented technology
Solving FJSS scheduling problem based on harmonic search algorithm, the problem phase coadaptation that must make algorithm He solve, specifically, is exactly the scheduling the solution how solution vector in harmony search algorithm be mapped in FJSS problem:
1. the form of solution vector in clear and definite harmony search algorithm;
2. in order to reduce the space of feasible solution, efficient decoding algorithm is adopted to the coding of FJSS feasible solution;
3. the transfer algorithm that in harmony search algorithm, solution vector is encoded to FJSS feasible solution is proposed;
On the basis of the above, the solution vector in harmony search algorithm can correspond to a feasible schedule solution of FJSS problem as follows:
For this reason, the flexible job shop scheduling based method based on mixing harmony search algorithm that the present invention proposes, comprises following content:
1, the solution vector that certain will solve FJSS is defined
In harmonic search algorithm, solution vector can be expressed as
it is the real number vector of a n dimension, and the variable range conveniently setting every one dimension in the present invention is all [-1,1].The dimension n of solution vector is the twice of solved FJSS scheduling problem operation number summation.Wherein, the first half of solution vector
represent the machine choice information of all operations, and latter half
represent the sequencing information of all operations.
2, the solution vector in harmony search algorithm is converted to the coding of FJSS feasible solution, transfer algorithm adopts different switching strategies respectively for machine choice part and operation sequencing part, is specially:
1) in machine choice part, during solution vector represents, solution vector is often tieed up variable range and be all defined as [-1,1], and the scope of machine choice is the integer of 1 to m in feasible solution coding, wherein, m is the optional machine number of the corresponding operation in this position.Therefore need the integer real number in [-1,1] being mapped as 1 to m, specific practice: first by the linear transformed mappings of real number in [-1,1] to the real number in [1, m], and then get immediate integer.So to any x ∈ [-1,1], the integer z in corresponding [1, m] is:
Wherein, round () is for getting an immediate integer of real number, and special circumstances are as m=1, to any x ∈ [-1,1], and z=1.
2) in operation sequencing part, the conversion method based on LPV rule is used.
First the integer ID number that each operation imparting one is fixing is given.Each Action number is given successively by the order operated in workpiece and workpiece, for table 2, O
11, O
12, O
21, O
22, O
23fixing No. ID be respectively 1,2,3,4,5.Solution vector is also [-1 in the often dimension of operation sequencing part, 1] real number in, first LPV rule is utilized the operation sequencing part of solution vector to be converted to an arrangement of No. ID, operation, specific practice is together with location number by the solution vector of operation sequencing part, by the value often tieed up with the arrangement of non-decreasing order, the arrangement that location number is originally formed is just as an arrangement of No. ID, operation.This arrangement is equivalent to arbitrary arrangement of all operations, likely corresponding infeasible solution, so be converted to the workpiece number at place by each operation No. ID again, the solution vector of such operation sequencing part is just converted into the operation sequencing part of FJSS feasible solution coding.For the FJSS problem of table 1, then the signal of concrete operations as shown in Figure 3.
3, adopt harmonic search algorithm framework to carry out harmony search algorithm, i.e. first some solution vectors of random initializtion, setting maximum iteration time, per in generation, produces a new solution vector by harmony search algorithm operator.
4, new solution vector solution converted to and dispatch solution accordingly, scheduling solution can adopt extracting figure to represent.
The scheduling solution of FJSS problem can adopt extracting figure to represent, extracting figure representation is by a FJSS scheduling problem digraph G=(V, C ∪ D) represent, wherein, V is all vertex sets of this digraph, and each summit represents an operation (containing starting and terminating two blank operations); C is all connection arc sets, and connect arc and refer to the camber line connecting same workpiece two adjacent operator in digraph, arc direction represents the processing sequence between this workpiece two adjacent operator; D is the set of all disconnected arcs, disconnected arc refers to two camber lines operated that connection is corresponding with a certain machine in digraph G, arc direction represents connected two operations processing sequence on this machine (if not connect arc direction for determining, then generally all having the dotted line of arrow to represent with two in digraph G).Generally can be labeled in the top of respective vertices the process time of each operation.A machinable necessary condition of operation: before this operation corresponding vertex, the operation continued corresponding to summit completes processing on extracting figure.
As can be seen from above definition: in extracting figure, which operation is machine choice be embodied between disconnected arc, has disconnected arc, represent that these operations are selected to process on same machine between operation.The operation sequencing body then present orientation of disconnected arc in extracting figure.Be illustrated in figure 4 the extracting figure model of a FJSS scheduling problem, wherein solid line represents connection arc, and dotted line represents disconnected arc, and S is starting point, E is terminal, other node is certain operation corresponding respectively, and operation 1,2,3 belongs to the 1st workpiece, and operation 4,5 belongs to the 2nd workpiece, operation 6,7 belongs to the 3rd workpiece, operation 1,6 is processed on same machine, and operation 2,4,5 is processed on same machine, and operation 3,5 is processed on same machine.The extracting figure describing FJSS scheduling problem has following critical nature:
1. in extracting figure, if the orientation of each disconnected arc is determined, then the length of the longest path (i.e. critical path) from its start node to end node is the completion date corresponding with this extracting figure.
If 2. a scheduling scheme is feasible, then there is not loop in the extracting figure of its correspondence.
5, after producing new scheduling solution, (can according to choosing with certain probability based on extracting figure, the probable value chosen in the present embodiment is 0.7) perform the local searching strategy based on public key operation proposed, by Local Search, extracting figure is adjusted, the scheduling solution be improved, and then the scheduling solution of improvement is converted to solution vector, successively refining is carried out to the solution vector obtained, solution vector before adopting the solution vector after refining to substitute Local Search, continues to perform harmony search algorithm of future generation.
In order to strengthen the search capability of algorithm, Local Search being embedded in the framework of harmony search algorithm and more careful search carried out to solution space, being specially:
To the new solution vector that step in basic harmony search algorithm produces, Local Search is utilized to improve the quality of separating.Directly for the solution vector in harmony search algorithm, but the information relevant to problem can not be made full use of like this for Local Search.The present invention is the scheduling solution solution vector of harmony search algorithm being converted into FJSS problem, the corresponding neighborhood of design is separated based on scheduling, then the neighborhood of design is utilized to carry out Local Search, scheduling solution after Local Search resulting improvement is converted into solution vector again, replace the solution vector before Local Search by this solution vector, continue the search procedure of harmony search algorithm.Current major part is all based on critical path about the neighborhood of FJSS scheduling problem, and thought major part reaches destruction critical path based on the one or more operations in mobile critical path, reduces the object of completion date.The present invention proposes the FJSS scheduling problem neighborhood based on public key operation.So-called public key operation is exactly the operation in all critical paths.Because can find that a lot of of FJSS problem separate the corresponding more than critical path of extracting figure, if the operation in the critical path of mobile not common key operation, then this operation is not at least in a certain bar critical path, so this operation mobile can not destroy this critical path, the completion date of gained solution also can not reduce.
Neighbour structure specific design based on public key operation is as follows: read public key operation successively, first this operation is deleted from extracting figure each operation, recalculates the earliest start time of each operation in each extracting figure; Then be current completion date with the completion date before deletion action, calculate the late start time of each operation from back to front; Whether the time slot formed between the last operation of examination successively and operation, see and can insert in suitable gap by operation, if can insert, current solution is exactly the neighborhood produced, and exits.Otherwise the operation of reading in next critical path, then do identical process.
6, search for complete after, the solution vector of optimum being carried out decoding obtains the scheduling solution of final FJSS, thus obtains the completion date of this scheduling solution.
As shown in Figure 5, the flexible job shop scheduling based method based on mixing harmony search algorithm is applied to a typical flexible job shop environment, i.e. multi-robot system by the present invention, and devise one and dynamically represent subsystem, dynamically representing subsystem specific implementation process is:
The subsystem that dynamically represents in the embodiment of the present invention is under the compilation run environment of the VisualStudio2010 of personal computer, add corresponding visualization tool component design realize:
1. overall framework
The overall framework of the dynamic demonstration system of the present embodiment mainly comprises MainStatus and JobEditor two Tab interfaces, two interface corresponding operating assembly essential informations are as shown in the table, and the detailed functions of each several part assembly and implementation will be introduced successively at table 2.
Table 2 operating assembly essential information
2. the information that inputs reads and Algorithm for Solving
The input information of the dynamic demonstration system of the present embodiment reads and the interface of Algorithm for Solving is mainly used in realizing and mix harmonic search algorithm and input information-related function, comprises the following aspects:
1) relevant information reading section: need the parameter information arranged to comprise wafer count, front and back end mechanical hand number and processing machine number.And the scope that arranges of parameters limits it by the options of each comboBox arranges scope, wherein set the span of wafer count and processing machine number as being respectively no more than 20, and the span of front and back end mechanical hand number is for be respectively no more than 10, port number is fixed as 2, namely access way respectively has 1, and the calculation mode of asking of total number of machines is then port number+front-end machine hand number+rear end mechanical hand number+processing machine number.Select after setting completed, reset except non-selection, arranging of parameters can not be modified, and make mistakes to avoid operation.
2) process information file reading section: the reading of process information file can select dialog box directly to select input file to import in the middle of text box by file, also can revise input file by direct editing process information body of an instrument frame simultaneously.The concrete form of native system input file is consistent with the input file form mixing harmonic search algorithm above.Selecting to do input file and simply go out misinterpretation process when determining process information file, comprise obvious form abnormal, and arrange in wafer count or total number of machines and relevant information hurdle inconsistent.For the sequence number of encoding accordingly of each machine in process information file with the corresponding relation of all types of machines be: 1, No. 2 corresponding input channels of machine and output channel, ensuing identification number corresponding each front-end machine hand, rear end mechanical hand and processing machine in order successively.
3) scheduling solution coding solves and display: in all information after setting completed, this interface carries out solving scheduling solution coding will call mixing harmonic search algorithm, and solution coding is presented in the text encoded frame of corresponding scheduling solution, will calculate to solve and store corresponding scheduling simultaneously and separate data, for ensuing dynamic demonstration scheduling process is prepared, the concrete data message stored will be introduced below.
3. Interface design
In order to the demonstration enabling the dynamic demonstration subsystem of the present embodiment be applicable to different dispatching algorithm, need to design suitable interface.Need the suitable data structure of design one to represent the scheduling result of dispatching algorithm for this reason.Represented by the extracting figure of scheduling problem and each can be known to operate be assigned on machine, and the operation of every platform machine is sequenced the solution that sequence just can obtain scheduling problem.Therefore can according to the data structure of the patten's design scheduling problem solution of table 3.
In demonstration program part, utilize a two-dimensional array machine1 to complete the function of scheduling result Dynamic Announce, the concrete meaning of machine1 is: Machine1 [i] [j] represents the wafer sequence number that machine i processes in a jth unit interval section, if without, be 0.Such as hypothesis has following two-dimentional Machine1 array:
111002220
222221111
Then represent that machine 1 processes wafer 1 within the 1-3 time period, processes wafer 2 within the 6-8 time period, all the other times are idle, and machine 2 processes wafer 2 within the 1-5 time period, processes wafer 1 within the 6-9 time period.The size of obvious machine1 is wafer count × completion date.In order to utilize demo system to demonstrate dispatching algorithm gained solution, most critical exactly the data structure represented by table 2 is converted to machine1, specific practice separates in class in scheduling the method realizing a data conversion, machine1 is first all initialized as 0 by the method, then each operation is traveled through, if be numbered id to each operation processing machine, earliest start time is e, process time is t, then the value of machine1 [id-1] [e] to machine1 [id-1] [e+t-1] is set to the wafer jId of this operation correspondence.
The data structure of separating dispatched by table 3
Need to be loaded into dispatching algorithm gained optimization solution in demonstration program, and separate the data transfer device of class with scheduling, scheduling solution is converted to machine1, carry out scheduling demonstration finally by machine1.
4. dynamic effect demonstration
The interface of the dynamic effect demonstration of the present embodiment is mainly used in realizing following correlation function:
Dynamic demonstration shows: by the Bitmap pattern bitmap display main interface of dynamic dispatching process, and scheduling process refreshes arranging and carry out Dynamic Announce once by Bitmap bitmap picture every 200ms.System is after encoding by GA+VNS Algorithm for Solving optimal scheduling solution, calculating is solved following corresponding scheduling and separate data: first ask the concrete status information calculating each each wafer of time quantum in total activation time range, namely lay respectively on which machine and operate accordingly, and these status informations to be stored in size be in the two-dimensional array of Input.JobMachineNumber*Makespan; Then calculate the display position of the concrete corresponding machine location of each wafer when each Dynamic Announce according to the machine display position of interface setting and wafer state information, and these positional informations are stored in corresponding array.When each Bitmap bitmap picture refreshes, the timenumber count value controlled by Timer assembly, first obtain the concrete display position of each machine and shown, then calling value that in wafer position information array, timernumber sequence number is corresponding to demonstrate the particular location of each wafer.
Demonstration controls: each action button of Start, Stop, Pause, Resume can be used to control in real time presentation process.Whole dynamic demonstration process controls a timenumber time counter by Timer assembly to determine to call which element value in array and carry out Dynamic Announce, therefore the functional realiey of action button is then completed by the Enabled value of control Timer assembly and timenumber count value, also do certain control to the Enabled value of action button, concrete operations are as shown in table 4 simultaneously:
Table 4 is demonstrated and is controlled
State shows: can the basic status information of each wafer in display scheduling process in real time in dynamic dispatching process, every a 1000ms i.e. scheduling time unit refreshing once.The display of concrete state display field comprises and first shows a line time quantum sequence number " TimeXXX: ", and then show the basic status of each wafer successively according to wafer sequence number, concrete form is as shown in table 5:
Table 5 state shows
The various embodiments described above are only for illustration of the present invention, and wherein each implementation step etc. of method all can change to some extent, and every equivalents of carrying out on the basis of technical solution of the present invention and improvement, all should not get rid of outside protection scope of the present invention.
Claims (3)
1., based on a flexible job shop scheduling based method for mixing harmony search algorithm, it is characterized in that comprising following content:
1) solution vector that certain will solve FJSS is defined;
2) solution vector in harmony search algorithm is converted to the coding of FJSS feasible solution;
3) adopt harmonic search algorithm framework to carry out harmony search algorithm, i.e. first some solution vectors of random initializtion, setting maximum iteration time, per in generation, produces a new solution vector by harmony search algorithm operator;
4) conversion of new solution vector solution is dispatched solution accordingly, scheduling is separated and is adopted extracting figure to represent;
5) after producing new scheduling solution, perform the Local Search based on public key operation proposed with certain probability based on extracting figure, by Local Search, extracting figure is adjusted, the scheduling solution be improved, and then the scheduling solution of improvement is converted to solution vector, the solution vector obtained after adopting Local Search substitutes the solution vector before Local Search, continues to perform harmony search algorithm of future generation;
6) search for complete after, the solution vector of optimum being carried out decoding obtains the scheduling solution of final FJSS.
2. as claimed in claim 1 a kind of based on mixing harmony search algorithm flexible job shop scheduling based method, it is characterized in that: described step 1) define the solution vector that certain will solve FJSS, be specially: solution vector is expressed as
n representation dimension amount, the variable range of every one dimension is all [-1,1], and the dimension n of solution vector is the twice of solved FJSS scheduling problem operation number summation, wherein, the first half of solution vector
represent the machine choice information of all operations, latter half
represent the sequencing information of all operations.
3. as claimed in claim 1 or 2 a kind of based on mixing harmony search algorithm flexible job shop scheduling based method, it is characterized in that: described step 2) solution vector in harmony search algorithm is converted to the coding of FJSS feasible solution, transfer algorithm adopts different switching strategies respectively for machine choice part and operation sequencing part, is specially:
(1) in machine choice part, specific practice: first by the linear transformed mappings of real number in [-1,1] to [1, m] in real number, and then get immediate integer, to any x ∈ [-1,1], the integer z in corresponding [1, m] is:
Wherein, round () is for getting an immediate integer of real number, and special circumstances are as m=1, to any x ∈ [-1,1], and z=1;
(2) in operation sequencing part, the conversion method based on LPV rule is used.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510855677.8A CN105512753A (en) | 2015-11-30 | 2015-11-30 | Hybrid harmony search-based flexible job shop scheduling method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510855677.8A CN105512753A (en) | 2015-11-30 | 2015-11-30 | Hybrid harmony search-based flexible job shop scheduling method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105512753A true CN105512753A (en) | 2016-04-20 |
Family
ID=55720715
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510855677.8A Pending CN105512753A (en) | 2015-11-30 | 2015-11-30 | Hybrid harmony search-based flexible job shop scheduling method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105512753A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107230023A (en) * | 2017-06-12 | 2017-10-03 | 合肥工业大学 | Based on the production and transportation coordinated dispatching method and system for improving harmony search |
| CN108363302A (en) * | 2018-02-13 | 2018-08-03 | 集美大学 | A kind of dynamic positioning of vessels bottom propeller control method based on harmony search |
| CN109002903A (en) * | 2018-06-12 | 2018-12-14 | 昆明理工大学 | A kind of Optimization Scheduling of printed circuit board surface mounting line |
| CN109961237A (en) * | 2019-04-02 | 2019-07-02 | 哈尔滨理工大学 | The integrated dispatch method of dynamic local optimal tree |
| CN110134092A (en) * | 2019-05-28 | 2019-08-16 | 山东师范大学 | Rail mounted automatic guide vehicle dynamic dispatching method and system based on harmony search |
| CN110378583A (en) * | 2019-07-05 | 2019-10-25 | 惠州学院 | Adjacent process exchanges method with equipment for a kind of quasi- critical path |
| CN110458478A (en) * | 2019-08-23 | 2019-11-15 | 兰州理工大学 | Job-shop scheduling method based on discrete invasive weed algorithm |
| CN110503248A (en) * | 2019-08-06 | 2019-11-26 | 中交信息技术国家工程实验室有限公司 | A kind of harmonic search algorithm for solving multi items high-volume cold chain article and loading in mixture |
| CN112783172A (en) * | 2020-12-31 | 2021-05-11 | 重庆大学 | AGV and machine integrated scheduling method based on discrete whale optimization algorithm |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102915355A (en) * | 2012-10-11 | 2013-02-06 | 李英明 | Multiprocessor task scheduling method based on harmony search and simulated annealing |
| CN103955864A (en) * | 2014-04-14 | 2014-07-30 | 武汉大学 | Power system multi-target differentiation planning method based on improved harmony search algorithm |
-
2015
- 2015-11-30 CN CN201510855677.8A patent/CN105512753A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102915355A (en) * | 2012-10-11 | 2013-02-06 | 李英明 | Multiprocessor task scheduling method based on harmony search and simulated annealing |
| CN103955864A (en) * | 2014-04-14 | 2014-07-30 | 武汉大学 | Power system multi-target differentiation planning method based on improved harmony search algorithm |
Non-Patent Citations (1)
| Title |
|---|
| YUAN YUAN 等: "A hybrid harmony search algorithm for the flexible job shop scheduling problem", 《APPLIED SOFT COMPUTING》 * |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107230023B (en) * | 2017-06-12 | 2018-08-28 | 合肥工业大学 | Based on the production and transportation coordinated dispatching method and system for improving harmony search |
| CN107230023A (en) * | 2017-06-12 | 2017-10-03 | 合肥工业大学 | Based on the production and transportation coordinated dispatching method and system for improving harmony search |
| CN108363302B (en) * | 2018-02-13 | 2020-09-11 | 集美大学 | Ship dynamic positioning bottom layer propeller control method based on harmony search |
| CN108363302A (en) * | 2018-02-13 | 2018-08-03 | 集美大学 | A kind of dynamic positioning of vessels bottom propeller control method based on harmony search |
| CN109002903A (en) * | 2018-06-12 | 2018-12-14 | 昆明理工大学 | A kind of Optimization Scheduling of printed circuit board surface mounting line |
| CN109002903B (en) * | 2018-06-12 | 2022-02-08 | 昆明理工大学 | Optimized scheduling method for printed circuit board surface mounting production line |
| CN109961237A (en) * | 2019-04-02 | 2019-07-02 | 哈尔滨理工大学 | The integrated dispatch method of dynamic local optimal tree |
| CN109961237B (en) * | 2019-04-02 | 2023-03-31 | 哈尔滨理工大学 | Comprehensive scheduling method of dynamic local optimal tree |
| CN110134092A (en) * | 2019-05-28 | 2019-08-16 | 山东师范大学 | Rail mounted automatic guide vehicle dynamic dispatching method and system based on harmony search |
| CN110378583A (en) * | 2019-07-05 | 2019-10-25 | 惠州学院 | Adjacent process exchanges method with equipment for a kind of quasi- critical path |
| CN110378583B (en) * | 2019-07-05 | 2023-01-17 | 惠州学院 | Method for interchanging adjacent procedures of pseudo-critical path and equipment |
| CN110503248A (en) * | 2019-08-06 | 2019-11-26 | 中交信息技术国家工程实验室有限公司 | A kind of harmonic search algorithm for solving multi items high-volume cold chain article and loading in mixture |
| CN110503248B (en) * | 2019-08-06 | 2022-03-01 | 中交信息技术国家工程实验室有限公司 | Harmony search algorithm for solving mixed loading of multiple varieties of large-batch cold chain articles |
| CN110458478A (en) * | 2019-08-23 | 2019-11-15 | 兰州理工大学 | Job-shop scheduling method based on discrete invasive weed algorithm |
| CN112783172A (en) * | 2020-12-31 | 2021-05-11 | 重庆大学 | AGV and machine integrated scheduling method based on discrete whale optimization algorithm |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105512753A (en) | Hybrid harmony search-based flexible job shop scheduling method | |
| Xu et al. | An effective teaching–learning-based optimization algorithm for the flexible job-shop scheduling problem with fuzzy processing time | |
| Li et al. | Efficient multi-objective optimization algorithm for hybrid flow shop scheduling problems with setup energy consumptions | |
| Wang et al. | An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem | |
| Xing et al. | A knowledge-based ant colony optimization for flexible job shop scheduling problems | |
| Lozano et al. | On an exact method for the constrained shortest path problem | |
| Xing et al. | An efficient search method for multi-objective flexible job shop scheduling problems | |
| CN109116854B (en) | Multi-group robot cooperation control method and system based on reinforcement learning | |
| CN111309486B (en) | Conversion method, conversion device, computer equipment and storage medium | |
| CN101901425A (en) | Flexible job shop scheduling method based on multi-species coevolution | |
| Lahrichi et al. | An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: Application to the MDPVRP | |
| CN105512954A (en) | Integrated search method for large-scale flexible job shop scheduling | |
| CN105373845A (en) | Hybrid intelligent scheduling optimization method of manufacturing enterprise workshop | |
| Jaengchuea et al. | A hybrid genetic algorithm with local search and tabu search approaches for solving the post enrolment based course timetabling problem: Outperforming guided search genetic algorithm | |
| CN115099502B (en) | Short-term power load prediction method based on inter-user power consumption behavior similarity | |
| CN113901728B (en) | Computer second-class assembly line balance optimization method based on migration genetic algorithm | |
| CN110532291B (en) | Method and system for converting deep learning frame model based on minimum execution cost | |
| Hou et al. | A self-crossover genetic algorithm for job shop scheduling problem | |
| Wang et al. | St-mlp: A cascaded spatio-temporal linear framework with channel-independence strategy for traffic forecasting | |
| CN106155799A (en) | Codelet dispatching method based on genetic algorithm | |
| CN105335135A (en) | Data processing method and center node | |
| US11169957B2 (en) | Systems and methods for reconfigurable systolic arrays | |
| CN114924641A (en) | Vibration array system, driving method, and storage medium | |
| CN103246923A (en) | Self-adaptive genetic algorithm-based flexible workshop dispatching technology | |
| CN107621979A (en) | A kind of Development of Students archives big data algorithm and analysis system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160420 |
|
| RJ01 | Rejection of invention patent application after publication |