CN106647669B - A kind of hardware pincers mixture manufacturing dispatching method - Google Patents
A kind of hardware pincers mixture manufacturing dispatching method Download PDFInfo
- Publication number
- CN106647669B CN106647669B CN201710009463.8A CN201710009463A CN106647669B CN 106647669 B CN106647669 B CN 106647669B CN 201710009463 A CN201710009463 A CN 201710009463A CN 106647669 B CN106647669 B CN 106647669B
- Authority
- CN
- China
- Prior art keywords
- machine
- workpiece
- processed
- corresponds
- idle
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- 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]
Landscapes
- Engineering & Computer Science (AREA)
- General Factory Administration (AREA)
- General Engineering & Computer Science (AREA)
- Manufacturing & Machinery (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Automation & Control Theory (AREA)
- Multi-Process Working Machines And Systems (AREA)
Abstract
The invention discloses a kind of hardware to clamp mixture manufacturing dispatching method, the idle process machine in each of workshop is given to distribute process task according to time scale first, after a machine has been assigned task, the machine will shield in the set of the idle machine of corresponding process, while the corresponding workpiece of task being shielded in the set of the workpiece to be processed of other processes.After the completion of the task, machine cancels shielding in the set of the idle machine of corresponding process, while the corresponding workpiece of the task cancels shielding in the set of the workpiece to be processed of other processes, and process, which takes, is accumulated to the adding up on the time-consuming of machine.Control system cycle arranges process task until all tasks are all assigned for each machine.A kind of Optimization Scheduling for temporally rescaling processing sequence that the present invention proposes is ranked up optimization for process, while taking into account workpiece process to be processed, improves the utilization rate of existing equipment as far as possible, has saved cost.
Description
Technical field
The present invention relates to metal tonger production fields, and in particular to a kind of hardware pincers mixture manufacturing dispatching method..
Background technology
American-European countries is because of the reasons such as cultural difference, living habit and social cost of serving, to all kinds of hardware tools
The demand of quality and quantity constantly increase；Country in the emerging high speed development such as gold brick four countries, especially Chinese long-term height
Speed development so that the situation to grow continuously and fast is presented in the demand of hardware tool.
In today that demographic dividend is depleted, the processing technology of hardware tool still very falls behind, and largely relies on people
The mode that the production of work, processing technology or traditional-handwork and some processes semi-automation is combined, this mode of production and work
Skill requires height to operating personnel, and the training period is long, and operating efficiency is relatively low, and processing environment is larger to workers ' health harm, and grinds
The dust of generation is cut, under certain condition, easy tos produce the calamitous safety accident such as explosion, especially this and Chinese manufacturing
2025 is far apart with the requirement of industrial 4.0 standards.
Existing hardware pincers grinding process is most of or by line producing line worker's hand grinding, and small part is farsighted
Enterprise has begun to set about carrying out machine substitute human labor strategy, but still rests on equipment set and complete one hardware pincers polishing mill
The level cut.Hardware tonger can be divided into tens of kinds of classifications according to the difference of purposes, but for most of tonger they
Polishing grinding does not need to complete the entire work flow of above equipment, this has resulted in the waste of production capacity.While complete equipment is simultaneously
The different grinding process of several tongers are completed, but due to the grinding Time Inconsistency needed for different process, it is just inevitable
Will appear could realize the circulation of equipment after the completion of waiting for most slow station technique after the completion of all stations, also result in production capacity with
The waste of energy consumption.
Invention content
The technical problem to be solved by the present invention is to for defect involved in background technology, provide a kind of hardware pincers
The dispatching method of mixture manufacturing is provided and is cut according to the grinding task that the number of devices of the existing each technique in workshop and needs are completed
Real feasible scheduling scheme, energy consumption is reduced while improving equipment efficiency of usage.
The present invention uses following technical scheme to solve above-mentioned technical problem：
A kind of hardware pincers mixture manufacturing dispatching method, includes the following steps：
Step 1）, the number for reading each process machine of workshop, the type for reading this workpiece to be processed and number,
The process and take that each workpiece to be processed to be completed；
Step 2）, established for each process and store the set of its idle machine, establish it for each process and wait for
The set of workpieces processing is established it for each process machine and accumulative is taken；
Step 3）, an idle process machine is randomly choosed, judges that the process machine corresponds to the workpiece to be processed of process
Set whether be empty, if so, executing step 10）, no to then follow the steps 4）；
Step 4）, select in the set for the workpiece to be processed for corresponding to process from the process machine to take the workpiece of minimum as
The task of the process machine, and this is taken into minimum workpiece and is removed from the set of the workpiece to be processed；
Step 5）, this is taken to the time-consuming of minimum workpiece and is added to the accumulative time-consuming of the process machine；
Step 6）, which is shielded from the set that it corresponds to the idle machine of process；
Step 7）, each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
It is shielded in the set of workpiece to be processed；
Step 8）, after the process machine is completed to take the processing of minimum workpiece to this；
Step 8.1）, which is cancelled from the set that it corresponds to the idle machine of process and is shielded；
Step 8.2）, each process other than process is corresponded to for the process machine, this, which is taken minimum workpiece, exists
Cancel shielding in the set of its workpiece to be processed；
Step 9）, redirect and execute step 3）；
Step 10）, which is put back to it and corresponds to the set of the idle machine of process；
Step 11）, judge whether the set of its workpiece to be processed is empty for each process, if each process waits for
The set of workpieces processing is sky, thens follow the steps 12）；It is no to then follow the steps 3）；
Step 12）, all processing tasks are all assigned, the maximum value in taking each process machine is accumulative to take
It is taken for highest；
Step 13）, the highest that output machine is concentrated takes and each the accumulative of machine takes.
The invention also discloses another hardware to clamp mixture manufacturing dispatching method, includes the following steps：
Step 1）, the number for reading each process machine of workshop, the type for reading this workpiece to be processed and number,
The process and take that each workpiece to be processed to be completed；
Step 2）, established for each process and store the set of its idle machine, establish it for each process and wait for
The set of workpieces processing is established it for each process machine and accumulative is taken；
Step 3）, an idle process machine is randomly choosed, judges that the process machine corresponds to the workpiece to be processed of process
Set whether be empty, if so, executing step 10）, no to then follow the steps 4）；
Step 4）, select in the set for the workpiece to be processed for corresponding to process from the process machine to take maximum workpiece as
The task of the process machine, and this is taken into maximum workpiece from the set of the workpiece to be processed and is removed；
Step 5）, this is taken into the time-consuming of maximum workpiece and is added to the accumulative time-consuming of the process machine；
Step 6）, which is shielded from the set that it corresponds to the idle machine of process；
Step 7）, each process other than process is corresponded to for the process machine, this is taken into maximum workpiece at it
It is shielded in the set of workpiece to be processed；
Step 8）, after process machine completion takes the processing of maximum workpiece to this；
Step 8.1）, which is cancelled from the set that it corresponds to the idle machine of process and is shielded；
Step 8.2）, each process other than process is corresponded to for the process machine, this, which is taken maximum workpiece, exists
Cancel shielding in the set of its workpiece to be processed；
Step 9）, redirect and execute step 3）；
Step 10）, which is put back to it and corresponds to the set of the idle machine of process；
Step 11）, judge whether the set of its workpiece to be processed is empty for each process, if each process waits for
The set of workpieces processing is sky, thens follow the steps 12）；It is no to then follow the steps 3）；
Step 12）, all processing tasks are all assigned, the maximum value in taking each process machine is accumulative to take
It is taken for highest；
Step 13）, the highest that output machine is concentrated takes and each the accumulative of machine takes.
The present invention has the following technical effects using above technical scheme is compared with the prior art：
The present invention proposes a kind of hardware pincers mixture manufacturing dispatching method can from the angle of machine choice process
Ensure the debt balance of all machines, and reduce the time of machine idle running as far as possible, while being all works to be processed again
Sequence is assigned with suitable machine, improves the automatization level of metal tonger polishing, reduces cost, raising efficiency, has centainly
Application value.
Description of the drawings
Fig. 1 is the flow diagram of the present invention；
Fig. 2 is the allocation result for the embodiment that a preferential selection takes minimum workpiece in the present invention；
Fig. 3 is the allocation result for the embodiment that a preferential selection takes maximum workpiece in the present invention.
Specific implementation mode
Technical scheme of the present invention is described in further detail below in conjunction with the accompanying drawings：
As shown in Figure 1, the invention discloses a kind of hardware to clamp mixture manufacturing dispatching method, include the following steps：
Step 1）, the number for reading each process machine of workshop, the type for reading this workpiece to be processed and number,
The process and take that each workpiece to be processed to be completed；
Step 2）, established for each process and store the set of its idle machine, establish it for each process and wait for
The set of workpieces processing is established it for each process machine and accumulative is taken；
Step 3）, an idle process machine is randomly choosed, judges that the process machine corresponds to the workpiece to be processed of process
Set whether be empty, if so, executing step 10）, no to then follow the steps 4）；
Step 4）, select in the set for the workpiece to be processed for corresponding to process from the process machine to take the workpiece of minimum as
The task of the process machine, and this is taken into minimum workpiece and is removed from the set of the workpiece to be processed；
Step 5）, this is taken to the time-consuming of minimum workpiece and is added to the accumulative time-consuming of the process machine；
Step 6）, which is shielded from the set that it corresponds to the idle machine of process；
Step 7）, each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
It is shielded in the set of workpiece to be processed；
Step 8）, after the process machine is completed to take the processing of minimum workpiece to this；
Step 8.1）, which is cancelled from the set that it corresponds to the idle machine of process and is shielded；
Step 8.2）, each process other than process is corresponded to for the process machine, this, which is taken minimum workpiece, exists
Cancel shielding in the set of its workpiece to be processed；
Step 9）, redirect and execute step 3）；
Step 10）, which is put back to it and corresponds to the set of the idle machine of process；
Step 11）, judge whether the set of its workpiece to be processed is empty for each process, if each process waits for
The set of workpieces processing is sky, thens follow the steps 12）；It is no to then follow the steps 3）；
Step 12）, all processing tasks are all assigned, the maximum value in taking each process machine is accumulative to take
It is taken for highest；
Step 13）, the highest that output machine is concentrated takes and each the accumulative of machine takes.
Another hardware pincers mixture manufacturing dispatching method is further comprised in Fig. 1, is included the following steps：
Step 1）, the number for reading each process machine of workshop, the type for reading this workpiece to be processed and number,
The process and take that each workpiece to be processed to be completed；
Step 2）, established for each process and store the set of its idle machine, establish it for each process and wait for
The set of workpieces processing is established it for each process machine and accumulative is taken；
Step 3）, an idle process machine is randomly choosed, judges that the process machine corresponds to the workpiece to be processed of process
Set whether be empty, if so, executing step 10）, no to then follow the steps 4）；
Step 4）, select in the set for the workpiece to be processed for corresponding to process from the process machine to take maximum workpiece as
The task of the process machine, and this is taken into maximum workpiece from the set of the workpiece to be processed and is removed；
Step 5）, this is taken into the time-consuming of maximum workpiece and is added to the accumulative time-consuming of the process machine；
Step 6）, which is shielded from the set that it corresponds to the idle machine of process；
Step 7）, each process other than process is corresponded to for the process machine, this is taken into maximum workpiece at it
It is shielded in the set of workpiece to be processed；
Step 8）, after process machine completion takes the processing of maximum workpiece to this；
Step 8.1）, which is cancelled from the set that it corresponds to the idle machine of process and is shielded；
Step 8.2）, each process other than process is corresponded to for the process machine, this, which is taken maximum workpiece, exists
Cancel shielding in the set of its workpiece to be processed；
Step 9）, redirect and execute step 3）；
Step 10）, which is put back to it and corresponds to the set of the idle machine of process；
Step 11）, judge whether the set of its workpiece to be processed is empty for each process, if each process waits for
The set of workpieces processing is sky, thens follow the steps 12）；It is no to then follow the steps 3）；
Step 12）, all processing tasks are all assigned, the maximum value in taking each process machine is accumulative to take
It is taken for highest；
Step 13）, the highest that output machine is concentrated takes and each the accumulative of machine takes.
Both methods the difference is that, when being processed, preferential selection takes minimum workpiece or preferential choosing
Select time-consuming maximum workpiece.
It elaborates to the present invention with reference to specific example.This example includes a facet milling drum, two cambered surfaces
Milling drum, a chamfering grinding machine, two big face milling drums, grinding task to be processed are：One nipper plier, three cutting pliers,
Two diagonal cutting nippers, one are forceps inlet.
Selection preferential first takes minimum workpiece, that is, uses and take minimum principle：
Step 1：Above-mentioned workshop each process machine number and this workpiece type and number to be processed are read, under
Table is the process and take that all kinds of hardware pincers to be completed：
| Hardware clamps each technique polishing and takes | Facet is ground time/min | Cambered surface is ground time/min | Chamfering is ground time/min | Big face is ground time/min |
| Nipper plier | \ | 8 | \ | 8 |
| Cutting pliers | 2 | 3 | 5 | 8 |
| Diagonal cutting nippers | 2 | 5 | \ | 4 |
| Forceps inlet | 3 | 8 | \ | 5 |
Step 2：It is to establish each process idle machine collection to be established for each process and store the set of its idle machine
Machine{}：
Facet：Machine1{M1}；
Cambered surface：Machine2 { M1, M2 }；
Chamfering：Machine3{M1}；
Big face：Machine4 { M1, M2 }；
The set i.e. each process workpiece to be processed collection Process { } of its workpiece to be processed is established for each process：
Facet Process1 { P2, P3, P4, P5, P6, P7 }；
Cambered surface Process2 { P1, P2, P3, P4, P5, P6, P7 }；
Chamfering Process3 { P2, P3, P4 }；
Big face Process4 { P1, P2, P3, P4, P5, P6, P7 }；
For each process machine establish its it is accumulative take i.e. each machine it is accumulative take set Totaltime 0,
0,0,0,0,0 }；
Step 3：A machine is randomly choosed, the result selected is grinding machine for arc M2, and it is to be processed which corresponds to process
Process collection Process2 is not sky, executes step 4；
Step 4：According to the principle of time-consuming minimum, it is { P2, P3, P4 } to be taken shortest in Process2, is all 3min, choosing
The processing tasks that P2 is grinding machine for arc M2 are selected, process P2 is removed in Process2, is i.e. cambered surface process collection to be processed is
Process2 { P1, P3, P4, P5, P6, P7 }；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 0,0,3,0,0,0 }；
Step 6：Shield the M2, i.e. Machine2 { M1 } in Machine2 { M1, M2 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process1 { P3, P4, P5, P6, P7 }, Process3 { P3, P4 }, Process4 P1,
P3, P4, P5, P6, P7 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：It is randomly selected the result is that chamfering grinding machine M1, the machine correspond to process process collection Process3 to be processed
It is not sky, executes step 4；
Step 4：According to the principle of time-consuming minimum, it is { P3, P4 } to be taken shortest in Process3, is all 5min, selection
P3 is the processing tasks of chamfering grinding machine M1, and process P3 is removed in Process3, i.e. chamfering process collection to be processed is
Process3{P4}；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 0,0,3,5,0,0 }；
Step 6：Shield the M1, i.e. Machine3 { } in Machine3 { M1 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process1 { P4, P5, P6, P7 }, Process2 { P1, P4, P5, P6, P7 },
Process4 { P1, P4, P5, P6, P7 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：It is randomly selected the result is that facet milling drum M1, the machine correspond to process process collection Process1 to be processed
It is not sky, executes step 4；
Step 4：According to the principle of time-consuming minimum, it is { P4, P5, P6 } to be taken shortest in Process1, is all 2min, choosing
The processing tasks that P4 is facet milling drum M1 are selected, process P4 are removed in Process1, i.e., facet process collection to be processed is
Process1 { P5, P6, P7 }；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 2,0,3,5,0,0 }；
Step 6：Shield the M1, i.e. Machine1 { } in Machine1 { M1 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process2 { P1, P5, P6, P7 }, Process4 { P1, P5, P6, P7 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：It is randomly selected the result is that big face milling drum M1, the machine correspond to process process collection Process4 to be processed
It is not sky, executes step 4；
Step 4：According to the principle of time-consuming minimum, it is { P5, P6 } to be taken shortest in Process4, is all 4min, selection
P5 is the processing tasks of big face milling drum M1, and process P5 is removed in Process4, i.e., big face process collection to be processed is
Process4 { P1, P6, P7 }；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 2,0,3,5,4,0 }；
Step 6：Shield the M1, i.e. Machine4 { M2 } in Machine4 { M1, M2 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process1 { P6, P7 }, Process2 { P1, P6, P7 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：It is randomly selected the result is that big face milling drum M2, the machine correspond to process process collection Process4 to be processed
It is not sky, executes step 4；
Step 4：According to the principle of time-consuming minimum, it is { P6 } to be taken shortest in Process4, is 4min, it is big to select P6
The processing tasks of face milling drum M2, in Process4 remove process P6, i.e., big face process to be processed integrate as Process4 P1,
P7}；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 2,0,3,5,4,4 }；
Step 6：Shield the M2, i.e. Machine4 { } in Machine4 { M2 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process1 { P7 }, Process2 { P1, P7 }, Process4 { P1, P7 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：It is randomly selected the result is that grinding machine for arc M1, the machine correspond to process process collection Process2 to be processed
It is not sky, executes step 4；
Step 4：According to the principle of time-consuming minimum, it is { P1, P7 } to be taken shortest in Process2, is all 8min, selection
P1 is the processing tasks of grinding machine for arc M1, and process P1 is removed in Process2, i.e. cambered surface process collection to be processed is
Process2{P7}；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 2,8,3,5,4,4 }；
Step 6：Shield the M1, i.e. Machine2 { } in Machine2 { M1 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process1 { P7 }, Process2 { P7 }, Process4 { P7 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：When take be accumulated to 2min when, the grinding task of facet milling drum M1 is completed, which corresponds to process
Process collection Process1 to be processed is not sky, executes step 4；
Step 4：According to the principle of time-consuming minimum, in Process1 take it is shortest be { P7 }, be 3min, select P7 for
The processing tasks of facet milling drum M1, remove process P7 in Process1, i.e. facet process to be processed integrates as Process1
{ }；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 5,8,3,5,4,4 }；
Step 6：Shield the M1, i.e. Machine1 { } in Machine1 { M1 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process2 { P4 }, Process3 { P4 }, Process4 { P4 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：When take be accumulated to 3min when, the grinding task of grinding machine for arc M2 is completed, which corresponds to process
Process collection Process2 to be processed is not sky, executes step 4；
Step 4：According to the principle of time-consuming minimum, in Process1 take it is shortest be { P4 }, be 3min, select P4 for
The processing tasks of cambered surface face milling drum M2, remove process P4 in Process2, i.e. cambered surface process to be processed integrates as Process2
{ }；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 5,8,6,5,4,4 }；
Step 6：Shield the M2, i.e. Machine2 { } in Machine2 { M2 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process1 { P2 }, Process3 { P2 }, Process4 { P2 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：When take be accumulated to 4min when, the grinding task of big face milling drum M1 and M2 are completed, and randomly select
As a result it is big face milling drum M1, it is sky which, which corresponds to process process collection Process4 to be processed not, executes step 4；
Step 4：According to the principle of time-consuming minimum, in Process4 take it is shortest be { P2 }, be 8min, select P2 for
The processing tasks of big face milling drum M1, remove process P2 in Process4, i.e., big face process to be processed integrates as Process4
{ }；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 5,8,6,5,12,4 }；
Step 6：Shield the M1, i.e. Machine4 { M2 } in Machine4 { M1, M2 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process1 { P5, P6 }, Process3 { P5, P6 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：The result randomly selected is big face milling drum M2, which corresponds to process process collection Process4 to be processed
For sky, step 10 is executed；
Step 10：The process machine is put back to it and corresponds to the set of the idle machine of process；
Step 11：Judge that its workpiece to be processed collection determines whether sky for each process, need manufacturing procedure collection
It is not sky, executes step 3；
Step 3：When take be accumulated to 5min when, the grinding task of facet milling drum M1 and chamfering grinding machine M1 are completed,
The result randomly selected is facet milling drum M1, and it is sky which, which corresponds to process process collection Process1 to be processed not, executes step
Rapid 4；
Step 4：According to the principle of time-consuming minimum, it is { P3, P5, P6 } to be taken shortest in Process1, is 2min, selection
P3 is the processing tasks of facet milling drum M1, and process P3 is removed in Process1, i.e. facet process collection to be processed is
Process1 { P5, P6 }；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 7,8,6,5,12,4 }；
Step 6：Shield the M1, i.e. Machine1 { } in Machine1 { M1 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process2 { P5, P6, P7 }, Process4 { P7 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：The result randomly selected is big face milling drum M2, which corresponds to process process collection Process4 to be processed
It is not sky, executes step 4；
Step 4：According to the principle of time-consuming minimum, in Process4 take it is shortest be { P7 }, be 5min, select P7 for
The processing tasks of big face milling drum M2, remove process P7 in Process4, i.e., big face process to be processed integrates as Process4
{ }；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 7,8,6,5,12,9 }；
Step 6：Shield the M2, i.e. Machine4 { } in Machine4 { M2 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process1 { P5, P6 }, Process2 { P5, P6 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：When take be accumulated to 6min when, the grinding task of grinding machine for arc M2 is completed, the result randomly selected
For grinding machine for arc M2, it is sky which, which corresponds to process process collection Process2 to be processed not, executes step 4；
Step 4：According to the principle of time-consuming minimum, it is { P5, P6 } to be taken shortest in Process2, is 5min, selects P5
For the processing tasks of grinding machine for arc M2, process P5 is removed in Process2, i.e. cambered surface process to be processed integrates as Process2
{P6}；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 7,8,11,5,12,9 }；
Step 6：Shield the M2, i.e. Machine2 { } in Machine2 { M2 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process1 { P6 }, Process3 { P4 }, Process4 { P4 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：The result randomly selected is chamfering grinding machine M1, which corresponds to process process collection Process3 to be processed
It is not sky, executes step 4；
Step 4：According to the principle of time-consuming minimum, in Process3 take it is shortest be { P4 }, be 5min, select P4 for
The processing tasks of chamfering grinding machine M1, remove process P4 in Process3, i.e. chamfering process to be processed integrates as Process3
{ }；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 7,8,11,10,12,9 }；
Step 6：Shield the M1, i.e. Machine3 { } in Machine3 { M1 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process1 { P6 }, Process2 { P6 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：When take be accumulated to 7min when, the grinding task of facet milling drum M1 is completed, the result randomly selected
For facet milling drum M1, it is sky which, which corresponds to process process collection Process1 to be processed not, executes step 4；
Step 4：According to the principle of time-consuming minimum, in Process1 take it is shortest be { P6 }, be 2min, select P6 for
The processing tasks of facet milling drum M1, remove process P6 in Process1, i.e. facet process to be processed integrates as Process1
{ }；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 9,8,11,10,12,9 }；
Step 6：Shield the M1, i.e. Machine1 { } in Machine1 { M1 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process2 { P3 }, Process4 { P3 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：When take be accumulated to 8min when, the grinding task of grinding machine for arc M1 is completed, the result randomly selected
For grinding machine for arc M1, it is sky which, which corresponds to process process collection Process2 to be processed not, executes step 4；
Step 4：According to the principle of time-consuming minimum, in Process2 take it is shortest be { P3 }, be 3min, select P3 for
The processing tasks of grinding machine for arc M1, remove process P3 in Process2, i.e. cambered surface process to be processed integrates as Process2
{ }；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 9,11,11,10,12,9 }；
Step 6：Shield the M1, i.e. Machine2 { } in Machine2 { M1 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process4 { P1 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：When take be accumulated to 9min when, the grinding task of facet milling drum M1 is completed, the result randomly selected
For facet milling drum M1, it is sky which, which corresponds to process process collection Process1 to be processed, executes step 10；
Step 10：The process machine is put back to it and corresponds to the set of the idle machine of process；
Step 11：Judge that the set of its workpiece to be processed determines whether sky, work also to be processed for each process
Sequence collection is not sky, executes step 3；
Step 3：When take be accumulated to 10min when, the grinding task of big face milling drum M2 is completed, the result randomly selected
For big face milling drum M2, it is sky which, which corresponds to process process collection Process4 to be processed not, executes step 4；
Step:4：According to the principle of time-consuming minimum, in Process4 take it is shortest be { P1 }, be 8min, select P1 for
The processing tasks of big face milling drum M2, remove process P1 in Process4, i.e., big face process to be processed integrates as Process4
{ }；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 9,11,11,10,12,17 }；
Step 6：Shield the M2, i.e. Machine4 { } in Machine4 { M2 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process2 { P6, P7 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：When take be accumulated to 11min when, the grinding task of chamfering grinding machine M1 and grinding machine for arc M1 and M2
It being completed, the result randomly selected is grinding machine for arc M1, and it is sky which, which corresponds to process process collection Process2 to be processed not,
Execute step 4；
Step 4：According to the principle of time-consuming minimum, it is { P6 } to be taken shortest in Process2, is 5min, selects P6 for arc
The processing tasks of face milling drum M1, remove process P6 in Process2, i.e. cambered surface process to be processed integrates as Process2 { P7 }；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 9,16,11,10,12,17 }；
Step 6：Shield the M1, i.e. Machine2 { M2 } in Machine2 { M1, M2 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process2 { P7 }, Process4 { P3, P4 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：The result randomly selected is grinding machine for arc M2, which corresponds to process process collection Process2 to be processed
It is not sky, executes step 4；
Step 4：According to the principle of time-consuming minimum, in Process2 take it is shortest be { P7 }, be 8min, select P7 for
The processing tasks of grinding machine for arc M2, remove process P7 in Process2, i.e. cambered surface process to be processed integrates as Process2
{ }；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 9,16,19,10,12,17 }；
Step 6：Shield the M2, i.e. Machine2 { } in Machine2 { M2 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process1 { }, Process4 { P3, P4 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：The result randomly selected is facet milling drum M1, which corresponds to process process collection Process1 to be processed
It is not sky, executes step 4；
Step 4：According to the principle of time-consuming minimum, in Process1 take it is shortest be { P5 }, be 2min, select P5 for
The processing tasks of facet milling drum M1, remove process P5 in Process1, i.e. facet process to be processed integrates as Process1
{ }；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 11,16,19,10,12,17 }；
Step 6：Shield the M1, i.e. Machine1 { } in Machine1 { M1 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process4 { P3, P4 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：The result randomly selected is chamfering grinding machine M1, which corresponds to process process collection Process2 to be processed
For sky, step 10 is executed；
Step 10：The process machine is put back to it and corresponds to the set of the idle machine of process；
Step 11：Judge that the set of its workpiece to be processed determines whether sky, work also to be processed for each process
Sequence collection is not sky, executes step 3；
Step 3：When take be accumulated to 12min when, big face milling drum M1 grinding task is completed, and the result randomly selected is
Big face milling drum M1, it is sky which, which corresponds to process process collection Process4 to be processed not, executes step 4；
Step:4：According to the principle of time-consuming minimum, it is { P3, P4 } to be taken shortest in Process4, is 8min, selects P4
For the processing tasks of big face milling drum M1, process P4 is removed in Process4, i.e., big face process to be processed integrates as Process4
{P3}；
Step 5：, the accumulative collection that takes of each machine is combined into Totaltime { 11,16,19,10,20,17 }；
Step 6：Shield the M1, i.e. Machine4 { } in Machine4 { M1 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process1 { P2 }, Process3 { P2 }, Process4 { P3 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：When take be accumulated to 13min when, facet milling drum M1 grinding task is completed, and the result randomly selected is
Facet milling drum M1, it is sky which, which corresponds to process process collection Process1 to be processed not, executes step 4；
Step 4：According to the principle of time-consuming minimum, in Process1 take it is shortest be { P2 }, be 2min, select P2 for
The processing tasks of facet milling drum M1, remove process P2 in Process1, i.e. facet process to be processed integrates as Process1
{ }；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 13,16,19,10,20,17 }；
Step 6：Shield the M1, i.e. Machine1 { } in Machine1 { M1 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process4 { P3 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：The result randomly selected is chamfering grinding machine M1, which corresponds to process process collection Process3 to be processed
For sky, step 10 is executed；
Step 10：The process machine is put back to it and corresponds to the set of the idle machine of process；
Step 11：Judge that the set of its workpiece to be processed determines whether sky, work also to be processed for each process
Sequence collection is not sky, executes step 3；
Step 3：When take be accumulated to 15min when, the grinding task of facet milling drum M1 is completed, the result randomly selected
For chamfering grinding machine M1, it is sky which, which corresponds to process process collection Process3 to be processed not, executes step 4；
Step 4：According to the principle of time-consuming minimum, in Process3 take it is shortest be { P2 }, be 5min, select P2 for
The processing tasks of chamfering grinding machine M1, remove process P2 in Process3, i.e. chamfering process to be processed integrates as Process3
{ }；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 13,16,19,15,20,17 }；
Step 6：Shield the M1, i.e. Machine3 { } in Machine3 { M1 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process4 { P3 }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：When take be accumulated to 18min when, the grinding task of big face milling drum M2 is completed, which corresponds to process
Process collection Process4 to be processed is not sky, executes step 4；
Step 4：According to the principle of time-consuming minimum, in Process4 take it is shortest be { P3 }, be 8min, select P3 for
The processing tasks of big face milling drum M2, remove process P3 in Process4, i.e. chamfering process to be processed integrates as Process4
{ }；
Step 5：The accumulative collection that takes of each machine is combined into Totaltime { 13,16,19,15,20,25 }；
Step 6：Shield the M2, i.e. Machine4 { } in Machine4 { M2 }；
Step 7：It shields the process machine and corresponds to each process other than process, this, which is taken minimum workpiece, waits at it
It is shielded in the set of workpieces processing, i.e. Process4 { }；
Step 8：After the process machine is completed to take the processing of minimum workpiece to this：
Step 8.1：The process machine is cancelled into shielding from the set that it corresponds to the idle machine of process；
Step 8.2：Each process other than process is corresponded to for the process machine, this is taken into minimum workpiece at it
Cancel shielding in the set of the workpiece to be processed；
Step 9：It redirects and executes step 3；
Step 3：The result randomly selected is grinding machine for arc M1, which corresponds to process process collection Process2 to be processed
For sky, step 10 is executed；
Step 10：The process machine is put back to it and corresponds to the set of the idle machine of process；
Step 11：Judge that the set of its workpiece to be processed determines whether sky for each process, each process
The set of workpiece to be processed is sky, executes step 12；
Step 12：All processing tasks are all assigned, and highest, which takes, is：The accumulation of 25min, each machine take
As shown in Figure 2；
Step 13：This programme does the scheduling processing method highest designed and takes as 25min, and accumulative take of each machine is
The production scheduling scheme of { 13,16,19,15,20,25 }, this secondary design is as follows：
| Facet milling drum M1 | P4→P7→P3→P6→P5→P2 |
| Grinding machine for arc M1 | P1→P3→P6 |
| Grinding machine for arc M2 | P2→P4→P5→P7 |
| Chamfering grinding machine M1 | P3→P4→P2 |
| Big face milling drum M1 | P5→P2→P4 |
| Big face milling drum M2 | P6→P7→P1→P3 |
When preferential selection takes maximum workpiece, i.e., using maximum principle is taken when, flow with it is like above, here not
It repeats again, production scheduling scheme when only providing using time-consuming maximum principle：
| Facet milling drum M1 | P7→P3→P5→P6→P4→P2 |
| Grinding machine for arc M1 | P5→P2→P1→P4 |
| Grinding machine for arc M2 | P6→P7→P3 |
| Chamfering grinding machine M1 | P2→P3→P4 |
| Big face milling drum M1 | P1→P2→P3 |
| Big face milling drum M2 | P4→P5→P6→P7 |
It is taken using the accumulation of each machine when taking maximum principle as shown in Figure 3.
Those skilled in the art of the present technique are it is understood that unless otherwise defined, all terms used herein（Including skill
Art term and scientific terminology）With meaning identical with the general understanding of the those of ordinary skill in fields of the present invention.Also
It should be understood that those terms such as defined in the general dictionary should be understood that with in the context of the prior art
The consistent meaning of meaning, and unless defined as here, will not be explained with the meaning of idealization or too formal.
Above-described specific implementation mode has carried out further the purpose of the present invention, technical solution and advantageous effect
It is described in detail, it should be understood that the foregoing is merely the specific implementation mode of the present invention, is not limited to this hair
Bright, all within the spirits and principles of the present invention, any modification, equivalent substitution, improvement and etc. done should be included in the present invention
Protection domain within.
Claims (2)
1. a kind of hardware clamps mixture manufacturing dispatching method, which is characterized in that include the following steps：
Step 1）, the number for reading each process machine of workshop, the type for reading this workpiece to be processed and number, each
The process and take that kind workpiece to be processed to be completed；
Step 2）, it is to be processed to establish its for the set of its idle machine of each process foundation storage, for each process
The set of workpiece is established it for each process machine and accumulative is taken；
Step 3）, an idle process machine is randomly choosed, judges that the process machine corresponds to the collection of the workpiece to be processed of process
Whether be empty, if so, executing step 10 if closing）, no to then follow the steps 4）；
Step 4）, select in the set for the workpiece to be processed for corresponding to process from the process machine workpiece for taking minimum as the work
The task of sequence machine, and this is taken into minimum workpiece and is removed from the set of the workpiece to be processed；
Step 5）, this is taken to the time-consuming of minimum workpiece and is added to the accumulative time-consuming of the process machine；
Step 6）, which is shielded from the set that it corresponds to the idle machine of process；
Step 7）, each process other than process is corresponded to for the process machine, the workpiece that this is taken to minimum is to be added at its
It is shielded in the set of work workpiece；
Step 8）, after the process machine is completed to take the processing of minimum workpiece to this；
Step 8.1）, which is cancelled from the set that it corresponds to the idle machine of process and is shielded；
Step 8.2）, each process other than process is corresponded to for the process machine, by this take minimum workpiece its should
Cancel shielding in the set of workpiece to be processed；
Step 9）, redirect and execute step 3）；
Step 10）, which is put back to it and corresponds to the set of the idle machine of process；
Step 11）, judge whether the set of its workpiece to be processed is empty for each process, if each process is to be processed
The set of workpiece is sky, thens follow the steps 12）；It is no to then follow the steps 3）；
Step 12）, all processing tasks are all assigned, and the maximum value in taking each process machine is accumulative to take is most
Height takes；
Step 13）, the highest that output machine is concentrated takes and each the accumulative of machine takes.
2. a kind of hardware clamps mixture manufacturing dispatching method, which is characterized in that include the following steps：
Step 1）, the number for reading each process machine of workshop, the type for reading this workpiece to be processed and number, each
The process and take that kind workpiece to be processed to be completed；
Step 2）, it is to be processed to establish its for the set of its idle machine of each process foundation storage, for each process
The set of workpiece is established it for each process machine and accumulative is taken；
Step 3）, an idle process machine is randomly choosed, judges that the process machine corresponds to the collection of the workpiece to be processed of process
Whether be empty, if so, executing step 10 if closing）, no to then follow the steps 4）；
Step 4）, select to take maximum workpiece in the set for the workpiece to be processed for corresponding to process from the process machine as the work
The task of sequence machine, and this is taken into maximum workpiece from the set of the workpiece to be processed and is removed；
Step 5）, this is taken into the time-consuming of maximum workpiece and is added to the accumulative time-consuming of the process machine；
Step 6）, which is shielded from the set that it corresponds to the idle machine of process；
Step 7）, each process other than process is corresponded to for the process machine, to take maximum workpiece to be added at its by this
It is shielded in the set of work workpiece；
Step 8）, after process machine completion takes the processing of maximum workpiece to this；
Step 8.1）, which is cancelled from the set that it corresponds to the idle machine of process and is shielded；
Step 8.2）, each process other than process is corresponded to for the process machine, by this take maximum workpiece its should
Cancel shielding in the set of workpiece to be processed；
Step 9）, redirect and execute step 3）；
Step 10）, which is put back to it and corresponds to the set of the idle machine of process；
Step 11）, judge whether the set of its workpiece to be processed is empty for each process, if each process is to be processed
The set of workpiece is sky, thens follow the steps 12）；It is no to then follow the steps 3）；
Step 12）, all processing tasks are all assigned, and the maximum value in taking each process machine is accumulative to take is most
Height takes；
Step 13）, the highest that output machine is concentrated takes and each the accumulative of machine takes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710009463.8A CN106647669B (en) | 2017-01-06 | 2017-01-06 | A kind of hardware pincers mixture manufacturing dispatching method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710009463.8A CN106647669B (en) | 2017-01-06 | 2017-01-06 | A kind of hardware pincers mixture manufacturing dispatching method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106647669A CN106647669A (en) | 2017-05-10 |
| CN106647669B true CN106647669B (en) | 2018-10-19 |
Family
ID=58843265
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710009463.8A Active CN106647669B (en) | 2017-01-06 | 2017-01-06 | A kind of hardware pincers mixture manufacturing dispatching method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106647669B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TW202013107A (en) * | 2018-09-27 | 2020-04-01 | 財團法人資訊工業策進會 | Production line automatically allocating device and method thereof |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8572622B2 (en) * | 2009-12-30 | 2013-10-29 | International Business Machines Corporation | Reducing queue synchronization of multiple work items in a system with high memory latency between processing nodes |
| CN101976073A (en) * | 2010-10-26 | 2011-02-16 | 北京理工大学 | Discrete procedure inserting and dispatching method in mixed line production |
| US10734816B2 (en) * | 2012-11-14 | 2020-08-04 | Autogrid Systems, Inc. | Identifying operability failure in demand response (DR) assets |
| CN104122861B (en) * | 2014-07-09 | 2017-01-04 | 中冶南方工程技术有限公司 | The conflict resolution method lax based on the waiting time and Optimization Scheduling |
| CN104678959B (en) * | 2015-01-28 | 2017-09-26 | 哈尔滨理工大学 | It is easy to the part decomposition method of many workshop integrated dispatch of distinct device |
-
2017
- 2017-01-06 CN CN201710009463.8A patent/CN106647669B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN106647669A (en) | 2017-05-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zahraee et al. | Lean manufacturing implementation through value stream mapping: A case study | |
| Silva et al. | Implementation of SMED in a cutting line | |
| CN104537503B (en) | Data processing method and system | |
| CN110597210A (en) | Flexible job shop scheduling energy-saving optimization method considering equipment pre-maintenance | |
| CN103995934A (en) | Automatic polishing method and device | |
| CN106647669B (en) | A kind of hardware pincers mixture manufacturing dispatching method | |
| CN108161247A (en) | For cutting the cutting method of coiled strip | |
| CN108459561B (en) | Formula optimization method for CNC batch processing | |
| CN107844104A (en) | Consider the modeling method of the flexible job shop energy-saving distribution of cycle power strategy | |
| Yang et al. | Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance | |
| CN109396915A (en) | A kind of tool changing processing method of the big pocket knife of machining center | |
| CN115309111A (en) | Resource-limited distributed hybrid flow shop scheduling method and system | |
| Yan et al. | Modified bottleneck-based heuristic for large-scale job-shop scheduling problems with a single bottleneck | |
| CN107703897A (en) | A kind of collaborative navigation optimization method towards fixed assembling process | |
| Hunter et al. | Lean Remanufacturing: a cellular case study | |
| Parab et al. | Value stream mapping: A case study of lock industry | |
| Anbumalar et al. | Implementation of cellular manufacturing in process industry-A case study | |
| Gélinas et al. | Dantzig-Wolfe decomposition for job shop scheduling | |
| CN105182946A (en) | Scheduling optimization method of manufacturing workshop with machine changing operation | |
| CN205703661U (en) | A kind of complex part sanding surface processing means | |
| Kumar et al. | Strategy development for lean manufacturing implementation in a selected Manufacturing company | |
| Thomas et al. | Performance review of the ROMI-RIP rough mill simulator | |
| McCartney et al. | Interactive scheduling procedures for flexible Manufacturing Systems | |
| CN117270486B (en) | Modeling method for scheduling problem of flexible job shop in consideration of periodic maintenance | |
| CN203003180U (en) | Multi-station lathe tool |
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 |