CN112947340A - Dynamic dispatching method for simulating pheromone mechanism - Google Patents
Dynamic dispatching method for simulating pheromone mechanism Download PDFInfo
- Publication number
- CN112947340A CN112947340A CN202110197359.2A CN202110197359A CN112947340A CN 112947340 A CN112947340 A CN 112947340A CN 202110197359 A CN202110197359 A CN 202110197359A CN 112947340 A CN112947340 A CN 112947340A
- Authority
- CN
- China
- Prior art keywords
- equipment
- workpieces
- workpiece
- time
- queued
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 108
- 239000003016 pheromone Substances 0.000 title claims abstract description 18
- 238000012545 processing Methods 0.000 claims abstract description 84
- 238000004519 manufacturing process Methods 0.000 claims description 32
- 238000003754 machining Methods 0.000 claims description 18
- 239000000126 substance Substances 0.000 claims description 8
- 238000011144 upstream manufacturing Methods 0.000 claims description 5
- 239000011541 reaction mixture Substances 0.000 claims description 4
- 230000014759 maintenance of location Effects 0.000 claims description 2
- 239000002994 raw material Substances 0.000 claims 1
- 238000004088 simulation Methods 0.000 description 10
- 239000004065 semiconductor Substances 0.000 description 9
- 230000007774 longterm Effects 0.000 description 5
- 238000007418 data mining Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 239000000243 solution Substances 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 241000257303 Hymenoptera Species 0.000 description 1
- XUIMIQQOPSSXEZ-UHFFFAOYSA-N Silicon Chemical compound [Si] XUIMIQQOPSSXEZ-UHFFFAOYSA-N 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000013079 data visualisation Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000009792 diffusion process Methods 0.000 description 1
- 238000001312 dry etching Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000002347 injection Methods 0.000 description 1
- 239000007924 injection Substances 0.000 description 1
- 238000001259 photo etching Methods 0.000 description 1
- 229910052710 silicon Inorganic materials 0.000 description 1
- 239000010703 silicon Substances 0.000 description 1
- 238000004544 sputter deposition Methods 0.000 description 1
- 238000010200 validation analysis Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
- 235000012431 wafers Nutrition 0.000 description 1
- 238000001039 wet etching Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B19/00—Programme-control systems
- G05B19/02—Programme-control systems electric
- G05B19/418—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM]
- G05B19/41865—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM] characterised by job scheduling, process planning, material flow
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B2219/00—Program-control systems
- G05B2219/30—Nc systems
- G05B2219/32—Operator till task planning
- G05B2219/32252—Scheduling production, machining, job shop
-
- 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 Engineering & Computer Science (AREA)
- Manufacturing & Machinery (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Automation & Control Theory (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- General Factory Administration (AREA)
Abstract
The invention provides a dynamic dispatching method for a simulated pheromone mechanism, which comprises the following steps: when the equipment becomes available at a certain time, judging whether the equipment is batch processing equipment or not; if yes, calculating the emergency degree of the workpieces queued in front of the equipment according to a preset formula, determining whether the workpieces queued in front of the equipment have emergency workpieces according to the emergency degree of the queued workpieces, and if so, batching the workpieces according to the preset formula; determining the selection probability of each batch of workpieces; the batch of workpieces with the highest selection probability is selected for starting processing on the equipment. The invention adopts dynamic dispatching rules, and the dispatching efficiency is superior to that of a manual priority dispatching method.
Description
Technical Field
The invention relates to a dynamic dispatching method for a simulation pheromone mechanism, belonging to the field of dynamic dispatching of a semiconductor manufacturing system.
Background
The dispatching rule used by the production line of the existing semiconductor manufacturing enterprise is based on a manual priority dispatching method, called PRIOR for short, and the main idea is to set the priority according to manual experience, so that the product can be delivered on time to the maximum extent, namely, the delivery date index is met. This method is not only labor intensive, but also inefficient in dispatching because it relies mainly on manual experience.
Since the 90 s of the 20 th century, along with the development of informatization of the manufacturing industry, a great deal of data is accumulated in the production process, and data mining also begins to be applied to the manufacturing industry. Based on the traditional modeling and optimizing method of the production scheduling problem, scholars at home and abroad extract key scheduling information which is hidden in a large amount of data and plays an important role in improving the scheduling performance index of a complex production process based on a large amount of historical data, real-time data and related scheduling simulation data in an actual scheduling environment by adopting technical means such as characteristic analysis, data mining and simulation and the like, and establish a data-based production process related scheduling model or dynamically determine key parameters of the production process related scheduling model by utilizing the information. Data mining can acquire knowledge from related data to improve decision making and yield, and meanwhile data visualization can provide a decision maker with more intuitive understanding and help the decision maker to better understand and utilize scheduling rules.
Disclosure of Invention
The invention aims to provide a dynamic dispatching method for a simulated pheromone mechanism, which aims to solve the problem of low dispatching efficiency in a semiconductor production line by adopting a manual-based priority dispatching method in the prior art.
In order to achieve the purpose, the invention adopts the following technical scheme:
a dynamic dispatching method for simulating pheromone mechanism comprises the following steps:
when the equipment becomes available at the dispatching time, judging whether the equipment is batch processing equipment or not;
if yes, calculating the emergency degree of workpieces queued in front of the equipment, and determining whether the workpieces queued in front of the equipment have emergency workpieces according to the emergency degree of the queued workpieces;
if the emergency workpieces exist, batching the workpieces according to the processing capacity of the equipment, the number of the workpieces queued in the process menu in front of the equipment and the retention time of the workpieces queued in the equipment;
selecting the batch workpiece with the highest selection probability to start processing on the equipment.
Further, calculating the urgency of the workpieces queued in front of the equipment according to the formula (1):
wherein the content of the first and second substances,
the urgency for the equipment i to process the workpiece n at the dispatch time t,
for the remaining processing time of the workpiece n on the apparatus i, FnIs the ratio of the mean machining period to the machining time of the workpiece n, DnAs a result of the delivery date of the workpiece n,
the occupied time of the workpiece n on the equipment i is taken; MAX is the highest processing priority.
Further, the method for batching the workpieces specifically comprises the following steps:
batching the workpieces according to equation (4):
wherein im is the index number of the process menu of the equipment i; miThe number of process menus on the device i;
for binary variables, if the workpiece n employs the process menu im on the tool i, then
Otherwise
BiIs the processing capacity of equipment i; n is a radical ofimThe number of workpieces queued for use in the process menu im in front of the tool i;
is the dwell time of the queued workpieces n on the equipment i.
Further, the specific method for determining the selection probability of each batch of workpieces is as follows:
determining the selection probability of each batch of workpieces according to the formula (9):
wherein rkIs the probability of selection of a workpiece lot k,
is the number of emergency workpieces in lot k; b iskIs the batch size of batch k;
is the time taken by the batch k on the equipment i;
is the maximum load of the downstream device id of batch k; (α 2, β 2, γ, σ) is a measure
Bk、
An indication of relative importance.
Further, the dynamic dispatch method for simulating the pheromone mechanism further comprises the following steps:
if the workpieces queued in front of the equipment do not have emergency workpieces, judging whether the workpieces machined on the upstream equipment of the equipment or just finished and machined by the equipment in the next step have emergency workpieces according to a formula (1);
if there is an emergency workpiece, waiting for the arrival of the emergency workpiece and batching the workpieces according to equation (4).
Further, the dynamic dispatch method for simulating the pheromone mechanism further comprises the following steps: if there is no emergency workpiece on the workpiece to be processed next using the apparatus, which is processed on the upstream apparatus of the apparatus or has just completed processing, it is determined whether the apparatus is a bottleneck apparatus according to equation (5):
wherein N isimNumber of workpieces queued for use in a process menu im in front of said equipment i; pimProcessing time of the process menu im on the equipment i;
which is a binary variable, if device i is the bottleneck device at dispatch time t,
if not, then,
if the device i is not a bottleneck device, determining whether the downstream device id is an idle device according to equation (7):
wherein N isidFor the number of workpieces queued before the downstream device id,
processing time of a process menu v on a downstream device id;
which is a binary variable, if the downstream device id is in an idle state at time t,
if not, then,
if the downstream equipment id is idle equipment, judging whether workpieces waiting for processing from the next process to the idle downstream equipment id exist in the queued workpieces of the equipment i, and if so, batching the workpieces according to a formula (8):
in the formula (8), the reaction mixture is,
is a binary variable, if the downstream equipment id for processing the next process of the workpiece n is in an idle state at the time t, and the workpiece adopts a menu im at the equipment i,
otherwise
Further, the dynamic dispatch method for simulating the pheromone mechanism further comprises the following steps: if the equipment is determined to be a bottleneck equipment, batching the workpieces according to formula (6):
wherein, BiIn order to be able to process the equipment i,
is the dwell time of the queued workpieces n on the device i.
Further, the dynamic dispatch method for simulating the pheromone mechanism further comprises the following steps: and if the downstream equipment is determined not to be idle equipment, waiting for the arrival of a new workpiece and restarting the dispatching decision.
Further, the dynamic dispatch method for simulating the pheromone mechanism further comprises the following steps: and if the workpieces which need to be processed by the idle downstream equipment id in the next process do not exist in the queued workpieces of the equipment i, waiting for the arrival of a new workpiece, and restarting a dispatching decision.
Further, the dynamic dispatch method for simulating the pheromone mechanism further comprises the following steps: if the equipment is judged not to be batch processing equipment, calculating the emergency degree of the workpieces queued in front of the equipment according to a formula (1):
wherein the content of the first and second substances,
the urgency for the equipment i to process the workpiece n at the dispatch time t,
for the remaining processing time of the workpiece n on the apparatus i, FnIs the ratio of the mean machining period to the machining time of the workpiece n, DnAs a result of the delivery date of the workpiece n,
the occupied time of the workpiece n on the equipment i is taken; MAX is the highest processing priority;
calculating the load degree of the downstream equipment id capable of completing the next process of the workpiece n at the time t on the production line according to the formula (2):
in the formula (2), the reaction mixture is,
negative of downstream equipment id for completing next process of workpiece n at time tDegree of loading;
the occupation time of the workpiece n on the downstream equipment id; t isidAvailable time per day for downstream device id;
calculating the selection probability of each queued workpiece in front of the equipment i according to the formula (3):
in the formula (3), SnFor the selection probability, alpha, of the work n1Is a measure of
An indicator of relative degree of importance, beta1Is a measure of
An indicator of relative importance;
the workpiece with the highest selection probability is selected to begin machining preferentially on the machine.
Compared with the prior art, the invention has the following beneficial technical effects: the dynamic dispatching method for simulating the pheromone mechanism adopts the dynamic dispatching rule, both short-term performance indexes and long-term performance indexes are superior to the PRIOR rule, and particularly, the long-term performance indexes are obvious and are improved by 100 percent on the basis of the PRIOR rule.
Drawings
FIG. 1 is a schematic flow chart of a dynamic dispatch method for simulating a pheromone mechanism according to an embodiment of the present invention;
FIG. 2 is a graph comparing the performance index optimization results of semiconductor manufacturing lines under three conditions. The three cases are: case 1: adopting PRIOR rules; case 2: replacing the scheduling rules of all equipment without special limitation in a production line with the method; case 3: only the equipment which has no special limitation in the production line and has daily equipment utilization rate more than 60 percent is replaced by the method, and the other equipment still adopts PRIOR rules.
Detailed Description
The invention is further described with reference to specific examples. The following examples are only for illustrating the technical solutions of the present invention more clearly, and the protection scope of the present invention is not limited thereby.
As described above, in the prior art, the problem of low efficiency exists in dispatching the semiconductor production line based on the manual priority scheduling method.
In order to solve the above problems, the present invention provides a Dynamic Dispatching method for simulating an pheromone mechanism, which is implemented by a basic Dynamic Dispatching Rule (DDR). DDR is a dispatching rule which can consider the whole production line according to the equipment characteristics of the semiconductor manufacturing production line by using the characteristic that the optimized group behavior is realized by the indirect communication based on pheromone among individual ants in the ant colony ecosystem, so that the dynamic dispatching of the self-adaptive semiconductor production line is realized.
As shown in fig. 1, a dynamic dispatch method for simulating a pheromone mechanism according to an embodiment of the present invention specifically includes the following steps:
step 1: when the equipment i becomes available at the dispatch time t, it is determined whether the equipment i is a batch processing equipment. If yes, turning to Step 6; otherwise, go to Step 2.
Step 2: according to formula (1), calculating the information variable of workpieces queued in front of the device i:
wherein the content of the first and second substances,
for the urgency of the equipment i to process the workpiece n at time t,
for the remaining machining time on the device i for the workpiece n, FnIs the ratio of the mean machining period to the machining time of the workpiece n, DnAs a result of the delivery date of the workpiece n,
the occupied time of the workpiece n on the equipment i is taken; MAX is the highest processing priority.
The formula (1) is designed to meet the requirement of the customer on time delivery. At time t, the larger the ratio of the theoretical remaining processing time to the actual remaining processing time of each WIP (Work In Process), the tighter the delivery date thereof, and accordingly, the higher the information variable value of the WIP, the easier it is to be selected by the apparatus for processing by priority. However, if the theoretical remaining processing time of the WIP is already greater than the actual remaining processing time, indicating that the WIP is likely to be stalled, it is changed to an urgent workpiece, i.e., the highest processing priority (MAX) on any equipment. In addition, the occupation time of each WIP on the equipment also influences the information variable value of the equipment, and the shorter the occupation time is, the higher the information variable value is, so that the movement of the WIP on the equipment can be accelerated, and the utilization rate of the equipment is improved.
Step 3: calculating information variables of other equipment on the production line:
wherein the content of the first and second substances,
the load degree of the downstream equipment id which can complete the next process of the workpiece n at the time t;
the occupation time of the workpiece n on the downstream equipment id; t isidIs the available time of day for the downstream device id.
Equation (2) means that the heavier the equipment load is at time t, the higher the information variable thereof. It is obvious that
Indicating that the load of the device has exceeded its one-day availability,i.e. the device is considered to be in a bottleneck state. It is noted that there may be multiple devices on a semiconductor manufacturing line that can perform a particular process of WIP, in which case TidMeaning the available processing time of a class of equipment that can complete a work process for WIP within a day.
Step 4: calculating the selection probability of each queued workpiece:
wherein S isnIs the probability of selection of the workpiece n,
for the dwell time, alpha, of queued workpieces n on the apparatus i1Is a measure of
An indicator of relative degree of importance, beta1Is a measure of
An indication of relative importance.
Equation (3) means that at time t, when the problem of competition for equipment resources by the WIP is solved, the delivery date and the equipment occupation degree of the WIP and the load condition of the downstream equipment of the equipment are considered at the same time, so as to ensure the rapid flow and the on-time delivery rate of the WIP.
Step 5: the workpiece with the highest selection probability is selected to start machining on the device i.
Step 6: the information variables of the workpieces queued in front of the equipment i are calculated using formula (1).
Step 7: determine if there is an emergency workpiece in front of the i-queue workpiece (i.e., if there is an emergency workpiece in the I-queue workpiece)
MAX), if yes, turning to Step 8; otherwise, go to Step 9.
Step 8: batching the workpieces according to the formula (4)
Wherein im is the index number of the process menu of the equipment i, MiThe number of process menus on the device i;
for binary variables, if the workpiece n employs the process menu im on the tool i, then
Otherwise
BiIs the processing capacity of equipment i; n is a radical ofimThe number of workpieces queued for use in the process menu im in front of the tool i;
is the dwell time of the queued workpieces n on the equipment i.
Equation (4) means: for each process menu im of the equipment i, if the number of emergency work pieces is less than BiAnd checking whether the common workpieces in front of the queuing equipment i adopt the same menu as the emergency workpieces. If the number of the common workpieces meeting the conditions is less, selecting the front of the equipment i according to the principle that the longer the workpiece waiting time is, the higher the priority is
Batching the workpieces; otherwise, all common workpieces that meet the requirements are selected (i.e.
) And (4) batching. If the number of emergency work pieces is more than or equal to BiAnd directly selecting the most urgent workpieces meeting the maximum processing batch and carrying out batch combination. Then go to step 17 to determine the processing priority of the batch of workpieces.
Step 9: judging whether the workpiece is machined on the upstream equipment iu of the batch machining equipment i or just finished according to the formula (1), judging whether the workpiece to be machined by the batch machining equipment i is an emergency workpiece or not, and turning to Step 10 if the emergency workpiece exists; otherwise, go to Step 11.
Step 10: waiting for the arrival of the emergency workpiece, and then turning to Step 8 to batch the workpiece according to the formula (4).
Step 11: it is determined whether the device i is a bottleneck device according to equation (5). If yes, turning to Step 12; otherwise, go to Step 13.
Wherein N isimThe number of workpieces queued for use in the process menu im in front of the tool i; pimProcessing time of the process menu im on the equipment i;
which is a binary variable, if device i is the bottleneck device at time t,
if not, then,
equation (5) means that a batch processing tool i is considered to be in a bottleneck state if the queued workpieces in its buffer have exceeded its daily maximum processing capacity (i.e., the maximum workpieces that can be processed within 24 hours).
Step 12: and (4) batching the workpieces according to the formula (6), and then turning to Step 17 to determine the processing priority of the batched workpieces.
Wherein, BiIn order to process the capacity of the batch processing equipment i,
is the dwell time of the queued workpieces n on the equipment i.
The formula (6) means that the workpieces are batched according to the process menu im of the batch processing equipment i used by the queued workpieces, and if the workpieces using the same process menu exceed the maximum processing batch size, the workpieces are batched respectively according to the principle that the longer the waiting time of the workpieces is, the higher the priority is.
Step 13: it is determined whether the downstream device id is an idle device according to equation (7). If yes, turning to Step 14; otherwise, go to Step 16.
Wherein N isidFor the number of workpieces queued before the downstream device id,
processing time of a process menu v on a downstream device id;
which is a binary variable, if the downstream device id is in an idle state at time t,
if not, then,
equation (7) means that if the queued workpieces in the buffer of the downstream device id have fallen below their daily minimum processing capacity (i.e., the minimum workpieces that can be processed within 24 hours), then the device is considered to be idle.
Step 14: judging whether workpieces to be processed in the next process of the queue workpieces of the equipment i need to be processed to the idle downstream equipment id or not; if yes, turning to Step 15; otherwise, go to Step 16.
Step 15: the workpieces are batched according to equation (8).
Wherein the content of the first and second substances,
is a binary variable, if the downstream equipment id for processing the next process of the workpiece n is in an idle state at the time t, and the workpiece adopts a menu im at the equipment i,
otherwise
Equation (8) means: for each process menu im of the equipment i, checking the number of workpieces which are processed on idle equipment and use the process menu in the next process, if the number is less than the maximum processing batch B of the equipmentiChecking whether other workpieces and the workpieces use the same process menu or not, and if the number of the workpieces meeting the conditions is large, selecting a plurality of non-emergency workpieces according to the principle that the longer the waiting time of the workpieces is, the more the workpieces are prioritized, so as to meet the maximum processing batch; and if the maximum processing batch size is larger than or equal to the maximum processing batch size, directly selecting the workpieces which have the longest queuing time and meet the maximum processing batch size for batch combination. Then go to Step 17 to determine the processing priority of the batch of workpieces.
Step 16: waiting for the arrival of a new workpiece, turning to Step 6 to restart the dispatching decision.
Step 17: the priority of each batch of workpieces is determined according to the formula (9).
Wherein rkThe probability of selection of the batch of workpieces k,
is the number of emergency workpieces in lot k; b iskIs the batch size of batch k;
is the time taken by the batch k on the equipment i;
is the maximum load of the downstream device id of batch k; (alpha2，β2γ, σ) is an index that measures the relative importance of these four terms.
The first term of formula (9) is the proportion of the emergency workpiece in the processing batch of batch k, and corresponds to the on-time delivery rate index; the second item is the ratio of the processing batch of the batch n to the maximum processing batch in all the batches, and corresponds to the processing period, the number of moving steps and the index of the utilization rate of equipment; the third item is the ratio of the processing time of the batch n to the maximum processing time in all batches, and correspondingly, the occupied time of the workpiece on the equipment is related to the processing period index and can also reflect the moving step index; the fourth item is the load degree of the downstream equipment, is related to the equipment utilization rate index, and can also represent the moving step index. Therefore, according to the difference of the attention indexes or the change of the manufacturing environment, the corresponding parameter (alpha) is adjusted2，β2γ, σ), a desired performance index can be obtained.
Step 18: the batch of workpieces with the highest selection probability is selected for starting processing on tool i.
The method of the embodiment of the invention is adopted to carry out simulation test as follows:
a large amount of production line historical data of 6-inch silicon wafers of a certain semiconductor manufacturing enterprise in the overseas city are taken as research objects, and according to the actual requirements of the enterprise, a dynamic modeling method is combined, and a production line Simulation model which is consistent with the actual production line all the time is built through Tecnomatix Plant Simulation software of Siemens company to be taken as a research platform for Simulation verification.
The production line of this enterprise has nine big processing districts at present, is respectively: the device comprises an injection region, a photoetching region, a sputtering region, a diffusion region, a dry etching region, a wet etching region, a back thinning region, a PVM testing region and a BMMSTOK microscopic region, wherein the dispatching rule is based on PRIOR.
In the method of the invention, information related to scheduling is packaged in the algorithm, and then weighting processing is carried out, and the weight values are adjusted, namely (alpha)1，β1，α2，β2γ, σ) to achieve the versatility of DDR to varying environments. This means that when (. alpha.) is1，β1，α2，β2And gamma and sigma) are different, the obtained performance indexes are different.
It is assumed that six weighting parameters (α) of the inventive method1，β1，α2，β2γ, σ) values are: alpha is alpha1＝0.5，β1＝0.5，α2＝0.25，β2＝0.25，γ＝0.25，σ＝0.25。
The following 3 cases were designed for up to 3 months of simulation validation:
case 1: adopting PRIOR rules of enterprises;
case 2: replacing the scheduling rules of all equipment without special limitation in a production line with the method;
case 3: only the equipment which has no special limitation in the production line and has daily equipment utilization rate more than 60 percent is replaced by the method, and the other equipment still adopts PRIOR rules.
From the short-term performance indicators: average daily moving step number (Move), average daily equipment utilization rate (Utility) and long-term performance index: the optimized production line results of Case 1, Case 2 and Case 3 were compared in terms of Throughput (Throughput), average Processing Cycle (Cycle Time, CT), Ideal Processing Time/actual Processing Time (Ideal Processing Time/Real Processing Time, IPT/RPT).
Since the Move value is in the order of 103The quantity of the discharged sheets is 101～102Average processing time of the order of 101While the Utility value and the ideal processing time/actual processing time are of the order of 10-1Therefore, the present application assumes 1 based on the value of Case 1, and Case 2 and Case 3 represent the degree of improvement in Case 1.
The results of the experiment are shown in FIG. 2, wherein Throughput indicates the amount of tablets; CT represents Cycle Time, i.e., processing Time; IPT/RPT represents Ideal Processing Time/Real Processing Time, i.e. the ratio of Ideal Processing Time to actual Processing Time.
The result shows that the method of the invention is superior to the PRIOR rule in both the short-term performance index and the long-term performance index, and is especially obvious in the long-term performance index, and is improved by 100 percent on the basis of the PRIOR rule. However, the performance improvement of the process of the present invention on all plants compared to the process of the present invention on the bottleneck plant alone is not significant. This is because the non-bottleneck equipment resources are sufficient, and when a workpiece arrives, it can be immediately processed without waiting in a buffer, so that it only needs to adopt a simple FIFO rule.
TABLE 1 simulation time comparison
As can be seen from Table 1, when the simulation is run for 90 days, the simulation time of all equipment adopting the method is 7.5 times that of equipment adopting the method only for the bottleneck, and the optimization effect is not obvious. This is because the method of the present invention is complicated to calculate, and particularly, the time complexity of Step 9 is very high, and therefore, the method of the present invention is suitable for use in an apparatus having an apparatus utilization rate of more than 60%.
The present invention has been disclosed in terms of the preferred embodiment, but is not intended to be limited to the embodiment, and all technical solutions obtained by substituting or converting equivalents thereof fall within the scope of the present invention.
Claims (10)
1. A dynamic dispatching method for simulating a pheromone mechanism is characterized by comprising the following steps:
when the equipment becomes available at the dispatching time, judging whether the equipment is batch processing equipment or not;
if yes, calculating the emergency degree of workpieces queued in front of the equipment, and determining whether the workpieces queued in front of the equipment have emergency workpieces according to the emergency degree of the queued workpieces;
if the emergency workpieces exist, batching the workpieces according to the processing capacity of the equipment, the number of the workpieces queued in the process menu in front of the equipment and the retention time of the workpieces queued in the equipment;
selecting the batch workpiece with the highest selection probability to start processing on the equipment.
2. The method of claim 1, wherein the urgency of queued workpieces before the equipment is calculated according to equation (1):
wherein the content of the first and second substances,
the urgency for the equipment i to process the workpiece n at the dispatch time t,
for the remaining processing time of the workpiece n on the apparatus i, FnIs the ratio of the mean machining period to the machining time of the workpiece n, DnAs a result of the delivery date of the workpiece n,
the occupied time of the workpiece n on the equipment i is taken; MAX is the highest processing priority.
3. The method of claim 1, wherein the batching of the workpieces is performed by:
batching the workpieces according to equation (4):
wherein im is the index number of the process menu of the equipment i; miThe number of process menus on the device i;
for binary variables, if the workpiece n employs the process menu im on the tool i, then
Otherwise
BiIs the processing capacity of equipment i; n is a radical ofimThe number of workpieces queued for use in the process menu im in front of the tool i;
is the dwell time of the queued workpieces n on the equipment i.
4. The method of claim 1, wherein the determining the selection probability for each batch of workpieces is performed by:
determining the selection probability of each batch of workpieces according to the formula (9):
wherein, gamma iskIs the probability of selection of a workpiece lot k,
is the number of emergency workpieces in lot k; b iskIs the batch size of batch k;
is the time taken by the batch k on the equipment i;
is the maximum load of the downstream device id of batch k; (alpha2，β2γ, σ) is a measure
Bk、
An indication of relative importance.
5. The method of claim 1, further comprising:
if the workpieces queued in front of the equipment do not have emergency workpieces, judging whether the workpieces machined or just machined on the upstream equipment of the equipment and machined by the equipment in the next step have emergency workpieces according to a formula (1):
wherein the content of the first and second substances,
the urgency for the equipment i to process the workpiece n at the dispatch time t,
for the remaining processing time of the workpiece n on the apparatus i, FnIs the ratio of the mean machining period to the machining time of the workpiece n, DnAs a result of the delivery date of the workpiece n,
the occupation time of the workpiece n on the equipment i; MAX is the highest processing priority;
if there is an emergency workpiece, waiting for the arrival of the emergency workpiece and batching the workpieces according to equation (4):
wherein im is the index number of the process menu of the equipment i; miThe number of process menus on the device i;
for binary variables, if the workpiece n employs the process menu im on the tool i, then
Otherwise
BiIs the processing capacity of equipment i; n is a radical ofimThe number of workpieces queued for use in the process menu im in front of the tool i;
is the dwell time of the queued workpieces n on the equipment i.
6. The method of claim 5, further comprising: if there is no emergency workpiece on the workpiece to be processed next using the apparatus, which is processed on the upstream apparatus of the apparatus or has just completed processing, it is determined whether the apparatus is a bottleneck apparatus according to equation (5):
wherein N isimNumber of workpieces queued for use in a process menu im in front of said equipment i; pimProcessing time of the process menu im on the equipment i;
is a binary variable, if the device i is the bottleneck at the dispatching time tPreparing a solution of the raw materials,
if not, then,
if the device i is not a bottleneck device, determining whether the downstream device id is an idle device according to equation (7):
wherein N isidFor the number of workpieces queued before the downstream device id,
processing time of a process menu v on a downstream device id;
which is a binary variable, if the downstream device id is in an idle state at time t,
if not, then,
if the downstream equipment id is idle equipment, judging whether workpieces waiting for processing from the next process to the idle downstream equipment id exist in the queued workpieces of the equipment i, and if so, batching the workpieces according to a formula (8):
in the formula (8), the reaction mixture is,
is a binary variable, if the downstream equipment id for processing the next process of the workpiece n is in an idle state at the time t, and the workpiece adopts a menu im at the equipment i,
otherwise
7. The method of claim 6, further comprising: if the equipment is determined to be a bottleneck equipment, batching the workpieces according to formula (6):
wherein, BiIn order to be able to process the equipment i,
is the dwell time of the queued workpieces n on the device i.
8. The method of claim 6, further comprising: and if the downstream equipment is determined not to be idle equipment, waiting for the arrival of a new workpiece and restarting the dispatching decision.
9. The method of claim 6, further comprising: and if the workpieces which need to be processed by the idle downstream equipment id in the next process do not exist in the queued workpieces of the equipment i, waiting for the arrival of a new workpiece, and restarting a dispatching decision.
10. The method of claim 1, further comprising: if the equipment is judged not to be batch processing equipment, calculating the emergency degree of the workpieces queued in front of the equipment according to a formula (1):
wherein the content of the first and second substances,
the urgency for the equipment i to process the workpiece n at the dispatch time t,
for the remaining processing time of the workpiece n on the apparatus i, FnIs the ratio of the mean machining period to the machining time of the workpiece n, DnAs a result of the delivery date of the workpiece n,
the occupied time of the workpiece n on the equipment i is taken; MAX is the highest processing priority;
calculating the load degree of the downstream equipment id capable of completing the next process of the workpiece n at the time t on the production line according to the formula (2):
in the formula (2), the reaction mixture is,
the load degree of the downstream equipment id which can complete the next process of the workpiece n at the time t;
the occupation time of the workpiece n on the downstream equipment id; t isidAvailable time per day for downstream device id;
calculating the selection probability of each queued workpiece in front of the equipment i according to the formula (3):
in the formula (3), SnFor the selection probability, alpha, of the work n1Is a measure of
An indicator of relative degree of importance, beta1Is a measure of
An indicator of relative importance;
the workpiece with the highest selection probability is selected to begin machining preferentially on the machine.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110197359.2A CN112947340A (en) | 2021-02-22 | 2021-02-22 | Dynamic dispatching method for simulating pheromone mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110197359.2A CN112947340A (en) | 2021-02-22 | 2021-02-22 | Dynamic dispatching method for simulating pheromone mechanism |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112947340A true CN112947340A (en) | 2021-06-11 |
Family
ID=76245136
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110197359.2A Pending CN112947340A (en) | 2021-02-22 | 2021-02-22 | Dynamic dispatching method for simulating pheromone mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112947340A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH06266413A (en) * | 1993-03-12 | 1994-09-22 | Nippon Telegr & Teleph Corp <Ntt> | Method and system for production management |
| US5751580A (en) * | 1996-07-26 | 1998-05-12 | Chartered Semiconductor Manufacturing, Ltd. | Fuzzy logic method and system for adjustment of priority rating of work in process in a production line |
| CN1734382A (en) * | 2005-06-10 | 2006-02-15 | 同济大学 | The dynamic dispatching method that is used for semiconductor production line based on pheromones |
| CN103217960A (en) * | 2013-04-08 | 2013-07-24 | 同济大学 | Automatic selection method of dynamic scheduling strategy of semiconductor production line |
| CN103439886A (en) * | 2013-07-26 | 2013-12-11 | 同济大学 | Semiconductor production line self-adaptation dynamic dispatching device |
| CN112131761A (en) * | 2020-11-25 | 2020-12-25 | 晶芯成(北京)科技有限公司 | Factory dispatching method and system based on group intelligent algorithm |
-
2021
- 2021-02-22 CN CN202110197359.2A patent/CN112947340A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH06266413A (en) * | 1993-03-12 | 1994-09-22 | Nippon Telegr & Teleph Corp <Ntt> | Method and system for production management |
| US5751580A (en) * | 1996-07-26 | 1998-05-12 | Chartered Semiconductor Manufacturing, Ltd. | Fuzzy logic method and system for adjustment of priority rating of work in process in a production line |
| CN1734382A (en) * | 2005-06-10 | 2006-02-15 | 同济大学 | The dynamic dispatching method that is used for semiconductor production line based on pheromones |
| CN103217960A (en) * | 2013-04-08 | 2013-07-24 | 同济大学 | Automatic selection method of dynamic scheduling strategy of semiconductor production line |
| CN103439886A (en) * | 2013-07-26 | 2013-12-11 | 同济大学 | Semiconductor production line self-adaptation dynamic dispatching device |
| CN112131761A (en) * | 2020-11-25 | 2020-12-25 | 晶芯成(北京)科技有限公司 | Factory dispatching method and system based on group intelligent algorithm |
Non-Patent Citations (1)
| Title |
|---|
| 李莉等: "半导体生产线自适应派工规则", 《控制工程》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103439886B (en) | A kind of semiconductor production line self-adaptation dynamic scheduler | |
| US6470231B1 (en) | Method and system for auto dispatching wafer | |
| CN103136631B (en) | Batch dispatching method of minimum total complete time is realized based on product family's sequence | |
| CN101609417B (en) | Mixed task set dispatching method based on VxWorks operation system | |
| CN111274021B (en) | GPU cluster task scheduling and distributing method | |
| CN108537338B (en) | Disaster rescue emergency resource scheduling method based on multi-agent genetic algorithm | |
| CN105302078A (en) | System and method for controlling furnace machine platform operation in semiconductor device manufacture technology | |
| CN112947340A (en) | Dynamic dispatching method for simulating pheromone mechanism | |
| CN106327053B (en) | Construction method of weaving process recommendation model based on multi-mode set | |
| Jacobs et al. | Quantifying variability of batching equipment using effective process times | |
| CN106897199B (en) | Batch job execution time prediction method based on big data processing framework | |
| Zhou et al. | WIP balance and due date control in a wafer fab with low and high volume products | |
| CN112416520A (en) | Intelligent resource scheduling method based on vSphere | |
| Niedermayer et al. | A simulation-based analysis of the cycle time of cluster tools in semiconductor manufacturing | |
| CN111784035A (en) | Flow production line workload prediction method based on delivery date | |
| Zhou et al. | A pull/push concept for toolgroup workload balance in wafer fab | |
| Rose | Comparison of due-date oriented dispatch rules in semiconductor manufacturing | |
| Jia et al. | A job-family-oriented algorithm for re-entrant batch processing machine scheduling | |
| CN111177937B (en) | Rapid response-oriented race production system model construction method | |
| CN114356515A (en) | Scheduling method of data conversion task | |
| CN110084498A (en) | A kind of work dispatching method of server-side, device, computer equipment and storage medium | |
| CN102478841B (en) | Method and device for balancing capacity of machine table | |
| CN114492959A (en) | Method for optimizing plate-type furniture production dispatching batches based on genetic algorithm | |
| CN112488492A (en) | Remote sensing product production scheduling method based on priority | |
| CN111784036A (en) | Production cycle-based flow production line workload prediction method |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210611 |
|
| RJ01 | Rejection of invention patent application after publication |