CN104460590B - Semiconductor production line multi-product workpiece combining method - Google Patents
Semiconductor production line multi-product workpiece combining method Download PDFInfo
- Publication number
- CN104460590B CN104460590B CN201410573275.4A CN201410573275A CN104460590B CN 104460590 B CN104460590 B CN 104460590B CN 201410573275 A CN201410573275 A CN 201410573275A CN 104460590 B CN104460590 B CN 104460590B
- Authority
- CN
- China
- Prior art keywords
- lot
- workpiece
- rule
- sequence
- time
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 58
- 238000004519 manufacturing process Methods 0.000 title claims abstract description 43
- 239000004065 semiconductor Substances 0.000 title claims abstract description 36
- 238000012545 processing Methods 0.000 claims abstract description 45
- 238000005457 optimization Methods 0.000 claims abstract description 10
- 208000022961 microcephaly, developmental delay, and brittle hair syndrome Diseases 0.000 claims abstract 9
- 230000001174 ascending effect Effects 0.000 claims description 14
- 238000003754 machining Methods 0.000 claims description 7
- 238000004088 simulation Methods 0.000 claims description 7
- 238000004364 calculation method Methods 0.000 claims description 4
- 238000012163 sequencing technique Methods 0.000 claims description 4
- 238000005267 amalgamation Methods 0.000 claims description 3
- 230000000903 blocking effect Effects 0.000 claims description 2
- 238000009434 installation Methods 0.000 claims description 2
- 238000012423 maintenance Methods 0.000 claims description 2
- 238000004422 calculation algorithm Methods 0.000 abstract description 4
- 230000000694 effects Effects 0.000 abstract description 3
- 238000005516 engineering process Methods 0.000 abstract description 3
- 150000001875 compounds Chemical class 0.000 abstract 1
- 238000005303 weighing Methods 0.000 abstract 1
- 238000011160 research Methods 0.000 description 4
- 238000002474 experimental method Methods 0.000 description 3
- 230000015572 biosynthetic process Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000003672 processing method Methods 0.000 description 2
- 238000003786 synthesis reaction Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 1
- 238000012856 packing Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B19/00—Programme-control systems
- G05B19/02—Programme-control systems electric
- G05B19/418—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM]
- G05B19/41865—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM] characterised by job scheduling, process planning, material flow
-
- H—ELECTRICITY
- H01—ELECTRIC ELEMENTS
- H01L—SEMICONDUCTOR DEVICES NOT COVERED BY CLASS H10
- H01L21/00—Processes or apparatus adapted for the manufacture or treatment of semiconductor or solid state devices or of parts thereof
- H01L21/67—Apparatus specially adapted for handling semiconductor or electric solid state devices during manufacture or treatment thereof; Apparatus specially adapted for handling wafers during manufacture or treatment of semiconductor or electric solid state devices or components ; Apparatus not specifically provided for elsewhere
- H01L21/67005—Apparatus not specifically provided for elsewhere
- H01L21/67011—Apparatus for manufacture or treatment
-
- 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)
- Manufacturing & Machinery (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Microelectronics & Electronic Packaging (AREA)
- Computer Hardware Design (AREA)
- Condensed Matter Physics & Semiconductors (AREA)
- Power Engineering (AREA)
- General Engineering & Computer Science (AREA)
- Quality & Reliability (AREA)
- Automation & Control Theory (AREA)
- General Factory Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Disclosed is a semiconductor production line multi-product workpiece combining method. The method comprises the steps that feature attributes of Lot to be machined in the processing equipment buffer area on a semiconductor production line are obtained; according to the collected workpiece feature attributes, on the basis of the semiconductor processing workpiece sorting compound rule, workpieces to be machined are sorted, and workpiece groups to be combined are formed; then, the ES/RW2 and MDBH combined scheduling algorithm is utilized for sorting the workpiece groups to be combined, and the workpiece processing sequence with the minimum tardiness as the optimization target is determined; finally, the workpiece groups to be combined are fed into processing equipment according to the sorting result to be machined, each Lot weighing factor of different order forms in the current round is calculated, and the technical support effect is provided for the combining decision for the next round. By optimizing the Lot processing flow of the same technology Lot of different order forms in the semiconductor production manufacturing process and combining the Lot processing time of the same technological menu, the production efficiency of the whole system will be improved, and the semiconductor production average processing period and order form tardiness rate are reduced.
Description
Technical field
This is related to a kind of semiconductor production line multi-product work the invention belongs to semi-conductor production scheduling and control technology field
Part merging method.
Background technology
Semiconductor manufacturing industry is a high-tech industry to economic development with Major Strategic value, has extensive,
Highly uncertain, complex manufacturing, constrain the features such as complexity, multiple target, in the quick change of the market demand and globalization warp
In the case of Ji intensified competition, semiconductor manufacture industry running maximizes productivity effect and efficiency and becomes urgently to be resolved hurrily important asks
Topic.Especially for the chip of large scale integrated circuit and special applications type integrated circuit type, because its order volume is big, product
The features such as species is many, even more need to carry out optimizing scheduling in process of production.
At present, there is the research being directed to semi-conductor production scheduling and control aspect in a large number both at home and abroad.Previous most researchs are all
Eye is in judgement and the prediction aspect of bottleneck device, and the scheduling problem of batch processing machines, and to the research being merged based on workpiece
Fewer.Wherein, Liao considers the probability of Lot merging when studying scheduling problem;Gupta and Sivakumar utilizes upper
The trip workpiece time of advent and the information at date of delivery, propose a kind of batch rule of utilization prior information, and notice that Lot merges
Can be considered that multiple Lot batchings become the Similar Problems of batch;JY Bang etc. proposes a kind of plant produced line 30%-40%'s
Lot be discontented with card in the case of workpiece merging method, and propose some identical jobs merging rule.Said method or lack
The System Discussion that workpiece is merged, or less to the research in the case of different order multiple products.
Content of the invention
It is an object of the invention to disclosing a kind of semiconductor production line multi-product workpiece merging method, it is preferred that emphasis is by right
Different orders, the merging of the workpiece of same process menu, improve the working (machining) efficiency of the production line of quasiconductor, reduce quasiconductor life
Produce the average process-cycle and drag phase rate with order.For semiconductor production quantity on order big, product category is many features such as, propose a kind of
The thought of dynamic optimization product weighter factor, by calculating each order corresponding product processing progress after each wheel workpiece merges
Determine order each Lot weighter factor, merging decision-making for next round provides technical support, optimizes each order using closed loop control thought
Processing progress.
For reaching above-mentioned purpose, the present invention employs the following technical solutions.
A kind of semiconductor production line multi-product workpiece merging method, the method includes the steps of:
Step 1:It is in relief area Lot to be processed information on collection semiconductor production line, obtain quasiconductor Lot's to be processed
Characteristic attribute (Lot wafer count to be combined, elasticity at date of delivery, workpiece residue process time, Lot weighter factor);
Step 2:It is combined ordering rule using the lot information to be processed of collection in step 1 and semiconductor machining workpiece, to slow
Rush area's workpiece to be processed to be ranked up, form workpiece race to be combined;
Step 2.1, the Lot according to the workpiece sequencing rule discontented card to be processed to relief area is ranked up;Wherein sort
Rule has:
Rule 1, descending adapts to rule first, and the Lot of discontented card is arranged according to wafer number in Lot is descending
Sequence, is merged by the target piling 25 wafer to the Lot sequence after sequence, till can not continuing.
Rule 2, ascending order adapts to rule first, and the Lot of discontented card is arranged according to wafer number in Lot is ascending
Sequence, is merged by the target piling 25 wafer to the Lot sequence after sequence, till can not continuing.
Rule 3, adapts to ES/RW2 (estimated slack time per remaining work2) rule first, right
The Lot of discontented card is ranked up according to the ES/RW2 value of Lot, and wherein ES/RW2 value is the synthesis portraying a certain Lot urgency level
Index, ES/RW2 value is less, more urgent;Lot sequence after sequence is merged by the target piling 25 wafer, until not
Till continuing.
Rule 4, adapts to MDBH (modified dynamic batching heuristic) rule, first to discontented card
Lot be ranked up according to the MDBH value of Lot, when wherein MDBH value features the average relaxation of workpiece to be processed during machine idle
Between, when a machine idle, one group of lot selecting the average relaxation time minimum merges.Lot sequence after sequence is pressed
The target piling 25 wafer merges, till can not continuing.
Rule 5, the knapsack problem based on the waiting time solves rule.By solving following 0-1 knapsack problem, which to select
A little Lot merge.
Wherein, n is to wait for the quantity of Lot in queue.WkIt is k-th Lot waiting time, akIt is the size (wafer of Lot k
Number).B is a capacity (25) completely blocking Lot, xkFor Boolean quantity, 0 represents selection, and 1 expression does not select.Using dynamic programming
Method solves this knapsack problem.
Lot sequence after sequence is merged by the target piling 25 wafer, till can not continuing.
Rule 6, the knapsack problem based on ES/RW2 value solves rule, and this knapsack problem solves target and is changed into:
I.e. so that more urgent workpiece more first merges processing.As target, solve knapsack problem output one to be combined
The sequence of Lot.Lot sequence after sequence is merged by the target piling 25 wafer, till can not continuing.
The step 2.2 full card Lot to be processed to relief area, it is moved to step 2.3 together with the lot group merging.
The lot workpiece group to merging for step 2.3., calculates the average relaxation time of each workpiece group, during by average relaxation
Between be multiplied by dynamic optimization weighter factor, by lot workpiece group press its be worth descending arrangement.
Step 2.4. utilizes the Lot of majorization of iterative method step 2.3 output
After the completion of merging decision-making each time, by lot importance decision rule, select in remaining Lot to be combined
One Lot, is labeled as virtual Lot.
It is more than lot importance decision rule,Represent the significance level of lot j respectively.Wherein X (J) is
Lotj affiliated like products family, and the Lot in same machines;Y (j) is Lotj affiliated like products family, and
Lot on all machines;Z (j) is the Lot of every other product family in Lotj same machines.Select each groupValue
Maximum lot is virtual lot.
Step 2.5. determines the time of the virtual Lot of step 2.4
Reset the time of virtual lot, and once merge before these Lot are added to again as Lot to be combined
(a front amalgamation result Lot virtual with these is regarded as one to be combined group, presses merging mesh before again in decision-making
Mark does once merging decision-making).Repeat said process not improve until merging target.
Step 3:Determine step 2 output workpiece race processing sequence
Step 3.1 on serial computer, Lot workpiece race to merging, determine Lot priority using ES/RW2 rule, excellent
First level is such as made decision:
For Lot i, diIt it is date of delivery, t is current time, i.e. the scheduling decision moment;liIt is that in Lot i process time is
The serial number of few Lot;wiIt is remaining labor content;hiIt is Lot i and liDifference.
For a certain Lot workpiece race to be combined, its ES RW2 value less, processing priority is higher.
Step 3.2, for batch processor, determines, using MDBH rule, the processing sequence having merged Lot workpiece race.
Select minimum being processed slack time in identical product race.If merged in relief area lot number be more than or
Equal to batch processor maximum working ability, then merged the processing of lot batching.Otherwise, selection scheme:1. by waiting list
Lot batching is processed;2. wait the lot that will reach batching processing again.Both prioritizing selection middle weighting waiting time little scheme.
Step 4 dynamical feedback calculation procedure 3 exports different orders each Lot weight factor
Step 4.1 calculates completion ratio T of each product family of currently all orderl(j)
Step 4.2 takes and averagely completes ratio when front-wheel
Step 4.3 calculates weight factor P (j+1) of each Lot of next round order
Wherein α as different orders between weight factor, be added to Lot weight factor calculate in.
Compared with existing semiconductor applications Work piece processing method, the present invention has following obvious advantage,
The present invention passes through to extract workpiece to be processed characteristic attribute, and process menu identical in multiple difference orders is discontented with card
Lot merges processing.After merging decision-making, virtual Lot is selected to be iterated optimizing by Lot importance decision rule,
Improve workpiece combined efficiency.For the features such as semiconductor production product category is many, quantity on order big, date of delivery, the time was wide, propose
A kind of thought of dynamic optimization difference order workpiece weighter factor, calculates each order corresponding product after each wheel workpiece merges
Completion ratio and average completion ratio, merging decision-making for next round provides technical support effect.The present invention passes through to optimize quasiconductor
Different order same process Lot work flows and merge same process menu Lot process time during the manufacturing, it will carry
High whole system production efficiency, reduces the semiconductor production average process-cycle and drags phase rate with order, be partly to lead to towards multi-product
The improvement of body production field Work piece processing method.
Brief description
Fig. 1 is method flow diagram involved in the present invention;
Fig. 2 is that majorization of iterative method involved in the present invention merges Lot algorithm flow chart;
Fig. 3 is utilized bin packing algorithm flow chart by workpiece involved in the present invention merging;
Fig. 4 is dynamic optimization difference order Lot weight factor schematic diagram involved in the present invention.
The average workpiece that Fig. 5 obtains for the embodiment of the present invention drags phase rate contrast and experiment.
The average process-cycle contrast and experiment that Fig. 6 obtains for the embodiment of the present invention.
The dynamic optimization difference order Lot weight factor contrast and experiment that Fig. 7 obtains for the embodiment of the present invention.
Specific embodiment
Embodiments of the present invention are described further by technical scheme for a better understanding of the present invention below.
It is embodied as taking semi-conductor production scheduling master pattern HP24 as a example.This model is made up of 24 machining centers, altogether
There are 72 equipment, equipment component detail parameters are as shown in table 1.
Equipment component parameter in table 1 master pattern HP24
Plant Simulation emulation platform is emulated using HP24 master pattern, wherein sends work rule to adopt
FIFO (First In First Out), dosing spot adopts CONWIP, and simulation time is set to 1445 hours, and pre- simulation time sets
For 365 hours.Fig. 1-4 show workpiece and merges algorithm main flow chart, comprises the steps:
Step 1:It is in relief area Lot to be processed information on collection semiconductor production line, obtain quasiconductor Lot's to be processed
Characteristic attribute (Lot wafer count to be combined, elasticity at date of delivery, workpiece residue process time, Lot weighter factor);
Used parameter given below definition:
The workpiece average process-cycle:Comprise workpiece average processing time and waiting time;
Utilization rate of equipment and installations:Set point is [0,1].
24 equipment each relief area queue lengths:Relief area workpiece capacity is set to infinity;
Workpiece species:Definition has 100 kinds of workpiece;
Processing priority:It is set as only relevant with workpiece type;
Date of delivery tightness:It is set as only related to workpiece type;
The process time of workpiece operation to be processed:Workpiece also need in production equipment process time;
Workpiece total remaining process time:The process time of workpiece operation to be processed and waiting time sum;
Equipment fault time, maintenance of equipment time:Occurred with fixed interval;
Parts waiting time:For workpiece in every equipment relief area waiting time sum;
The respective completion number of workpiece:With reach recycle bin Drain be complete processing;
The total elapsed time of workpiece and average processing time:The total elapsed time of workpiece is respectively divided by respective completion number
It is the average processing time of workpiece;
Workpiece drags phase rate:When order date of delivery, the chief engineer's number of packages that do not complete/order requirements number of packages altogether;
Step 2:It is combined ordering rule using the lot information to be processed of collection in step 1 and semiconductor machining workpiece, to slow
Rush area's workpiece to be processed to be ranked up, form workpiece race to be combined;
Step 2.1, the Lot according to the workpiece sequencing rule discontented card to be processed to relief area is ranked up;Wherein sort
Rule has:
Rule 1, descending adapts to rule first, and the Lot of discontented card is arranged according to wafer number in Lot is descending
Sequence, is merged by the target piling 25 wafer to the Lot sequence after sequence, till can not continuing.
Descending adapts to Sample Rules first:
Lot wafer count 3 14 57 15 23 642 in the Lot to be combined of a certain relief area
According to after descending 23 15 14 765432
Merging group (23 2) (15 7 3) (14 6 5) (4)
Rule 2, ascending order adapts to rule first, and the Lot of discontented card is arranged according to wafer number in Lot is ascending
Sequence, is merged by the target piling 25 wafer to the Lot sequence after sequence, till can not continuing.
Ascending order adapts to Sample Rules first:
Lot wafer count 3 14 57 15 23 642 in the Lot to be combined of a certain relief area
According to after ascending order arrangement 234567 14 15 23
Merging group (2 345 6) (7 14) (15) (23)
Rule 3, adapts to ES/RW2 (estimated slack time per remaining work2) rule first, right
The Lot of discontented card is ranked up according to the ES/RW2 value of Lot, and wherein ES/RW2 value is the synthesis portraying a certain Lot urgency level
Index, ES/RW2 value is less, more urgent;Lot sequence after sequence is merged by the target piling 25 wafer, until not
Till continuing.
Sample Rules:
It is ES/RW2 property value in square frame
Lot wafer count 3 [0.9] 14 [0.3] 5 [0.6] 7 [0.7] 15 [0.8] 23 in the Lot to be combined of a certain relief area
[0.4]6[0.2]4[0.7]2[0.3]
According to after ascending order arrangement 6 [0.2] 2 [0.3] 14 [0.3] 23 [0.4] 5 [0.6] 4 [0.7] 7 [0.7] 15 [0.8] 3
[0.9]
Merging group (6 [0.2] 2 [0.3] 14 [0.3]) (23 [0.4]) (5 [0.6] 4 [0.7] 7 [0.7]) (15 [0.8] 3
[0.9])
Rule 4, adapts to MDBH (modified dynamic batching heuristic) rule, first to discontented card
Lot be ranked up according to the MDBH value of Lot, when wherein MDBH value features the average relaxation of workpiece to be processed during machine idle
Between, when a machine idle, one group of lot selecting the average relaxation time minimum merges.Lot sequence after sequence is pressed
The target piling 25 wafer merges, till can not continuing.
Rule 5, the knapsack problem based on the waiting time solves rule.Its basic thought is, the sequence to the Lot of discontented card
Be equivalent to one knapsack problem of solution, by merging those waiting time the longest Lot, to reduce total process time.Pass through
Solve to make waiting time maximum 0-1 knapsack problem with the next one, to select which Lot merges.
Wherein, n is to wait for the quantity of Lot in queue.WkIt is k-th Lot waiting time, akIt is the size (wafer of Lot k
Number).B is the capacity (25) of a Lot, xkFor Boolean quantity, 0 selection, 1 does not select.Can be solved this using dynamic programming
Knapsack problem.
Sample Rules:
Lot sequence after sequence is merged by the target piling 25 wafer, till can not continuing.
Lot wafer count in a certain Lot to be combined:3,14,5,7,15,23,6,4,2
Lot corresponding waiting time to be combined:437,1412,691,1735,1985,1234,1735,962,450
Merging group obtained by solution knapsack problem:(3,14,5,2)(7,15)(6,4)(23)
Rule 6, the knapsack problem based on ES/RW2 solves rule, and this knapsack problem solves target and is changed into:
I.e. so that more urgent workpiece more first merges is processed.As target, solve knapsack problem output one and treat
Merge the sequence of Lot.Lot sequence after sequence is merged by the target piling 25 wafer, till can not continuing.
The step 2.2 full card Lot to be processed to relief area, it is moved to step 2.3 together with the lot group merging.
The lot workpiece group to merging for step 2.3., calculates the average relaxation time of each workpiece group, during by average relaxation
Between be multiplied by dynamic optimization weighter factor, by lot workpiece group press its be worth descending arrangement.
Step 2.4. utilizes the Lot of majorization of iterative method step 2.3 output
After the completion of merging decision-making each time, by lot importance decision rule, select in remaining Lot to be combined
One Lot, is labeled as virtual Lot.
It is more than lot importance decision rule,Represent the significance level of lot j respectively.Wherein X (J) is
Lotj affiliated like products family, and the Lot in same machines;Y (j) is Lotj affiliated like products family, and
Lot on all machines;Z (j) is the Lot of every other product family in Lotj same machines.Select each groupValue
Maximum lot is virtual lot.
Step 2.5. determines the time of the virtual Lot of step 2.4
Reset the time of virtual lot, and once merge before these Lot are added to again as Lot to be combined
(a front amalgamation result Lot virtual with these is regarded as one to be combined group, presses merging mesh before again in decision-making
Mark does once merging decision-making).Repeat said process not improve until merging target.
Lot wafer count 3 14 57 15 23 642 in a certain Lot to be combined
Merging group (23 2) (15 7 3) (14 6 5) (4)
It is 8 that wafer count in virtual Lot is taken out in definition
Again merge according to descending
Then new ordered set is 23 15 14 8765432
New merging group is changed into merging group (23 2) (15 8 7) (14 6 5) (4 3)
Step 3:Determine step 2 output workpiece race processing sequence
Step 3.1 on serial computer, Lot workpiece race to merging, determine Lot priority using ES/RW2 rule, excellent
First level is such as made decision:
For Lot i, diIt it is date of delivery, t is current time, i.e. the scheduling decision moment;liIt is that in Lot i process time is
The serial number of few Lot;wiIt is remaining labor content;hiIt is Lot i and liDifference.
For a certain Lot workpiece race to be combined, its ES RW2 value less, processing priority is higher.
Step 3.2, for batch processor, determines, using MDBH rule, the processing sequence having merged Lot workpiece race.
Select minimum being processed slack time in identical product race.If merged in relief area lot number be more than or
Equal to batch processor maximum working ability, then merged the processing of lot batching.Otherwise, selection scheme:1. by waiting list
Lot batching is processed;2. wait the lot that will reach batching processing again.Both prioritizing selection middle weighting waiting time little scheme.
Step 4 dynamical feedback calculation procedure 3 exports different orders each Lot weight factor
Step 4.1 calculates the completion ratio of each product family of currently all order
The α value defining order 1,2,3,4 is respectively 0.98 0.99 0.98 0.99
T1(1)=0.74 T2(1)=0.65 T3(1)=0.69 T4(1)=0.72
Step 4.2 takes and averagely completes ratio when front-wheel
Step 4.3 calculates the weight factor of each Lot of next round order
P (j+1)=Pl(j)+α×(T(j)-Tl(j))
T1(2)=0.74+0.98 × (0.7-0.74)=0.7008
T2(2)=0.65+0.99 × (0.7-0.65)=0.6995
T3(2)=0.69+0.98 × (0.7-0.69)=0.6998
T4(2)=0.72+0.99 × (0.7-0.72)=0.7002
Wherein α as different orders between weight factor, be added to Lot weight factor calculate in.
Simulation result as shown in Figure 5 and Figure 6, by extract workpiece to be processed characteristic attribute, by multiple difference orders in work
Skill menu identical is discontented with card Lot and is merged processing, and the average process-cycle of workpiece is compared actual production and reduces by 12.9%, work
The mean tardiness rate of part is compared actual production and is reduced 23.5%.On here basis, by dynamic optimization difference order workpiece
Weighter factor, improves the effectiveness merging decision-making, drags phase rate and average process-cycle to reduce 6.5% and 8.7% respectively again.By
Shown in Fig. 7, by calculating dynamical feedback each order difference Lot weight factor, not only reduce the average processing of semiconductor production
Cycle, and each order completion time variance is also obviously reduced.Illustrate that the present invention passes through to optimize in semiconductor production manufacture process
Different order same process Lot work flows and merge same process menu Lot process time, it is possible to increase whole system produces
Efficiency, reduces the semiconductor production average process-cycle and drags phase rate with order, current semiconductor production line is produced important value.
Claims (4)
1. a kind of semiconductor production line multi-product workpiece merging method it is characterised in that:The method includes the steps of,
Step 1:It is in relief area Lot to be processed information on collection semiconductor production line, obtain the feature of quasiconductor Lot to be processed
Attribute;
Step 2:It is combined ordering rule using the lot information to be processed of collection in step 1 and semiconductor machining workpiece, to relief area
Workpiece to be processed is ranked up, and forms workpiece race to be combined;
Step 2.1, the Lot according to the workpiece sequencing rule discontented card to be processed to relief area is ranked up;Wherein ordering rule
Have:
Rule 1, descending adapts to rule first, and the Lot of discontented card is ranked up according to wafer number in Lot is descending, right
Lot sequence after sequence is merged by the target piling 25 wafer, till can not continuing;
Rule 2, ascending order adapts to rule first, and the Lot of discontented card is ranked up according to wafer number in Lot is ascending, right
Lot sequence after sequence is merged by the target piling 25 wafer, till can not continuing;
Rule 3, adapts to ES/RW2 rule first, the Lot of discontented card is ranked up according to the ES/RW2 value of Lot, wherein ES/
RW2 value is the aggregative indicator portraying a certain Lot urgency level, and ES/RW2 value is less, more urgent;Lot sequence after sequence is pressed
The target piling 25 wafer merges, till can not continuing;
Rule 4, adapts to MDBH rule first, the Lot of discontented card is ranked up according to the MDBH value of Lot, wherein MDBH value is carved
Draw the average relaxation time of workpiece to be processed during machine idle, when a machine idle, select average relaxation time minimum
One group of lot merges;Lot sequence after sequence is merged by the target piling 25 wafer, until continuing
Till;
Rule 5, the knapsack problem based on the waiting time solves rule;By solving following 0-1 knapsack problem, which to select
Lot merges;
It is limited to
Wherein, n is to wait for the quantity of Lot in queue;WkIt is k-th Lot waiting time, akBe the size of Lot k be wafer count;b
It is a capacity such as 25 completely blocking Lot, xkFor Boolean quantity, 0 represents selection, and 1 expression does not select;Solved using dynamic programming
This knapsack problem;
Lot sequence after sequence is merged by the target piling 25 wafer, till can not continuing;
Rule 6, the knapsack problem based on ES/RW2 value solves rule, and this knapsack problem solves target and is changed into:
I.e. so that more urgent workpiece more first merges processing;As target, solve knapsack problem and export a Lot's to be combined
Sequence;Lot sequence after sequence is merged by the target piling 25 wafer, till can not continuing;
The step 2.2 full card Lot to be processed to relief area, it is moved to step 2.3 together with the lot group merging;
The lot workpiece group to merging for step 2.3., calculates the average relaxation time of each workpiece group, the average relaxation time is taken advantage of
With dynamic optimization weighter factor, lot workpiece group is pressed it and is worth descending arrangement;
Step 2.4. utilizes the Lot of majorization of iterative method step 2.3 output
After the completion of merging decision-making each time, by lot importance decision rule, in remaining Lot to be combined, select one
Lot, is labeled as virtual Lot;
It is more than lot importance decision rule,Represent the significance level of lot j respectively;Wherein X (j) is belonging to Lotj
Like products family, and the Lot in same machines;Y (j) is Lotj affiliated like products family, and in all machines
On Lot;Z (j) is the Lot of every other product family in Lotj same machines;Select each groupThe maximum lot of value
For virtual lot;
Step 2.5. determines the time of the virtual Lot of step 2.4
Reset the time of virtual lot, and once merge decision-making before these Lot are added to again as Lot to be combined
In;Repeat said process not improve until merging target;
Step 3:Determine step 2 output workpiece race processing sequence
Step 3.1 on serial computer, Lot workpiece race to merging, determine Lot priority, priority using ES/RW2 rule
As made decision:
For Lot i, diIt it is date of delivery, t is current time, i.e. the scheduling decision moment;liBe in Lot i process time minimum
The serial number of Lot;wiIt is remaining labor content;hiIt is Lot i and liDifference;
For a certain Lot workpiece race to be combined, its ES RW2 value less, processing priority is higher;
Step 3.2, for batch processor, determines, using MDBH rule, the processing sequence having merged Lot workpiece race;
Select minimum being processed slack time in identical product race;If having merged lot number in relief area to be more than or equal to
Batch processor maximum working ability, then merged the processing of lot batching;Otherwise, selection scheme:1. by the lot in waiting list
Batching is processed;2. wait the lot that will reach batching processing again;Both prioritizing selection middle weighting waiting time little scheme;
Step 4 dynamical feedback calculation procedure 3 exports different orders each Lot weight factor
Step 4.1 calculates completion ratio T of each product family of currently all orderl(j)
Step 4.2 takes and averagely completes ratio when front-wheel
Step 4.3 calculates weight factor P (j+1) of each Lot of next round order
Wherein α as different orders between weight factor, be added to Lot weight factor calculate in.
2. a kind of semiconductor production line multi-product workpiece merging method according to claim 1 it is characterised in that:Described obtain
Take quasiconductor Lot to be processed characteristic attribute be Lot wafer count to be combined, elasticity at date of delivery, workpiece residue process time,
Lot weighter factor.
3. a kind of semiconductor production line multi-product workpiece merging method according to claim 1 it is characterised in that:Described heavy
Put the time of virtual lot, and once merge before these Lot are added to again as Lot to be combined will in decision-making
A front amalgamation result Lot virtual with these is regarded as one to be combined group, does once by merging target before again
Merge decision-making.
4. a kind of semiconductor production line multi-product workpiece merging method according to claim 1 it is characterised in that:In order to more
Understand well technical scheme, below embodiments of the present invention are described further;
It is embodied as taking semi-conductor production scheduling master pattern HP24 as a example;This model is made up of 24 machining centers, has 72
Platform equipment, equipment component detail parameters are as shown in table 1;
Equipment component parameter in table 1 master pattern HP24
Plant Simulation emulation platform is emulated using HP24 master pattern, wherein sends work rule to adopt
FIFO, dosing spot adopts CONWIP, and simulation time is set to 1445 hours, and pre- simulation time is set to 365 hours;
Specifically include following steps:
Step 1:It is in relief area Lot to be processed information on collection semiconductor production line, obtain the feature of quasiconductor Lot to be processed
Attribute, Lot wafer count to be combined, elasticity at date of delivery, workpiece residue process time, Lot weighter factor;
Used parameter given below definition:
The workpiece average process-cycle:Comprise workpiece average processing time and waiting time;
Utilization rate of equipment and installations:Set point is [0,1];
24 equipment each relief area queue lengths:Relief area workpiece capacity is set to infinity;
Workpiece species:Definition has 100 kinds of workpiece;
Processing priority:It is set as only relevant with workpiece type;
Date of delivery tightness:It is set as only related to workpiece type;
The process time of workpiece operation to be processed:Workpiece also need in production equipment process time;
Workpiece total remaining process time:The process time of workpiece operation to be processed and waiting time sum;
Equipment fault time, maintenance of equipment time:Occurred with fixed interval;
Parts waiting time:For workpiece in every equipment relief area waiting time sum;
The respective completion number of workpiece:With reach recycle bin Drain be complete processing;
The total elapsed time of workpiece and average processing time:The total elapsed time of workpiece is respectively divided by respective completion number and is
The average processing time of workpiece;
Workpiece drags phase rate:When order date of delivery, the chief engineer's number of packages that do not complete/order requirements number of packages altogether;
Step 2:It is combined ordering rule using the lot information to be processed of collection in step 1 and semiconductor machining workpiece, to relief area
Workpiece to be processed is ranked up, and forms workpiece race to be combined;
Step 2.1, the Lot according to the workpiece sequencing rule discontented card to be processed to relief area is ranked up;Wherein ordering rule
Have:
Rule 1, descending adapts to rule first, and the Lot of discontented card is ranked up according to wafer number in Lot is descending, right
Lot sequence after sequence is merged by the target piling 25 wafer, till can not continuing;
Descending adapts to Sample Rules first:
Lot wafer count 3 14 57 15 23 642 in the Lot to be combined of a certain relief area
According to after descending 23 15 14 765432
Merging group (23 2) (15 7 3) (14 6 5) (4)
Rule 2, ascending order adapts to rule first, and the Lot of discontented card is ranked up according to wafer number in Lot is ascending, right
Lot sequence after sequence is merged by the target piling 25 wafer, till can not continuing;
Ascending order adapts to Sample Rules first:
Lot wafer count 3 14 57 15 23 642 in the Lot to be combined of a certain relief area
According to after ascending order arrangement 234567 14 15 23
Merging group (2 345 6) (7 14) (15) (23)
Rule 3, adapts to ES/RW2 rule first, the Lot of discontented card is ranked up according to the ES/RW2 value of Lot, wherein ES/
RW2 value is the aggregative indicator portraying a certain Lot urgency level, and ES/RW2 value is less, more urgent;Lot sequence after sequence is pressed
The target piling 25 wafer merges, till can not continuing;
Sample Rules:
It is ES/RW2 property value in square frame
Lot wafer count 3 [0.9] 14 [0.3] 5 [0.6] 7 [0.7] 15 [0.8] 23 in the Lot to be combined of a certain relief area
[0.4] 6[0.2] 4[0.7] 2[0.3]
According to after ascending order arrangement 6 [0.2] 2 [0.3] 14 [0.3] 23 [0.4] 5 [0.6] 4 [0.7] 7 [0.7] 15
[0.8] 3[0.9]
Merging group (6 [0.2] 2 [0.3] 14 [0.3]) (23 [0.4]) (5 [0.6] 4 [0.7] 7 [0.7]) (15 [0.8] 3
[0.9])
Rule 4, adapts to MDBH rule first, the Lot of discontented card is ranked up according to the MDBH value of Lot, wherein MDBH value is carved
Draw the average relaxation time of workpiece to be processed during machine idle, when a machine idle, select average relaxation time minimum
One group of lot merges;Lot sequence after sequence is merged by the target piling 25 wafer, until continuing
Till;
Rule 5, the knapsack problem based on the waiting time solves rule;Its basic thought is that the sequence to the Lot of discontented card is suitable
In solving a knapsack problem, by merging those waiting time the longest Lot, to reduce total process time;By solving
Waiting time maximum 0-1 knapsack problem is made with the next one, to select which Lot merges;
It is limited to
Wherein, n is to wait for the quantity of Lot in queue;WkIt is k-th Lot waiting time, akIt is the size of Lot k;B is one
The capacity of Lot, xkFor Boolean quantity, 0 selection, 1 does not select;This knapsack problem can be solved using dynamic programming;
Sample Rules:
Lot sequence after sequence is merged by the target piling 25 wafer, till can not continuing;
Lot wafer count in a certain Lot to be combined:3,14,5,7,15,23,6,4,2
Lot corresponding waiting time to be combined:437,1412,691,1735,1985,1234,1735,962,450
Merging group obtained by solution knapsack problem:(3,14,5,2) (7,15) (6,4) (23)
Rule 6, the knapsack problem based on ES/RW2 solves rule, and this knapsack problem solves target and is changed into:
I.e. so that more urgent workpiece more first merges is processed;As target, solve knapsack problem output one to be combined
The sequence of Lot;Lot sequence after sequence is merged by the target piling 25 wafer, till can not continuing;
The step 2.2 full card Lot to be processed to relief area, it is moved to step 2.3 together with the lot group merging;
The lot workpiece group to merging for step 2.3., calculates the average relaxation time of each workpiece group, the average relaxation time is taken advantage of
With dynamic optimization weighter factor, lot workpiece group is pressed it and is worth descending arrangement;
Step 2.4. utilizes the Lot of majorization of iterative method step 2.3 output
After the completion of merging decision-making each time, by lot importance decision rule, in remaining Lot to be combined, select one
Lot, is labeled as virtual Lot;
It is more than lot importance decision rule,Represent the significance level of lot j respectively;Wherein X (j) is belonging to Lotj
Like products family, and the Lot in same machines;Y (j) is Lotj affiliated like products family, and in all machines
On Lot;Z (j) is the Lot of every other product family in Lotj same machines;Select each groupThe maximum lot of value
For virtual lot;
Step 2.5. determines the time of the virtual Lot of step 2.4
Reset the time of virtual lot, and once merge decision-making before these Lot are added to again as Lot to be combined
In;Repeat said process not improve until merging target;
Lot wafer count 3 14 57 15 23 642 in a certain Lot to be combined
Merging group (23 2) (15 7 3) (14 6 5) (4)
It is 8 that wafer count in virtual Lot is taken out in definition
Again merge according to descending
Then new ordered set is 23 15 14 8765432
New merging group is changed into merging group (23 2) (15 8 7) (14 6 5) (4 3)
Step 3:Determine step 2 output workpiece race processing sequence
Step 3.1 on serial computer, Lot workpiece race to merging, determine Lot priority, priority using ES/RW2 rule
As made decision:
For Lot i, diIt it is date of delivery, t is current time, i.e. the scheduling decision moment;liBe in Lot i process time minimum
The serial number of Lot;wiIt is remaining labor content;hiIt is Lot i and liDifference;
For a certain Lot workpiece race to be combined, its ES RW2 value less, processing priority is higher;
Step 3.2, for batch processor, determines, using MDBH rule, the processing sequence having merged Lot workpiece race;
Select minimum being processed slack time in identical product race;If having merged lot number in relief area to be more than or equal to
Batch processor maximum working ability, then merged the processing of lot batching;Otherwise, selection scheme:1) by the lot in waiting list
Batching is processed;2) wait the lot that will reach batching processing again;Both prioritizing selection middle weighting waiting time little scheme;
Step 4 dynamical feedback calculation procedure 3 exports different orders each Lot weight factor
Step 4.1 calculates the completion ratio of each product family of currently all order
The α value defining order 1,2,3,4 is respectively 0.98 0.99 0.98 0.99
Step 4.2 takes and averagely completes ratio when front-wheel
Step 4.3 calculates the weight factor of each Lot of next round order
P (j+1)=Pl(j)+α×(T(j)-Tl(j))
T1(2)=0.74+0.98 × (0.7-0.74)=0.7008
T2(2)=0.65+0.99 × (0.7-0.65)=0.6995
T3(2)=0.69+0.98 × (0.7-0.69)=0.6998
T4(2)=0.72+0.99 × (0.7-0.72)=0.7002
Wherein α as different orders between weight factor, be added to Lot weight factor calculate in.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410573275.4A CN104460590B (en) | 2014-10-23 | 2014-10-23 | Semiconductor production line multi-product workpiece combining method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410573275.4A CN104460590B (en) | 2014-10-23 | 2014-10-23 | Semiconductor production line multi-product workpiece combining method |
Publications (2)
Publication Number | Publication Date |
---|---|
CN104460590A CN104460590A (en) | 2015-03-25 |
CN104460590B true CN104460590B (en) | 2017-02-15 |
Family
ID=52906815
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201410573275.4A Expired - Fee Related CN104460590B (en) | 2014-10-23 | 2014-10-23 | Semiconductor production line multi-product workpiece combining method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN104460590B (en) |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105279605B (en) * | 2015-09-25 | 2018-10-12 | 安徽工程大学 | A kind of batch processing machine dispatching method under dynamic change weight |
CN108122055B (en) * | 2016-11-28 | 2021-07-30 | 北京理工大学 | Resource scheduling method and device for flow shop |
CN109685398A (en) * | 2019-02-02 | 2019-04-26 | 深圳埃克斯工业自动化有限公司 | A kind of failure response method and system of semiconductor process module |
CN110673560B (en) * | 2019-10-10 | 2021-02-05 | 清华大学 | Integrated circuit production line scheduling method based on operation completion time rapid prediction |
CN112365181A (en) * | 2020-11-24 | 2021-02-12 | 上海华力集成电路制造有限公司 | Qtime WIP control method of dynamic process flow |
CN114037168A (en) * | 2021-11-16 | 2022-02-11 | 长江存储科技有限责任公司 | Method and device for improving production efficiency of machine table and processing system |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103310285A (en) * | 2013-06-17 | 2013-09-18 | 同济大学 | Performance prediction method applicable to dynamic scheduling for semiconductor production line |
CN103700022A (en) * | 2013-12-27 | 2014-04-02 | 浙江大学 | Methods and device for scheduling production of semiconductor products |
CN103943523A (en) * | 2013-01-21 | 2014-07-23 | 中芯国际集成电路制造(上海)有限公司 | Sampling measuring method in semiconductor production process |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2003280714A (en) * | 2002-03-19 | 2003-10-02 | Toshiba Corp | Production scheduling method and production scheduling device |
JP4342770B2 (en) * | 2002-05-08 | 2009-10-14 | Necエレクトロニクス株式会社 | Semiconductor manufacturing system and process control method for semiconductor manufacturing |
JP2011018737A (en) * | 2009-07-08 | 2011-01-27 | Panasonic Corp | Semiconductor manufacturing system |
-
2014
- 2014-10-23 CN CN201410573275.4A patent/CN104460590B/en not_active Expired - Fee Related
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103943523A (en) * | 2013-01-21 | 2014-07-23 | 中芯国际集成电路制造(上海)有限公司 | Sampling measuring method in semiconductor production process |
CN103310285A (en) * | 2013-06-17 | 2013-09-18 | 同济大学 | Performance prediction method applicable to dynamic scheduling for semiconductor production line |
CN103700022A (en) * | 2013-12-27 | 2014-04-02 | 浙江大学 | Methods and device for scheduling production of semiconductor products |
Non-Patent Citations (1)
Title |
---|
不确定环境下半导体制造***瓶颈预测与调度方法研究;邓积杰;《中国优秀硕士学位论文全文数据库 信息科技辑》;20131215(第S2期);全文 * |
Also Published As
Publication number | Publication date |
---|---|
CN104460590A (en) | 2015-03-25 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN104460590B (en) | Semiconductor production line multi-product workpiece combining method | |
CN103217960B (en) | Automatic selection method of dynamic scheduling strategy of semiconductor production line | |
CN107506956A (en) | Based on improvement particle cluster algorithm supply chain production and transport coordinated dispatching method and system | |
CN102609714B (en) | Novel classification device and sorting technique based on information gain and Online SVM | |
CN103136631B (en) | Batch dispatching method of minimum total complete time is realized based on product family's sequence | |
CN104636479A (en) | Industrial big data driven total completion time prediction method | |
CN105843189B (en) | A kind of efficient scheduling rule selection method for semiconductor production line based on simplified simulation model | |
CN109507961B (en) | Semiconductor production line dynamic load balancing feeding control method | |
CN101782769B (en) | Quick prediction method of average flowing-through time on basis of index compensation | |
Reddy et al. | Heuristics and sequence-dependent set-up jobs in flow line cells | |
CN106611288A (en) | Improved solving algorithm for flexible flow shop scheduling problem | |
CN106292292A (en) | The floatation of iron ore dosing Optimal Setting method and system of case-based reasioning | |
CN111738580B (en) | Anshan type iron ore blending optimization method | |
CN106707991A (en) | Bottleneck device identifying method based on fuzzy analytic hierarchy process in multi-target job scheduling | |
CN103116809B (en) | The dispatching device of the batch processor of used for products race sequence and method | |
Jia et al. | DESIGN AND IMPLIMENTATION OF LEAN FACILITY LAYOUT SYSTEM OF A PRODUCTION LINE. | |
CN105988424B (en) | The generation method and generating means of semiconductor technology processing procedure information | |
CN102393687B (en) | Method for limiting distribution and scheduling for solving machine changing problem | |
CN113031542A (en) | Semiconductor production line dynamic scheduling method based on load balancing | |
Park et al. | Fab simulation with recipe arrangement of tools | |
Amori et al. | Thermal performance of solar hot water systems using a flat plate collector of accelerated risers | |
Li et al. | An efficient adaptive dispatching method for semiconductor wafer fabrication facility | |
Bashiri | A two stage heuristic solution approach for resource assignment during a cell formation problem | |
CN114492959A (en) | Method for optimizing plate-type furniture production dispatching batches based on genetic algorithm | |
CN112598274A (en) | Scheduling method of semiconductor manufacturing system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170215 Termination date: 20181023 |