CN108255141A - A kind of assembling schedule information generating method and system - Google Patents
A kind of assembling schedule information generating method and system Download PDFInfo
- Publication number
- CN108255141A CN108255141A CN201810044376.0A CN201810044376A CN108255141A CN 108255141 A CN108255141 A CN 108255141A CN 201810044376 A CN201810044376 A CN 201810044376A CN 108255141 A CN108255141 A CN 108255141A
- Authority
- CN
- China
- Prior art keywords
- product
- assembling
- product stack
- stack
- duration
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 260
- 230000008569 process Effects 0.000 claims abstract description 190
- 239000000047 product Substances 0.000 claims description 987
- 238000003780 insertion Methods 0.000 claims description 51
- 230000037431 insertion Effects 0.000 claims description 51
- 238000004519 manufacturing process Methods 0.000 claims description 25
- 238000012545 processing Methods 0.000 claims description 18
- 238000012163 sequencing technique Methods 0.000 claims description 16
- 238000002156 mixing Methods 0.000 claims description 14
- 238000003860 storage Methods 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 10
- 238000013507 mapping Methods 0.000 claims description 7
- 238000012216 screening Methods 0.000 claims description 4
- 238000001914 filtration Methods 0.000 claims description 2
- 239000006227 byproduct Substances 0.000 claims 1
- 230000006870 function Effects 0.000 description 12
- 238000010586 diagram Methods 0.000 description 11
- 230000000694 effects Effects 0.000 description 11
- 238000004422 calculation algorithm Methods 0.000 description 8
- 238000012360 testing method Methods 0.000 description 4
- 230000006854 communication Effects 0.000 description 3
- 241000239366 Euphausiacea Species 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000001514 detection method Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 241000208340 Araliaceae Species 0.000 description 1
- 235000005035 Panax pseudoginseng ssp. pseudoginseng Nutrition 0.000 description 1
- 235000003140 Panax quinquefolius Nutrition 0.000 description 1
- 230000001133 acceleration Effects 0.000 description 1
- 238000009825 accumulation Methods 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000003139 buffering effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 239000013066 combination product Substances 0.000 description 1
- 229940127555 combination product Drugs 0.000 description 1
- 238000005314 correlation function Methods 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 230000005611 electricity Effects 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 235000008434 ginseng Nutrition 0.000 description 1
- 230000005484 gravity Effects 0.000 description 1
- 244000144980 herd Species 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000009527 percussion Methods 0.000 description 1
- BULVZWIRKLYCBC-UHFFFAOYSA-N phorate Chemical class CCOP(=S)(OCC)SCSCC BULVZWIRKLYCBC-UHFFFAOYSA-N 0.000 description 1
- 230000002028 premature Effects 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000005236 sound signal Effects 0.000 description 1
- 210000004243 sweat Anatomy 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
- -1 wherein Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B19/00—Programme-control systems
- G05B19/02—Programme-control systems electric
- G05B19/418—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM]
- G05B19/41865—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM] characterised by job scheduling, process planning, material flow
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B19/00—Programme-control systems
- G05B19/02—Programme-control systems electric
- G05B19/418—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM]
- G05B19/41805—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM] characterised by assembly
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06316—Sequencing of tasks or work
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/04—Manufacturing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/02—Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Manufacturing & Machinery (AREA)
- Quality & Reliability (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Automation & Control Theory (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Tourism & Hospitality (AREA)
- Primary Health Care (AREA)
- General Health & Medical Sciences (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Health & Medical Sciences (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- General Factory Administration (AREA)
Abstract
The present invention provides a kind of assembling schedule information generating method and system, wherein, method handle includes：Multiple Product stacks are obtained, wherein, each Product stack is used to represent the product sequence that n product enters assembly process；According to preset schedule rule and the Product stack, obtain the general assembly duration that all over products in each Product stack completes assembling, wherein, the preset schedule rule includes product in the same process to the ordering strategy and assembly parameter of multiple selection strategies for assembling teams and groups, product；It determines the shortest target product queue of general assembly duration, generate and exports assembling schedule information, the assembling schedule information includes the product sequence that the n product that the target product queue represents enters assembly process.Assembling schedule information generating method provided in an embodiment of the present invention and system can improve efficiency of assembling during shop applications assembling schedule information, shorten the general assembly duration in workshop.
Description
Technical field
The present invention relates to Product Assembly technical field more particularly to a kind of assembling schedule information generating method and systems.
Background technology
Complex product refers to that customer demand is complicated, product form is complicated, product technology is complicated, manufacturing process is complicated, project
A kind of product of complex management, such as guided missile, satellite, rocket, aircraft.Wherein, assembling is to produce the final tache of complex product,
It is also one of mostly important link, result is directly related to quality, service life, performance, reliability and the maintainability of product.
Production scheduling be Product Assembly process key link and assembling process management with control key problem it
One, refer under certain constraints, limited resource is distributed to several tasks in time, to meet or optimize
The process of one or more performance indicators.The time spent by every procedure in assemble flow on working hour longest path is all straight
Connecing influences the assembling completion date of product, wherein, each procedure may take the completion of incoherent assembling teams and groups by multiple again,
Due to related constraints such as the assembling level complexity of complex product, the more, long time periods of resource being related to, lead to the excellent of production scheduling
It is high to change difficulty.
In the prior art, the assembling of complex product is using simple workflow, and product processing sequence is fixed, and there are complexity
The problem of assembling duration of product is longer.
Invention content
The embodiment of the present invention provides a kind of assembling schedule information generating method and system, to solve the dress of existing complex product
With duration it is longer the problem of.
In a first aspect, an embodiment of the present invention provides a kind of assembling schedule information generating method, the method includes：
Multiple Product stacks are obtained, wherein, each Product stack is used to represent the product that n product enters assembly process
Sequentially, different product queue represents that the product sequence of the n product is different, and the n is the integer more than or equal to 2；
According to preset schedule rule and the Product stack, obtain all over products in each Product stack and complete the total of assembling
Duration is assembled, wherein, the preset schedule rule includes product in the same process to multiple selection strategies for assembling teams and groups, production
The ordering strategy and assembly parameter of product；
It determines the shortest target product queue of general assembly duration, generate and exports assembling schedule information, the assembling schedule
Information includes the product sequence that the n product that the target product queue represents enters assembly process.
Optionally, the shortest target product queue of determining general assembly duration, generates and exports assembling schedule information
Step, including：
Determine shortest first Product stack of general assembly duration in the Product stack；
Insertion operation is carried out to first Product stack, obtains the second Product stack, and advise according to the preset schedule
The local search operation of mixing neighborhood is then carried out to second Product stack, filters out the general assembly based on second Product stack
With the shortest third Product stack of duration；
If the general assembly duration of the third Product stack is less than the general assembly duration of first Product stack, by institute
It states target product queue and is updated to the third Product stack, generate and export assembling schedule information, the assembling schedule information
The n product represented including the updated target product queue enters the product of assembly process sequentially.
Optionally, it is described that insertion operation is carried out to first Product stack, the second Product stack is obtained, and according to described
Preset schedule rule carries out second Product stack local search operation of mixing neighborhood, filters out based on second product
The step of general assembly duration of queue shortest third Product stack, including：
Insertion operation is carried out to first Product stack, obtains the second Product stack, and advise according to the preset schedule
Then with second Product stack, the general assembly duration of second Product stack is obtained；
Insertion operation or swap operation are carried out to second Product stack, obtain the 4th Product stack, and according to described
Preset schedule rule and the 4th Product stack obtain the general assembly duration of the 4th Product stack；
If the general assembly duration of the 4th Product stack is less than the general assembly duration of second Product stack, by institute
It states the second Product stack and is updated to the 4th Product stack, the first iterations are added 1, and perform described to the second product team
Row carry out insertion operation or swap operation, obtain the 4th Product stack, and according to the preset schedule rule and the 4th production
The step of product queue, the general assembly duration of acquisition the 4th Product stack；
It, will if the general assembly duration of the 4th Product stack is not less than the general assembly duration of second Product stack
First iterations add 1, and execution is described to carry out insertion operation or swap operation to second Product stack, obtains the 4th product
Queue, and according to the preset schedule rule and the 4th Product stack, when obtaining the general assembly of the 4th Product stack
Long step；
When first iterations are not less than the first default iterations, then using second Product stack as third
Product stack.
Optionally, the step of acquisition multiple Product stacks, including：
Obtain multiple Product stacks of current iteration round；
It is described according to preset schedule rule and the Product stack, obtain all over products in each Product stack and complete assembling
General assembly duration the step of after, further include：
It determines shortest 5th Product stack of general assembly duration in current iteration round, and secondary iteration number is added 1；
If the general assembly duration of the 5th Product stack, which is less than, has completed general assembly duration in iterations shortest the
6th Product stack is then updated to the 5th Product stack, and the 6th Product stack is not updated by six Product stacks
Algebraically is zeroed out operation；
It, will if the general assembly duration of the 5th Product stack is not less than the general assembly duration of the 6th Product stack
6th Product stack does not update algebraically and adds 1；
If the 6th Product stack, which does not update algebraically, is not less than predetermined threshold value, new Product stack is obtained, and will
In the new Product stack replacement current iteration round after the longer Product stack of the general assembly duration of preset ratio, institute is performed
The step of stating according to preset schedule rule and the replaced Product stack, obtaining the general assembly duration of each product；
If the 6th Product stack does not update algebraically less than predetermined threshold value, and the secondary iteration number is less than second
The step of presetting iterations, then performing the multiple Product stacks for obtaining following iteration round；
The step of determining general assembly duration shortest target product queue, including：
Using the 6th Product stack as the target product queue.
Optionally, the step of acquisition multiple Product stacks, including：
Multiple times are generated to row, each time includes the multiple time points equal with the quantity of multiple products to arranging；
The sequencing and the mapping relations of product identification sequence temporally put determine corresponding to row with the multiple time
Multiple Product stacks.
Optionally, each selection strategy, including：
For each process in assembly process, determine that product allows process time point and each assembling in the earliest of the process
Teams and groups are in the assembling duration of the process；According to the earliest permission process time point and each assembling teams and groups in the assembling of the process
It is long, calculate multiple deadline points that product is assembled by multiple assembling teams and groups；Select the first dress that deadline point is most preceding
The product is assembled with teams and groups.
Optionally, each selection strategy further includes：
If it is described first assembling teams and groups have it is multiple, select it is described first assembling teams and groups in the process assemble duration most
The product assembles in the second short assembling teams and groups.
Optionally, each selection strategy, further includes：
If the second assembling teams and groups have multiple, it is determined that the release time of multiple second assembling teams and groups；Calculate production
Product allow process time point and the difference of the release time of multiple second assembling teams and groups in the earliest of the process, select difference
The product assembles in minimum third assembling teams and groups.
Optionally, each ordering strategy, including：
Processing sequence of each product in the first step is determined according to the Product stack, its in addition to the first step
Remaining process is processed successively according to the time sequencing of product in place.
Second aspect, the embodiment of the present invention additionally provide a kind of assembling schedule information generating system, including：
First acquisition module, for obtaining multiple Product stacks, wherein, each Product stack is used to represent n product
Into the product sequence of assembly process, different product queue represents that the product sequence of the n product is different, the n for more than
Or the integer equal to 2；
Second acquisition module, for according to preset schedule rule and the Product stack, obtaining complete in each Product stack
Portion's product completes the general assembly duration of assembling, wherein, the preset schedule rule includes product in the same process to multiple dresses
The ordering strategy and assembly parameter of selection strategy, product with teams and groups；
Output module, for determining the shortest target product queue of general assembly duration, generating and exporting assembling schedule information,
The assembling schedule information includes the product sequence that the n product that the target product queue represents enters assembly process.
Optionally, the output module includes：
First determination sub-module, for determining shortest first Product stack of general assembly duration in the Product stack；
Submodule is screened, for carrying out insertion operation to first Product stack, obtains the second Product stack, and according to
The preset schedule rule carries out second Product stack local search operation of mixing neighborhood, filters out based on described second
The shortest third Product stack of general assembly duration of Product stack；
Output sub-module, if the general assembly duration for the third Product stack is less than the total of first Product stack
Duration is assembled, then the target product queue is updated to the third Product stack, generates and export assembling schedule information, institute
It states assembling schedule information and includes the product that the n product that the updated target product queue represents enters assembly process
Sequentially.
Optionally, the screening submodule includes：
First acquisition unit for carrying out insertion operation to first Product stack, obtains the second Product stack, and root
According to the preset schedule rule and second Product stack, the general assembly duration of second Product stack is obtained；
Second acquisition unit for carrying out insertion operation or swap operation to second Product stack, obtains the 4th production
Product queue, and according to the preset schedule rule and the 4th Product stack, obtain the general assembly of the 4th Product stack
Duration；
First counting unit, if the general assembly duration for the 4th Product stack is less than second Product stack
General assembly duration, then be updated to the 4th Product stack by second Product stack, the first iterations is added 1, and perform institute
It states and insertion operation or swap operation is carried out to second Product stack, obtain the 4th Product stack, and according to the default tune
Metric is then with the 4th Product stack, the step of obtaining the general assembly duration of the 4th Product stack；
Second counting unit, if the general assembly duration for the 4th Product stack is not less than second Product stack
General assembly duration, then the first iterations are added 1, perform and described insertion operation or exchange are carried out to second Product stack
Operation obtains the 4th Product stack, and according to the preset schedule rule and the 4th Product stack, obtains the 4th production
The step of general assembly duration of product queue；
Determination unit for working as first iterations not less than the first default iterations, is then produced described second
Product queue is as third Product stack.
Optionally, the acquiring unit is used to obtain multiple Product stacks of current iteration round；
The assembling schedule information generating system further includes：
Determining module, for determining shortest 5th Product stack of general assembly duration in current iteration round, and by second
Iterations add 1；
First counting module, if the general assembly duration for the 5th Product stack is total in iterations less than having completed
Shortest 6th Product stack of duration is assembled, then the 6th Product stack is updated to the 5th Product stack, and to the
Six Product stacks do not update algebraically and are zeroed out operation；
Second counting module, if the general assembly duration for the 5th Product stack is not less than the 6th Product stack
General assembly duration, then the 6th Product stack is not updated into algebraically and adds 1；
First execution module does not update algebraically not less than predetermined threshold value for the 6th Product stack, then obtains new
Product stack, and the new Product stack is replaced to the longer production of general assembly duration of preset ratio in current iteration round
After product queue, execution is described according to preset schedule rule and the replaced Product stack, obtains the total of each product
The step of assembling duration；
Second execution module, if not updating algebraically less than predetermined threshold value for the 6th Product stack, and described the
Two iterations be less than the second default iterations, then perform obtain following iteration round multiple Product stacks the step of；
The output module, for using the 6th Product stack as the target product queue.
Optionally, the acquisition module includes：
Submodule is generated, for generating multiple times to row, each time is to arranging the quantity phase included with multiple products
Deng multiple time points；
Second determination sub-module, for the sequencing and the mapping relations of product identification sequence temporally put, determine with
The multiple time is to arranging corresponding multiple Product stacks.
Optionally, second acquisition module is used to, for each process in assembly process, determine product in the process
The earliest assembling duration for allowing process time point and each assembling teams and groups in the process；According to the earliest permission process time point
With each assembling teams and groups in the assembling duration of the process, multiple deadlines that calculating product is assembled by multiple assembling teams and groups
Point；The product assembles in the first most preceding assembling teams and groups of selection deadline point.
Optionally, if the second acquisition module be additionally operable to it is described first assembling teams and groups have it is multiple, select it is described first assembling
The shortest second assembling teams and groups of duration are assembled in teams and groups in the process to assemble the product.
Optionally, if second acquisition module be additionally operable to the second assembling teams and groups have it is multiple, it is determined that it is multiple described
The release time of second assembling teams and groups；Calculate product allows process time point and multiple second assemblings in the earliest of the process
The difference of the release time of teams and groups selects the third assembling teams and groups of difference minimum to assemble the product.
Optionally, second acquisition module, for determining each product in the first step according to the Product stack
Processing sequence, remaining process in addition to the first step are processed successively according to the time sequencing of product in place.
The third aspect, the embodiment of the present invention also provide a kind of electronic equipment, including：Processor, memory and it is stored in institute
The computer program that can be run on memory and on the processor is stated, when the computer program is performed by the processor
The step of realizing assembling schedule information generating method as described above.
Fourth aspect, the embodiment of the present invention also provide a kind of computer readable storage medium, the computer-readable storage
Computer program is stored on medium, the computer program realizes assembling schedule information as described above when being executed by processor
The step of generation method.
In embodiments of the present invention, by obtaining multiple Product stacks, wherein, each Product stack is used to represent n
Product enters the product sequence of assembly process, and different product queue represents that the product sequence of the n product is different, and the n is
Integer more than or equal to 2；According to preset schedule rule and the Product stack, all over products in each Product stack is obtained
The general assembly duration of assembling is completed, wherein, the preset schedule rule includes product in the same process to multiple assembling teams and groups
Selection strategy, product ordering strategy and assembly parameter；It determines the shortest target product queue of general assembly duration, generates and defeated
Go out assembling schedule information, the assembling schedule information includes the n product that the target product queue represents and enters assembling
The product sequence of process.In such manner, it is possible to determine that the shortest n product of general assembly duration enters assembling from numerous Product stacks
The product sequence of process, improves efficiency of assembling during shop applications assembling schedule information, shortens the general assembly duration in workshop.
Description of the drawings
In order to illustrate the technical solution of the embodiments of the present invention more clearly, needed in being described below to the embodiment of the present invention
Attached drawing to be used is briefly described, it should be apparent that, the accompanying drawings in the following description is only some embodiments of the present invention,
For those of ordinary skill in the art, without having to pay creative labor, it can also be obtained according to these attached drawings
Obtain other attached drawings.
Fig. 1 is the flow diagram of assembling schedule information generating method that one embodiment of the invention provides；
Fig. 2 is working hour longest path simplification figure in complex product assemble flow；
Fig. 3 is the flow diagram of assembling schedule information generating method that another embodiment of the present invention provides；
Fig. 4 is the flow diagram of assembling schedule information generating method that another embodiment of the present invention provides；
Fig. 5 is the assembling schedule information generating method that provides of another embodiment of the present invention in assembly parameter different level situation
Under performance move towards figure；
Fig. 6 is the result of the test that the assembling schedule information generating method that another embodiment of the present invention provides is obtained according to table 1；
Fig. 7 is the result figure of the general assembly duration of the assembling schedule information generating method of various embodiments of the present invention；
Fig. 8 is song of the various embodiments of the present invention assembling schedule information generating method about average value, optimal value and standard deviation
Line chart；
Fig. 9 is the structure diagram of assembling schedule information generating system that one embodiment of the invention provides；
Figure 10 is the structure diagram of assembling schedule information generating system that another embodiment of the present invention provides；
Figure 11 is the structure diagram of assembling schedule information generating system that another embodiment of the present invention provides；
Figure 12 is the structure diagram of assembling schedule information generating system that another embodiment of the present invention provides；
Figure 13 is the structure diagram of assembling schedule information generating system that another embodiment of the present invention provides；
The hardware architecture diagram of Figure 14 a kind of electronic equipment of each embodiment to realize the present invention.
Specific embodiment
Below in conjunction with the attached drawing in the embodiment of the present invention, the technical solution in the embodiment of the present invention is carried out clear, complete
Site preparation describes, it is clear that described embodiment is part of the embodiment of the present invention, instead of all the embodiments.Based on this hair
Embodiment in bright, the every other implementation that those of ordinary skill in the art are obtained without creative efforts
Example, shall fall within the protection scope of the present invention.
Referring to Fig. 1, Fig. 1 is the flow diagram of assembling schedule information generating method that one embodiment of the invention provides.
As shown in Figure 1, including：
Step 101：Multiple Product stacks are obtained, wherein, each Product stack is used to represent that n product enters assembler
The product sequence of sequence, different product queue represent that the product sequence of the n product is different, and the N is more than or equal to 2
Integer.
Referring to Fig. 2, Fig. 2 is working hour longest path simplification figure in complex product assemble flow.In the embodiment of the present invention
Process be process in shop production line on working hour longest path, product is to be assembled on working hour longest path
Product, wherein, product can be like products, or the identical approximate product of assembly process, product experience assembly process
Sequence and quantity all same, multiple assembling teams and groups on each assembly process each product can be assembled.
In the present embodiment, mixed integer linear programming model is established based on krill group's algorithm (Krill Herd, abbreviation KH),
It specifically includes：
M inZ=Cmax(1)
Wherein：J, g, h are product identification, J={ 1,2 ..., n },nFor product sum；
S={ 1,2 ..., s },sFor process sum；K is numbered for process, k ∈ S；
M(k)For the parallel assembling teams and groups number on process k；
pjkmFor product j the assembly manipulation required time is carried out in process k, by assembling teams and groups m；
tjkThe on-stream time of kth procedure for product j；
CmaxFor Maximal Makespan；
U is default positive number；
Z is whole durations；
xj,k,mThe kth procedure of=1, product j are dispatched on assembling teams and groups m；Otherwise xj,k,m=0；
yj,k,tThe kth procedure of=1, product j assemble on the t times；Otherwise yj,k,t=0；
zg,h,k=1, product g is assembled prior to product h on kth procedure；Otherwise zg,h,k=0.
In above-mentioned model, formula (1) represents the selection minimum duration；Formula (2) represents the last one product in last procedures
Completion date be Cmax；Formula (3) represents that same product only could start lower one of work after previous procedure assembles
Sequence；Formula (4) represents that each product can only carry out assembly manipulation in each process stages by an assembling teams and groups；Formula (5) represents production
ProductgWithhBetween exist prior to, after at the same three kinds of ordinal relations；Formula (6) represents that same assembling teams and groups can only a moment
A product is assembled, i.e., could start the assembling of next product after the completion of previous Product Assembly；Formula (7) and formula (8) represent
The value of variable is nonnegative number, 0 or 1.
Such as：Process sum in shop production line on working hour longest path is s, then n product is required to phase
Same sequence experience s procedures, wherein, there are m assembling teams and groups that can be assembled to n product in each process.
Include the product identification of n product in each Product stack, each product is according to the distributing order in Product stack
Successively enter assembly process.Such as：N=5, Product stack is (5,2,4,3,1), then according to product 5, product 2, product 4, product
3 and the sequence of product 1 sequentially enter assembly process.
Step 102：According to preset schedule rule and the Product stack, obtain all over products in each Product stack and complete
The general assembly duration of assembling, wherein, the preset schedule rule includes choosing of the product to multiple assembling teams and groups in the same process
Select the ordering strategy and assembly parameter of strategy, product.
In the embodiment of the present invention, in zero moment, all products are in the state that can be mounted；Each product is preceding
It can enter subsequent processing after the completion of one process；Each product is merely able to assemble teams and groups into luggage by one in synchronization
Match；Product does not allow to interrupt by being assembled to assembling teams and groups in end assembling way；With infinite capacity between adjacent process
Buffering area；Product in process by assemble teams and groups carry out assembling the required time it is known；Product is before the assembling of assembling teams and groups
Time belongs to product and carries out assembling the required time by assembling teams and groups in process.
Wherein, have in a process in the case that multiple assembling teams and groups are assembled, each teams and groups of assembling are due to personnel, dress
Difference with machine and product, the times that the different assembling teams and groups in a process are completed needed for assembling are orthogonal.
By knowing product is needed by how many procedure and each required assembly time of procedure Product Assembly
The time that each product completes assembling can be calculated.Combination product queue can understand the sum of product again, so as to count
Calculate the general assembly duration that all over products in each Product stack completes assembling.
First, general assembly duration is related in the assembling teams and groups that each process selects with product.
Optionally, in a feasible embodiment, product in the same process to it is multiple assembling teams and groups selection strategies,
Including：For each process in assembly process, determine that product allows process time point a in the earliest of the processmWith each assembling
Teams and groups are in the assembling duration p of the processjkm, wherein, am=max (rm, Cj,k-1), rmRepresent the release time of machine, Cj,k-1It represents
Workpiece j is in the completion date in a upper stage；According to the earliest permission process time point amWith each assembling teams and groups in the process
Assembling duration pjkm, calculate multiple deadline point a that product is assembled by multiple assembling teams and groupsm+pjkm；When selection is completed
Between put most preceding first assembling teams and groups the product assembled.
It can reach the first most preceding assembling teams and groups of deadline point by selection to assemble product, it is each so as to make
Product can terminate the assembling of the process with the earliest deadline, and then can shorten the general assembly of Product stack in each process
With duration.
Further, since the assembling duration of multiple assembling teams and groups is orthogonal, it is understood that there may be the first assembling teams and groups have more
A situation, in the case, optionally, if in the present embodiment it is described first assembling teams and groups have it is multiple, selection described in
Duration p is assembled in the process in first assembling teams and groupsjkmThe product assembles in shortest second assembling teams and groups.
If there are the first assembling teams and groups that multiple deadline points are identical in the same process, it is most short that duration is wherein assembled in selection
The second assembling teams and groups the product is assembled, so as to improve the assembling speed of product in the case of being determined in the deadline
Degree also improves the flexibility of product scheduling.
In addition, first assembling teams and groups have it is multiple in the case of, can also select transport path it is shortest first assembling teams and groups
It is assembled, it is also an option that specific first assembling teams and groups are assembled, present embodiment is not construed as limiting this.
Further, since the assembling duration of multiple assembling teams and groups is orthogonal, it is understood that there may be the second assembling teams and groups have more
A situation, in the case, optionally, if in the present embodiment it is described second assembling teams and groups have it is multiple, it is determined that it is multiple
The release time r of the second assembling teams and groupsm；Calculate product allows process time point a in the earliest of the processmWith it is multiple described
The difference a of the release time of second assembling teams and groupsm-rm, select difference am-rmMinimum third assembling teams and groups to the product into
Luggage is matched.
The release time of assembling teams and groups is for compensating individual demand, inevitably delay and being caused due to fatigue
Efficiency decline time.Release time drinks water including assembly worker, goes to toilet, wiping the sweat, replaces and puts together machines, safeguards assembly machine
A series of device etc. inevitable times.Product is selected to allow process time point and multiple described second in the earliest of the process
The third assembling teams and groups of the difference minimum of the release time of teams and groups are assembled, the permitting earliest in the process in deadline point and product
Perhaps in the case of process time point all same, the release time longer assembling for indicating that third assembling teams and groups of third assembling teams and groups
Efficiency highest, and since release time is there are changeability, when actual conditions lower release time is often below the release for calculating
Between, product there is a possibility that in advance in the deadline point that third assembling teams and groups complete assembling in this case.
By in multiple second assemblings teams and groups, select product the process it is earliest allow process time point with it is more
Product assembles in the third assembling teams and groups of the difference minimum of the release time of a second assembling teams and groups, in practical release
In the case that time is less than the release time for calculating, the deadline point of final reality can be made in advance in the completion of calculating
Time point, and then the general assembly duration of Product stack can be shortened.
In addition, second assembling teams and groups have it is multiple in the case of, can also select transport path it is shortest second assembling teams and groups
It is assembled, it is also an option that specific second assembling teams and groups are assembled, present embodiment is not construed as limiting this.
It should be noted that in the other embodiment of the embodiment of the present invention, product is in the same process to multiple dresses
Select specific assembling teams and groups to product into luggage in selection with teams and groups or multiple assembling teams and groups in process
Match, can also be and assembling teams and groups is selected to carry out product successively the sequence of the deadline point of previous product according to assembling teams and groups
Assembling etc. mode, the present embodiment are not construed as limiting this.
Secondly, general assembly duration is also related with the ordering strategy of product.
Optionally, in another feasible embodiment, ordering strategy of the product in each process includes：According to described
Product stack determines processing sequence of each product in the first step, remaining process in addition to the first step is arrived according to product
The time sequencing of position is assembled successively.
The process sequence all same that product is undergone, i.e., successively undergo the first step, the second step ..., s-1 processes
With s processes.The sequence that product enters the first step is sequentially entered according to the clooating sequence of Product stack, its after the first step
The time sequencing that his process then reaches the process according to product is successively processed product.
Further, product can enter the second step after the completion of the first step, but since the first step exists
Multiple assembling teams and groups, therefore first product be in one of the first step assembling teams and groups assembling process, second product can be with
It is assembled into the first step and by others assembling teams and groups.In this case, since different product is in different assembling classes
The assembling duration of group differs, in fact it could happen that multiple products reach the situation of a process simultaneously, optionally, in present embodiment
If there is multiple the first identical product of arrival time point, it is determined that assembling duration of first product in the process in；It is excellent
First the second product of the length in the assembling in the process is assembled.
By the way that preferentially to the second product of length assembles during assembling in process, the entrance of the second product earlier can be made
In subsequent process, so as to improve flexibility of the product in assembly process, and but also subsequent handling will not be because of preamble
Taking too long and causing idle situation for process, avoids reducing the resource utilization of subsequent handling.
It in addition, can also be to specific products preferentially into luggage in the situation for one process of multiple products while arrival occur
Match or to specific products delay assemble etc. mode, present embodiment and this is not construed as limiting.
It should be noted that in the other embodiment of the embodiment of the present invention, if the first production that arrival time point is identical
Product have multiple or preferentially specific product are assembled, and can also be the required time according to product subsequent handling
The product preferentially grown to duration needed for subsequent handling assemble etc. mode, the embodiment of the present invention and this is not construed as limiting.
In addition, general assembly duration is related also with controlling the assembly parameters such as interval time, Product stack sum.
N product in Product stack enters the control interval time of assembly process and Product stack sum directly affects production
It the general assembly time of product queue, is illustrated for controlling interval time：It controls interval time too short, product may be caused to exist
Preceding process portion excessively congestion in s procedures, and rear process portion is caused idle situation, subassembly after reduction occur
The resource utilization of sequence, so as to extend the general assembly duration of Product stack；Or control interval time is too long, may cause s
Saturation is not up to process integral load, so as to reduce the resource utilization of whole assembly process, so as to extend Product stack
General assembly duration.
Pass through above-mentioned selection strategy, ordering strategy, assembly parameter, process sum s, product sum n and known difference
Product in different assembling teams and groups' required times, all over products in each Product stack can be calculated and complete the total of assembling
Assembly time.
Step 103：It determines the shortest target product queue of general assembly duration, generate and exports assembling schedule information, it is described
Assembling schedule information includes the product sequence that the n product that the target product queue represents enters assembly process.
After the general assembly duration for obtaining all over products queue, the shortest target product team of general assembly duration is therefrom filtered out
Row, and generate the assembling tune for including the product sequence that the n product that the target product queue represents enters assembly process
Spend information.The concrete form of assembling schedule information can be process implementation schedule, scheduling of resource timetable etc., it will be understood that
Any assembling schedule information that can embody the product sequence that n product enters assembly process belongs to the embodiment of the present invention
Protection domain.
Assembling tune by the product sequence that the n product for including target product queue expression is entered to assembly process
Information output is spent, so that assembly shop manager can fill assembling schedule Information application to assembly shop so as to shorten
General assembly duration with workshop.
In embodiments of the present invention, by obtaining multiple Product stacks, wherein, each Product stack is used to represent n
Product enters the product sequence of assembly process, and different product queue represents that the product sequence of the n product is different, and the n is
Integer more than or equal to 2；According to preset schedule rule and the Product stack, all over products in each Product stack is obtained
The general assembly duration of assembling is completed, wherein, the preset schedule rule includes product in the same process to multiple assembling teams and groups
Selection strategy, product ordering strategy and assembly parameter；It determines the shortest target product queue of general assembly duration, generates and defeated
Go out assembling schedule information, the assembling schedule information includes the n product that the target product queue represents and enters assembling
The product sequence of process.In such manner, it is possible to determine that the shortest n product of general assembly duration enters assembling from numerous Product stacks
The product sequence of process, improves efficiency of assembling during shop applications assembling schedule information, shortens the general assembly duration in workshop.
Referring to Fig. 3, Fig. 3 is the flow signal for the assembling schedule information generating method that another embodiment of the present invention provides
Figure.As shown in figure 3, include the following steps：
Step 301：Multiple Product stacks are obtained, wherein, each Product stack is used to represent that n product enters assembler
The product sequence of sequence, different product queue represent that the product sequence of the n product is different, and the n is more than or equal to 2
Integer.
In a feasible embodiment, step 301 specifically includes：
Multiple times are generated to row, each time includes the multiple time points equal with the quantity of multiple products to arranging；
The sequencing and the mapping relations of product identification sequence temporally put determine corresponding to row with the multiple time
Multiple Product stacks.
Multiple time points in time queue are ranked up according to time order and function sequence, so as to determine time team
The rule of the time sequencing number, sequentially in time number corresponding product number of each time point in row, so as to determine
Multiple Product stacks.
Such as：Product sum is 5, time queue Xi=(1.125,0.765,1.689,0.235,0.569), to XiIt carries out
It is obtained after positive sequence sequenceWherein,It is 0.235, corresponding Xi4；For
0.569, corresponding Xi5, and so on, then the Product stack after converting is (4,3,5,1,2).
In the present embodiment, step 301 is not limited in a kind of this embodiment or upsets at random including n production
The Product stack of product, so as to obtain multiple Product stacks, the present embodiment is not construed as limiting this.
It should be noted that the above embodiment in step 301 can be applied equally to the step in embodiment illustrated in fig. 1
Rapid 101.
Step 302：According to preset schedule rule and the Product stack, obtain all over products in each Product stack and complete
The general assembly duration of assembling, wherein, the preset schedule rule includes choosing of the product to multiple assembling teams and groups in the same process
Select the ordering strategy and assembly parameter of strategy, product.
The realization process and advantageous effect of step 301 and step 302 may refer to the description in step 101 and step 102,
Details are not described herein again.
Step 303：Determine shortest first Product stack of general assembly duration in the Product stack；
After step 302 obtains the general assembly duration of multiple Product stacks, general assembly is determined from this multiple Product stack
Shortest first Product stack of duration.
Step 304：Insertion operation is carried out to first Product stack, obtains the second Product stack, and according to described pre-
If scheduling rule carries out second Product stack local search operation of mixing neighborhood, filter out based on the second product team
The shortest third Product stack of general assembly duration of row；
Insertion operation be in Product stack random selection two positions, and by the product identification of one of position put to
On another position, the product sum of Product stack is constant.Such as：First Product stack be (3,4,2,1), randomly selected two
A position is first position and the 4th position, then the second Product stack formed after being inserted into is (4,2,3,1).
Swap operation is two positions of random selection in Product stack, and the product identification of the two positions is handed over
It changes, the product sum of Product stack is constant.Such as：Second Product stack is (4,2,3,1), and randomly selected two positions are the
Two positions and the 4th position, then the 4th Product stack formed after exchanging are (4,1,3,2).
After obtaining the second Product stack, mixing neighborhood local search, in the present embodiment, mixing are carried out to the second Product stack
It can be 1 time or multiple that the number of field local search, which is, and the embodiment of the present invention is not construed as limiting this.Part each time
Above-mentioned insertion operation can be only selected in search process, can also only select above-mentioned swap operation, it can be with insertion operation and friendship
It changes operation alternately to operate the shortest Product stack of general assembly duration of a preceding local search, so as in mixing field office
The shortest third Product stack of general assembly duration based on second Product stack is filtered out in portion's search.
Optionally, in a kind of feasible embodiment, step 304 can be specially：To first Product stack into
Row insertion operation, obtains the second Product stack, and according to the preset schedule rule and second Product stack, described in acquisition
The general assembly duration of second Product stack；Insertion operation or swap operation are carried out to second Product stack, obtain the 4th production
Product queue, and according to the preset schedule rule and the 4th Product stack, obtain the general assembly of the 4th Product stack
Duration；If the general assembly duration of the 4th Product stack is less than the general assembly duration of second Product stack, by described in
Second Product stack is updated to the 4th Product stack, and the first iterations are added 1, and performs described to second Product stack
Insertion operation or swap operation are carried out, obtains the 4th Product stack, and according to the preset schedule rule and the 4th product
The step of queue, the general assembly duration of acquisition the 4th Product stack；If the general assembly duration of the 4th Product stack is not
Less than the general assembly duration of second Product stack, then the first iterations are added 1, performed described to the second product team
Row carry out insertion operation or swap operation, obtain the 4th Product stack, and according to the preset schedule rule and the 4th production
The step of product queue, the general assembly duration of acquisition the 4th Product stack；When first iterations are pre- not less than first
If iterations, then using second Product stack as third Product stack.
Each local search has the general assembly duration of the second Product stack and the general assembly duration of the 4th Product stack
It is compared, when the general assembly duration of the 4th Product stack by being obtained after the second Product stack insertion operation or swap operation
Not less than the second Product stack general assembly duration when, give up to fall the 4th Product stack, then enter local search next time,
Again the 4th new Product stack that insertion operation or swap operation obtain is carried out to the second Product stack to be compared again；When
When the general assembly duration of 4th Product stack is less than the general assembly duration of the second Product stack, the 4th Product stack is replaced the
Two Product stacks, then enter local search next time, insertion operation or swap operation are carried out to the second new Product stack
The 4th new Product stack obtained is compared again, until local search number reaches the first default number of falls.
Wherein, the first iterations are local search number, and the first iterations are n* (n+1) in present embodiment, when
First iterations are less than the first default iterations n* (n+1), then continue to repeat to filter out based on second Product stack
The shortest Product stack of general assembly duration；When the first iterations are not less than the first default iterations n* (n+1), then by it
Before shortest second Product stack of general assembly duration that filters out as third Product stack.
Such as：The product sum n of Product stack is that the 5, first Product stack is (5,2,4,3,1), to the first Product stack
It carries out insertion operation and obtains the second Product stack as (2,4,3,5,1), and the second Product stack is calculated according to preset schedule rule
A length of A1 during the general assembly of (2,4,3,5,1)；Insertion operation or swap operation are carried out to the second Product stack (2,4,3,5,1)
The 4th Product stack is obtained as (4,2,3,5,1), and the 4th Product stack (4,2,3,5,1) is calculated according to preset schedule rule
A length of A2 during general assembly；If the second Product stack is updated to (4,2,3,5,1) by A2 ＜ A1 from (2,4,3,5,1), and by
One iterations X adds as 1 from 0；When X be less than the first default iterations 30, continue to the second Product stack (4,2,3,5,1) into
Row insertion operation or swap operation obtain the 4th Product stack as (4,2,5,3,1), and calculate the according to preset schedule rule
A length of A3 during the general assembly of four Product stacks (4,2,5,3,1)；If A3 ＞ A2,2 are added as by X from 1；It is preset when X is less than first
Iterations 30 continue to carry out insertion operation to the second Product stack (4,2,3,5,1) or swap operation obtain the 4th product
Queue, and so on ... until X is not less than the first default iterations 30, then it is the general assembly duration filtered out before is most short
The second Product stack as the shortest third Product stack of general assembly duration based on second Product stack.
In present embodiment, persistently the second Product stack shortest to general assembly duration carries out local search, can improve
The screening efficiency of third Product stack.
It realizes it should be noted that step 304 is not limited in a kind of this embodiment, changes for example, by using different first
Generation number, different local searching strategies disposably obtain the second Product stack progress insertion operation or replacement operation pre-
If the 4th Product stack of number, will be determined from the 4th whole Product stacks the shortest Product stack of general assembly duration as
Third Product stack can obtain the shortest third Product stack of general assembly duration based on second Product stack, this hair
Bright embodiment is not construed as limiting this.
Step 305：If the general assembly duration of the third Product stack is less than the general assembly of first Product stack
It is long, then the target product queue is updated to the third Product stack, generates and export assembling schedule information, the assembling
Scheduling information includes the product sequence that the n product that the updated target product queue represents enters assembly process.
When the third Product stack general assembly duration be less than first Product stack general assembly duration, then by institute
It states target product queue and is updated to the third Product stack, the assembling schedule information of generation includes what third Product stack represented
The n product enters the product sequence of assembly process.
The realization process and advantageous effect of this step may refer to the description in step 103, and details are not described herein again.
Second is obtained by carrying out insertion operation to shortest first Product stack of general assembly duration in multiple Product stacks
Product stack, then the local search operation of mixing neighborhood is carried out to the second Product stack, it filters out based on second Product stack
The shortest third Product stack of general assembly duration；Compare the general assembly duration of the first Product stack and third Product stack, it will
Wherein general assembly duration is shortest as target product queue generation assembling schedule information.In such manner, it is possible to improve assembling of the present invention
Convergence rate of the scheduling information generation method in calculating process.
Referring to Fig. 4, Fig. 4 is the flow signal for the assembling schedule information generating method that another embodiment of the present invention provides
Figure.As shown in figure 4, include the following steps：
Step 401：Multiple Product stacks of current iteration round are obtained, wherein, each Product stack is used to represent n
Product enters the product sequence of assembly process, and different product queue represents that the product sequence of the n product is different, and the n is
Integer more than or equal to 2.
The realization process and advantageous effect of this step may refer to the description in step 101, and details are not described herein again.
In the present embodiment, step 401 to step 407 is an iteration step.Second default iterations are default value,
Can be 20,50 or 100 etc., the present embodiment does not limit this.
Step 402：According to preset schedule rule and the Product stack, obtain all over products in each Product stack and complete
The general assembly duration of assembling, wherein, the preset schedule rule includes choosing of the product to multiple assembling teams and groups in the same process
Select the ordering strategy and assembly parameter of strategy, product.
The realization process and advantageous effect of this step may refer to the description in step 102, and details are not described herein again.
Step 403：Determine shortest 5th Product stack of general assembly duration in current iteration round, and secondary iteration is secondary
Number plus 1.
Step 402 obtains the general assembly duration of multiple Product stacks of current iteration round, therefrom determines general assembly duration
Shortest 5th Product stack.
Step 404：Judge the general assembly duration of the 5th Product stack whether less than when having completed general assembly in iterations
Long shortest 6th Product stack.
If the general assembly duration of the 5th Product stack, which is less than, has completed general assembly duration in iterations shortest the
Six Product stacks, then perform step 405：6th Product stack is updated to the 5th Product stack, and produce to the 6th
Product queue does not update algebraically and is zeroed out operation；
Step 403 can be determined to correspond to the 5th of that iteration round from multiple Product stacks in each iteration round
Product stack is capable of determining that iteration wheel by the comparison that fixed multiple 5th Product stacks are carried out general assembly duration
Secondary shortest 6th Product stack of middle general assembly duration.
Shortest 5th Product stack of general assembly duration in current iteration round and the 6th Product stack are subjected to general assembly
The comparison of duration, if the general assembly duration of the 5th Product stack of current iteration round is less than the general assembly of the 6th Product stack
It is long, then the 6th Product stack is updated to the 5th Product stack of current iteration round, and generation is not updated to the 6th Product stack
Number is zeroed out operation.
If the general assembly duration of the 5th Product stack is not less than the general assembly duration of the 6th Product stack, hold
Row step 406：If the general assembly duration of the 5th Product stack is not less than the general assembly duration of the 6th Product stack,
6th Product stack is not updated into algebraically and adds 1；
Such as：A length of B1 during the general assembly of the 5th Product stack L1 of the first iteration round, then the 6th Product stack at this time
Also it is equally L1, it is 0 that the 6th Product stack, which does not update algebraically,；The 5th production of secondary iteration round is determined into secondary iteration round
A length of B2 during the general assembly of product queue L2, as B2 ＜ B1, then the 6th Product stack at this time is updated to L2, the 6th Product stack
It is 0 not update algebraically；It is determined into third iteration round a length of during the general assembly of the 5th Product stack L3 of third iteration round
B3, as B3 ＞ B2, the 6th Product stack at this time is still L2, and it is 1 that the 6th Product stack, which does not update algebraically,；It changes into the 4th
A length of B4 during the general assembly of the 5th Product stack L4 of the 4th iteration round is determined for round, as B4 ＞ B2, the at this time the 6th
Product stack is still L2, and it is 2 that the 6th Product stack, which does not update algebraically ... until secondary iteration round reaches the
Two default iteration rounds.
Step 407：Judge that the 6th Product stack does not update whether algebraically is less than predetermined threshold value.
6th Product stack does not update algebraically not less than predetermined threshold value Limit, then performs step 408：If it obtains
New Product stack, and the new Product stack is replaced to the general assembly duration of preset ratio (1- η) in current iteration round
After longer Product stack, then return to step 402, re-execute step 402 to step 408.Wherein, predetermined threshold value Limit
Can be 5,10 or 20 etc., the present embodiment does not limit this for default value.
It is arrived when the 6th Product stack does not update algebraically accumulation not less than predetermined threshold value Limit, then it is multiple by what is newly obtained
Product stack replaces the longer product team of general assembly duration of preset ratio (1- η) in multiple Product stacks of the iteration round
Row, and replaced multiple Product stacks are performed into step 403 to step 405.
If the 6th Product stack does not update algebraically less than predetermined threshold value Limit, step 409 is performed：Judge
Whether two iterations are less than the second default iterations.
If the 6th Product stack does not update algebraically less than predetermined threshold value Limit, and the secondary iteration number is small
In the second default iterations, then return to step 401, re-execute step 401 to step 409；
When secondary iteration number is not less than the second default iterations, step 410 is performed：By the 6th Product stack
It as the target product queue, generates and exports assembling schedule information, the assembling schedule information includes the target product
The n product that queue represents enters the product sequence of assembly process.
The realization process and advantageous effect of this step may refer to the description in step 103, and details are not described herein again.
Wherein, the 6th Product stack is the shortest Product stack of general assembly duration in iteration round, when secondary iteration time
When number is not less than the second default iterations, the 6th Product stack is the shortest product of general assembly duration in all over products queue
Queue.
By the multiple Product stacks of successive ignition, the shortest 6th product team of general assembly duration in iteration round is preserved
Row, and record the 6th Product stack and do not update algebraically, not updating algebraically in the 6th Product stack reaches predetermined threshold value Limit
When, the Product stack that part general assembly duration is longer in the iteration round is replaced, and again using the Product stack newly obtained
Replaced multiple Product stacks are screened, are compared etc. with operations, until secondary iteration number is not less than the second default iteration
So as to effectively avoid the problem that being absorbed in local optimum during target product queue point is determined, it is complete to reach acquisition for number
The effect of office's optimum point.
In addition, the predetermined threshold value Limit and preset ratio η in the present embodiment belong to the assembly parameter in step 402, in advance
It can influence to produce gating limit value Limit and preset ratio η and the control interval time in step 102 and Product stack sum
The general assembly duration of product queue.
The present embodiment can also be combined with embodiment shown in Fig. 2, i.e., step 403 specifically includes：In current iteration round
In determine the 5th Product stack after, to the 5th Product stack carry out insertion operation obtain the 7th Product stack, and according to default tune
Metric then carries out the 7th Product stack the local search operation of mixing neighborhood, when filtering out the general assembly based on the 7th Product stack
Long shortest 8th Product stack；5th Product stack and the 8th Product stack are carried out to the comparison of general assembly duration again, and will
The wherein shortest Product stack of general assembly duration is as the 5th Product stack.
When the assembling of teams and groups is now assembled with process sum s=5, respectively for the Discrete Stochastic integer of a length of [3,40], to production
These three situations of product quantity n=10,15 and 20 are tested three times, obtained result of the test.Wherein, the assembling ginseng in experiment
Number such as table 1：
1 each assembly parameter value of table
| Parameter/level | 1 | 2 | 3 | 4 |
| Product stack sum NP | 20 | 50 | 80 | 110 |
| Control time interval Ct | 0.5 | 1.0 | 1.5 | 2.0 |
| Time gate limit value Limit | 40 | 60 | 80 | 100 |
| Preset ratio η (Eta) | 0.1 | 0.2 | 0.3 | 0.4 |
Result of the test includes Fig. 5, Fig. 6 and table 2, wherein, Fig. 5 is the assembling schedule information that another embodiment of the present invention provides
Generation method moves towards figure in the performance of assembly parameter different level；Fig. 6 is the assembling that another embodiment of the present invention provides
The result of the test that scheduling information generation method is obtained according to table 1；Table 2 is the very poor value of each assembly parameter.
As shown in Figure 5, it can be seen that Product stack sum NP is bigger, and algorithm performance is more excellent, this is because Product stack is total
Number NP determines the coverage area in search space.When NP is smaller, the global of algorithm explores poor-performing, easy Premature Convergence
And it is absorbed in local optimum；When NP is larger, group can cover more search spaces, it is easier to obtain the solution of high quality.Separately
Outside, becoming the increase of excellent amplitude with population quantity, (level 3 and 4 gap of level are little, only 0.03), therefore constantly becoming smaller
NP should not be too large.ParameterCtDetermine mobile range of the algorithm in searching process, in entire search space.CtIt is excessive easily to lead
It causes convergence rate too fast and is absorbed in local optimum,CtIt is too small to cause convergence rate slowly so as to influence algorithm performance.For restarting
Operation, parameter Limit determines the opportunity restarted, and when Limit is smaller, algorithm is also not up to local optimum and is forced to restart,
The effect not only restarted is general, but also can influence the performance of algorithm；Parameter η, which is determined, retains the ratio of optimized individual when restarting,
When retaining ratio is larger, algorithm is easily absorbed in local optimum again, leads to the effect unobvious restarted.It can be in conjunction with Fig. 6
Determine parameter combination【3、2、4、1】When obtained general assembly duration it is most short, NP=80, C at this timet=1.0, Limit=100 and η
=0.1.
The very poor maximum of Limit and η according to table 2, secondly NP, is finally Ct, this may indicate that implements shown in Fig. 3
Example can be obviously improved the performance of assembling schedule information generating method.
The very poor value of 2 each assembly parameter of table
In addition, Fig. 7 and Fig. 8 are please referred to, wherein, Fig. 7 is the assembling schedule information generating method of various embodiments of the present invention
The result figure of general assembly duration；Fig. 8 for various embodiments of the present invention assembling schedule information generating method about average value, optimal value and
The curve graph of standard deviation.The embodiment of the present invention also by embodiment illustrated in fig. 1, embodiment illustrated in fig. 2, embodiment illustrated in fig. 3 and
Embodiment illustrated in fig. 2 and the combination embodiment of embodiment illustrated in fig. 3 combination are compared, the wherein assembling of embodiment illustrated in fig. 1
Scheduling information generation method is labeled as DKH, and the assembling schedule information generating method of embodiment illustrated in fig. 2 is labeled as DKH-LS, Fig. 3
The assembling schedule information generating method of illustrated embodiment is labeled as DKH-RS, combines the assembling schedule information generating method of embodiment
Labeled as IDKH.Using above-mentioned best parameter group NP=80, Ct=1.0, Limit=100 and η=0.1, each example operation
20 times, each run time is no more than 20 seconds, records average value AVE, optimal value MIN and the standard deviation STD of 20 operation results.
Fig. 7 and Fig. 8 are please referred to, wherein, Fig. 7 is the result figure of the general assembly duration of various embodiments of the present invention；Fig. 8 is this hair
Curve graph of the bright each embodiment about average value, optimal value and standard deviation.Such as Fig. 7 and Fig. 8, embodiment illustrated in fig. 2 can be obtained
After adding in local search, AVE, MIN and STD are optimized, so as to improve the complete of assembling schedule information generating method
Face optimizing performance and robustness；It can also obtain embodiment illustrated in fig. 3 and obtain excellent by adding in reboot operation, AVE and STD
Change, i.e., the average optimizing of assembling schedule information generating method and robustness are enhanced；Synthesis can obtain combination and implement
Example has the advantages that Fig. 2 embodiments and Fig. 3 embodiments, and performance is best.
Referring to Fig. 9, Fig. 9 is a kind of structural representation of assembling schedule information generating system provided in an embodiment of the present invention
Figure, as shown in figure 9, the assembling schedule information generating system 900 include the first acquisition module 901, the second acquisition module 902,
With output module 903, wherein, the first acquisition module 901 is connect with the second acquisition module 902, the second acquisition module 902 and output
Module 903 connects.
First acquisition module 901, for obtaining multiple Product stacks, wherein, each Product stack is used to represent n production
Product enter the product sequence of assembly process, and different product queue represents that the product sequence of the n product is different, and the n is big
In or equal to 2 integer；
Second acquisition module 902, for according to preset schedule rule and the Product stack, obtaining in each Product stack
All over products completes the general assembly duration of assembling, wherein, the preset schedule rule includes product in the same process to multiple
Assemble the selection strategy of teams and groups, the ordering strategy and assembly parameter of product；
Output module 903 for determining the shortest target product queue of general assembly duration, generates and exports assembling schedule letter
Breath, it is suitable that the assembling schedule information includes the product that the n product that the target product queue represents enters assembly process
Sequence.
Optionally, as shown in Figure 10, the output module 903 includes：
First determination sub-module 9031, for determining the shortest first product team of general assembly duration in the Product stack
Row；
Submodule 9032 is screened, for carrying out insertion operation to first Product stack, obtains the second Product stack, and
The local search operation of mixing neighborhood is carried out to second Product stack according to the preset schedule rule, is filtered out based on described
The shortest third Product stack of general assembly duration of second Product stack；
Output sub-module 9033, if the general assembly duration for the third Product stack is less than first Product stack
General assembly duration, then the target product queue is updated to the third Product stack, generate and export assembling schedule letter
Breath, the assembling schedule information include the n product that the updated target product queue represents and enter assembly process
Product sequence.
Optionally, as shown in figure 11, the screening submodule 9032 includes：
First acquisition unit 90321 for carrying out insertion operation to first Product stack, obtains the second product team
Row, and according to the preset schedule rule and second Product stack, obtain the general assembly duration of second Product stack；
Second acquisition unit 90322 for carrying out insertion operation or swap operation to second Product stack, obtains the
Four Product stacks, and according to the preset schedule rule and the 4th Product stack, obtain the total of the 4th Product stack
Assemble duration；
First counting unit 90323, if the general assembly duration for the 4th Product stack is less than second product
Second Product stack is then updated to the 4th Product stack by the general assembly duration of queue, and the first iterations are added 1, and
Perform it is described insertion operation or swap operation are carried out to second Product stack, obtain the 4th Product stack, and according to described
The step of preset schedule rule and the 4th Product stack, the general assembly duration of acquisition the 4th Product stack；
Second counting unit 90324, if the general assembly duration for the 4th Product stack is produced not less than described second
First iterations are then added 1 by the general assembly duration of product queue, are performed described to second Product stack progress insertion operation
Or swap operation, the 4th Product stack is obtained, and according to the preset schedule rule and the 4th Product stack, described in acquisition
The step of general assembly duration of 4th Product stack；
Determination unit 90325, for working as first iterations not less than the first default iterations, then by described the
Two Product stacks are as third Product stack.
Optionally, as shown in figure 12, first acquisition module is used to obtain multiple Product stacks of current iteration round；
The assembling schedule information generating system 900 further includes：
Determining module 904, for determining shortest 5th Product stack of general assembly duration in current iteration round, and by
Two iterations add 1；
First counting module 905, if for the 5th Product stack general assembly duration be less than completed iterations
Middle shortest 6th Product stack of general assembly duration, then be updated to the 5th Product stack by the 6th Product stack, and
Algebraically is not updated to the 6th Product stack and is zeroed out operation；
Second counting module 906, if the general assembly duration for the 5th Product stack is not less than the 6th product
6th Product stack is not then updated algebraically and adds 1 by the general assembly duration of queue；
First execution module 907 if not updating algebraically not less than predetermined threshold value for the 6th Product stack, obtains
New Product stack is taken, and the general assembly duration that the new Product stack is replaced preset ratio in current iteration round is longer
Product stack after, perform described according to preset schedule rule and the replaced Product stack, obtain each product
General assembly duration the step of；
Second execution module 908, if not updating algebraically for the 6th Product stack is less than predetermined threshold value, and described
Secondary iteration number be less than the second default iterations, then perform obtain following iteration round multiple Product stacks the step of；
The output module 903, for using the 6th Product stack as the target product queue.
Optionally, as shown in figure 13, first acquisition module 901 includes：
Submodule 9011 is generated, for generating multiple times to row, each time is to arranging the number included with multiple products
Measure equal multiple time points；
Second determination sub-module 9012, for the sequencing and the mapping relations of product identification sequence temporally put, really
Determine with the multiple time to the corresponding multiple Product stacks of row.
Optionally, second acquisition module 902 for being directed to each process in assembly process, determines product at this
The earliest assembling duration for allowing process time point and each assembling teams and groups in the process of process；According to it is described earliest allow processing when
Between point and it is each assembling teams and groups the process assembling duration, calculate product by it is multiple assembling teams and groups assembled multiple completions when
Between point；The product assembles in the first most preceding assembling teams and groups of selection deadline point.
Optionally, the second acquisition module 902 if being additionally operable to the first assembling teams and groups has multiple, selects described first
The shortest second assembling teams and groups of duration are assembled in assembling teams and groups in the process to assemble the product.
Optionally, second acquisition module 902, if be additionally operable to it is described second assembling teams and groups have it is multiple, it is determined that it is multiple
The release time of the second assembling teams and groups；Calculate product allows process time point and multiple described second in the earliest of the process
The difference of the release time of teams and groups is assembled, the third assembling teams and groups of difference minimum is selected to assemble the product.
Optionally, second acquisition module 902, for determining each product in the first step according to the Product stack
Processing sequence, remaining process in addition to the first step is processed successively according to the time sequencing of product in place.
The assembling schedule information generating system 900 of inventive embodiments can realize electronics in the embodiment of the method for Fig. 1 to Fig. 8
Each process that equipment is realized, repeats, which is not described herein again to avoid.
The assembling schedule information generating system 900 of the embodiment of the present invention can determine general assembly from numerous Product stacks
Enter the product sequence of assembly process with the shortest n product of duration, improve assembling effect during shop applications assembling schedule information
Rate shortens the general assembly duration in workshop.
Refer to Figure 14, the hardware architecture diagram of Figure 14 a kind of electronic equipment of each embodiment to realize the present invention,
The electronic equipment 1400 includes but not limited to：Radio frequency unit 1401, network module 1402, audio output unit 1403, input are single
Member 1404, sensor 1405, display unit 1406, user input unit 1407, interface unit 1408, memory 1409, processing
1411 grade components of device 1410 and power supply.It will be understood by those skilled in the art that the electronic devices structure shown in Figure 10 is not
The restriction to electronic equipment is formed, electronic equipment can be included than illustrating more or fewer components or combining certain components,
Or different component arrangement.In embodiments of the present invention, electronic equipment includes but not limited to mobile phone, tablet computer, notebook
Computer, palm PC, car-mounted terminal, wearable device and pedometer etc..
Wherein, processor 1410, for obtaining multiple Product stacks, wherein, each Product stack is used to represent n production
Product enter the product sequence of assembly process, and different product queue represents that the product sequence of the n product is different, and the n is big
In or equal to 2 integer；According to preset schedule rule and the Product stack, it is complete to obtain all over products in each Product stack
Into the general assembly duration of assembling, wherein, the preset schedule rule includes product in the same process to multiple assembling teams and groups
The ordering strategy and assembly parameter of selection strategy, product；It determines the shortest target product queue of general assembly duration, generates and export
Assembling schedule information, the assembling schedule information include the n product that the target product queue represents and enter assembler
The product sequence of sequence.
Optionally, processor 1410 are determining the shortest target product queue of general assembly duration, generate and export assembling and adjust
In the step of spending information, including：Determine shortest first Product stack of general assembly duration in the Product stack；To described first
Product stack carries out insertion operation, obtains the second Product stack, and according to the preset schedule rule to the second product team
Row carry out the local search operation of mixing neighborhood, filter out the shortest third production of general assembly duration based on second Product stack
Product queue；If the general assembly duration of the third Product stack is less than the general assembly duration of first Product stack, by institute
It states target product queue and is updated to the third Product stack, generate and export assembling schedule information, the assembling schedule information
The n product represented including the updated target product queue enters the product of assembly process sequentially.
Optionally, processor 1410 are carrying out insertion operation to first Product stack, are obtaining the second Product stack,
And the local search operation of mixing neighborhood is carried out to second Product stack according to the preset schedule rule, it filters out based on institute
In the step of stating the general assembly duration shortest third Product stack of the second Product stack, including：To first Product stack
Insertion operation is carried out, obtains the second Product stack, and according to the preset schedule rule and second Product stack, obtain institute
State the general assembly duration of the second Product stack；Insertion operation or swap operation are carried out to second Product stack, obtain the 4th
Product stack, and according to the preset schedule rule and the 4th Product stack, obtain the general assembly of the 4th Product stack
With duration；If the general assembly duration of the 4th Product stack is less than the general assembly duration of second Product stack, by institute
It states the second Product stack and is updated to the 4th Product stack, the first iterations are added 1, and perform described to the second product team
Row carry out insertion operation or swap operation, obtain the 4th Product stack, and according to the preset schedule rule and the 4th production
The step of product queue, the general assembly duration of acquisition the 4th Product stack；If the general assembly duration of the 4th Product stack
Not less than the general assembly duration of second Product stack, then the first iterations are added 1, performed described to second product
Queue carries out insertion operation or swap operation, obtains the 4th Product stack, and according to the preset schedule rule and the described 4th
The step of Product stack, the general assembly duration of acquisition the 4th Product stack；When first iterations are not less than first
Default iterations, then using second Product stack as third Product stack.
Optionally, processor 1410, in the step of obtaining multiple Product stacks, including：Obtain current iteration round
Multiple Product stacks；It is described according to preset schedule rule and the Product stack, it is complete to obtain all over products in each Product stack
Into assembling general assembly duration the step of after, further include：Determine shortest 5th production of general assembly duration in current iteration round
Product queue, and secondary iteration number is added 1；It has been completed in iterations if the general assembly duration of the 5th Product stack is less than
Shortest 6th Product stack of general assembly duration, then be updated to the 5th Product stack, and right by the 6th Product stack
6th Product stack does not update algebraically and is zeroed out operation；If the general assembly duration of the 5th Product stack is not less than described the
6th Product stack is not then updated algebraically and adds 1 by the general assembly duration of six Product stacks；If the 6th Product stack is not
Algebraically is updated not less than predetermined threshold value, then obtains new Product stack, and the new Product stack is replaced into current iteration
In round after the longer Product stack of the general assembly duration of preset ratio, perform described according to preset schedule rule and replaced
The step of Product stack, the general assembly duration of each product of acquisition；If the 6th Product stack does not update algebraically
Less than predetermined threshold value, and the secondary iteration number is less than the second default iterations, then performs and obtain following iteration round
Multiple Product stacks the step of；In the step of determining general assembly duration shortest target product queue, including：By institute
The 6th Product stack is stated as the target product queue.
Optionally, processor 1410, in the step of obtaining multiple Product stacks, including：Multiple times are generated to arranging, often
A time includes the multiple time points equal with the quantity of multiple products to arranging；The sequencing and product identification temporally put
The mapping relations of sequence are determined with the multiple time to the corresponding multiple Product stacks of row.
Optionally, processor 1410, each selection strategy, including：For each process in assembly process, product is determined
In the earliest assembling duration for allowing process time point and each assembling teams and groups in the process of the process；Allow to add earliest according to described
Work time point and each assembling duration for assembling teams and groups in the process, calculating product are assembled multiple complete by multiple assembling teams and groups
Into time point；The product assembles in the first most preceding assembling teams and groups of selection deadline point.
Optionally, processor 1410, each selection strategy further include：If the first assembling teams and groups have multiple, select
The shortest second assembling teams and groups of duration are assembled in the first assembling teams and groups in the process to assemble the product.
Optionally, each selection strategy, further includes：If the second assembling teams and groups have multiple, it is determined that multiple described the
The release time of two assembling teams and groups；Calculate product allows process time point and multiple second assembling classes in the earliest of the process
The difference of the release time of group selects the third assembling teams and groups of difference minimum to assemble the product.
Optionally, each ordering strategy, including：Processing of each product in the first step is determined according to the Product stack
Sequentially, remaining process in addition to the first step is processed successively according to the time sequencing of product in place.
Electronic equipment 1400 can realize each process that assembling schedule information generating system is realized in previous embodiment, be
It avoids repeating, which is not described herein again.
The electronic equipment 1400 of the embodiment of the present invention can determine that general assembly duration is shortest from numerous Product stacks
N product enters the product sequence of assembly process, improves efficiency of assembling during shop applications assembling schedule information, shortens workshop
General assembly duration.
It should be understood that the embodiment of the present invention in, radio frequency unit 1401 can be used for receive and send messages or communication process in, signal
Send and receive, specifically, by from base station downlink data receive after, handled to processor 1410；In addition, by uplink
Data are sent to base station.In general, radio frequency unit 1401 includes but not limited to antenna, at least one amplifier, transceiver, coupling
Device, low-noise amplifier, duplexer etc..In addition, radio frequency unit 1401 can also by radio communication system and network and other
Equipment communicates.
Electronic equipment has provided wireless broadband internet to the user by network module 1402 and has accessed, and such as user is helped to receive
It sends e-mails, browse webpage and access streaming video etc..
It is that audio output unit 1403 can receive radio frequency unit 1401 or network module 1402 or in memory
The audio data stored in 1409 is converted into audio signal and exports as sound.Moreover, audio output unit 1403 can be with
The relevant audio output of specific function performed with electronic equipment 1400 is provided (for example, call signal receives sound, message sink
Sound etc.).Audio output unit 1403 includes loud speaker, buzzer and receiver etc..
Input unit 1404 is used to receive audio or video signal.Input unit 1404 can include graphics processor
(Graphics Processing Unit, GPU) 10041 and microphone 10042, graphics processor 10041 in video to capturing
In pattern or image capture mode by image capture apparatus (such as camera) obtain static images or video image data into
Row processing.Treated, and picture frame may be displayed on display unit 1406.Through treated the picture frame of graphics processor 10041
It can be stored in memory 1409 (or other storage mediums) or be carried out via radio frequency unit 1401 or network module 1402
It sends.Microphone 10042 can receive sound, and can be audio data by such acoustic processing.Audio that treated
Data can be converted to the lattice that mobile communication base station can be sent to via radio frequency unit 1401 in the case of telephone calling model
Formula exports.
Electronic equipment 1400 further includes at least one sensor 1405, for example, optical sensor, motion sensor and other
Sensor.Specifically, optical sensor includes ambient light sensor and proximity sensor, wherein, ambient light sensor can be according to ring
The light and shade of border light adjusts the brightness of display panel 10061, proximity sensor can when electronic equipment 1400 is moved in one's ear,
Close display panel 10061 and/or backlight.As one kind of motion sensor, accelerometer sensor can detect in all directions
The size of (generally three axis) acceleration, can detect that size and the direction of gravity, can be used to identify electronic equipment appearance when static
State (such as horizontal/vertical screen switching, dependent game, magnetometer pose calibrating), Vibration identification correlation function (such as pedometer, percussion)
Deng；Sensor 1405 can also include fingerprint sensor, pressure sensor, iris sensor, molecule sensor, gyroscope, gas
Meter, hygrometer, thermometer, infrared ray sensor etc. are pressed, details are not described herein.
Display unit 1406 is used to show by information input by user or be supplied to the information of user.Display unit 1406 can
Including display panel 10061, liquid crystal display (Liquid Crystal Display, LCD), organic light-emitting diodes may be used
Forms such as (Organic Light-Emitting Diode, OLED) are managed display panel 10061 is configured.
User input unit 1407 can be used for receiving the number inputted or character information and generation and the use of electronic equipment
The key signals input that family is set and function control is related.Specifically, user input unit 1407 include touch panel 10071 with
And other input equipments 10072.Touch panel 10071, also referred to as touch screen collect user on it or neighbouring touch are grasped
Make (for example user uses any suitable objects such as finger, stylus or attachment on touch panel 10071 or in touch panel
Operation near 10071).Touch panel 10071 may include both touch detecting apparatus and touch controller.Wherein, it touches
The touch orientation of detection device detection user is touched, and detects the signal that touch operation is brought, transmits a signal to touch controller；
Touch controller receives touch information from touch detecting apparatus, and is converted into contact coordinate, then gives processor 1410,
It receives the order that processor 1410 is sent and is performed.Furthermore, it is possible to using resistance-type, condenser type, infrared ray and surface
The multiple types such as sound wave realize touch panel 10071.In addition to touch panel 10071, user input unit 1407 can also include
Other input equipments 10072.Specifically, other input equipments 10072 can include but is not limited to physical keyboard, function key (ratio
Such as volume control button, switch key), trace ball, mouse, operating lever, details are not described herein.
Further, touch panel 10071 can be covered on display panel 10061, when touch panel 10071 detects
After touch operation on or near it, processor 1410 is sent to determine the type of touch event, is followed by subsequent processing device 1410
Corresponding visual output is provided on display panel 10061 according to the type of touch event.Although in Fig. 10, touch panel
10071 realize the function that outputs and inputs of electronic equipment with display panel 10061 is the component independent as two, but
In some embodiments, touch panel 10071 with display panel 10061 can be integrated and realize outputting and inputting for electronic equipment
Function does not limit specifically herein.
Interface unit 1408 is the interface that external device (ED) is connect with electronic equipment 1400.For example, external device (ED) can include
Wired or wireless headphone port, external power supply (or battery charger) port, wired or wireless data port, storage card
Port, the port for device of the connection with identification module, audio input/output (I/O) port, video i/o port, earphone
Port etc..Interface unit 1408 can be used for receiving the input (for example, data information, electric power etc.) from external device (ED) simultaneously
And one or more elements that the input received is transferred in electronic equipment 1400 or it can be used in electronic equipment
Data are transmitted between 1400 and external device (ED).
Memory 1409 can be used for storage software program and various data.Memory 1409 can mainly include storage program
Area and storage data field, wherein, storing program area can storage program area, needed at least one function application program (such as
Sound-playing function, image player function etc.) etc.；Storage data field can be stored uses created data (ratio according to mobile phone
Such as audio data, phone directory) etc..In addition, memory 1409 can include high-speed random access memory, can also include non-
Volatile memory, for example, at least a disk memory, flush memory device or other volatile solid-state parts.
Processor 1410 is the control centre of electronic equipment, utilizes each of various interfaces and the entire electronic equipment of connection
A part is stored in storage by running or performing the software program being stored in memory 1409 and/or module and call
Data in device 1409 perform the various functions of electronic equipment and processing data, so as to carry out integral monitoring to electronic equipment.Place
Reason device 1410 may include one or more processing units；Preferably, processor 1410 can integrate application processor and modulation /demodulation
Processor, wherein, the main processing operation system of application processor, user interface and application program etc., modem processor master
Handle wireless communication.It is understood that above-mentioned modem processor can not also be integrated into processor 1410.
Electronic equipment 1400 can also include the power supply 1411 (such as battery) powered to all parts, it is preferred that power supply
1411 can be logically contiguous by power-supply management system and processor 1410, so as to realize that management is filled by power-supply management system
The functions such as electricity, electric discharge and power managed.
In addition, electronic equipment 1400 includes some unshowned function modules, details are not described herein.
Preferably, the embodiment of the present invention also provides a kind of electronic equipment, including processor 1410, memory 1409, storage
On memory 1409 and the computer program that can be run on the processor 1410, the computer program is by processor 1410
Each process of above-mentioned assembling schedule information generating method embodiment is realized during execution, and identical technique effect can be reached, is
It avoids repeating, which is not described herein again.
The embodiment of the present invention also provides a kind of computer readable storage medium, and meter is stored on computer readable storage medium
Calculation machine program, the computer program realize each mistake of above-mentioned assembling schedule information generating method embodiment when being executed by processor
Journey, and identical technique effect can be reached, it is repeated to avoid, which is not described herein again.Wherein, the computer-readable storage medium
Matter, such as read-only memory (Read-Only Memory, abbreviation ROM), random access memory (Random Access
Memory, abbreviation RAM), magnetic disc or CD etc..
It should be noted that herein, term " comprising ", "comprising" or its any other variant are intended to non-row
His property includes, so that process, method, article or device including a series of elements not only include those elements, and
And it further includes other elements that are not explicitly listed or further includes intrinsic for this process, method, article or device institute
Element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that including this
Also there are other identical elements in the process of element, method, article or device.
Through the above description of the embodiments, those skilled in the art can be understood that above-described embodiment side
Method can add the mode of required general hardware platform to realize by software, naturally it is also possible to by hardware, but in many cases
The former is more preferably embodiment.Based on such understanding, technical scheme of the present invention substantially in other words does the prior art
Going out the part of contribution can be embodied in the form of software product, which is stored in a storage medium
In (such as ROM/RAM, magnetic disc, CD), used including some instructions so that a station terminal (can be mobile phone, computer services
Device, air conditioner or network equipment etc.) perform method described in each embodiment of the present invention.
The embodiment of the present invention is described above in conjunction with attached drawing, but the invention is not limited in above-mentioned specific
Embodiment, above-mentioned specific embodiment is only schematical rather than restricted, those of ordinary skill in the art
Under the enlightenment of the present invention, present inventive concept and scope of the claimed protection are not being departed from, can also made very much
Form is belonged within the protection of the present invention.
Claims (20)
1. a kind of assembling schedule information generating method, which is characterized in that the method includes：
Obtain multiple Product stacks, wherein, each Product stack be used to represent n product enter assembly process product it is suitable
Sequence, different product queue represent that the product sequence of the n product is different, and the n is the integer more than or equal to 2；
According to preset schedule rule and the Product stack, the general assembly that all over products in each Product stack completes assembling is obtained
Duration, wherein, the preset schedule rule includes product in the same process to the multiple assembling selection strategies of teams and groups, product
Ordering strategy and assembly parameter；
It determines the shortest target product queue of general assembly duration, generate and exports assembling schedule information, the assembling schedule information
The n product represented including the target product queue enters the product of assembly process sequentially.
2. assembling schedule information generating method according to claim 1, which is characterized in that the determining general assembly duration is most
Short target product queue, the step of generating and export assembling schedule information, including：
Determine shortest first Product stack of general assembly duration in the Product stack；
Insertion operation is carried out to first Product stack, obtains the second Product stack, and right according to the preset schedule rule
Second Product stack carries out the local search operation of mixing neighborhood, when filtering out the general assembly based on second Product stack
Long shortest third Product stack；
If the general assembly duration of the third Product stack is less than the general assembly duration of first Product stack, by the mesh
Mark Product stack is updated to the third Product stack, generates and exports assembling schedule information, the assembling schedule information includes
The n product that the updated target product queue represents enters the product sequence of assembly process.
3. assembling schedule information generating method according to claim 2, which is characterized in that described to the first product team
Row carry out insertion operation, obtain the second Product stack, and second Product stack is carried out according to the preset schedule rule
The operation of neighborhood local search is mixed, filters out the shortest third Product stack of general assembly duration based on second Product stack
The step of, including：
Insertion operation is carried out to first Product stack, obtains the second Product stack, and according to the preset schedule rule and
Second Product stack obtains the general assembly duration of second Product stack；
Insertion operation or swap operation are carried out to second Product stack, obtain the 4th Product stack, and according to described default
Scheduling rule and the 4th Product stack obtain the general assembly duration of the 4th Product stack；
If the general assembly duration of the 4th Product stack is less than the general assembly duration of second Product stack, by described the
Two Product stacks are updated to the 4th Product stack, and the first iterations are added 1, and perform it is described to second Product stack into
Row insertion operation or swap operation obtain the 4th Product stack, and according to the preset schedule rule and the 4th product team
The step of row, the general assembly duration of acquisition the 4th Product stack；
If the general assembly duration of the 4th Product stack is not less than the general assembly duration of second Product stack, by first
Iterations add 1, and execution is described to carry out insertion operation or swap operation to second Product stack, obtains the 4th product team
Row, and according to the preset schedule rule and the 4th Product stack, obtain the general assembly duration of the 4th Product stack
The step of；
When first iterations are not less than the first default iterations, then using second Product stack as third product
Queue.
4. assembling schedule information generating method according to claim 1, which is characterized in that described to obtain multiple Product stacks
The step of, including：
Obtain multiple Product stacks of current iteration round；
It is described according to preset schedule rule and the Product stack, obtain all over products in each Product stack and complete the total of assembling
After the step of assembling duration, further include：
It determines shortest 5th Product stack of general assembly duration in current iteration round, and secondary iteration number is added 1；
If the general assembly duration of the 5th Product stack, which is less than, has completed shortest 6th production of general assembly duration in iterations
6th Product stack is then updated to the 5th Product stack, and do not update algebraically to the 6th Product stack by product queue
It is zeroed out operation；
If the general assembly duration of the 5th Product stack is not less than the general assembly duration of the 6th Product stack, by described in
6th Product stack does not update algebraically and adds 1；
If the 6th Product stack does not update algebraically not less than predetermined threshold value, new Product stack is obtained, and by described in
In new Product stack replacement current iteration round after the longer Product stack of the general assembly duration of preset ratio, described is performed
According to preset schedule rule and the replaced Product stack, the step of obtaining the general assembly duration of each product；
If the 6th Product stack does not update algebraically less than predetermined threshold value, and the secondary iteration number is less than second and presets
Iterations, then perform obtain following iteration round multiple Product stacks the step of；
The step of determining general assembly duration shortest target product queue, including：
Using the 6th Product stack as the target product queue.
5. assembling schedule information generating method according to any one of claim 1 to 4, which is characterized in that the acquisition
The step of multiple Product stacks, including：
Multiple times are generated to row, each time includes the multiple time points equal with the quantity of multiple products to arranging；
The sequencing and the mapping relations of product identification sequence temporally put determine corresponding more to row with the multiple time
A Product stack.
6. assembling schedule information generating method according to claim 1, which is characterized in that each selection strategy, including：
For each process in assembly process, determine that product allows process time point and each assembling teams and groups in the earliest of the process
In the assembling duration of the process；According to it is described it is earliest allow process time point and it is each assembling teams and groups the process assembling duration,
Calculate multiple deadline points that product is assembled by multiple assembling teams and groups；Select the first assembling class that deadline point is most preceding
Group assembles the product.
7. assembling schedule information generating method according to claim 6, which is characterized in that each selection strategy further includes：
If it is described first assembling teams and groups have it is multiple, select it is described first assembling teams and groups in the process assemble duration it is shortest
The product assembles in second assembling teams and groups.
8. assembling schedule information generating method according to claim 7, which is characterized in that each selection strategy further includes：
If the second assembling teams and groups have multiple, it is determined that the release time of multiple second assembling teams and groups；
Calculate product allows process time point and the difference of the release time of multiple second assembling teams and groups in the earliest of the process
Value selects the third assembling teams and groups of difference minimum to assemble the product.
9. assembling schedule information generating method according to claim 1, which is characterized in that each ordering strategy, including：
Processing sequence of each product in the first step is determined according to the Product stack, remaining work in addition to the first step
Sequence is processed successively according to the time sequencing of product in place.
10. a kind of assembling schedule information generating system, which is characterized in that including：
First acquisition module, for obtaining multiple Product stacks, wherein, each Product stack is used to represent that n product enters
The product sequence of assembly process, different product queue represent that the product sequence of the n product is different, the n be more than or
Integer equal to 2；
Second acquisition module, for according to preset schedule rule and the Product stack, obtaining and all being produced in each Product stack
Product complete the general assembly duration of assembling, wherein, the preset schedule rule includes product in the same process to multiple assembling classes
The selection strategy of group, the ordering strategy and assembly parameter of product；
Output module, it is described for determining the shortest target product queue of general assembly duration, generating and exporting assembling schedule information
Assembling schedule information includes the product sequence that the n product that the target product queue represents enters assembly process.
11. assembling schedule information generating system according to claim 10, which is characterized in that the output module includes：
First determination sub-module, for determining shortest first Product stack of general assembly duration in the Product stack；
Submodule is screened, for carrying out insertion operation to first Product stack, obtains the second Product stack, and according to described
Preset schedule rule carries out second Product stack local search operation of mixing neighborhood, filters out based on second product
The shortest third Product stack of general assembly duration of queue；
Output sub-module, if the general assembly duration for the third Product stack is less than the general assembly of first Product stack
The target product queue is then updated to the third Product stack by duration, is generated and is exported assembling schedule information, the dress
It is suitable including the product that the n product that the updated target product queue represents enters assembly process with scheduling information
Sequence.
12. assembling schedule information generating system according to claim 11, which is characterized in that the screening submodule packet
It includes：
First acquisition unit for carrying out insertion operation to first Product stack, obtains the second Product stack, and according to institute
Preset schedule rule and second Product stack are stated, obtains the general assembly duration of second Product stack；
Second acquisition unit for carrying out insertion operation or swap operation to second Product stack, obtains the 4th product team
Row, and according to the preset schedule rule and the 4th Product stack, obtain the general assembly duration of the 4th Product stack；
First counting unit, if the general assembly duration for the 4th Product stack is less than the general assembly of second Product stack
With duration, then second Product stack is updated to the 4th Product stack, the first iterations is added 1, and perform it is described right
Second Product stack carries out insertion operation or swap operation, obtains the 4th Product stack, and advise according to the preset schedule
Then with the 4th Product stack, the step of obtaining the general assembly duration of the 4th Product stack；
Second counting unit, if the general assembly duration for the 4th Product stack is total not less than second Product stack
Duration is assembled, then the first iterations are added 1, execution is described to be carried out second Product stack insertion operation or exchange to grasp
Make, obtain the 4th Product stack, and according to the preset schedule rule and the 4th Product stack, obtain the 4th product
The step of general assembly duration of queue；
Determination unit, for working as first iterations not less than the first default iterations, then by the second product team
Row are as third Product stack.
13. assembling schedule information generating system according to claim 10, which is characterized in that first acquisition module is used
In the multiple Product stacks for obtaining current iteration round；
The assembling schedule information generating system further includes：
Determining module, for determining shortest 5th Product stack of general assembly duration in current iteration round, and by secondary iteration
Number adds 1；
First counting module, if for the 5th Product stack general assembly duration be less than completed general assembly in iterations
6th Product stack is then updated to the 5th Product stack, and produce to the 6th by shortest 6th Product stack of duration
Product queue does not update algebraically and is zeroed out operation；
Second counting module, if the general assembly duration for the 5th Product stack is total not less than the 6th Product stack
Duration is assembled, then the 6th Product stack is not updated into algebraically and adds 1；
First execution module if not updating algebraically not less than predetermined threshold value for the 6th Product stack, obtains newly
Product stack, and the new Product stack is replaced to the longer product of general assembly duration of preset ratio in current iteration round
After queue, perform described according to preset schedule rule and the replaced Product stack, the general assembly of each product of acquisition
The step of with duration；
Second execution module, if not updating algebraically less than predetermined threshold value for the 6th Product stack, and described second changes
Generation number be less than the second default iterations, then perform obtain following iteration round multiple Product stacks the step of；
The output module, for using the 6th Product stack as the target product queue.
14. the assembling schedule information generating system according to any one of claim 10 to 13, which is characterized in that described
One acquisition module includes：
Submodule is generated, for generating multiple times to row, each time is to arranging including equal with the quantity of multiple products
Multiple time points；
Second determination sub-module, for the sequencing and the mapping relations of product identification sequence temporally put, determine with it is described
Multiple times are to arranging corresponding multiple Product stacks.
15. assembling schedule information generating system according to claim 10, which is characterized in that second acquisition module,
For being directed to each process in assembly process, determine that product allows process time point and each assembling teams and groups in the earliest of the process
In the assembling duration of the process；According to it is described it is earliest allow process time point and it is each assembling teams and groups the process assembling duration,
Calculate multiple deadline points that product is assembled by multiple assembling teams and groups；Select the first assembling class that deadline point is most preceding
Group assembles the product.
16. assembling schedule information generating system according to claim 15, which is characterized in that the second acquisition module is also used
If in the described first assembling teams and groups having multiple, select to assemble duration shortest the in the process in the first assembling teams and groups
The product assembles in two assembling teams and groups.
17. assembling schedule information generating system according to claim 16, which is characterized in that second acquisition module,
If be additionally operable to it is described second assembling teams and groups have it is multiple, it is determined that it is multiple it is described second assembling teams and groups release time；Calculate product
Earliest in the process allows process time point and the difference of the release time of multiple second assembling teams and groups, selects difference most
The product assembles in small third assembling teams and groups.
18. assembling schedule information generating system according to claim 10, which is characterized in that second acquisition module,
For determining processing sequence of each product in the first step according to the Product stack, remaining work in addition to the first step
Sequence is processed successively according to the time sequencing of product in place.
19. a kind of electronic equipment, which is characterized in that including processor, memory and be stored on the memory and can be in institute
The computer program run on processor is stated, such as claim 1 to 9 is realized when the computer program is performed by the processor
Any one of described in assembling schedule information generating method the step of.
20. a kind of computer readable storage medium, which is characterized in that be stored with computer on the computer readable storage medium
Program, the computer program realize assembling schedule information as claimed in any one of claims 1-9 wherein when being executed by processor
The step of generation method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810044376.0A CN108255141B (en) | 2018-01-17 | 2018-01-17 | A kind of assembling schedule information generating method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810044376.0A CN108255141B (en) | 2018-01-17 | 2018-01-17 | A kind of assembling schedule information generating method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108255141A true CN108255141A (en) | 2018-07-06 |
| CN108255141B CN108255141B (en) | 2019-11-26 |
Family
ID=62726480
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810044376.0A Active CN108255141B (en) | 2018-01-17 | 2018-01-17 | A kind of assembling schedule information generating method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108255141B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109978403A (en) * | 2019-04-04 | 2019-07-05 | 北京理工大学 | A kind of quality management-control method, device and the equipment of Product Assembly process |
| CN110456746A (en) * | 2019-07-30 | 2019-11-15 | 中国工程物理研究院材料研究所 | A kind of real-time scheduling method of multi items swinging cross automated production |
| CN110659844A (en) * | 2019-09-30 | 2020-01-07 | 哈尔滨工程大学 | Optimization method for assembly resource scheduling of mail-carrier outfitting workshop |
| CN112308445A (en) * | 2020-11-10 | 2021-02-02 | 珠海格力电器股份有限公司 | Method and system for processing manufacturing process data, storage medium and electronic device |
| CN115879782A (en) * | 2023-01-05 | 2023-03-31 | 深圳市鼎山科技有限公司 | Production supply chain monitoring management system and method based on Internet of things |
| CN117075556A (en) * | 2023-08-25 | 2023-11-17 | 安徽鸿凌智能仪表科技有限公司 | Intelligent instrument assembly method and system based on Internet of things |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6510355B1 (en) * | 2000-03-29 | 2003-01-21 | Ford Motor Company | Method for paint repair in a reduced retooling cost system |
| CN1466864A (en) * | 2000-08-04 | 2004-01-07 | 松下电器产业株式会社 | Method for optimization of an order of component mounting, apparatus using the same and mounter |
| CN102393634A (en) * | 2011-11-28 | 2012-03-28 | 浙江工业大学 | Single-target multi-production line scheduling control method based on PSO-GA mixing optimization algorithm |
| CN102929263A (en) * | 2012-11-16 | 2013-02-13 | 北京理工大学 | Hybrid flow shop scheduling method |
| CN103116324A (en) * | 2012-12-17 | 2013-05-22 | 清华大学 | Micro-electronics production line scheduling method based on index prediction and online learning |
| CN103176407A (en) * | 2012-04-12 | 2013-06-26 | 哈尔滨理工大学 | Production scheduling method based on production process decoupling point positioning |
| CN104283954A (en) * | 2014-09-30 | 2015-01-14 | 浙江大学 | Service combination selecting method orienting mobile service cell |
| CN104462705A (en) * | 2014-12-19 | 2015-03-25 | 西安工业大学 | Fixture assembly sequence planning method based on particle swarm optimization algorithm |
| CN104503381A (en) * | 2014-11-20 | 2015-04-08 | 昆明理工大学 | Optimizing scheduling method of handset in production assembly process |
| CN106681291A (en) * | 2017-01-09 | 2017-05-17 | 北京理工大学 | Production scheduling method and system |
-
2018
- 2018-01-17 CN CN201810044376.0A patent/CN108255141B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6510355B1 (en) * | 2000-03-29 | 2003-01-21 | Ford Motor Company | Method for paint repair in a reduced retooling cost system |
| CN1466864A (en) * | 2000-08-04 | 2004-01-07 | 松下电器产业株式会社 | Method for optimization of an order of component mounting, apparatus using the same and mounter |
| CN102393634A (en) * | 2011-11-28 | 2012-03-28 | 浙江工业大学 | Single-target multi-production line scheduling control method based on PSO-GA mixing optimization algorithm |
| CN103176407A (en) * | 2012-04-12 | 2013-06-26 | 哈尔滨理工大学 | Production scheduling method based on production process decoupling point positioning |
| CN102929263A (en) * | 2012-11-16 | 2013-02-13 | 北京理工大学 | Hybrid flow shop scheduling method |
| CN103116324A (en) * | 2012-12-17 | 2013-05-22 | 清华大学 | Micro-electronics production line scheduling method based on index prediction and online learning |
| CN104283954A (en) * | 2014-09-30 | 2015-01-14 | 浙江大学 | Service combination selecting method orienting mobile service cell |
| CN104503381A (en) * | 2014-11-20 | 2015-04-08 | 昆明理工大学 | Optimizing scheduling method of handset in production assembly process |
| CN104462705A (en) * | 2014-12-19 | 2015-03-25 | 西安工业大学 | Fixture assembly sequence planning method based on particle swarm optimization algorithm |
| CN106681291A (en) * | 2017-01-09 | 2017-05-17 | 北京理工大学 | Production scheduling method and system |
Non-Patent Citations (2)
| Title |
|---|
| 刘沛等: "一种基于改进的磷虾群和粒子群的混合算法", 《河南师范大学学报（自然科学版）》 * |
| 庄存波等: "复杂产品装配现场动态实时可视化监控***", 《计算机集成制造***》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109978403A (en) * | 2019-04-04 | 2019-07-05 | 北京理工大学 | A kind of quality management-control method, device and the equipment of Product Assembly process |
| CN109978403B (en) * | 2019-04-04 | 2021-04-20 | 北京理工大学 | Quality control method, device and equipment for product assembly process |
| CN110456746A (en) * | 2019-07-30 | 2019-11-15 | 中国工程物理研究院材料研究所 | A kind of real-time scheduling method of multi items swinging cross automated production |
| CN110456746B (en) * | 2019-07-30 | 2020-11-27 | 中国工程物理研究院材料研究所 | Real-time scheduling method for multi-variety mixed line automatic production |
| CN110659844A (en) * | 2019-09-30 | 2020-01-07 | 哈尔滨工程大学 | Optimization method for assembly resource scheduling of mail-carrier outfitting workshop |
| CN112308445A (en) * | 2020-11-10 | 2021-02-02 | 珠海格力电器股份有限公司 | Method and system for processing manufacturing process data, storage medium and electronic device |
| CN112308445B (en) * | 2020-11-10 | 2024-04-16 | 珠海格力电器股份有限公司 | Method and system for processing manufacturing process data, storage medium and electronic equipment |
| CN115879782A (en) * | 2023-01-05 | 2023-03-31 | 深圳市鼎山科技有限公司 | Production supply chain monitoring management system and method based on Internet of things |
| CN115879782B (en) * | 2023-01-05 | 2023-05-09 | 深圳市鼎山科技有限公司 | Production supply chain monitoring management system and method based on Internet of things |
| CN117075556A (en) * | 2023-08-25 | 2023-11-17 | 安徽鸿凌智能仪表科技有限公司 | Intelligent instrument assembly method and system based on Internet of things |
| CN117075556B (en) * | 2023-08-25 | 2024-05-14 | 安徽鸿凌智能仪表科技有限公司 | Intelligent instrument assembly method and system based on Internet of things |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108255141B (en) | 2019-11-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108255141B (en) | A kind of assembling schedule information generating method and system | |
| CN104967679B (en) | Information recommendation system, method and device | |
| CN107734179A (en) | A kind of message prompt method, mobile terminal | |
| CN107707461A (en) | The display methods and mobile terminal of a kind of conversation message | |
| CN109598749A (en) | A kind of method for parameter configuration of three-dimensional face model, device, equipment and medium | |
| CN104881844B (en) | Picture combination method and device and terminal equipment | |
| CN104363988B (en) | A kind of management method and device of multi-core processor | |
| CN107766139B (en) | Application management method and device | |
| CN109375907A (en) | Auditing flow development approach, business audit method, apparatus, equipment and medium | |
| CN108519089A (en) | A kind of more people's route planning methods and terminal | |
| CN107220951A (en) | Facial image noise-reduction method, device, storage medium and computer equipment | |
| CN107729143A (en) | Application control method, apparatus, storage medium and electronic equipment | |
| CN108363524A (en) | A kind of application icon display methods and mobile terminal | |
| CN107704133A (en) | Freeze screen monitoring with solving method, mobile terminal and computer-readable recording medium | |
| CN108195392A (en) | A kind of more people's layout of roads methods and terminal | |
| CN107748699A (en) | Resource allocation methods and Related product | |
| CN110162653A (en) | A kind of picture and text sort recommendations method and terminal device | |
| CN107103074A (en) | The processing method and mobile terminal of a kind of sharing information | |
| CN108322897A (en) | Cutting ferrule meal combined method and device | |
| CN105049374B (en) | Dispatching method, device and the mobile terminal of downloading task | |
| CN108536349A (en) | A kind of icon management method and mobile terminal | |
| CN107277217A (en) | A kind of incoming call answering method and terminal device | |
| CN110413639A (en) | Data check method and device, electronic equipment and computer readable storage medium | |
| CN108600080A (en) | A kind of social information display methods and server | |
| CN108062370A (en) | A kind of application program searching method and mobile terminal |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |