CN108255141B - A kind of assembling schedule information generating method and system - Google Patents

A kind of assembling schedule information generating method and system Download PDF

Info

Publication number
CN108255141B
CN108255141B CN201810044376.0A CN201810044376A CN108255141B CN 108255141 B CN108255141 B CN 108255141B CN 201810044376 A CN201810044376 A CN 201810044376A CN 108255141 B CN108255141 B CN 108255141B
Authority
CN
China
Prior art keywords
product
product stack
assembly
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.)
Active
Application number
CN201810044376.0A
Other languages
Chinese (zh)
Other versions
CN108255141A (en
Inventor
熊辉
刘检华
庄存波
洪子奇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Technology
Original Assignee
Beijing University of Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing University of Technology filed Critical Beijing University of Technology
Priority to CN201810044376.0A priority Critical patent/CN108255141B/en
Publication of CN108255141A publication Critical patent/CN108255141A/en
Application granted granted Critical
Publication of CN108255141B publication Critical patent/CN108255141B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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], 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], 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], 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], 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—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/04—Manufacturing
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/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

Abstract

The present invention provides a kind of assembling schedule information generating method and system, wherein method is including: to obtain multiple Product stacks, wherein each Product stack is used to indicate that n product enters the product of assembly process sequentially；According to preset schedule rule and the Product stack, obtain the general assembly duration that all over products in each Product stack completes assembly, wherein, the preset schedule rule include product in the same process to the ordering strategy and assembly parameter of multiple assembly selection strategies of teams and groups, product；It determines the shortest target product queue of general assembly duration, generates and export assembling schedule information, the assembling schedule information includes that the n product of the target product queue expression enters the product sequence of assembly process.Assembling schedule information generating method provided in an embodiment of the present invention and system can be improved assembly efficiency when shop applications assembling schedule information, shorten the general assembly duration in workshop.

Description

A kind of assembling schedule information generating method and system
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 technique
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, assembly is the final tache for producing complex product, It is also mostly important one of 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 and control key problem it One, refer under certain constraint condition, limited resource is distributed to several tasks in time, to meet or optimize The process of one or more performance indicators.Time spent by every procedure in assemble flow on working hour longest path is all straight Connecing the assembly completion date for influencing product, wherein each procedure may be completed again by the incoherent assembly teams and groups of multiple time-consumings, Due to related constraints such as the assembly level complexity of complex product, the more, long periods of resource being related to, lead to the excellent of production scheduling It is high to change difficulty.
In the prior art, the assembly of complex product is all made of simple workflow, and product processing sequence is fixed, and there are complexity The longer problem of assembly duration of product.
Summary of the invention
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 the longer problem of duration.
In a first aspect, the embodiment of the invention provides a kind of assembling schedule information generating methods, which comprises
Obtain multiple Product stacks, wherein each Product stack is used to indicate that n product enters the product of assembly process Sequentially, different product queue indicates 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, obtains all over products in each Product stack and complete the total of assembly Assemble duration, wherein the preset schedule rule include product in the same process to it is multiple assembly teams and groups selection strategies, produce The ordering strategy and assembly parameter of product；
It determines the shortest target product queue of general assembly duration, generates and export assembling schedule information, the assembling schedule Information includes that the n product of the target product queue expression enters the product sequence of assembly process.
Optionally, the shortest target product queue of determining general assembly duration, generates and exports assembling schedule information Step, comprising:
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 Mixing neighborhood local search operation then is 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 indicated including the updated target product queue enters the product of assembly process sequentially.
Optionally, 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 mixing neighborhood local search operation to second Product stack, filters out based on second product The step of general assembly duration of queue shortest third Product stack, comprising:
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 the number of iterations is added 1, and execute described to second product team Column carry out insertion operation or swap operation, obtain the 4th Product stack, and produce according to the preset schedule rule and the described 4th 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 the number of iterations adds 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 the number of iterations is not less than the first default the number of iterations, then using second Product stack as third Product stack.
Optionally, the step of acquisition multiple Product stacks, comprising:
Obtain multiple Product stacks of current iteration round；
It is described according to preset schedule rule and the Product stack, obtain in each Product stack all over products and complete assembly General assembly duration the step of after, further includes:
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, is completed general assembly duration in the number of iterations shortest the 6th Product stack is then updated to the 5th Product stack, and not updated to the 6th Product stack by six Product stacks Algebra 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 algebra and adds 1；
If the 6th Product stack, which does not update algebra, 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 general assembly duration of preset ratio, institute is executed The step of stating the general assembly duration that each product is obtained according to preset schedule rule and the replaced Product stack；
If the 6th Product stack does not update algebra less than predetermined threshold value, and the secondary iteration number is less than second The step of presetting the number of iterations, then executing the multiple Product stacks for obtaining following iteration round；
The step of determining general assembly duration shortest target product queue, comprising:
Using the 6th Product stack as the target product queue.
Optionally, the step of acquisition multiple Product stacks, comprising:
Multiple time queues are generated, each time queue includes the multiple times equal with the quantity of multiple products to column Point；
The mapping relations of the sequencing and product number sequence temporally put, determining and the multiple time queue pair The multiple Product stacks answered.
Optionally, each selection strategy, comprising:
For each process in assembly process, determine product in the earliest permission process time point of the process and each assembly Assembly duration of the teams and groups in the process；According to the earliest permission process time point and each assembly teams and groups in the assembly of the process It is long, calculate multiple deadline points that product is assembled by multiple assembly 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 include:
If it is described first assembly teams and groups have it is multiple, select it is described first assembly teams and groups in the process assemble duration most The product assembles in the second short assembly teams and groups.
Optionally, each selection strategy, further includes:
If second assembly teams and groups have multiple, it is determined that the release time of multiple second assembly teams and groups；It calculates and produces Product select difference in the difference of the earliest permission process time point of the process and the release time of multiple second assembly teams and groups The product assembles in the smallest third assembly teams and groups.
Optionally, each ordering strategy, comprising:
Each product is determined in the processing sequence of first step according to the Product stack, its in addition to the first step Remaining process is successively processed according to the time sequencing of product in place.
Second aspect, the embodiment of the invention also provides a kind of assembling schedule information generating systems, comprising:
First obtains module, for obtaining multiple Product stacks, wherein each Product stack is used to indicate n product Into the product sequence of assembly process, different product queue indicates that the product sequence of the n product is different, the n for greater than Or the integer equal to 2；
Second obtains module, complete in each Product stack for obtaining according to preset schedule rule and the Product stack Portion's product complete assembly general assembly duration, wherein the preset schedule rule include product in the same process to multiple dresses The ordering strategy and assembly parameter of selection strategy, product with teams and groups；
Output module generates and exports assembling schedule information for determining the shortest target product queue of general assembly duration, The assembling schedule information includes that the n product of the target product queue expression enters the product sequence of assembly process.
Optionally, the output module includes:
First determines submodule, 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 mixing neighborhood local search operation to second Product stack, filters out based on described second The shortest third Product stack of the 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 State the product that the n product that assembling schedule information includes the updated target product queue expression enters assembly process Sequentially.
Optionally, the screening submodule includes:
First acquisition unit obtains the second Product stack, and root for carrying out insertion operation to first Product stack According to the preset schedule rule and second Product stack, the general assembly duration of second Product stack is obtained；
Second acquisition unit obtains the 4th production for carrying out insertion operation or swap operation to second Product stack 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 for second Product stack, the first the number of iterations is added 1, and execute 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 the number of iterations is added 1, executes 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 described 4th and produce The step of general assembly duration of product queue；
Determination unit is then produced described second for being not less than the first default the number of iterations when first the number of iterations 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 include:
Determining module, for determining shortest 5th Product stack of general assembly duration in current iteration round, and by second The number of iterations adds 1；
First counting module is completed in the number of iterations always if the general assembly duration for the 5th Product stack is less than 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 algebra 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 algebra and adds 1；
First execution module does not update algebra not less than predetermined threshold value for the 6th Product stack, then obtains new Product stack, and by the longer production of general assembly duration of preset ratio in the new Product stack replacement 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 algebra less than predetermined threshold value for the 6th Product stack, and described the Two the number of iterations are less than the second default the number of iterations, then the step of executing the multiple Product stacks for obtaining following iteration round；
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 time queues, each time queue includes the quantity phase with multiple products Deng multiple time points；
Second determine submodule, the mapping relations of sequencing and product number sequence for temporally putting, determine with The corresponding multiple Product stacks of the multiple time queue.
Optionally, described second each process that module is used to be directed in assembly process is obtained, determines product in the process Earliest permission process time point and it is each assembly teams and groups the process assembly duration；According to the earliest permission process time point With each assembly teams and groups in the assembly duration of the process, multiple deadlines that product is assembled by multiple assembly teams and groups are calculated Point；The product assembles in the first most preceding assembly teams and groups of selection deadline point.
Optionally, if second acquisition module be also used to it is described first assembly teams and groups have it is multiple, select it is described first assembly Duration shortest second assembly teams and groups are assembled in teams and groups in the process to assemble the product.
Optionally, if the second acquisition module be also used to second assembly teams and groups have it is multiple, it is determined that it is multiple described The release time of second assembly teams and groups；Calculate earliest permission process time point and multiple second assembly of the product in the process The difference of the release time of teams and groups selects difference the smallest third assembly teams and groups to assemble the product.
Optionally, described second module is obtained, for determining each product in first step according to the Product stack Processing sequence, remaining process in addition to the first step are successively processed 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, comprising: processor, memory and are stored in institute The computer program that can be run on memory and on the processor is stated, when the computer program is executed 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 indicate n Product enters the product sequence of assembly process, and different product queue indicates 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 Complete assembly general assembly duration, wherein the preset schedule rule include product in the same process to multiple assembly 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 Assembling schedule information out, the assembling schedule information include that the n product of the target product queue expression enters assembly The product sequence of process.In such manner, it is possible to determine that the shortest n product of general assembly duration enters assembly from numerous Product stacks The product sequence of process, improves assembly efficiency when shop applications assembling schedule information, shortens the general assembly duration in workshop.
Detailed description of the invention
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, drawings in the following description are only some embodiments of the invention, For those of ordinary skill in the art, without any creative labor, it can also obtain according to these attached drawings Obtain other attached drawings.
Fig. 1 is the flow diagram for the 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 be another embodiment of the present invention provides assembling schedule information generating method flow diagram；
Fig. 4 be another embodiment of the present invention provides assembling schedule information generating method flow diagram；
Fig. 5 be another embodiment of the present invention provides assembling schedule information generating method in assembly parameter different level situation Under performance move towards figure；
Fig. 6 be another embodiment of the present invention provides the test result that is obtained according to table 1 of assembling schedule information generating method；
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 structural schematic diagram for the assembling schedule information generating system that one embodiment of the invention provides；
Figure 10 be another embodiment of the present invention provides assembling schedule information generating system structural schematic diagram；
Figure 11 be another embodiment of the present invention provides assembling schedule information generating system structural schematic diagram；
Figure 12 be another embodiment of the present invention provides assembling schedule information generating system structural schematic diagram；
Figure 13 be another embodiment of the present invention provides assembling schedule information generating system structural schematic diagram；
The hardware structural diagram of Figure 14 a kind of electronic equipment of each embodiment to realize the present invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete Site preparation description, it is clear that described embodiments are some of the embodiments of the present invention, instead of all the embodiments.Based on this hair Embodiment in bright, every other implementation obtained by those of ordinary skill in the art without making creative efforts Example, shall fall within the protection scope of the present invention.
Referring to Fig. 1, Fig. 1 is the flow diagram for the assembling schedule information generating method that one embodiment of the invention provides. As shown in Figure 1, comprising:
Step 101: obtaining multiple Product stacks, wherein each Product stack is used to indicate that n product enters assembler The product sequence of sequence, different product queue indicate 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 assemble on working hour longest path Product, wherein product can be like products, or the identical approximate product of assembly process, product undergo assembly process Sequence and quantity it is all the same, multiple assembly teams and groups on each assembly process can assemble each product.
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 number, J={ 1,2 ..., n },nFor product sum；
S={ 1,2 ..., s },sFor process sum；K is process number, k ∈ S；
M(k)For the parallel assembly teams and groups number on process k；
pjkmThe time required for assembly manipulation is carried out in process k, as assembly teams and groups m for product j；
tjkFor the on-stream time of the kth procedure of 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 assembly teams and groups m；Otherwise xj,k,m=0；
yj,k,tThe kth procedure of=1, product j assemble on the t time；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) indicates to select the minimum duration；Formula (2) indicates the last one product in last procedures Completion date be Cmax；Formula (3) indicates that the same product only could start lower one of work after previous procedure assembles Sequence；Formula (4) indicates that each product can only carry out assembly manipulation by an assembly teams and groups in each process stages；Formula (5) indicates to produce ProductgWithhBetween exist prior to, after in, simultaneously three kinds of ordinal relations；Formula (6) indicates that the same assembly teams and groups can only a moment A product is assembled, i.e., could start the assembly of next product after the completion of previous Product Assembly；Formula (7) and formula (8) indicate The value of variable is nonnegative number, 0 or 1.
Such as: the process sum in shop production line on working hour longest path is s, then n product is required to phase Same sequence undergoes s procedure, wherein has m assembly teams and groups that can assemble to n product in each process.
It include the product number 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, obtaining all over products in each Product stack and complete The general assembly duration of assembly, wherein the preset schedule rule includes choosing of the product in the same process to multiple assembly teams and groups 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 Subsequent processing can be entered after the completion of one process；Each product is merely able to be filled by an assembly teams and groups in synchronization Match；Product is assembled to end assembly by assembly teams and groups not to allow to interrupt on the way；With infinite capacity between adjacent process Buffer area；By assembling teams and groups, assemble the required time known in process for product；Product is before the assembly of assembly teams and groups Time belongs to product and carries out assembling the required time by assembling teams and groups in process.
Wherein, in the case where having multiple assembly teams and groups to be assembled in a process, each assembly teams and groups are due to personnel, dress Difference with machine and product, times needed for the different assembly teams and groups in a process complete assembly are irrelevant.
By knowing that product is needed by assembly time required for how many procedure and each procedure Product Assembly The time that each product completes assembly 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 assembly.
Firstly, general assembly duration is related with the assembly teams and groups that product is selected in each process.
Optionally, in a feasible embodiment, product in the same process to it is multiple assembly teams and groups selection strategies, It include: to determine product in the earliest permission process time point a of the process for each process in assembly processmWith each assembly Assembly duration p of the teams and groups in the processjkm, wherein am=max (rm, Cj,k-1), rmIndicate the release time of machine, Cj,k-1Table Showed workpiece j in the completion date in a upper stage；According to the earliest permission process time point amWith each assembly teams and groups in the work The assembly duration p of sequencejkm, calculate multiple deadline point a that product is assembled by multiple assembly teams and groupsm+pjkm；Selection is completed Time point it is most preceding first assembly teams and groups the product is assembled.
The first most preceding assembly teams and groups of deadline point can be reached by selection to assemble product, to make each Product can terminate the assembly of the process with the earliest deadline in each process, and then can shorten the general assembly of Product stack With duration.
Further, since the assembly duration of multiple assembly teams and groups is irrelevant, it is understood that there may be the first assembly teams and groups have more A situation, in the case, optionally, if in the present embodiment it is described first assembly teams and groups have it is multiple, selection described in Duration p is assembled in the process in first assembly teams and groupsjkmThe product assembles in shortest second assembly teams and groups.
If wherein assembly duration is most short for selection there are multiple deadline points identical first assembly teams and groups in the same process Second assembly teams and groups the product is assembled, thus the deadline determine in the case where improve product assembly speed Degree also improves the flexibility of product scheduling.
In addition, first assembly teams and groups have it is multiple in the case where, also can choose transport path it is shortest first assembly teams and groups It is assembled, it is also an option that specific first assembly teams and groups are assembled, present embodiment is not construed as limiting this.
Further, since the assembly duration of multiple assembly teams and groups is irrelevant, it is understood that there may be the second assembly teams and groups have more A situation, in the case, optionally, if in the present embodiment it is described second assembly teams and groups have it is multiple, it is determined that it is multiple The release time r of second assembly teams and groupsm；Product is calculated in the earliest permission process time point a of the processmWith it is multiple described The difference a of the release time of second assembly teams and groupsm-rm, select difference am-rmThe smallest third assembly teams and groups to the product into Luggage is matched.
The release time of assembly teams and groups is for compensating individual demand, inevitably delay and being caused due to fatigue Efficiency decline time.Release time includes that assembly worker drinks water, goes to toilet, wiping the sweat, replacing and put together machines, safeguard assembly machine A series of device etc. inevitable times.Select product in the earliest permission process time point and multiple described second of the process The smallest third of difference for assembling the release time of teams and groups assembles teams and groups, permits in deadline point and product in the earliest of the process Perhaps in the case that process time point is all the same, the longer assembly for indicating that third assembly teams and groups of the release time of third assembly teams and groups Efficiency highest, and since release time, there are changeabilities, when actual conditions lower release time is often below the release for being used for calculating Between, in this case there is a possibility that shifting to an earlier date in the deadline point that third assembly teams and groups complete assembly in product.
By in multiple second assembly teams and groups, selecting product in the earliest permission process time point of the process and more Product assembles in the difference the smallest third assembly teams and groups of the release time of a second assembly teams and groups, in practical release In the case that time is lower than the release time for calculating, final actual deadline point 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 assembly teams and groups have it is multiple in the case where, also can choose transport path it is shortest second assembly teams and groups It is assembled, it is also an option that specific second assembly teams and groups are assembled, present embodiment is not construed as limiting this.
It should be noted that product is in the same process to multiple dresses in the other embodiments of the embodiment of the present invention Selection with teams and groups is also possible to that specific assembly teams and groups is selected to fill product in multiple assembly teams and groups in process Match, can also be and successively select assembly teams and groups to carry out product according to sequence of the assembly teams and groups to the deadline point of previous product Assembly 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, the ordering strategy of product at each step includes: according to Product stack determines each product in the processing sequence of first step, remaining process in addition to the first step is arrived according to product The time sequencing of position is successively assembled.
Product process sequence experienced is all the same, i.e., successively undergo first step, the second step ..., s-1 process With s process.The sequence that product enters first step is sequentially entered according to the collating sequence of Product stack, its after first step He then successively processes product according to the time sequencing that product reaches the process at process.
Further, product can enter the second step after the completion of first step, but since first step exists Multiple assembly teams and groups, therefore first product be in an assembly teams and groups assembling process of first step, second product can be with It is assembled into first step and by others assembly teams and groups.In this case, since different product is in different assembly classes The assembly duration of group is not identical, in fact it could happen that multiple products reach the case where process simultaneously, optionally, in present embodiment If there is multiple identical first product of arrival time point in, it is determined that assembly duration of first product in the process；It is excellent The second product of length assembles when first to the assembly in the process.
It is assembled by the second product preferentially to length when being assembled in process, the entrance of the second product earlier can be made In subsequent process, to improve flexibility of the product in assembly process, and but also subsequent handling will not be because of preamble The time-consuming of process is too long and causes idle situation, avoids the resource utilization for reducing subsequent handling.
In addition, can also preferentially be filled to specific products there is the case where multiple products reach a process simultaneously Match, or assemble etc. mode, present embodiment to specific products delay and this is not construed as limiting.
It should be noted that in the other embodiments of the embodiment of the present invention, if arrival time point identical first produces Product have multiple, are also possible to preferentially assemble specific product, can also be the required time according to product subsequent handling Preferentially the product long to duration needed for subsequent handling assemble etc. mode, the embodiment of the present invention and is not construed as limiting to this.
In addition, general assembly duration is also related with the assembly parameters such as interval time, Product stack sum are controlled.
N product in Product stack enters the control interval time of assembly process and Product stack sum directly affects production The general assembly time of product queue, be illustrated for controlling interval time: control interval time is too short, may cause product and exists Preceding process portion excessively congestion in s procedure, and rear process portion is caused idle situation, subassembly after reduction occur The resource utilization of sequence, to extend the general assembly duration of Product stack；Or control interval time is too long, may cause s It is not up to saturated to process integral load, so that the resource utilization of whole assembly process is reduced, 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 time required for different assembly teams and groups, all over products in each Product stack can be calculated and complete the total of assembly Assembly time.
Step 103: it determines the shortest target product queue of general assembly duration, generates and export assembling schedule information, it is described Assembling schedule information includes that the n product of the target product queue expression enters the product sequence of assembly process.
After the general assembly duration for obtaining all over products queue, it is screened out from it the shortest target product team of general assembly duration Column, and generate the assembly tune that the n product indicated including the target product queue enters the product sequence of 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 scope.
By by include target product queue indicate the n product enter assembly process product sequence assembly tune Information output is spent, so that assembly shop manager can be by assembling schedule Information application to assembly shop, so as to shorten dress General assembly duration with workshop.
In embodiments of the present invention, by obtaining multiple Product stacks, wherein each Product stack is used to indicate n Product enters the product sequence of assembly process, and different product queue indicates 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 Complete assembly general assembly duration, wherein the preset schedule rule include product in the same process to multiple assembly 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 Assembling schedule information out, the assembling schedule information include that the n product of the target product queue expression enters assembly The product sequence of process.In such manner, it is possible to determine that the shortest n product of general assembly duration enters assembly from numerous Product stacks The product sequence of process, improves assembly efficiency when shop applications assembling schedule information, shortens the general assembly duration in workshop.
Referring to Fig. 3, Fig. 3 be another embodiment of the present invention provides assembling schedule information generating method process signal Figure.As shown in figure 3, including the following steps:
Step 301: obtaining multiple Product stacks, wherein each Product stack is used to indicate that n product enters assembler The product sequence of sequence, different product queue indicate 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 is specifically included:
Multiple time queues are generated, each time queue includes the multiple time points equal with the quantity of multiple products；
The mapping relations of the sequencing and product number sequence temporally put, determining and the multiple time queue pair The multiple Product stacks answered.
Multiple time points in time queue are ranked up according to chronological order, so as to determine time team The time sequencing number of each time point, the rule that number corresponding product is numbered sequentially in time, so as to determination in column 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 transformed Product stack is (4,3,5,1,2).
In the present embodiment, step 301 is not limited in a kind of this embodiment, is also possible to upset at random producing including n The Product stack of product, 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, obtaining all over products in each Product stack and complete The general assembly duration of assembly, wherein the preset schedule rule includes choosing of the product in the same process to multiple assembly teams and groups Select the ordering strategy and assembly parameter of strategy, product.
The realization process and beneficial effect of step 301 and step 302 may refer to retouching in step 101 and step 102 It states, details are not described herein again.
Step 303: determining 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 being carried out to first Product stack, obtains the second Product stack, and according to described pre- If scheduling rule carries out mixing neighborhood local search operation to second Product stack, filter out based on second product team The shortest third Product stack of the general assembly duration of column；
Insertion operation be in Product stack random selection two positions, and by the product number of one of position put to On another position, the product sum of Product stack is constant.Such as: the first Product stack is (3,4,2,1), randomly selected Two positions are 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 number of the two positions is handed over It changes, the product sum of Product stack is constant.Such as: the 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 The number of fields local search be can be 1 time or repeatedly, 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, thus 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 with specifically: 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；It, will be described if the general assembly duration of the 4th Product stack is less than the general assembly duration of second Product stack Second Product stack is updated to the 4th Product stack, and the first the number of iterations is added 1, and executes 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 the number of iterations is added 1, executed described to second product team Column carry out insertion operation or swap operation, obtain the 4th Product stack, and produce according to the preset schedule rule and the described 4th The step of product queue, the general assembly duration of acquisition the 4th Product stack；When first the number of iterations is pre- not less than first If the number of 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, the general assembly duration of the 4th Product stack obtained after by 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 The general assembly duration of 4th Product stack less than the second Product stack general assembly duration when, the 4th Product stack is replaced 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 the number of iterations is local search number, and the first the number of iterations is n* (n+1) in present embodiment, when First the number of iterations the number of iterations n* (n+1) default less than first then continues to repeat to filter out based on second Product stack The shortest Product stack of general assembly duration；When the first the number of iterations is not less than the first default the number of 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 to be (2,4,3,5,1), and the second Product stack is calculated according to preset schedule rule A length of A1 when 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) Obtaining the 4th Product stack is (4,2,3,5,1), and calculates the 4th Product stack (4,2,3,5,1) according to preset schedule rule General assembly when a length of A2；If the second Product stack is updated to (4,2,3,5,1) by A2 < A1 from (2,4,3,5,1), and First the number of iterations X is added as 1 from 0；When X is less than the first default the number of iterations 30, continue to the second Product stack (4,2,3,5, 1) it carries out insertion operation or swap operation obtains the 4th Product stack as (4,2,5,3,1), and according to preset schedule rule meter Calculate a length of A3 when the general assembly of the 4th Product stack (4,2,5,3,1)；If A3 > A2, adds as 2 from 1 for X；When X is less than first Default the number of iterations 30 continues to carry out insertion operation to the second Product stack (4,2,3,5,1) or swap operation obtains the 4th Product stack, and so on ... until X is not less than the first default the number of iterations 30, then the general assembly duration that will be filtered out before Shortest second Product stack is 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 be improved The screening efficiency of third Product stack.
It should be noted that step 304 is not limited in a kind of this embodiment realization, change 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 The shortest third Product stack of the available general assembly duration based on second Product stack of third 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 assembly Scheduling information includes that the n product of the updated target product queue expression enters the product sequence of assembly process.
When the general assembly duration of the third Product stack is less than the general assembly duration of first Product stack, 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 indicated The n product enters the product sequence of assembly process.
The realization process and beneficial 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 mixing neighborhood local search operation 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 assembly of the present invention Convergence rate of the scheduling information generation method in calculating process.
Referring to Fig. 4, Fig. 4 be another embodiment of the present invention provides assembling schedule information generating method process signal Figure.As shown in figure 4, including the following steps:
Step 401: obtaining multiple Product stacks of current iteration round, wherein each Product stack is used to indicate n Product enters the product sequence of assembly process, and different product queue indicates 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 beneficial 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 the number of iterations is default value, It 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, obtaining all over products in each Product stack and complete The general assembly duration of assembly, wherein the preset schedule rule includes choosing of the product in the same process to multiple assembly teams and groups Select the ordering strategy and assembly parameter of strategy, product.
The realization process and beneficial effect of this step may refer to the description in step 102, and details are not described herein again.
Step 403: determining 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: judging whether the general assembly duration of the 5th Product stack is less than when general assembly in the number of iterations is completed Long shortest 6th Product stack.
If the general assembly duration of the 5th Product stack, which is less than, is completed general assembly duration in the number of iterations shortest the Six Product stacks, then follow the steps 405: the 6th Product stack being updated to the 5th Product stack, and is produced to the 6th Product queue does not update algebra 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 less than the 6th Product stack general assembly when 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 algebra and adds 1；
Such as: a length of B1 when the general assembly of the 5th Product stack L1 of the first iteration round, then the 6th Product stack at this time It is equally also L1, it is 0 that the 6th Product stack, which does not update algebra,；Determine secondary iteration round into secondary iteration round the 5th produces A length of B2 when 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 Not updating algebra is 0；It is a length of when determining the general assembly of the 5th Product stack L3 of third iteration round into 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 algebra,；It changes into the 4th A length of B4 when determining the general assembly of the 5th Product stack L4 of the 4th iteration round for round, as B4 > B2, at this time the 6th Product stack is still L2, and it is 2 and so on that the 6th Product stack, which does not update algebra ... until secondary iteration round reaches the Two default iteration rounds.
Step 407: judging that the 6th Product stack does not update whether algebra is less than predetermined threshold value.
6th Product stack does not update algebra not less than predetermined threshold value Limit, thens follow the steps 408: if obtaining New Product stack, and by the general assembly duration of preset ratio (1- η) in the new Product stack replacement current iteration round After longer Product stack, then return step 402, re-execute the steps 402 to step 408.Wherein, predetermined threshold value Limit It can be 5,10 or 20 etc., the present embodiment does not limit this for default value.
It arrives when the 6th Product stack does not update algebra 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 in multiple Product stacks of the iteration round (1- η) Column, and replaced multiple Product stacks are executed into step 403 to step 405.
If the 6th Product stack does not update algebra less than predetermined threshold value Limit, 409 are thened follow the steps: judging the Whether two the number of iterations are less than the second default the number of iterations.
If the 6th Product stack does not update algebra less than predetermined threshold value Limit, and the secondary iteration number is small In the second default the number of iterations, then return step 401, re-execute the steps 401 to step 409；
When secondary iteration number is not less than the second default the number of iterations, step 410 is executed: by the 6th Product stack As the target product queue, assembling schedule information is generated and exports, the assembling schedule information includes the target product The n product that queue indicates enters the product sequence of assembly process.
The realization process and beneficial 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 the number of 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 saved Column, and record the 6th Product stack and do not update algebra, algebra is not updated in the 6th Product stack reaches predetermined threshold value Limit When, general assembly duration longer Product stack in part in the iteration round is replaced using the Product stack newly obtained, and again The operation such as screened, compared to replaced multiple Product stacks, until secondary iteration number is not less than the second default iteration It is complete to reach acquisition to effectively avoid the problem that falling into local optimum during determining target product queue point 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 Gating limit value Limit and preset ratio η in step 102 control interval time and Product stack sum can influence to produce 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 After middle the 5th Product stack of determination, insertion operation is carried out to the 5th Product stack and obtains the 7th Product stack, and according to default tune Metric then carries out mixing neighborhood local search operation to the 7th Product stack, when filtering out the general assembly based on the 7th Product stack Long shortest 8th Product stack；Again by the 5th Product stack compared with the 8th Product stack carries out general assembly duration, and will Wherein the shortest Product stack of general assembly duration is as the 5th Product stack.
When now assembling the assembly of teams and groups 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 test result.Wherein, the assembly ginseng in test Number such as table 1:
Each assembly parameter value of table 1
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
Test result includes Fig. 5, Fig. 6 and table 2, wherein Fig. 5 be another embodiment of the present invention provides assembling schedule information Performance of the generation method in assembly parameter different level moves towards figure；Fig. 6 be another embodiment of the present invention provides assembly The test result 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 performance of exploring of algorithm is poor, is easy Premature Convergence And fall into 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 to be easy to lead It causes convergence rate too fast and falls into local optimum,CtIt is too small to will lead to convergence rate slowly 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 will affect the performance of algorithm；Parameter η, which is determined, retains the ratio of optimized individual when restarting, When retaining ratio is larger, algorithm is easy to fall into local optimum again, causes the effect restarted unobvious.It can be in conjunction with Fig. 6 The general assembly duration obtained when determining parameter combination [3,2,4,1] is most short, at this time NP=80, Ct=1.0, Limit=100 and η =0.1.
The very poor maximum of Limit and η, followed by NP are finally C according to table 2t, 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 each assembly parameter of table 2
In addition, please referring to Fig. 7 and Fig. 8, 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 be 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 assembly 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 fortune Row 20 times, each run time is no more than 20 seconds, records the average value AVE, optimal value MIN and standard deviation of 20 operation results STD。
Please refer to Fig. 7 and Fig. 8, 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, available embodiment illustrated in fig. 2 After local search is added, AVE, MIN and STD are optimized, to improve the complete of assembling schedule information generating method Face optimizing performance and robustness；Also available embodiment illustrated in fig. 3 has obtained excellent by the way that reboot operation, AVE and STD is added 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 embodiment and Fig. 3 embodiment, performance are 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 first obtain module 901, second obtain module 902, With output module 903, wherein the first acquisition module 901 is connect with the second acquisition module 902, and second obtains module 902 and output Module 903 connects.
First obtains module 901, for obtaining multiple Product stacks, wherein each Product stack is used to indicate n production Product enter the product sequence of assembly process, and different product queue indicates that the product sequence of the n product is different, and the n is big In or equal to 2 integer；
Second obtains module 902, for obtaining in each Product stack according to preset schedule rule and the Product stack All over products complete assembly general assembly duration, wherein the preset schedule rule include 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, generating and exporting assembling schedule letter Breath, the assembling schedule information include that the n product that indicates of the target product queue product that enters assembly process is suitable Sequence.
Optionally, as shown in Figure 10, the output module 903 includes:
First determines submodule 9031, for determining general assembly duration shortest first product team in the Product stack Column；
Submodule 9032 is screened, for obtaining the second Product stack to first Product stack progress insertion operation, and Mixing neighborhood local search operation 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 the 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 that the n product of the updated target product queue expression enters assembly process Product sequence.
Optionally, as shown in figure 11, the screening submodule 9032 includes:
First acquisition unit 90321 obtains the second product team for carrying out insertion operation to first Product stack Column, and according to the preset schedule rule and second Product stack, obtain the general assembly duration of second Product stack；
Second acquisition unit 90322 obtains for carrying out insertion operation or swap operation to second Product stack 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 the number of iterations is added 1, and Execute 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 the number of iterations is then added 1 by the general assembly duration of product queue, is executed 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 being not less than the first default the number of iterations when first the number of iterations, then by described the Two Product stacks are as third Product stack.
Optionally, as shown in figure 12, the first acquisition module is used to obtain multiple Product stacks of current iteration round；
The assembling schedule information generating system 900 further include:
Determining module 904, for determining shortest 5th Product stack of general assembly duration in current iteration round, and by Two the number of iterations add 1；
First counting module 905, if the general assembly duration for the 5th Product stack, which is less than, is completed the number of iterations Middle shortest 6th Product stack of general assembly duration, then be updated to the 5th Product stack for the 6th Product stack, and Algebra 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 algebra and adds 1 by the general assembly duration of queue；
First execution module 907 obtains if not updating algebra not less than predetermined threshold value for the 6th Product stack New Product stack is taken, and the general assembly duration of preset ratio in the new Product stack replacement current iteration round is longer Product stack after, execute 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 algebra for the 6th Product stack is less than predetermined threshold value, and described Secondary iteration number is less than the second default the number of iterations, then the step of executing the multiple Product stacks for obtaining following iteration round；
The output module 903, for using the 6th Product stack as the target product queue.
Optionally, as shown in figure 13, the first acquisition module 901 includes:
Submodule 9011 is generated, for generating multiple time queues, each time queue includes the number with multiple products Measure equal multiple time points；
Second determining submodule 9012, the mapping relations of sequencing and product number sequence for temporally putting, really Fixed multiple Product stacks corresponding with the multiple time queue.
Optionally, described second module 902 is obtained, for determining product at this for each process in assembly process The earliest permission process time point of process and each teams and groups of assembling are in the assembly duration of the process；According to it is described earliest allow process when Between point and it is each assembly teams and groups the process assembly duration, calculate product by it is multiple assembly teams and groups assembled multiple completions when Between point；The product assembles in the first most preceding assembly teams and groups of selection deadline point.
Optionally, second module 902 is obtained, if being also used to first assembly teams and groups has multiple, selects described first Duration shortest second assembly teams and groups are assembled in assembly teams and groups in the process to assemble the product.
Optionally, it is described second obtain module 902, if be also used to it is described second assembly teams and groups have it is multiple, it is determined that it is multiple The release time of second assembly teams and groups；Product is calculated in the earliest permission process time point and multiple described second of the process The difference of the release time of teams and groups is assembled, difference the smallest third assembly teams and groups is selected to assemble the product.
Optionally, described second module 902 is obtained, for determining each product in first step according to the Product stack Processing sequence, remaining process in addition to the first step successively processed according to the time sequencing of product in place.
The assembling schedule information generating system 900 of inventive embodiments can be realized electronics in the embodiment of the method for Fig. 1 to Fig. 8 Each process that equipment is realized, to avoid repeating, which is not described herein again.
The assembling schedule information generating system 900 of the embodiment of the present invention can determine general assembly from numerous Product stacks The product sequence for entering assembly process with the shortest n product of duration improves assembly effect when shop applications assembling schedule information Rate shortens the general assembly duration in workshop.
The hardware structural diagram of 4, Figure 14 a kind of electronic equipment of each embodiment to realize the present invention referring to Figure 1, The electronic equipment 1400 includes but is 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 The components such as device 1410 and power supply 1411.It will be understood by those skilled in the art that electronic devices structure shown in Figure 10 is not The restriction to electronic equipment is constituted, electronic equipment may include components more more or fewer than diagram, or combine certain components, Or different component layout.In embodiments of the present invention, electronic equipment includes but is 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 indicate n production Product enter the product sequence of assembly process, and different product queue indicates 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 At the general assembly duration of assembly, wherein the preset schedule rule include product in the same process to multiple assembly 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 that the n product of the target product queue expression enters assembler The product sequence of sequence.
Optionally, processor 1410 are determining the shortest target product queue of general assembly duration, generate and export assembly and adjust In the step of spending information, comprising: 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 second product team Column carry out mixing neighborhood local search operation, filter out the shortest third of general assembly duration based on second Product stack and produce 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 indicated 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 mixing neighborhood local search operation 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, comprising: to first Product stack Insertion operation is carried out, the second Product stack is obtained, and according to the preset schedule rule and second Product stack, obtains 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 the number of iterations is added 1, and execute described to second product team Column carry out insertion operation or swap operation, obtain the 4th Product stack, and produce according to the preset schedule rule and the described 4th 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 the number of iterations is added 1, executed 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 the number of iterations is not less than first Default the number of iterations, then using second Product stack as third Product stack.
Optionally, processor 1410, in the step of obtaining multiple Product stacks, comprising: 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 At assembly general assembly duration the step of after, further includes: determine in current iteration round that general assembly duration the shortest 5th produces Product queue, and secondary iteration number is added 1；It is completed in the number of 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 for the 6th Product stack, and right 6th Product stack does not update algebra 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 algebra and adds 1 by the general assembly duration of six Product stacks；If the 6th Product stack is not It updates algebra and is not less than predetermined threshold value, then obtain new Product stack, and the new Product stack is replaced into current iteration In round after the longer Product stack of general assembly duration of preset ratio, execute 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 algebra Less than predetermined threshold value, and the secondary iteration number then executes less than the second default the number of iterations and obtains following iteration round Multiple Product stacks the step of；In the determining general assembly duration shortest target product queue the step of, comprising: by institute The 6th Product stack is stated as the target product queue.
Optionally, processor 1410, in the step of obtaining multiple Product stacks, comprising: generate multiple time queues, often A time queue includes the multiple time points equal with the quantity of multiple products；The sequencing and product number temporally put The mapping relations of sequence determine multiple Product stacks corresponding with the multiple time queue.
Optionally, processor 1410, each selection strategy, comprising: for each process in assembly process, determine product In the earliest permission process time point of the process and each teams and groups of assembling in the assembly duration of the process；Allow to add earliest according to described In the assembly duration of the process, calculating product is assembled multiple complete by multiple assembly teams and groups for work time point and each assembly teams and groups At time point；The product assembles in the first most preceding assembly teams and groups of selection deadline point.
Optionally, processor 1410, each selection strategy further include: if first assembly teams and groups have multiple, select Duration shortest second assembly teams and groups are assembled in first assembly teams and groups in the process to assemble the product.
Optionally, each selection strategy, further includes: if second assembly teams and groups have it is multiple, it is determined that multiple described the The release time of two assembly teams and groups；Calculate earliest permission process time point and multiple second assembly class of the product in the process The difference of the release time of group selects difference the smallest third assembly teams and groups to assemble the product.
Optionally, each ordering strategy, comprising: determine each product in the processing of first step according to the Product stack Sequentially, remaining process in addition to the first step is successively processed according to the time sequencing of product in place.
Electronic equipment 1400 can be realized 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 assembly efficiency when 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 receiving and sending messages or communication process in, signal Send and receive, specifically, by from base station downlink data receive after, to processor 1410 handle；In addition, by uplink Data be sent to base station.In general, radio frequency unit 1401 includes but is not limited to antenna, at least one amplifier, transceiver, coupling Clutch, low-noise amplifier, duplexer etc..In addition, radio frequency unit 1401 can also by wireless communication system and network and its He communicates equipment.
Electronic equipment provides wireless broadband internet by network module 1402 for user and accesses, and such as user is helped to receive It sends e-mails, browse webpage and access streaming video etc..
Audio output unit 1403 can be received by radio frequency unit 1401 or network module 1402 or in memory The audio data stored in 1409 is converted into audio signal and exports to be sound.Moreover, audio output unit 1403 can be with Audio output relevant to the specific function that electronic equipment 1400 executes is provided (for example, call signal receives sound, message connects Quiet down sound etc.).Audio output unit 1403 includes loudspeaker, buzzer and receiver etc..
Input unit 1404 is for receiving audio or video signal.Input unit 1404 may include graphics processor (Graphics Processing Unit, GPU) 10041 and microphone 10042, graphics processor 10041 are captured in video In mode 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 image of graphics processor 10041 Frame can store in memory 1409 (or other storage mediums) or via radio frequency unit 1401 or network module 1402 into Row is sent.Microphone 10042 can receive sound, and can be audio data by such acoustic processing.Treated sound Frequency evidence can be converted in the case where telephone calling model and can be sent to mobile communication base station via radio frequency unit 1401 Format output.
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 a 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 sensor etc. are pressed, details are not described herein.
Display unit 1406 is for showing information input by user or being supplied to the information of user.Display unit 1406 can Including display panel 10061, liquid crystal display (Liquid Crystal Display, LCD), organic light emission two can be used The forms such as pole pipe (Organic Light-Emitting Diode, OLED) configure display panel 10061.
User input unit 1407 can be used for receiving the number or character information of input, and generate the use with electronic equipment Family setting and the related key signals input of function control.Specifically, user input unit 1407 includes touch panel 10071 And other input equipments 10072.Touch panel 10071, also referred to as touch screen collect the touch of user on it or nearby Operation (for example user uses any suitable objects or attachment such as finger, stylus 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 touch operation bring signal, 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 executed.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 stick, 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 it or nearby, 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 Figure 10, touch panel 10071 and display panel 10061 are the functions that outputs and inputs of realizing electronic equipment as two independent components, but In some embodiments, touch panel 10071 can be integrated with display panel 10061 and realize outputting and inputting for electronic equipment Function, specifically herein without limitation.
Interface unit 1408 is the interface that external device (ED) is connect with electronic equipment 1400.For example, external device (ED) may include Wired or wireless headphone port, external power supply (or battery charger) port, wired or wireless data port, storage card Port, port, the port audio input/output (I/O), video i/o port, ear for connecting the device with identification module Generator terminal mouth etc..Interface unit 1408 can be used for receiving the input (for example, data information, electric power etc.) from external device (ED) And by 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 storing software program and various data.Memory 1409 can mainly include storage program Area and storage data area, wherein storing program area can application program needed for storage program area, at least one function (such as Sound-playing function, image player function etc.) etc.；Storage data area, which can be stored, uses created data (ratio according to mobile phone Such as audio data, phone directory) etc..In addition, memory 1409 may include high-speed random access memory, it 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 by running or execute the software program and/or module that are stored in memory 1409, and calls and is stored in storage Data in device 1409 execute the various functions and processing data of electronic equipment, to carry out integral monitoring to electronic equipment.Place Managing 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, 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 functional 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 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 when execution, and can reach identical technical effect, 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 technical effect can be reached, to avoid repeating, 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 or disk etc..
It should be noted that, in this document, the terms "include", "comprise" or its any other variant are intended to non-row His property includes, so that the process, method, article or the device that include a series of elements not only include those elements, and And further include other elements that are not explicitly listed, or further include for this process, method, article or device institute it is intrinsic Element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that including being somebody's turn to do There is also other identical elements in the process, method of element, 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 be realized by means of software and necessary general hardware platform, naturally it is also possible to by hardware, but in many cases The former is more preferably embodiment.Based on this understanding, technical solution of the present invention substantially in other words does the prior art The part contributed out can be embodied in the form of software products, which is stored in a storage medium In (such as ROM/RAM, magnetic disk, CD), including some instructions are used so that a terminal (can be mobile phone, computer, service Device, air conditioner or network equipment etc.) execute method described in each embodiment of the present invention.
The embodiment of the present invention is described with above attached drawing, but the invention is not limited to above-mentioned specific Embodiment, the above mentioned embodiment is only schematical, rather than restrictive, those skilled in the art Under the inspiration of the present invention, without breaking away from the scope protected by the purposes and claims of the present invention, it can also make very much Form belongs within protection of the invention.

Claims (18)

1. a kind of assembling schedule information generating method, which is characterized in that the described method includes:
Obtain multiple Product stacks, wherein each Product stack be used to indicate n product enter assembly process product it is suitable Sequence, different product queue indicate 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 assembly is obtained Duration, wherein the preset schedule rule include product in the same process to it is multiple assembly teams and groups selection strategy, products Ordering strategy and assembly parameter；
It determines the shortest target product queue of general assembly duration, generates and export assembling schedule information, the assembling schedule information The n product indicated including the target product queue enters the product of assembly process sequentially；Wherein,
The step of acquisition multiple Product stacks, comprising:
Multiple time queues are generated, each time queue includes the multiple time points equal with the quantity of multiple products；
The mapping relations of the sequencing and product number sequence temporally put, determination are corresponding with the multiple time queue more A Product stack.
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, comprising:
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 mixing neighborhood local search operation, 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 export assembling schedule information, the assembling schedule information includes The n product that the updated target product queue indicates enters the product sequence of assembly process.
3. assembling schedule information generating method according to claim 2, which is characterized in that described to first product team Column carry out insertion operation, obtain the second Product stack, and carry out to second Product stack according to the preset schedule rule The operation of neighborhood local search is mixed, the shortest third Product stack of general assembly duration based on second Product stack is filtered out The step of, comprising:
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 the number of iterations is added 1, and execute 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 column, 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 The number of iterations adds 1, and execution is described to carry out insertion operation or swap operation to second Product stack, obtains the 4th product team Column, 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 the number of iterations is not less than the first default the number of 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, comprising:
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 assembly After the step of assembling duration, further includes:
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, is completed shortest 6th production of general assembly duration in the number of iterations 6th Product stack is then updated to the 5th Product stack, and does not update algebra to the 6th Product stack by product queue It is zeroed out operation；
It, will be described 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 algebra and adds 1；
If the 6th Product stack, which does not update algebra, obtains new Product stack not less than predetermined threshold value, and will be described In new Product stack replacement current iteration round after the longer Product stack of general assembly duration of preset ratio, described is executed 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 algebra less than predetermined threshold value, and the secondary iteration number is default less than second The number of iterations, then execute obtain following iteration round multiple Product stacks the step of；
The step of determining general assembly duration shortest target product queue, comprising:
Using the 6th Product stack as the target product queue.
5. assembling schedule information generating method according to claim 1, which is characterized in that each selection strategy, comprising:
For each process in assembly process, determine product in the earliest permission process time point of the process and each assembly teams and groups In the assembly duration of the process；According to it is described it is earliest allow process time point and it is each assembly teams and groups the process assembly duration, Calculate multiple deadline points that product is assembled by multiple assembly teams and groups；Select the first assembly class that deadline point is most preceding Group assembles the product.
6. assembling schedule information generating method according to claim 5, which is characterized in that each selection strategy further include:
If it is described first assembly teams and groups have it is multiple, select it is described first assembly teams and groups in the process assemble duration it is shortest The product assembles in second assembly teams and groups.
7. assembling schedule information generating method according to claim 6, which is characterized in that each selection strategy, further includes:
If second assembly teams and groups have multiple, it is determined that the release time of multiple second assembly teams and groups；
Product is calculated in the difference of the earliest permission process time point of the process and the release time of multiple second assembly teams and groups Value selects difference the smallest third assembly teams and groups to assemble the product.
8. assembling schedule information generating method according to claim 1, which is characterized in that each ordering strategy, comprising:
Remaining work of each product in the processing sequence of first step, in addition to the first step is determined according to the Product stack Sequence is successively processed according to the time sequencing of product in place.
9. a kind of assembling schedule information generating system characterized by comprising
First obtains module, for obtaining multiple Product stacks, wherein each Product stack is used to indicate that n product enters The product sequence of assembly process, different product queue indicate that the product sequence of the n product is different, the n to be greater than or Integer equal to 2；
Second obtains module, for obtaining and all producing in each Product stack according to preset schedule rule and the Product stack Product complete assembly general assembly duration, wherein the preset schedule rule include product in the same process to multiple assembly classes The ordering strategy and assembly parameter of the selection strategy, product organized；
Output module generates and exports assembling schedule information for determining the shortest target product queue of general assembly duration, described Assembling schedule information includes that the n product of the target product queue expression enters the product sequence of assembly process；Wherein,
Described first, which obtains module, includes:
Submodule is generated, for generating multiple time queues, each time queue includes equal with the quantity of multiple products Multiple time points；
Second determines submodule, the mapping relations of sequencing and product number sequence for temporally putting, it is determining with it is described The corresponding multiple Product stacks of multiple time queues.
10. assembling schedule information generating system according to claim 9, which is characterized in that the output module includes:
First determines submodule, 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 mixing neighborhood local search operation to second Product stack, filters out based on second product The shortest third Product stack of the general assembly duration of queue；
Output sub-module, if being less than the general assembly of first Product stack for the general assembly duration of the third Product stack The target product queue is then updated to the third Product stack by duration, generates and export assembling schedule information, the dress The product for entering assembly process with the n product that scheduling information includes the updated target product queue expression is suitable Sequence.
11. assembling schedule information generating system according to claim 10, which is characterized in that the screening submodule packet It includes:
First acquisition unit obtains the second Product stack, and according to institute for carrying out insertion operation to first Product stack Preset schedule rule and second Product stack are stated, the general assembly duration of second Product stack is obtained；
Second acquisition unit obtains the 4th product team for carrying out insertion operation or swap operation to second Product stack Column, 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 being less than the general assembly of second Product stack for the general assembly duration of the 4th Product stack With duration, then second Product stack is updated to the 4th Product stack, the first the number of iterations is added 1, and execute 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 the number of iterations is added 1, execution is described to carry out insertion operation or exchange behaviour to second Product stack Make, obtain the 4th Product stack, and according to the preset schedule rule and the 4th Product stack, obtains the 4th product The step of general assembly duration of queue；
Determination unit, for being not less than the first default the number of iterations when first the number of iterations, then by second product team Column are used as third Product stack.
12. assembling schedule information generating system according to claim 9, which is characterized in that described first, which obtains module, uses In the multiple Product stacks for obtaining current iteration round；
The assembling schedule information generating system further include:
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 the general assembly duration for the 5th Product stack, which is less than, is completed general assembly in the number of iterations 6th Product stack is then updated to the 5th Product stack, and produced to the 6th by shortest 6th Product stack of duration Product queue does not update algebra 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 algebra and adds 1；
First execution module obtains newly if not updating algebra not less than predetermined threshold value for the 6th Product stack Product stack, and by the longer product of general assembly duration of preset ratio in the new Product stack replacement current iteration round After queue, execute 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 algebra less than predetermined threshold value for the 6th Product stack, and described second changes Generation number is less than the second default the number of iterations, then the step of executing the multiple Product stacks for obtaining following iteration round；
The output module, for using the 6th Product stack as the target product queue.
13. assembling schedule information generating system according to claim 9, which is characterized in that described second obtains module, uses In for each process in assembly process, determine that product exists in the earliest permission process time point of the process and each assembly teams and groups The assembly duration of the process；According to the earliest assembly duration for allowing process time point and each assembly teams and groups in the process, meter Calculate multiple deadline points that product is assembled by multiple assembly teams and groups；Select the first assembly teams and groups that deadline point is most preceding The product is assembled.
14. assembling schedule information generating system according to claim 13, which is characterized in that second obtains module, also uses If having in first assembly teams and groups multiple, select to assemble duration shortest the in the process in first assembly teams and groups The product assembles in two assembly teams and groups.
15. assembling schedule information generating system according to claim 14, which is characterized in that described second obtains module, If be also used to it is described second assembly teams and groups have it is multiple, it is determined that it is multiple it is described second assembly teams and groups release time；Calculate product In the difference of the release time of the earliest permission process time point and multiple second assembly teams and groups of the process, difference is selected most The product assembles in small third assembly teams and groups.
16. assembling schedule information generating system according to claim 9, which is characterized in that described second obtains module, uses In determining remaining process of each product in the processing sequence of first step, in addition to the first step according to the Product stack It is successively processed according to the time sequencing of product in place.
17. 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 8 is realized when the computer program is executed by the processor Any one of described in assembling schedule information generating method the step of.
18. a kind of computer readable storage medium, which is characterized in that be stored with computer on the computer readable storage medium Program realizes such as assembling schedule information described in any item of the claim 1 to 8 when the computer program is executed by processor The step of generation method.
CN201810044376.0A 2018-01-17 2018-01-17 A kind of assembling schedule information generating method and system Active CN108255141B (en)

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 CN108255141A (en) 2018-07-06
CN108255141B true 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)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109978403B (en) * 2019-04-04 2021-04-20 北京理工大学 Quality control method, device and equipment for product assembly process
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
CN112308445B (en) * 2020-11-10 2024-04-16 珠海格力电器股份有限公司 Method and system for processing manufacturing process data, storage medium and electronic equipment
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

Citations (10)

* Cited by examiner, † Cited by third party
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

Patent Citations (10)

* Cited by examiner, † Cited by third party
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)

* Cited by examiner, † Cited by third party
Title
一种基于改进的磷虾群和粒子群的混合算法;刘沛等;《河南师范大学学报（自然科学版）》;20170331;全文 *
复杂产品装配现场动态实时可视化监控系统;庄存波等;《计算机集成制造系统》;20170630;全文 *

Also Published As

Publication number Publication date
CN108255141A (en) 2018-07-06

Similar Documents

Publication Publication Date Title
CN108255141B (en) A kind of assembling schedule information generating method and system
CN106874168A (en) Determine method, device and the mobile terminal of application program runnability
CN107092520B (en) Recommended method, device, storage medium and the mobile terminal of application program
CN107734179A (en) A kind of message prompt method, mobile terminal
CN109556621A (en) A kind of method and relevant device of route planning
CN110362494A (en) Method, model training method and the relevant apparatus that micro services status information is shown
CN108363524B (en) A kind of application icon display methods and mobile terminal
CN107220077B (en) Using the management-control method and management and control devices of starting
CN108965587A (en) A kind of message prompt method, device and equipment
CN109375907A (en) Auditing flow development approach, business audit method, apparatus, equipment and medium
CN108519089A (en) A kind of more people&#39;s route planning methods and terminal
CN107729143A (en) Application control method, apparatus, storage medium and electronic equipment
CN106777009A (en) Smart machine and task scheduling perform control method and device
CN110597793A (en) Data management method and device, electronic equipment and computer readable storage medium
CN109062680A (en) A kind of data load method, device and storage medium
CN107948404A (en) A kind of method, terminal device and computer-readable recording medium for handling message
CN110162653A (en) A kind of picture and text sort recommendations method and terminal device
CN107766139B (en) Application management method and device
CN104468483B (en) Data transmission method and system, control device and node apparatus
CN105049374B (en) Dispatching method, device and the mobile terminal of downloading task
CN108270853A (en) A kind of message treatment method and mobile terminal
CN110533507A (en) A kind of order management method, mobile terminal and computer readable storage medium
CN109993234A (en) A kind of unmanned training data classification method, device and electronic equipment
CN110167006A (en) A kind of control application program uses the method and terminal device of SIM card
CN110413639A (en) Data check method and device, electronic equipment and computer readable storage medium

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