CN104537503B - Data processing method and system - Google Patents
Data processing method and system Download PDFInfo
- Publication number
- CN104537503B CN104537503B CN201510021667.4A CN201510021667A CN104537503B CN 104537503 B CN104537503 B CN 104537503B CN 201510021667 A CN201510021667 A CN 201510021667A CN 104537503 B CN104537503 B CN 104537503B
- Authority
- CN
- China
- Prior art keywords
- scheduling scheme
- feasible
- resource
- optimization aim
- feasible scheduling
- 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
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of data processing method, this method includes：Analyzed according to the order taking responsibility of reception and obtain the resource information of resource needed for completion order taking responsibility and production constraints；Feasible scheduling scheme is generated according to resource information and production constraints, and feasible scheduling scheme is put into default task feasible solution pond；According to resource information and default optimization aim, feasible scheduling scheme is evaluated, analysis determines that the feasible scheduling scheme of evaluation of estimate highest is optimal scheduling scheme.The invention also discloses a kind of data handling system.The present invention is led based on resource, the feasible scheduling scheme of recurrence crawl matching Current resource, feasible scheduling scheme is evaluated according to default optimization aim, it is final to determine that the feasible scheduling scheme of evaluation of estimate highest is optimal scheduling scheme, untill the resource traversal of all production tasks in order taking responsibility is completed, so avoid, because selecting unreasonable scheduling scheme, to cause the increased technical problem of claim for eot, cost.
Description
Technical field
The present invention relates to a kind of data processing method and system.
Background technology
The production scheduling protocol questions of enterprise are very complicated multi-objective optimization questions, and subsidiary many constraintss,
Situation is more miscellaneous, and general use optimizes place by leading optimization method of production task to production scheduling scheme in the prior art
Reason, i.e., can complete production task as optimization aim, the production scheduling scheme for selecting achievable production task is real as enterprise
The production scheduling scheme finally performed in the production of border.But when the production scheduling scheme that production task can be achieved has a variety of, can
Realize the production scheduling scheme of production task relative to uneven, the optional feasible schedule scheme of the inevitable quality ginseng time of production task
It is difficult to choose most suitable feasible production scheduling scheme, it can so extend the duration needed for completion production task, life is completed in increase
Produce the cost of required by task.
The above is only used for auxiliary and understands technical scheme, does not represent and recognizes that the above is existing skill
Art.
The content of the invention
It is a primary object of the present invention to provide a kind of data processing method and system, it is intended to solve based on production task
Lead and processing is optimized to production scheduling scheme be difficult to select reasonable production scheduling scheme, easily cause claim for eot, cost increases
The technical problem added.
To achieve the above object, a kind of data processing method provided by the invention, the data processing method include following
Step：
Analyzed according to the order taking responsibility of reception and obtain the resource information of resource and production needed for the completion order taking responsibility about
Beam condition；
Feasible scheduling scheme is generated according to the resource information and production constraints, and the feasible scheduling scheme is put
Enter in default task feasible solution pond；
According to the resource information and default optimization aim, the feasible scheduling scheme is evaluated, analysis determines
Feasible scheduling scheme described in evaluation of estimate highest is optimal scheduling scheme.
Preferably, it is described according to the resource information and default optimization aim, the feasible scheduling scheme is commented
Valency, compare and determine that the step of feasible scheduling scheme described in evaluation of estimate highest is optimal scheduling scheme includes：
Instructed according to the resource settings of reception, at least one resource is selected from the resource needed for the completion order taking responsibility
It is set as primary resource, remaining resource settings is auxiliary resources；
Instructed according to the optimization aim of reception, for main optimization aim and the auxiliary resources corresponding to primary resource setting
Secondary optimization aim corresponding to setting；
Optimizing evaluation twice is carried out to the feasible scheduling scheme according to the main optimization aim and secondary optimization aim, than
It is optimal scheduling scheme compared with feasible scheduling scheme described in determination evaluation of estimate highest.
Preferably, it is described that two suboptimization are carried out to the feasible scheduling scheme according to main optimization aim and secondary optimization aim
Evaluation, compare and determine that the step of feasible scheduling scheme described in evaluation of estimate highest is optimal scheduling scheme includes：
The primary weight values of the main optimization aim and the secondary weighted value of secondary optimization aim are set；
The main optimization degree of the feasible scheduling scheme is drawn according to the main optimization aim analysis, according to the secondary optimization
Target analysis draws the secondary optimization degree of the feasible scheduling scheme；
The main optimization degree that the feasible scheduling scheme is calculated is multiplied by the product and the feasible scheduling scheme of primary weight values
Secondary optimization degree is multiplied by the product sum of secondary weighted value, and the rwo sum is weighted again average as feasible
The evaluation of estimate of scheduling scheme；
Compare and determine that feasible scheduling scheme is as optimal scheduling scheme described in evaluation of estimate highest.
Preferably, it is described according to the resource information and default optimization aim, the feasible scheduling scheme is commented
Valency, compare and determine that the step of feasible scheduling scheme described in evaluation of estimate highest is optimal scheduling scheme is：
According to formulaCalculate the evaluation of all feasible scheduling schemes
Value F (X), compare and determine that the feasible scheduling scheme of evaluation of estimate F (X) highest is optimal scheduling scheme, wherein, X arranges for present feasible
Production scheme, Yi(X) for present feasible scheduling scheme i-th of optimization aim optimization degree function, WiFor present feasible scheduling scheme
I-th of optimization aim weighted value, N be present feasible scheduling scheme optimization aim total number, J is present feasible scheduling
The total number of resource is included in scheme.
Preferably, the production constraints has including processing route constraints, process validity constraint condition, instruction
At least one of effect property constraints, resource availability constraints and production characteristic matching constraints.
In addition, to achieve the above object, the present invention also provides a kind of data handling system, the data handling system bag
Include：
Acquisition module, the resource of resource needed for the completion order taking responsibility is obtained for being analyzed according to the order taking responsibility of reception
Information and production constraints；
Feasible program generation module, for generating feasible scheduling scheme according to the resource information and production constraints,
And the feasible scheduling scheme is put into default task feasible solution pond；
Determining module is analyzed, for according to the resource information and default optimization aim, to the feasible scheduling scheme
Evaluated, analysis determines that feasible scheduling scheme described in evaluation of estimate highest is optimal scheduling scheme.
Preferably, the analysis determining module includes：
Resource settings unit, for being instructed according to the resource settings of reception, from the resource completed needed for the order taking responsibility
The middle at least one resource settings of selection are primary resource, and remaining resource settings is auxiliary resources；
Target sets instruction, is instructed for being set according to the target of reception, is main optimization corresponding to the primary resource is set
Secondary optimization aim corresponding to target and auxiliary resources setting；
Comparing unit, for carrying out two to the feasible scheduling scheme according to the main optimization aim and secondary optimization aim
Suboptimization is evaluated, and is compared and is determined that feasible scheduling scheme described in evaluation of estimate highest is optimal scheduling scheme.
Preferably, the comparing unit is additionally operable to：
The primary weight values of the main optimization aim and the secondary weighted value of secondary optimization aim are set；
The main optimization degree of the feasible scheduling scheme is drawn according to the main optimization aim analysis, according to the secondary optimization
Target analysis draws the secondary optimization degree of the feasible scheduling scheme；
The main optimization degree that the feasible scheduling scheme is calculated is multiplied by the product and the feasible scheduling scheme of primary weight values
Secondary optimization degree is multiplied by the product sum of secondary weighted value, and the rwo sum is weighted again average as feasible
The evaluation of estimate of scheduling scheme；
Compare and determine that feasible scheduling scheme is as optimal scheduling scheme described in evaluation of estimate highest.
Preferably, the analysis determining module is additionally operable to：
According to formulaCalculate the evaluation of estimate F of all feasible scheduling schemes
(X), compare and determine that the feasible scheduling scheme of evaluation of estimate F (X) highest is optimal scheduling scheme, wherein, X is present feasible scheduling side
Case, Yi(X) for present feasible scheduling scheme i-th of optimization aim optimization degree function, WiFor the of present feasible scheduling scheme
The weighted value of i optimization aim, N are the total number of the optimization aim of present feasible scheduling scheme, and J is present feasible scheduling scheme
In include the total number of resource.
Preferably, the production constraints has including processing route constraints, process validity constraint condition, instruction
At least one of effect property constraints, resource availability constraints and production characteristic matching constraints.
The resource information of present invention resource first according to needed for the order taking responsibility is completed in the analysis acquisition of the order taking responsibility of reception
With production constraints；Then feasible scheduling scheme is generated according to resource information and production constraints, and by feasible scheduling side
Case is put into default task feasible solution pond；Finally according to the resource information and default optimization aim, to the feasible row
Production scheme is evaluated, and analysis determines that feasible scheduling scheme described in evaluation of estimate highest is optimal scheduling scheme, is so unsatisfactory for
The scheduling scheme of production constraints is filtered first, filters out production constraints and order taking responsibility is required to be provided with completing
The feasible production scheduling scheme of the resource information in source；Then led based on resource, the feasible row of recurrence crawl matching Current resource
Production scheme, feasible scheduling scheme is evaluated according to default optimization aim, final analysis determines that evaluation of estimate highest is feasible
Scheduling scheme is optimal scheduling scheme, untill the resource traversal of all production tasks in order taking responsibility is completed, thus
Avoid because selecting unreasonable scheduling scheme, cause the increased technical problem of claim for eot, cost.
Brief description of the drawings
Fig. 1 is the schematic flow sheet of the embodiment of data processing method one of the present invention；
Fig. 2 is that the feasible scheduling scheme is commented according to the resource information and default optimization aim in Fig. 1
Valency, analysis determine the refinement flow that the step of feasible scheduling scheme described in evaluation of estimate highest is optimal scheduling scheme first is implemented
Schematic diagram；
Fig. 3 is to carry out optimizing evaluation twice to feasible scheduling scheme according to main optimization aim and secondary optimization aim in Fig. 2,
Compare the refinement schematic flow sheet for determining that the feasible scheduling scheme of evaluation of estimate highest is optimal scheduling scheme；
Fig. 4 is the high-level schematic functional block diagram of the embodiment of data handling system one of the present invention；
Fig. 5 is the refinement functional mode schematic diagram that determining module is analyzed in Fig. 4；
Fig. 6 is the schematic flow sheet of data processing method preferred embodiment of the present invention；
Fig. 7 is that data processing method preferred embodiment of the present invention selects evaluation of estimate highest scheduling scheme from feasible solution pond
Schematic flow sheet.
The realization, functional characteristics and advantage of the object of the invention will be described further referring to the drawings in conjunction with the embodiments.
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 present invention provides a kind of data processing method, in terms of the optimization for being used primarily in enterprise's scheduling scheme.
Reference picture 1, Fig. 1 are the schematic flow sheet of the embodiment of data processing method one of the present invention.
In one embodiment, the data processing method comprises the following steps：
Step S10, analyzed according to the order taking responsibility of reception and obtain the resource information of resource and life needed for completion order taking responsibility
Produce constraints；
It is order taking responsibility by product order decomposition after manufacturing enterprise is connected to product order, and is input to for optimizing row
In the data handling system of production scheme, i.e., the order taking responsibility of user's input is first received before step S10, it is then defeated according to user
The order taking responsibility analysis entered, which obtains, completes the resource information of resource needed for the order taking responsibility and production constraints, such as order is appointed
It is engaged in produce the product of injection molding, then the resource needed is injection machine and product mold, and corresponding production constraints has production
The production feature such as the precision of product, specification.
Step S20, feasible scheduling scheme is generated according to resource information and production constraints, and feasible scheduling scheme is put
Enter in default task feasible solution pond；
Resource according to needed for resource information determines completion order taking responsibility, generates all possible scheduling scheme, Ran Hougen
The scheduling scheme for not meeting the production constraints is excluded according to production constraints, that is, selects feasible scheduling scheme, and can
Row scheduling scheme is put into default task feasible solution pond.
Step S30, according to resource information and default optimization aim, feasible scheduling scheme is evaluated, analysis determines
The feasible scheduling scheme of evaluation of estimate highest is optimal scheduling scheme.
According to resource information and default optimization aim, the feasible scheduling scheme in task feasible solution pond is commented one by one
Valency, the evaluation of estimate of each feasible scheduling scheme is drawn, be defined as optimal scheduling from the feasible scheduling scheme of evaluation of estimate highest is selected
Scheme.
In addition, optimization aim includes：
1) overdue minimum, punctual delivery then the optimization aim Optimum Matching degree be 1, as far as possible ensure product handing over
Completed on time between delivery date；If overdue, the Optimum Matching degree of the optimization aim is negative, overdue bigger, the optimization aim
Optimum Matching degree it is smaller；
2) switching time minimizes, and the switching time occurred between current production scheduling scheme and side task is bigger, then
The Optimum Matching degree of the optimization aim is closer to 0, and in the case of no setting time, then the Optimum Matching degree of the optimization aim is 1；
3) same item is preferential, and the production task on current production scheduling scheme and side is the situation of same items, then
The Optimum Matching degree of the optimization aim is 1, conversely, then the Optimum Matching degree of the optimization aim is 0；
4) manufacturing time minimizes, and manufacturing time is bigger, then the Optimum Matching degree of the optimization aim is closer to 0, during manufacture
Between it is smaller, then the Optimum Matching degree of the optimization aim is closer to 1；
5) resource priority degree, resource priority degree is according to size prioritization；
6) production cost minimizes, main the start cost for including manufacture and human cost etc.；
7) stand-by period and minimizes, when the stand-by period is bigger, the Optimum Matching degree of the optimization aim is closer to 0, during wait
Between more hour, then the Optimum Matching degree of the optimization aim is closer to 1；
8) order margin is minimized, and the minimum scheduling scheme of margin is preferentially distributed, i.e., margin is smaller, the optimization mesh
Target Optimum Matching degree is higher.
Preferably, producing constraints includes processing route constraints, process validity constraint condition, instruction validity
At least one of constraints, resource availability constraints and production characteristic matching constraints.
Processing route constraints, refer to the processing route in feasible production scheduling scheme must be manufacturing enterprise have or
The processing route that person can use.
Process validity constraint condition, it must be that manufacturing enterprise is currently used to refer to the process in feasible production scheduling scheme
Effective process.
Instruction validity constraints：It must be that manufacturing enterprise works as to refer to the used instruction in feasible production scheduling scheme
Instructed used in preceding.
Resource availability constraints：It must be that manufacturing enterprise works as to refer to the used resource in feasible production scheduling scheme
Efficient resource used in preceding.
Produce characteristic matching constraints：The used production feature referred in feasible production scheduling scheme must match life
Produce the production feature of enterprise's Current resource.
In the present embodiment, the money of resource needed for completing the order taking responsibility is obtained according to the analysis of the order taking responsibility of reception first
Source information and production constraints；Then feasible scheduling scheme is generated according to resource information and production constraints, and will be feasible
Scheduling scheme is put into default task feasible solution pond；Finally according to resource information and default optimization aim, to feasible scheduling
Scheme is evaluated, and analysis determines that the feasible scheduling scheme of evaluation of estimate highest is optimal scheduling scheme, is so unsatisfactory for production about
The scheduling scheme of beam condition is filtered first, filters out production constraints and with the money for completing resource needed for order taking responsibility
The feasible production scheduling scheme of source information；Then led based on resource, the feasible scheduling scheme of recurrence crawl matching Current resource,
Feasible scheduling scheme is evaluated according to default optimization aim, final analysis determines the feasible scheduling scheme of evaluation of estimate highest
For optimal scheduling scheme, untill the resource traversal of all production tasks in order taking responsibility is completed, so avoid because
Unreasonable scheduling scheme is selected, causes the increased technical problem of claim for eot, cost.
Further, reference picture 2, Fig. 2 are the refinement schematic flow sheet of step S30 in Fig. 1.
In the present embodiment, step S30 includes：
Step S301, instructed according to the resource settings of reception, at least one is selected from the resource needed for completion order taking responsibility
Kind resource settings are primary resource, and remaining resource settings is auxiliary resources；
Important level of the user according to different types of resource relative to order taking responsibility, resource is inputted to data handling system
Setting instruction, system are instructed according to the resource settings of reception, and at least one money is selected from the resource needed for completion order taking responsibility
Source is set as that (the high resource of important level is primary resource, such as important level is set into level Four primary resource, and the resource of the first order is
Primary resource, the resource of other ranks is auxiliary resources), remaining resource settings is auxiliary resources.
Step S302, instructed according to the optimization aim of reception, provided for main optimization aim and auxiliary corresponding to primary resource setting
Secondary optimization aim corresponding to the setting of source；
User can input optimization aim instruction to data handling system, be main optimization aim corresponding to primary resource is set,
For secondary optimization aim corresponding to auxiliary resources setting, main optimization aim and auxiliary optimization aim can be the same or different,
Primarily directed to resource, optimization aim is set, for example, optimization aim be manufacturing time minimize, Optimized Matching degree be 0~1 it
Between value, manufacturing time is bigger closer to 0, smaller closer to 1.
Step S303, optimizing evaluation twice is carried out to feasible scheduling scheme according to main optimization aim and secondary optimization aim,
Compare and determine that the feasible scheduling scheme of evaluation of estimate highest is optimal scheduling scheme.
Preferably, reference picture 3, step S303 comprise the following steps：
Step S3031, the primary weight values of main optimization aim and the secondary weighted value of secondary optimization aim are set；
User sets the weighted value of optimization aim according to production needs, the instruction that data handling system inputs according to user,
The primary weight values of main optimization aim and the secondary weighted value of secondary optimization aim are set, such as primary weight values are 0.95, secondary power
Weight values are 0.05.
Step S3032, the main optimization degree of feasible scheduling scheme is drawn according to the analysis of main optimization aim, optimizes mesh according to secondary
Mark analysis draws the secondary optimization degree of feasible scheduling scheme；
Optimization aim can be function on optimization degree, and each the resource of feasible scheduling scheme has pair with respect to optimization aim
The optimization degree answered, so the main optimization degree of feasible scheduling scheme is drawn according to the analysis of main optimization aim, according to secondary optimization aim
Analysis draws the secondary optimization degree of feasible scheduling scheme.
Step S3033, the main optimization degree that feasible scheduling scheme is calculated are multiplied by the product and the feasible scheduling of primary weight values
The secondary optimization degree of scheme is multiplied by the product sum of secondary weighted value, and the rwo sum is weighted into average work again
For the evaluation of estimate of feasible scheduling scheme；
The product that the evaluation of estimate of feasible scheduling scheme is multiplied by primary weight values equal to the main optimization degree of feasible scheduling scheme can with this
The product sum that the secondary optimization degree of row scheduling scheme is multiplied by secondary weighted value is weighted the value of average gained again.
Step S3034, compare and determine the feasible scheduling scheme of evaluation of estimate highest as optimal scheduling scheme
In the present embodiment, by be unsatisfactory for produce constraints scheduling scheme filter out first, and it is other it is nonproductive about
Beam condition is completely converted into the optimization aim as optimal conditions, can so avoid the occurrence of caused by more nonproductive constraints not
Feasible scheduling scheme, feasible scheduling scheme is farthest generated, simply its objective optimization degree is different.For example, order is handed over
The constraints of delivery date, because order delivery date is not production constraints, the optimal conditions of optimization aim can be converted to, such as
Fruit can not meet delivery date, can find an overdue minimum solution as current scheduling scheme, overdue more serious, illustrate excellent
Change degree is lower, but user by way of consulting with client, can improve the enforceability of current planning.
Further, step S30 is：
Step S300, according to formulaCalculate all feasible scheduling schemes
Evaluation of estimate F (X), compare determine the feasible scheduling scheme of evaluation of estimate F (X) highest be optimal scheduling scheme, wherein, X is current
Feasible scheduling scheme, Yi(X) for present feasible scheduling scheme i-th of optimization aim optimization degree function, WiArranged for present feasible
The weighted value of i-th of optimization aim of production scheme, N are the total number of the optimization aim of present feasible scheduling scheme, and J is currently may be used
The total number of resource is included in row scheduling scheme.
In the present embodiment, the invention provides one kind to be dominated based on resource, and selected resource can be arranged
The data processing method of scheme optimization is produced, realizes production constraint and the double processing of objective optimization, and work as and multiple optimizations be present
During target, go out each scheduling scheme for meeting production constraints according to the weighted value different weights average computation of optimization aim
Evaluation of estimate, guarantee to generate a rational feasible scheduling scheme, while can be by improving the master of main target of optimization
Weighted value, it at utmost can preferentially meet main target of optimization, other secondary optimization aims are also paid close attention to accordingly, so as to
Had laid a good foundation to obtain an optimal feasible scheduling scheme, the utilization of resources inside final enterprise
Rate, reduce production cost, enterprise competitiveness.
Preferably, at reference picture 6, the scheduling scheme evaluation leading based on resource provided by the present invention and the data selected
Reason method, including step once：
The weighted value of step 1, setting production constraints, main optimization aim and secondary optimization aim；
A) the related production technology path of the order of scheduling and technology characteristics are treated in setting
User according to actual production technique, can have to scheduling key element and condition for validity of consideration etc. when setting scheduling raw
Constraints is produced, system produces the feasible scheduling side of the candidate of each resource according to the matching result of various production constraintss automatically
Case.A constraints decision table is defined for each production constraints, as shown in table 1.Constraints judges information
Table includes code constraint, constrained type, order code, operation code, assignment instructions, is constrained to the fields such as day-mark will, wherein about
Beam type is divided into：
A) processing route constrains, and whether order meets which processing route used.
Whether b) process validity constraint, order meet to use current process.
C) instruction validity constrains, and whether order meets to use present instruction
D) resource availability constrains, and whether order meets to use Current resource condition for validity
Whether e) industry characteristics matching constraint, the production feature of order match the production feature of Current resource.
| Sequence number | Field | Type | Length | Major key | Index | Acquiescence | Remarks |
| 1 | Code constraint | varchar | 30 | ||||
| 2 | Constrained type | varchar | 10 | ||||
| 3 | Order code | varchar | 30 | ||||
| 4 | Operation code | varchar | 40 | ||||
| 5 | Assignment instructions | varchar | 50 | ||||
| 6 | It is constrained to day-mark | bool |
Table 1
B main optimization aim) is set
Primary resource is directed to, user selects one or more kinds of as main optimization aim, tax in built-in optimization aim
Its higher weighted value, or self-defined main optimization aim are given, the primary resource progress to the feasible scheduling scheme of current candidate is excellent
Change degree is evaluated.Comment result that one optimization aim optimization degree information table is set for each optimization degree, as shown in table 2, it is led
The information is wanted to be：The information such as optimization degree code, optimization aim code, order code, operation code, assignment instructions, optimization degree.
| Sequence number | Field | Type | Length | Major key | Index | Acquiescence | Remarks |
| 1 | Optimization degree code | varchar | 10 | ||||
| 2 | Optimization aim code | varchar | 10 | ||||
| 3 | Order code | varchar | 30 | ||||
| 4 | Operation code | varchar | 40 | ||||
| 5 | Assignment instructions | varchar | 50 | ||||
| 6 | Optimize angle value | float |
Table 2
C secondary optimization aim) is set
Auxiliary resources is directed to, user selects one or more kinds of as secondary optimization mesh in built-in optimization aim
Mark, assigns its relatively low weighted value, or self-defined suboptimization target, the auxiliary resources of the feasible scheduling scheme of current candidate is entered
Row optimization degree evaluation.Comment result that one optimization aim optimization degree information table (as shown in table 2) is set for each optimization degree,
Its main information is：Optimization degree code, optimization aim code, order code, operation code, assignment instructions, optimization degree.
Step 2, carry out constraints judgement for scheduling scheme and optimization degree is evaluated, idiographic flow refer to Fig. 6, have
Body step is as follows：
A, feasible scheduling scheme judges, judges for each single item constraints, and generates constraints and judge information
Table；
B, the scheduling scheme all set up for institute's Prescribed Properties, is put into feasible solution pond, otherwise an order is at least present
One feasible solution, is otherwise put into intangibility pond；
C first carries out primary resource selection in feasible solution pond, and the feasible scheduling of related candidate is obtained according to selected primary resource
Scheme.
D, according to default optimization aim calculation optimization angle value, the optimization angle value of current scheduling scheme, scheduling scheme are exported
Judge and evaluation terminates.
Different optimization aims, optimization degree function is also different, according to optimization degree function calculate interior optimization angle value get over
Greatly, represent and more meet current optimization aim, the degree of optimization of optimization aim is better.Example is minimised as with overdue, its target
Optimization degree function representation is：
(1+x) works as x for F (x)=1/>=0 or F (x)=x/ (1-x) works as x<0
Wherein, x value is that the moment is completed in order delivery date-plan
E, judge to continue to carry out evaluation scheduling using Current resource as guiding, if it is, going back to D, otherwise go back to B.
Step 3, in step 2 optimization aim optimization angle value pair can Xie Chi work carry out descending sort；
Step 4, selects optimization degree highest scheduling scheme from the scheduling scheme in feasible solution pond, and flow chart refers to figure
7, comprise the following steps that：
A, it is arranged on the ratio upper limit threshold values L for selecting individual to account for feasible solution pond individual sum in feasible solution pond.
B, using statistical method, by calculating all variances for solving optimization angle value in feasible solution pond, calculate feasible
The diversity factor of individual optimization angle value in Xie Chi
C, for the solution in feasible solution pond, according to the height of optimization degree, selection optimizes the less a collection of individual of angle value diversity factor,
The number of individual needs to meet upper limit threshold values L, and this collection of individual is a collection of individual best in feasible solution pond.
D, this collection of individual of the person of choosing in C is given, selects an optimization angle value highest job.
E, based on work is selected in D, suboptimum objective optimization evaluation is carried out to secondary resource in units of work, selects suboptimum mesh
Mark optimization angle value highest scheduling scheme, generates final optimal scheduling scheme.
Step 5, export optimal scheduling scheme.
The present invention further provides a kind of data handling system, reference picture 4, Fig. 4 are real for data handling system one of the present invention
Apply the high-level schematic functional block diagram of example.
In the present embodiment, data handling system includes：
Acquisition module 40, the money of resource needed for the completion order taking responsibility is obtained for being analyzed according to the order taking responsibility of reception
Source information and production constraints；
It is order taking responsibility by product order decomposition after manufacturing enterprise is connected to product order, and is input to for optimizing row
In the data handling system of production scheme, i.e., the order of user's input is first received before the order taking responsibility that data handling system receives
Task, the resource information of resource and production needed for completing the order taking responsibility are then obtained according to the order taking responsibility analysis that user inputs
Constraints, such as order taking responsibility is the product of production injection molding, then the resource needed is injection machine and product mold, is corresponded to
Production constraints have the precision of product, specification etc. produce feature.
Feasible program generation module 50, for generating feasible scheduling side according to the resource information and production constraints
Case, and the feasible scheduling scheme is put into default task feasible solution pond；
Resource according to needed for resource information determines completion order taking responsibility, generates all possible scheduling scheme, Ran Hougen
The scheduling scheme for not meeting the production constraints is excluded according to production constraints, that is, selects feasible scheduling scheme, and can
Row scheduling scheme is put into default task feasible solution pond.
Determining module 60 is analyzed, for according to the resource information and default optimization aim, to the feasible scheduling side
Case is evaluated, and analysis determines that feasible scheduling scheme described in evaluation of estimate highest is optimal scheduling scheme.
According to resource information and default optimization aim, the feasible scheduling scheme in task feasible solution pond is commented one by one
Valency, the evaluation of estimate of each feasible scheduling scheme is drawn, be defined as optimal scheduling from the feasible scheduling scheme of evaluation of estimate highest is selected
Scheme.
In addition, optimization aim includes：
1) overdue minimum, punctual delivery then the optimization aim Optimum Matching degree be 1, as far as possible ensure product handing over
Completed on time between delivery date；If overdue, the Optimum Matching degree of the optimization aim is negative, overdue bigger, the optimization aim
Optimum Matching degree it is smaller；
2) switching time minimizes, and the switching time occurred between current production scheduling scheme and side task is bigger, then
The Optimum Matching degree of the optimization aim is closer to 0, and in the case of no setting time, then the Optimum Matching degree of the optimization aim is 1；
3) same item is preferential, and the production task on current production scheduling scheme and side is the situation of same items, then
The Optimum Matching degree of the optimization aim is 1, conversely, then the Optimum Matching degree of the optimization aim is 0；
4) manufacturing time minimizes, and manufacturing time is bigger, then the Optimum Matching degree of the optimization aim is closer to 0, during manufacture
Between it is smaller, then the Optimum Matching degree of the optimization aim is closer to 1；
5) resource priority degree, resource priority degree is according to size prioritization；
6) production cost minimizes, main the start cost for including manufacture and human cost etc.；
7) stand-by period and minimizes, when the stand-by period is bigger, the Optimum Matching degree of the optimization aim is closer to 0, during wait
Between more hour, then the Optimum Matching degree of the optimization aim is closer to 1；
8) order margin is minimized, and the minimum scheduling scheme of margin is preferentially distributed, i.e., margin is smaller, the optimization mesh
Target Optimum Matching degree is higher.
Preferably, producing constraints includes processing route constraints, process validity constraint condition, instruction validity
At least one of constraints, resource availability constraints and production characteristic matching constraints.
Processing route constraints, refer to the processing route in feasible production scheduling scheme must be manufacturing enterprise have or
The processing route that person can use.
Process validity constraint condition, it must be that manufacturing enterprise is currently used to refer to the process in feasible production scheduling scheme
Effective process.
Instruction validity constraints：It must be that manufacturing enterprise works as to refer to the used instruction in feasible production scheduling scheme
Instructed used in preceding.
Resource availability constraints：It must be that manufacturing enterprise works as to refer to the used resource in feasible production scheduling scheme
Efficient resource used in preceding.
Produce characteristic matching constraints：The used production feature referred in feasible production scheduling scheme must match life
Produce the production feature of enterprise's Current resource.
In the present embodiment, the money of resource needed for completing the order taking responsibility is obtained according to the analysis of the order taking responsibility of reception first
Source information and production constraints；Then feasible scheduling scheme is generated according to resource information and production constraints, and will be feasible
Scheduling scheme is put into default task feasible solution pond；Finally according to resource information and default optimization aim, to feasible scheduling
Scheme is evaluated, and analysis determines that the feasible scheduling scheme of evaluation of estimate highest is optimal scheduling scheme, is so unsatisfactory for production about
The scheduling scheme of beam condition is filtered first, filters out production constraints and with the money for completing resource needed for order taking responsibility
The feasible production scheduling scheme of source information；Then led based on resource, the feasible scheduling scheme of recurrence crawl matching Current resource,
Feasible scheduling scheme is evaluated according to default optimization aim, final analysis determines the feasible scheduling scheme of evaluation of estimate highest
For optimal scheduling scheme, untill the resource traversal of all production tasks in order taking responsibility is completed, so avoid because
Unreasonable scheduling scheme is selected, causes the increased technical problem of claim for eot, cost.
Further, reference picture 5, analysis determining module 60 include：
Resource settings unit 601, for being instructed according to the resource settings of reception, from the money completed needed for the order taking responsibility
At least one resource settings are selected in source as primary resource, remaining resource settings is auxiliary resources；
Important level of the user according to different types of resource relative to order taking responsibility, resource is inputted to data handling system
Setting instruction, system are instructed according to the resource settings of reception, and at least one money is selected from the resource needed for completion order taking responsibility
Source is set as that (the high resource of important level is primary resource, such as important level is set into level Four primary resource, and the resource of the first order is
Primary resource, the resource of other ranks is auxiliary resources), remaining resource settings is auxiliary resources.
Target sets instruction 602, is instructed for being set according to the target of reception, is that master corresponding to the primary resource is set is excellent
Change secondary optimization aim corresponding to target and auxiliary resources setting；
User can input optimization aim instruction to data handling system, be main optimization aim corresponding to primary resource is set,
For secondary optimization aim corresponding to auxiliary resources setting, main optimization aim and auxiliary optimization aim can be the same or different,
Primarily directed to resource, optimization aim is set, for example, optimization aim be manufacturing time minimize, Optimized Matching degree be 0~1 it
Between value, manufacturing time is bigger closer to 0, smaller closer to 1.
Comparing unit 603, for being entered according to the main optimization aim and secondary optimization aim to the feasible scheduling scheme
Capable optimizing evaluation twice, compare and determine that feasible scheduling scheme described in evaluation of estimate highest is optimal scheduling scheme.
Preferably, comparing unit 603 is additionally operable to：
The primary weight values of the main optimization aim and the secondary weighted value of secondary optimization aim are set；
The main optimization degree of the feasible scheduling scheme is drawn according to the main optimization aim analysis, according to the secondary optimization
Target analysis draws the secondary optimization degree of the feasible scheduling scheme；
The main optimization degree that the feasible scheduling scheme is calculated is multiplied by the product and the feasible scheduling scheme of primary weight values
Secondary optimization degree is multiplied by the product sum of secondary weighted value, and the rwo sum is weighted again average as feasible
The evaluation of estimate of scheduling scheme；
Compare and determine that feasible scheduling scheme is as optimal scheduling scheme described in evaluation of estimate highest.
User sets the weighted value of optimization aim according to production needs, the instruction that data handling system inputs according to user,
The primary weight values of main optimization aim and the secondary weighted value of secondary optimization aim are set, such as primary weight values are 0.95, secondary power
Weight values are 0.05.
Optimization aim can be function on optimization degree, and each the resource of feasible scheduling scheme has pair with respect to optimization aim
The optimization degree answered, so the main optimization degree of feasible scheduling scheme is drawn according to the analysis of main optimization aim, according to secondary optimization aim
Analysis draws the secondary optimization degree of feasible scheduling scheme.
The product that the evaluation of estimate of feasible scheduling scheme is multiplied by primary weight values equal to the main optimization degree of feasible scheduling scheme can with this
The product sum that the secondary optimization degree of row scheduling scheme is multiplied by secondary weighted value is weighted the value of average gained again.
In the present embodiment, by be unsatisfactory for produce constraints scheduling scheme filter out first, and it is other it is nonproductive about
Beam condition is completely converted into the optimization aim as optimal conditions, can so avoid the occurrence of caused by more nonproductive constraints not
Feasible scheduling scheme, feasible scheduling scheme is farthest generated, simply its objective optimization degree is different.For example, order is handed over
The constraints of delivery date, because order delivery date is not production constraints, the optimal conditions of optimization aim can be converted to, such as
Fruit can not meet delivery date, can find an overdue minimum solution as current scheduling scheme, overdue more serious, illustrate excellent
Change degree is lower, but user by way of consulting with client, can improve the enforceability of current planning.
Further, analysis determining module is additionally operable to：
According to formulaCalculate the evaluation of estimate F of all feasible scheduling schemes
(X), compare and determine that the feasible scheduling scheme of evaluation of estimate F (X) highest is optimal scheduling scheme, wherein, X is present feasible scheduling side
Case, Yi(X) for present feasible scheduling scheme i-th of optimization aim optimization degree function, WiFor the of present feasible scheduling scheme
The weighted value of i optimization aim, N are the total number of the optimization aim of present feasible scheduling scheme, and J is present feasible scheduling scheme
In include the total number of resource.
In the present embodiment, the invention provides one kind to be dominated based on resource, and selected resource can be arranged
The data processing method of scheme optimization is produced, realizes production constraint and the double processing of objective optimization, and work as and multiple optimizations be present
During target, go out each scheduling scheme for meeting production constraints according to the weighted value different weights average computation of optimization aim
Evaluation of estimate, guarantee to generate a rational feasible scheduling scheme, while can be by improving the master of main target of optimization
Weighted value, it at utmost can preferentially meet main target of optimization, other secondary optimization aims are also paid close attention to accordingly, so as to
Had laid a good foundation to obtain an optimal feasible scheduling scheme, the utilization of resources inside final enterprise
Rate, reduce production cost, enterprise competitiveness.
The preferred embodiments of the present invention are these are only, are not intended to limit the scope of the invention, it is every to utilize this hair
The equivalent structure or equivalent flow conversion that bright specification and accompanying drawing content are made, or directly or indirectly it is used in other related skills
Art field, is included within the scope of the present invention.
Claims (8)
1. a kind of data processing method, it is characterised in that the data processing method comprises the following steps：
Analyzed according to the order taking responsibility of reception and obtain the resource information of resource needed for the completion order taking responsibility and production constraint bar
Part；
Feasible scheduling scheme is generated according to the resource information and production constraints, and the feasible scheduling scheme is put into pre-
If task feasible solution pond in；
According to the resource information and default optimization aim, the feasible scheduling scheme is evaluated, analysis determines evaluation
Feasible scheduling scheme described in being worth highest is optimal scheduling scheme；
It is described according to the resource information and default optimization aim, the feasible scheduling scheme is evaluated, compares determination
The step of feasible scheduling scheme described in evaluation of estimate highest is optimal scheduling scheme includes：
Instructed according to the resource settings of reception, at least one resource settings are selected from the resource needed for the completion order taking responsibility
For primary resource, remaining resource settings is auxiliary resources；
Instructed according to the optimization aim of reception, set for main optimization aim and the auxiliary resources corresponding to primary resource setting
Corresponding secondary optimization aim；
Optimizing evaluation twice is carried out to the feasible scheduling scheme according to the main optimization aim and secondary optimization aim, it is relatively more true
Feasible scheduling scheme described in accepted opinion value highest is optimal scheduling scheme.
2. data processing method as claimed in claim 1, it is characterised in that described according to main optimization aim and secondary optimization mesh
Mark carries out optimizing evaluation twice to the feasible scheduling scheme, compares and determines that feasible scheduling scheme is most described in evaluation of estimate highest
The step of excellent scheduling scheme, includes：
The primary weight values of the main optimization aim and the secondary weighted value of secondary optimization aim are set；
The main optimization degree of the feasible scheduling scheme is drawn according to the main optimization aim analysis, according to the secondary optimization aim
Analysis draws the secondary optimization degree of the feasible scheduling scheme；
The main optimization degree that the feasible scheduling scheme is calculated is multiplied by the product of primary weight values and the secondary of the feasible scheduling scheme
Optimization degree is multiplied by the product sum of secondary weighted value, and the rwo sum is weighted again average as feasible scheduling
The evaluation of estimate of scheme；
Compare and determine that feasible scheduling scheme is as optimal scheduling scheme described in evaluation of estimate highest.
3. data processing method as claimed in claim 1, it is characterised in that described according to the resource information and default excellent
Change target, the feasible scheduling scheme is evaluated, compare and determine that feasible scheduling scheme is optimal described in evaluation of estimate highest
The step of scheduling scheme is：
According to formulaCalculate the evaluation of estimate F of all feasible scheduling schemes
(X), compare and determine that the feasible scheduling scheme of evaluation of estimate F (X) highest is optimal scheduling scheme, wherein, X is present feasible scheduling side
Case, Yi(X) for present feasible scheduling scheme i-th of optimization aim optimization degree function, WiFor the of present feasible scheduling scheme
The weighted value of i optimization aim, N are the total number of the optimization aim of present feasible scheduling scheme, and J is present feasible scheduling scheme
In include the total number of resource.
4. the data processing method as described in claims 1 to 3 any one, it is characterised in that the production constraints bag
Include processing route constraints, process validity constraint condition, instruction validity constraints, resource availability constraints and
Produce at least one of characteristic matching constraints.
5. a kind of data handling system, it is characterised in that the data handling system includes：
Acquisition module, the resource information of resource needed for the completion order taking responsibility is obtained for being analyzed according to the order taking responsibility of reception
With production constraints；
Feasible program generation module, for generating feasible scheduling scheme according to the resource information and production constraints, and will
The feasible scheduling scheme is put into default task feasible solution pond；
Determining module is analyzed, for according to the resource information and default optimization aim, being carried out to the feasible scheduling scheme
Evaluation, analysis determine that feasible scheduling scheme described in evaluation of estimate highest is optimal scheduling scheme；
The analysis determining module includes：
Resource settings unit, for being instructed according to the resource settings of reception, selected from the resource needed for the completion order taking responsibility
It is primary resource to select at least one resource settings, and remaining resource settings is auxiliary resources；
Target sets instruction, is instructed for being set according to the target of reception, is main optimization aim corresponding to the primary resource is set
With the auxiliary resources set corresponding to secondary optimization aim；
Comparing unit, for carrying out two suboptimums to the feasible scheduling scheme according to the main optimization aim and secondary optimization aim
Change evaluation, compare and determine that feasible scheduling scheme described in evaluation of estimate highest is optimal scheduling scheme.
6. data handling system as claimed in claim 5, it is characterised in that the comparing unit is additionally operable to：
The primary weight values of the main optimization aim and the secondary weighted value of secondary optimization aim are set；
The main optimization degree of the feasible scheduling scheme is drawn according to the main optimization aim analysis, according to the secondary optimization aim
Analysis draws the secondary optimization degree of the feasible scheduling scheme；
The main optimization degree that the feasible scheduling scheme is calculated is multiplied by the product of primary weight values and the secondary of the feasible scheduling scheme
Optimization degree is multiplied by the product sum of secondary weighted value, and the rwo sum is weighted again average as feasible scheduling
The evaluation of estimate of scheme；
Compare and determine that feasible scheduling scheme is as optimal scheduling scheme described in evaluation of estimate highest.
7. data handling system as claimed in claim 5, it is characterised in that the analysis determining module is additionally operable to：
According to formulaCalculate the evaluation of estimate F of all feasible scheduling schemes
(X), compare and determine that the feasible scheduling scheme of evaluation of estimate F (X) highest is optimal scheduling scheme, wherein, X is present feasible scheduling side
Case, Yi(X) for present feasible scheduling scheme i-th of optimization aim optimization degree function, WiFor the of present feasible scheduling scheme
The weighted value of i optimization aim, N are the total number of the optimization aim of present feasible scheduling scheme, and J is present feasible scheduling scheme
In include the total number of resource.
8. the data handling system as described in claim 5 to 7 any one, it is characterised in that the production constraints bag
Include processing route constraints, process validity constraint condition, instruction validity constraints, resource availability constraints and
Produce at least one of characteristic matching constraints.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510021667.4A CN104537503B (en) | 2015-01-15 | 2015-01-15 | Data processing method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510021667.4A CN104537503B (en) | 2015-01-15 | 2015-01-15 | Data processing method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104537503A CN104537503A (en) | 2015-04-22 |
| CN104537503B true CN104537503B (en) | 2018-03-02 |
Family
ID=52853022
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510021667.4A Active CN104537503B (en) | 2015-01-15 | 2015-01-15 | Data processing method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104537503B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106557836A (en) * | 2016-10-27 | 2017-04-05 | 重庆大学 | It is a kind of to be directed to processing optimization method processed under primacord |
| CN107730147A (en) * | 2017-11-10 | 2018-02-23 | 广东溢达纺织有限公司 | Arrange partial loss consumption calibration method, device, readable storage medium storing program for executing and computer equipment |
| CN109501110A (en) * | 2018-12-14 | 2019-03-22 | 四川长虹电器股份有限公司 | The automatic scheduled production method of injecting products |
| CN110826849A (en) * | 2019-09-20 | 2020-02-21 | 珠海格力电器股份有限公司 | Production scheduling method and device, electronic equipment and storage medium |
| CN111260322A (en) * | 2020-01-16 | 2020-06-09 | 襄阳航泰动力机器厂 | Discrete manufacturing industry work order scheduling improvement method |
| CN111950849A (en) * | 2020-07-09 | 2020-11-17 | 华为技术有限公司 | Data processing method and data processing device |
| CN113298336A (en) * | 2020-08-21 | 2021-08-24 | 阿里巴巴集团控股有限公司 | Resource scheduling information determining method and device |
| CN113673885B (en) * | 2021-08-25 | 2024-05-14 | 浙江中控技术股份有限公司 | Method and system for determining scheduling plan |
| CN115689502B (en) * | 2022-12-30 | 2023-04-14 | 广东美的制冷设备有限公司 | Equipment scheduling method, device, production system and storage medium |
| CN116414360B (en) * | 2023-06-09 | 2023-10-03 | 杭州易靓好车互联网科技有限公司 | Artificial intelligence-based application system integrated management method and system |
| CN116562477A (en) * | 2023-07-12 | 2023-08-08 | 深圳市微优微科技有限公司 | Method, device, equipment and storage medium for selecting workgroup scheduling scheme |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101271543A (en) * | 2008-04-23 | 2008-09-24 | 永凯软件技术（上海）有限公司 | Production scheduling system and method using genetic algorithm based on elite solution pool |
| CN103679388A (en) * | 2013-12-26 | 2014-03-26 | 杭州万事利丝绸科技有限公司 | Production scheduling method and system |
| CN103729740A (en) * | 2013-12-30 | 2014-04-16 | 北京施达优技术有限公司 | Data processing method and device for generating production plan |
| CN103927628A (en) * | 2011-08-16 | 2014-07-16 | 上海交通大学 | Order management system and order management method oriented to customer commitments |
-
2015
- 2015-01-15 CN CN201510021667.4A patent/CN104537503B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101271543A (en) * | 2008-04-23 | 2008-09-24 | 永凯软件技术（上海）有限公司 | Production scheduling system and method using genetic algorithm based on elite solution pool |
| CN103927628A (en) * | 2011-08-16 | 2014-07-16 | 上海交通大学 | Order management system and order management method oriented to customer commitments |
| CN103679388A (en) * | 2013-12-26 | 2014-03-26 | 杭州万事利丝绸科技有限公司 | Production scheduling method and system |
| CN103729740A (en) * | 2013-12-30 | 2014-04-16 | 北京施达优技术有限公司 | Data processing method and device for generating production plan |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104537503A (en) | 2015-04-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104537503B (en) | Data processing method and system | |
| CN111966050B (en) | AMMAS-GA nesting algorithm-based double-resource die job shop scheduling optimization method | |
| CN107301473B (en) | Similar parallel machine based on improved adaptive GA-IAGA batch dispatching method and system | |
| CN101901425A (en) | Flexible job shop scheduling method based on multi-species coevolution | |
| CN104808636B (en) | Flexible Flow Shop energy optimization dispatching method | |
| CN107590603A (en) | Based on the dispatching method and system for improving change neighborhood search and differential evolution algorithm | |
| CN107230023B (en) | Based on the production and transportation coordinated dispatching method and system for improving harmony search | |
| CN105652791A (en) | Order-driven discrete manufacturing process energy consumption optimization method | |
| CN111047272B (en) | Project scheduling method and device for multi-language collaborative development | |
| CN105629927A (en) | Hybrid genetic algorithm-based MES (Manufacturing Execution System) production planning and scheduling method | |
| CN107451747A (en) | Job-Shop system and its method of work based on adaptive non-dominant genetic algorithm | |
| CN103530702A (en) | Large-scale operation workshop scheduling method based on bottleneck equipment decomposition | |
| CN113139710B (en) | Multi-resource parallel task advanced plan scheduling method based on genetic algorithm | |
| CN108053152A (en) | The method that improved adaptive GA-IAGA based on polychromatic sets solves dynamic job shop scheduling | |
| CN101706883B (en) | Data mining method and device | |
| CN110909787A (en) | Method and system for multi-objective batch scheduling optimization based on clustering evolutionary algorithm | |
| CN107146039A (en) | The customized type mixed-model assembly production method and device of a kind of multiple target Collaborative Control | |
| CN110531716A (en) | The method for solving low-carbon Job-Shop problem based on discrete whale algorithm | |
| CN112668789A (en) | Self-adaptive batch scheduling method for flexible operation workshop preparation process | |
| CN112053037A (en) | Flexible PCB workshop scheduling optimization method and system | |
| CN110968950A (en) | Human-computer cooperation disassembly sequence planning method based on personnel fatigue | |
| CN105955209A (en) | Manufacturing industry factory equipment layout method based on data mining | |
| CN109784570A (en) | Wisdom workshop flexible production dispatching method based on information physical emerging system | |
| CN107437138B (en) | Based on the production and transport coordinated dispatching method and system for improving gravitation search algorithm | |
| Zhang et al. | Evolutionary algorithm incorporating reinforcement learning for energy-conscious flexible job-shop scheduling problem with transportation and setup times |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |