CN103559544B - Chromosome coding method and device based on intelligent scheduling - Google Patents
Chromosome coding method and device based on intelligent scheduling Download PDFInfo
- Publication number
- CN103559544B CN103559544B CN201310552686.0A CN201310552686A CN103559544B CN 103559544 B CN103559544 B CN 103559544B CN 201310552686 A CN201310552686 A CN 201310552686A CN 103559544 B CN103559544 B CN 103559544B
- Authority
- CN
- China
- Prior art keywords
- task
- sequence
- coding
- product
- layer
- 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.)
- Active
Links
Abstract
The present invention discloses a kind of chromosome coding method and device based on intelligent scheduling, and its method includes：Obtain product task；At least a product task includes the process task of at least two types；The product task is encoded based on process task and using double-deck coding rule, obtains characterizing the chromosome sequence of any default process task job sequence.The present invention to chromosome by carrying out double-deck coding, chromosome mapping space can be made when product task has serial, parallel, network process task dispatching working procedures task, business solution space is characterized completely, expands the plug in rope scope of Scheduling Algorithm, avoids sequence from characterizing the problem of insufficient；In addition, double-deck coding can also greatly increase the information content that sequence includes, and then all kinds of genetic manipulations based on bilayer coding can be amplified out, so as to improve the optimizing performance of Scheduling Algorithm.
Description
Technical field
The present invention relates to logistics information processing technology field, more particularly to a kind of chromosome coding side based on intelligent scheduling
Method and device.
Background technology
In the Job Shop Scheduling research based on genetic algorithm, one of most important work is how to carry out chromosome
Coding.At present, coding of the coding generally use individual layer based on process of chromosome, wherein, chromosome is one by process task
The sequence of code composition, a product task is represented with a character, the different process tasks in product task, existed with the character
Positional representation in chromosome sequence.
As shown in figure 1, A representative products task A, the B representative products tasks B in sequence；Product task A includes five processes
Task（A1, A2, A3, A4, A5）, the 1st, 3,7,8,11 positioned at sequence respectively；Product task B includes six process tasks
（B1, B2, B3, B4, B5, B6）Respectively positioned at sequence the 2nd, 4,5,6,9,10；This chromosome represent with（A1, B1, A2, B2,
B3, B4, A3, A4, B5, B6, A5）Order carry out scheduling.
But there is following defect in existing chromosome coding scheme：, can not be complete for networking process, parallel process
Complete to characterize business solution space, i.e., when parallel, cyberrelationship between process task be present, existing coding method can only characterize very
The solution space of small a part of business, sequence is caused to characterize the problem of insufficient, so as to greatly reduce the optimizing performance of Scheduling Algorithm.
The content of the invention
It is a primary object of the present invention to provide a kind of chromosome coding method and device based on intelligent scheduling, it is intended to keep away
Exempt from sequence and characterize the problem of insufficient, and then improve the optimizing performance of Scheduling Algorithm.
In order to achieve the above object, the present invention proposes a kind of chromosome coding method based on intelligent scheduling, including：
Obtain product task；At least one product task includes the process task of at least two types；
The product task is encoded based on process task and using double-deck coding rule, obtains characterizing any preset
Process task job sequence chromosome sequence.
Preferably, it is described that product task is encoded based on process task and using double-deck coding rule, characterized
The step of chromosome sequence of any default process task job sequence, includes：
The product task is ranked up in the first coding layer, obtains first layer coding sequence；
Obtain the ordering map table of the current process task of each product task in first coding layer；
In the second coding layer, according to the ordering map table of the current process task of each product task, to each product
Sequencing schemes are encoded corresponding to task, obtain second layer coding sequence；
The ordering map table second layer encoded in sequence enters with corresponding product task in first layer coding sequence
Row association, obtain characterizing the chromosome sequence of any default process task job sequence.
Preferably, it is described that the product task is ranked up in the first coding layer, obtain the step of first layer coding sequence
Suddenly include：
Obtain product task ranking rule；
In the first coding layer, according to the product task ranking rule of the acquisition, the product task is ranked up, obtained
Sequence is encoded to first layer.
Preferably, also include before the step of acquisition product task：
For the ordering map table of the product task creation process task.
Preferably, the product task includes serial, parallel and/or network process task.
Preferably, this method also includes：
Business genetic manipulation is carried out based on the chromosome sequence.
The embodiment of the present invention also proposes a kind of chromosome coding device based on intelligent scheduling, including：
Acquisition module, for obtaining product task；The process that at least one product task includes at least two types is appointed
Business；
Coding module, for being encoded based on process task and using double-deck coding rule to product task, obtain table
The chromosome sequence of any default process task job sequence of sign.
Preferably, the coding module includes：
First compiles unit, for being ranked up in the first coding layer to the product task, obtains first layer coding sequence；
Acquiring unit, the sequence for obtaining the current process task of each product task in first coding layer are reflected
Firing table；
Second coding unit, in the second coding layer, according to the sequence of the current process task of each product task
Mapping table, sequencing schemes corresponding to each product task are encoded, obtain second layer coding sequence；
Associative cell, it is corresponding in ordering map table and first layer coding sequence in sequence for the second layer to be encoded
Product task be associated, obtain characterizing the chromosome sequence of any default process task job sequence.
Preferably, described first unit is compiled, is additionally operable to obtain product task ranking rule；In the first coding layer, according to institute
The product task ranking rule of acquisition is stated, the product task is ranked up, obtains first layer coding sequence.
Preferably, the device also includes：
Creation module, for the ordering map table for the product task creation process task.
Preferably, the device also includes：
Operation module, for carrying out business genetic manipulation based on the chromosome sequence.
The embodiment of the present invention proposes a kind of chromosome coding method and device based on intelligent scheduling, by entering to chromosome
The double-deck coding of row, chromosome mapping space can be made serial, parallel, network process task dispatching working procedures to be present in product task and appointed
During business, business solution space is characterized completely, expands the plug in rope scope of Scheduling Algorithm, avoids sequence from characterizing the problem of insufficient；It is in addition, double
Layer coding can also greatly increase the information content that sequence includes, and then can amplify out all kinds of genetic manipulations based on bilayer coding,
So as to improve the optimizing performance of Scheduling Algorithm.
Brief description of the drawings
Fig. 1 is existing chromosome coding sequence schematic diagram；
Fig. 2 is the schematic flow sheet of the chromosome coding method first embodiment of the invention based on intelligent scheduling；
Fig. 3 is the product task instances schematic diagram that the embodiment of the present invention is enumerated；
Fig. 4 is a kind of chromosome sequence example schematic formed using bilayer encoding scheme of the embodiment of the present invention；
Fig. 5 is another chromosome sequence example schematic formed using bilayer encoding scheme of the embodiment of the present invention；
Fig. 6 is that the product task shown in Fig. 4 uses the chromosome sequence schematic diagram that existing encoding scheme is formed；
Fig. 7 is the schematic diagram of the chromosome sequence generation invalid code shown in Fig. 6；
Fig. 8 is the schematic flow sheet of the chromosome coding method second embodiment of the invention based on intelligent scheduling；
Fig. 9 is the schematic flow sheet of the chromosome coding method 3rd embodiment of the invention based on intelligent scheduling；
Figure 10 is the high-level schematic functional block diagram of the chromosome coding device first embodiment of the invention based on intelligent scheduling；
Figure 11 is the structural representation of coding module in the chromosome coding device embodiment of the invention based on intelligent scheduling；
Figure 12 is the high-level schematic functional block diagram of the chromosome coding device second embodiment of the invention based on intelligent scheduling；
Figure 13 is the high-level schematic functional block diagram of the chromosome coding device second embodiment of the invention based on intelligent scheduling.
In order that technical scheme is clearer, clear, it is described in further detail below in conjunction with accompanying drawing.
Embodiment
It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not intended to limit the present invention.
The technical term being related in the embodiment of the present invention includes：
Process task：A basic element of scheduling is represented, the purpose of scheduling is exactly the money being adapted to for the arrangement of process task
Source and time；
Product task：Being combined by multiple process tasks for task, includes the restriction relation between each operation task；
Chromosome：A feasible schedule scheme is represented, actually the orderly sequence of process task.
As shown in Fig. 2 first embodiment of the invention proposes a kind of chromosome coding method based on intelligent scheduling, including：
Step S101, obtain product task；At least one product task includes the process task of at least two types；
Wherein, product task can be one or more.
Provided with two product tasks, respectively A, B；Its process task included and relation are as shown in Figure 3.
Each circle represents a process task in Fig. 3, and arrow represents the relation between process, and A includes 5 processes and appointed
Business, each operation task is Serial Relation, and B includes 6 process tasks, parallel process be present, and a chromosome coding is actual for production
Product Machining Sequencing scheme, if being encoded by existing method, the chromosome coding sequence that it is formed is as shown in Figure 1.
A1, B1, A2 are pressed in this coded representation, B2, B3, B4, A3, A4, B5, and B6, A5 order arranges process to process, this
Coding method has the drawback that：If the process modeling of product is nonlinear（Such as product B）, then this coding method
Caused chromosome sequence can not characterize whole solution space.In example shown in Fig. 1, the process task of sign is encoded
Sequentially all be forever ..., B1 ..., B2 ..., B3 ..., B4 ..., B5 ...,
B6 ... } this pattern, without being likely to occur other effective 5 kinds of patterns：..., B3 ..., B4 ...,
B1 ..., B2 ..., B5 ..., B6 ...；..., B1 ..., B3 ...,
B2 ..., B4 ..., B5 ..., B6 ...；..., B1 ..., B3 ...,
B4 ..., B2 ..., B5 ..., B6 ...；..., B3 ..., B1 ...,
B2 ..., B4 ..., B5 ..., B6 ...；..., B3 ..., B1 ...,
B4 ..., B2 ..., B5 ..., B6 ....That is the coding method shown in existing Fig. 1 can only
1/6 sequencing schemes are characterized, optimal solution can only be found in this 1/6 sequencing schemes by thereby resulting in genetic algorithm, so as to significantly
Reduce the optimizing performance of Scheduling Algorithm.
In consideration of it, the present embodiment proposes a kind of double-deck encoding scheme, mainly solve product task exist it is serial, parallel,
During network process task dispatching working procedures task, business solution space can not be characterized completely, cause sequence to characterize deficiency, reduce scheduling
The problem of optimizing performance of algorithm.
First, product task is obtained；Wherein, at least one product task includes serial, parallel or network process task
Etc. polytype process task.
Step S102, the product task is encoded based on process task and using double-deck coding rule, obtains table
The chromosome sequence of any default process task job sequence of sign.
After product task is got, the product task is compiled based on process task and using double-deck coding rule
Code, obtains characterizing the chromosome sequence of any default process task job sequence, and its detailed process is as follows：
First, the product task is ranked up in the first coding layer, obtains first layer coding sequence；Can first it obtain
Product task ranking rule；Afterwards in the first coding layer, according to the product task ranking rule of the acquisition, the product is appointed
Business is ranked up, and thus obtains first layer coding sequence.
Then, the ordering map table of the current process task of each product task in first coding layer is obtained；
In second coding layer, according to the ordering map table of the current process task of each product task, to corresponding to each product task
Sequencing schemes are encoded, and obtain second layer coding sequence.
Finally, the ordering map table second layer encoded in sequence encodes corresponding product times in sequence with first layer
Business is associated, and obtains characterizing the chromosome sequence of any default process task job sequence.
For two kinds of product tasks for including serial process task of A, B, the double-deck encoding scheme proposed using the present embodiment,
The chromosome sequence form that can be formed is as shown in Figure 4.Detailed process is as follows：
First layer compared with sort method it is identical, be a character in each frame, represent a process task, the second layer
It is that first layer is explained further, each inframe is a process task object, and is appointed for the current process of product task
Business forms an ordering map table.Encoded for identical first layer, there can be multiple different second layers to encode, the volume in Fig. 4
Code represents same order with the single layer coding shown in existing Fig. 1.Now, if doing a little variations to the second layer, as shown in figure 5,
The processing sequence then represented becomes { A1, B3, A2, B4, B1, B2, A3, A4, B5, B6, A5 }, can thus by two layer encoding
To represent all process task processing sequences, different process task processing sequences is mapped by different process task rankings
Table embodies.
And if directly put second layer coding on the first layer in the form of suffix, then as shown in Figure 6, then, rear
When continuous Scheduling Algorithm calculates, because sequence is exchanged, invalid code as shown in Figure 7 can be produced（A2 can not possibly be before A1）.
And the present embodiment encoding scheme, because Scheduling Algorithm only operates to first layer, do not change the second layer, so making
Invalid code will not be produced with bilayer coding.
Thus, encoded by bilayer, can not only avoid sequence from characterizing the problem of insufficient, chromosome is deposited in product task
In serial, parallel, network process task, solution space is characterized completely, is expanded algorithm and is plugged in rope scope, because same first layer code
String can correspond to all possible actual process task job sequence by the explanation of second layer sequence；In addition double-deck coding can also
The information content that greatly increase sequence includes, and then all kinds of genetic manipulations based on bilayer coding can be amplified out, calculated so as to improve
The optimizing performance of method.
As shown in figure 8, second embodiment of the invention proposes a kind of chromosome coding method based on intelligent scheduling, above-mentioned
On the basis of first embodiment, also include before above-mentioned steps S101：
Step S100, it is the ordering map table of the product task creation process task.
The present embodiment and the difference of above-mentioned first embodiment are that the sequence that the present embodiment also includes creating process task is reflected
The scheme of firing table.
Specifically, it is contemplated that different product task has serial, parallel, network process task dispatching working procedures task, often
The ordering map table of the process task of individual product task then has difference, for example the product for including parallel process task is appointed
Business, it includes parallel multiple product Machining Sequencing scheme, therefore, for each Product processing sequencing schemes, creates one
The ordering map table of process task, by putting in order in ordering map table, the Product processing sequencing schemes is identified successively and are wanted
The numbering for the corresponding process task asked, when performing manufacturing procedure, according to first layer encode sequence and the second layer encode sequence it
Between incidence relation, be sequentially completed corresponding process task in the scheduling of chromosome sequence sign.
The present embodiment, by creating the ordering map table of process task, double-deck volume is carried out to chromosome by such scheme
Code, chromosome mapping space can be made when product task has serial, parallel, network process task dispatching working procedures task, it is complete
It is complete to characterize business solution space, expand the plug in rope scope of Scheduling Algorithm, avoid sequence from characterizing the problem of insufficient.
As shown in figure 9, third embodiment of the invention proposes a kind of chromosome coding method based on intelligent scheduling, above-mentioned
On the basis of second embodiment, after above-mentioned steps S102, in addition to：
Step S103, business genetic manipulation is carried out based on the chromosome sequence.
The present embodiment and the difference of above-mentioned first embodiment are that the present embodiment also includes the something lost in double-deck basis of coding
Operation is passed, to improve the optimizing performance of Scheduling Algorithm.
Specifically, the double-deck coding realized by above-described embodiment can greatly increase the information content that sequence includes, and enter
And all kinds of genetic manipulations based on bilayer coding can be amplified out, so as to improve the optimizing performance of Scheduling Algorithm.
As shown in Figure 10, first embodiment of the invention proposes a kind of chromosome coding device based on intelligent scheduling, including：
Acquisition module 201 and coding module 202, wherein：
Acquisition module 201, for obtaining product task；The process that at least one product task includes at least two types
Task；
Coding module 202, for being encoded based on process task and using double-deck coding rule to product task, obtain
Characterize the chromosome sequence of any default process task job sequence.
Wherein, product task can be one or more.
Provided with two product tasks, respectively A, B；Its process task included and relation are as shown in Figure 3.
Each circle represents a process task in Fig. 3, and arrow represents the relation between process, and A includes 5 processes and appointed
Business, each operation task is Serial Relation, and B includes 6 process tasks, parallel process be present, and a chromosome coding is actual for production
Product Machining Sequencing scheme, if being encoded by existing method, the chromosome coding sequence that it is formed is as shown in Figure 1.
A1, B1, A2 are pressed in this coded representation, B2, B3, B4, A3, A4, B5, and B6, A5 order arranges process to process, this
Coding method has the drawback that：If the process modeling of product is nonlinear（Such as product B）, then this coding method
Caused chromosome sequence can not characterize whole solution space.In example shown in Fig. 1, the process task of sign is encoded
Sequentially all be forever ..., B1 ..., B2 ..., B3 ..., B4 ..., B5 ...,
B6 ... } this pattern, without being likely to occur other effective 5 kinds of patterns：..., B3 ..., B4 ...,
B1 ..., B2 ..., B5 ..., B6 ...；..., B1 ..., B3 ...,
B2 ..., B4 ..., B5 ..., B6 ...；..., B1 ..., B3 ...,
B4 ..., B2 ..., B5 ..., B6 ...；..., B3 ..., B1 ...,
B2 ..., B4 ..., B5 ..., B6 ...；..., B3 ..., B1 ...,
B4 ..., B2 ..., B5 ..., B6 ....That is the coding method shown in existing Fig. 1 can only
1/6 sequencing schemes are characterized, optimal solution can only be found in this 1/6 sequencing schemes by thereby resulting in genetic algorithm, so as to significantly
Reduce the optimizing performance of Scheduling Algorithm.
In consideration of it, the present embodiment proposes a kind of double-deck encoding scheme, mainly solve product task exist it is serial, parallel,
During network process task dispatching working procedures task, business solution space can not be characterized completely, cause sequence to characterize deficiency, reduce scheduling
The problem of optimizing performance of algorithm.
First, product task is obtained；Wherein, at least one product task includes serial, parallel or network process task
Etc. polytype process task.
After product task is got, the product task is compiled based on process task and using double-deck coding rule
Code, obtains characterizing the chromosome sequence of any default process task job sequence, and its detailed process is as follows：
First, the product task is ranked up in the first coding layer, obtains first layer coding sequence；Can first it obtain
Product task ranking rule；Afterwards in the first coding layer, according to the product task ranking rule of the acquisition, the product is appointed
Business is ranked up, and thus obtains first layer coding sequence.
Then, the ordering map table of the current process task of each product task in first coding layer is obtained；
In second coding layer, according to the ordering map table of the current process task of each product task, to corresponding to each product task
Sequencing schemes are encoded, and obtain second layer coding sequence.
Finally, the ordering map table second layer encoded in sequence encodes corresponding product times in sequence with first layer
Business is associated, and obtains characterizing the chromosome sequence of any default process task job sequence.
Based on two kinds of product tasks of A, B, the double-deck encoding scheme proposed using the present embodiment, the chromosome code that can be formed
String form is as shown in Figure 4.Detailed process is as follows：
First layer compared with sort method it is identical, be a character in each frame, represent a process task, the second layer
It is that first layer is explained further, each inframe is a process task object, and is appointed for the current process of product task
Business forms an ordering map table.Encoded for identical first layer, there can be multiple different second layers to encode, the volume in Fig. 4
Code represents same order with the single layer coding shown in existing Fig. 1.Now, if doing a little variations to the second layer, as shown in figure 5,
The processing sequence then represented becomes { A1, B3, A2, B4, B1, B2, A3, A4, B5, B6, A5 }, can thus by two layer encoding
To represent all process task processing sequences, different process task processing sequences is mapped by different process task rankings
Table embodies.
In addition, if directly second layer coding is put on the first layer in the form of suffix, then as shown in Figure 6, then,
When follow-up Scheduling Algorithm calculates, because sequence is exchanged, invalid code as shown in Figure 7 can be produced（A2 can not possibly be before A1）.
And the present embodiment encoding scheme, because Scheduling Algorithm only operates to first layer, do not change the second layer, so making
Invalid code will not be produced with bilayer coding.
Thus, encoded by bilayer, can not only avoid sequence from characterizing the problem of insufficient, chromosome is deposited in product task
In serial, parallel, network process task, solution space is characterized completely, is expanded algorithm and is plugged in rope scope, because same first layer code
String can correspond to all possible actual process task job sequence by the explanation of second layer sequence；In addition double-deck coding can also
The information content that greatly increase sequence includes, and then all kinds of genetic manipulations based on bilayer coding can be amplified out, calculated so as to improve
The optimizing performance of method.
More specifically, as shown in figure 11, the coding module 202 includes：First compiles unit 2021, acquiring unit
2022nd, the second coding unit 2023 and associative cell 2024, wherein：
First compiles unit 2021, for being ranked up in the first coding layer to the product task, obtains first layer coding
Sequence；
Acquiring unit 2022, for obtaining the row of the current process task of each product task in first coding layer
Sequence mapping table；
Second coding unit 2023, in the second coding layer, according to the current process task of each product task
Ordering map table, sequencing schemes corresponding to each product task are encoded, obtain second layer coding sequence；
Associative cell 2024, encoded for the second layer to be encoded to the ordering map table in sequence with first layer in sequence
Corresponding product task is associated, and obtains characterizing the chromosome sequence of any default process task job sequence.
Further, the first volume unit 2021 is additionally operable to obtain product task ranking rule；In the first coding layer, press
According to the product task ranking rule of the acquisition, the product task is ranked up, obtains first layer coding sequence.
As shown in figure 12, second embodiment of the invention proposes a kind of chromosome coding device based on intelligent scheduling, upper
On the basis of stating first embodiment, in addition to：
Creation module 200, for the ordering map table for the product task creation process task.
The present embodiment and the difference of above-mentioned first embodiment are that the sequence that the present embodiment also includes creating process task is reflected
The scheme of firing table.
Specifically, it is contemplated that different product task has serial, parallel, network process task dispatching working procedures task, often
The ordering map table of the process task of individual product task then has difference, for example the product for including parallel process task is appointed
Business, it includes parallel multiple product Machining Sequencing scheme, therefore, for each Product processing sequencing schemes, creates one
The ordering map table of process task, by putting in order in ordering map table, the Product processing sequencing schemes is identified successively and are wanted
The numbering for the corresponding process task asked, when performing manufacturing procedure, according to first layer encode sequence and the second layer encode sequence it
Between incidence relation, be sequentially completed corresponding process task in the scheduling of chromosome sequence sign.
The present embodiment, by creating the ordering map table of process task, double-deck volume is carried out to chromosome by such scheme
Code, chromosome mapping space can be made when product task has serial, parallel, network process task dispatching working procedures task, it is complete
It is complete to characterize business solution space, expand the plug in rope scope of Scheduling Algorithm, avoid sequence from characterizing the problem of insufficient.
As shown in figure 13, third embodiment of the invention proposes a kind of chromosome coding device based on intelligent scheduling, upper
On the basis of stating second embodiment, in addition to：
Operation module 203, for carrying out business genetic manipulation based on the chromosome sequence.
The present embodiment and the difference of above-mentioned first embodiment are that the present embodiment also includes the something lost in double-deck basis of coding
Operation is passed, to improve the optimizing performance of Scheduling Algorithm.
Specifically, the double-deck coding realized by above-described embodiment can greatly increase the information content that sequence includes, and enter
And all kinds of genetic manipulations based on bilayer coding can be amplified out, so as to improve the optimizing performance of Scheduling Algorithm.
Chromosome coding method and device of the embodiment of the present invention based on intelligent scheduling, by carrying out double-deck volume to chromosome
Code, chromosome mapping space can be made when product task has serial, parallel, network process task dispatching working procedures task, it is complete
It is complete to characterize business solution space, expand the plug in rope scope of Scheduling Algorithm, avoid sequence from characterizing the problem of insufficient；In addition, double-deck coding
The information content that sequence includes can also greatly be increased, and then all kinds of genetic manipulations based on bilayer coding can be amplified out, so as to carry
The optimizing performance of high Scheduling Algorithm.
The preferred embodiments of the present invention are above are only, are not intended to limit the scope of the invention, it is every to utilize this hair
Equivalent structure or the flow conversion that bright specification and accompanying drawing content are made, or directly or indirectly it is used in other related technology necks
Domain, it is included within the scope of the present invention.
Claims (9)
- A kind of 1. chromosome coding method based on intelligent scheduling, it is characterised in that including：Obtain product task；At least one product task includes the process task of at least two types；The product task is encoded based on process task and using double-deck coding rule, obtains characterizing any default work The chromosome sequence of sequence task job sequence；It is described that product task is compiled based on process task and using double-deck coding rule Code, obtain including the step of characterizing the chromosome sequence of any default process task job sequence：The product task is ranked up in the first coding layer, obtains first layer coding sequence；Obtain the ordering map table of the current process task of each product task in first coding layer；In the second coding layer, according to the ordering map table of the current process task of each product task, to each product task Corresponding sequencing schemes are encoded, and obtain second layer coding sequence；The ordering map table second layer encoded in sequence is closed with corresponding product task in first layer coding sequence Connection, obtain characterizing the chromosome sequence of any default process task job sequence.
- 2. according to the method for claim 1, it is characterised in that described that the product task is arranged in the first coding layer Sequence, obtaining the step of first layer encodes sequence includes：Obtain product task ranking rule；In the first coding layer, according to the product task ranking rule of the acquisition, the product task is ranked up, obtains the One layer of coding sequence.
- 3. method according to claim 1 or 2, it is characterised in that also include before described the step of obtaining product task：For the ordering map table of the product task creation process task.
- 4. according to the method for claim 3, it is characterised in that the product task includes serial, parallel and/or network work Sequence task.
- 5. according to the method for claim 1, it is characterised in that also include：Business genetic manipulation is carried out based on the chromosome sequence.
- A kind of 6. chromosome coding device based on intelligent scheduling, it is characterised in that including：Acquisition module, for obtaining product task；At least one product task includes the process task of at least two types；Coding module, for being encoded based on process task and using double-deck coding rule to product task, obtain characterizing and appoint The chromosome sequence for default process task job sequence of anticipating；The coding module includes：First compiles unit, for being ranked up in the first coding layer to the product task, obtains first layer coding sequence；Acquiring unit, for obtaining the ordering map of the current process task of each product task in first coding layer Table；Second coding unit, in the second coding layer, according to the ordering map of the current process task of each product task Table, sequencing schemes corresponding to each product task are encoded, obtain second layer coding sequence；Associative cell, the ordering map table for encoding the second layer in sequence encode corresponding production in sequence with first layer Product task is associated, and obtains characterizing the chromosome sequence of any default process task job sequence.
- 7. device according to claim 6, it is characterised in thatDescribed first compiles unit, is additionally operable to obtain product task ranking rule；In the first coding layer, according to the product of the acquisition Task ranking rule, is ranked up to the product task, obtains first layer coding sequence.
- 8. the device according to claim 6 or 7, it is characterised in that also include：Creation module, for the ordering map table for the product task creation process task.
- 9. device according to claim 8, it is characterised in that also include：Operation module, for carrying out business genetic manipulation based on the chromosome sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310552686.0A CN103559544B (en) | 2013-11-07 | 2013-11-07 | Chromosome coding method and device based on intelligent scheduling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310552686.0A CN103559544B (en) | 2013-11-07 | 2013-11-07 | Chromosome coding method and device based on intelligent scheduling |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103559544A CN103559544A (en) | 2014-02-05 |
| CN103559544B true CN103559544B (en) | 2017-11-17 |
Family
ID=50013785
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310552686.0A Active CN103559544B (en) | 2013-11-07 | 2013-11-07 | Chromosome coding method and device based on intelligent scheduling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103559544B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114611995B (en) * | 2022-03-30 | 2023-04-28 | 精英数智科技股份有限公司 | Process scheduling method and system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101320448A (en) * | 2008-04-09 | 2008-12-10 | 永凯软件技术（上海）有限公司 | Genetic algorithm encoding and decoding method based on order structure |
| CN101377789A (en) * | 2007-08-29 | 2009-03-04 | 宝山钢铁股份有限公司 | Method and apparatus for composing furnace by plate blank in steel-smelting production process |
-
2013
- 2013-11-07 CN CN201310552686.0A patent/CN103559544B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101377789A (en) * | 2007-08-29 | 2009-03-04 | 宝山钢铁股份有限公司 | Method and apparatus for composing furnace by plate blank in steel-smelting production process |
| CN101320448A (en) * | 2008-04-09 | 2008-12-10 | 永凯软件技术（上海）有限公司 | Genetic algorithm encoding and decoding method based on order structure |
Non-Patent Citations (1)
| Title |
|---|
| 基于混合遗传算法的硬质合金刀具生产车间调度研究;柳翔飞;《中国优秀硕士学位论文全文数据库（工程科技I辑）》;20080831;第B022-186页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103559544A (en) | 2014-02-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Grabowska | Smart factories in the age of Industry 4.0 | |
| Liu et al. | Springback prediction for sheet metal forming based on GA-ANN technology | |
| Zhang et al. | Integrated design and operation management for enterprise systems | |
| Chung et al. | Application of genetic approach for advanced planning in multi-factory environment | |
| CN111061232A (en) | Production line design and optimization method based on digital twinning | |
| WO2020257812A3 (en) | Modeling dependencies with global self-attention neural networks | |
| CN108053047A (en) | Cloud resources of production scheduling methods, devices and systems | |
| CN107862094A (en) | Product parts classification and coding system construction method based on group technology | |
| CN106933200A (en) | The control method of the solution Flexible Job-shop Scheduling Problems based on genetic algorithm | |
| DE602005024399D1 (en) | Method and software for optimizing the positioning of software functions in a memory | |
| CN103559544B (en) | Chromosome coding method and device based on intelligent scheduling | |
| CN108647859A (en) | The double population collaborative learning strategies of displacement assembly line and optimization method of Knowledge driving | |
| Rogers et al. | Special issue on 3D printing: Opportunities and applications for supply chain management | |
| Wong et al. | Genetic optimization of fabric utilization in apparel manufacturing | |
| Süer et al. | Models for cell loading and product sequencing in labor-intensive cells | |
| Nagar et al. | An AHP-based approach for the selection of HFMS: an Indian perspective | |
| Kim et al. | A TRIZ-based approach to generation of service-supporting product concepts | |
| Wolniak et al. | THE IMPLEMENTATION OF INDUSTRY 4.0 CONCEPT IN SMART CITY. | |
| US20180157735A1 (en) | Method and system for clustering engineering data in a multidisciplinary engineering system | |
| Potočnik et al. | Hybrid self-organization based facility layout planning | |
| CN110705650B (en) | Sheet metal layout method based on deep learning | |
| TW201028916A (en) | Program edit system and method for PLC | |
| Abbasi et al. | Determination of manufacturing strategy using interpretive structural modeling | |
| CN106920036A (en) | A kind of job shop equipment enlivens energy-conservation scheduling method and system entirely | |
| Afshari et al. | Distribution-service network design: an agent-based approach |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |