Chip transfer scheduling method and semiconductor process equipment

By identifying the operating status of the process chamber in the chip manufacturing equipment and optimizing the chip transfer scheduling method, the inefficiency problem caused by the inability to use the process chamber operation position is solved, and the chip transfer efficiency and equipment production capacity are improved.

CN118969670AActive Publication Date: 2024-11-15BEIJING NAURA MICROELECTRONICS EQUIP CO LTD
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
CN202411026237.7
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-29
Publication Date
2024-11-15
Estimated Expiration
2044-07-29

AI Technical Summary

Technical Problem

In chip manufacturing equipment, when the working position of a certain process chamber is unavailable, the entire process chamber is unavailable, resulting in low chip transfer efficiency and equipment production capacity.

Method used

By identifying the workable state of the working positions in each process chamber, the process chamber with two working positions is preferred to transmit two wafers that are not working, and the process chamber with a single working position is traversed to transmit the unworked single wafers that are not working, and the process chamber with a single working position is traversed to transmit the unworked single wafers that are not working Wafers ensure that process chambers that cannot be operated are still available.

Benefits of technology

Improve the efficiency of chip transfer and equipment production capacity, ensure the effective utilization of process chambers, and give priority to traversing efficient working positions to improve overall production efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118969670A_ABST
    Figure CN118969670A_ABST
Patent Text Reader

Abstract

The invention discloses a wafer transfer scheduling method and semiconductor process equipment. The method comprises the following steps: acquiring operable states of two operation positions in a process chamber corresponding to a to-be-scheduled wafer box; if the number of the first type of process chambers of which the two operation positions are both operable is P, and P is greater than zero, traversing the P chambers in sequence, and for each chamber, controlling a manipulator to transmit two unoperated wafers for operation; after the traversal of the P cavities is completed, if the number of the second type of process cavities with only one working position being workable is S, and S is greater than zero, the S cavities are traversed in sequence, and for each cavity, a manipulator is controlled to transmit unworked single wafers for working; and after the traversal of the S chambers is completed, determining a target process chamber according to the number of unoperated wafers in the wafer box, and waiting for the target process chamber to complete the operation so as to execute a corresponding transmission action. According to the invention, the wafer transfer efficiency and the equipment productivity are improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application belongs to the field of semiconductor technology, and in particular, relates to a chip transmission scheduling method and semiconductor process equipment. Background Art

[0002] In the field of integrated circuit manufacturing, in order to improve the production capacity of chip manufacturing equipment, it is particularly important to process two or more wafers at a time in the equipment, thus producing twin chamber equipment (processing two wafers at a time) and furnace equipment (processing 50 to 200 wafers at a time). In twin chamber equipment, the two positions (i.e., working positions) for processing wafers, Station (abbreviated as ST), are arranged horizontally, which is inconsistent with the vertical arrangement of wafers in the wafer box, so the scheduling algorithm has higher requirements.

[0003] The chip manufacturing equipment may also include multiple process modules (PMs for short), each of which includes two STs. For example, a chip manufacturing equipment includes two PMs, which includes four STs, namely PM1 includes ST1 and ST2, and PM2 includes ST3 and ST4. In this mode, the wafers in the wafer box are grouped before the operation starts, with two wafers in a group. During the operation, a pair of manipulators take and place the wafers at the same time to achieve simultaneous entry and exit. However, in the actual operation process, it may happen that one of the STs in a PM cannot operate (such as downtime, vacuum conditions are not met, etc.). In this case, the scheduling method of the above two wafers entering and exiting at the same time will make the entire PM where the ST that cannot operate is located unusable, and the wafer transfer efficiency and equipment production capacity are low. Summary of the invention

[0004] The purpose of the embodiments of the present application is to provide a wafer transfer scheduling method and semiconductor process equipment to solve the problem in the related art that when one of the STs in a PM fails to operate, the entire PM cannot be used, resulting in low wafer transfer efficiency and equipment production capacity.

[0005] To achieve the above objectives, the present application embodiment adopts the following technical solutions:

[0006] In a first aspect, an embodiment of the present application provides a wafer transfer scheduling method, which is applicable to a semiconductor process equipment having at least one process chamber, wherein the process chamber has two working positions, including: obtaining the operable status of two working positions in the process chamber corresponding to a wafer box to be scheduled; if the number of first-type process chambers is P, and P is greater than zero, traversing the P first-type process chambers in sequence, and for each of the first-type process chambers, controlling a robot to transfer two unoperated wafers in the wafer box for operation; the first-type process chamber is a chamber in which the operable status of the two working positions are both operable. process chamber; after the traversal of the P first-type process chambers is completed, if the number of the second-type process chambers is S, and the S is greater than zero, the S second-type process chambers are traversed in sequence, and for each of the second-type process chambers, the robot is controlled to transfer the unoperated single wafer for operation; the second-type process chamber is a process chamber with only one operating position in an operable state; after the traversal of the S second-type process chambers is completed, the target process chamber is determined according to the number of unoperated wafers in the wafer box, and the target process chamber is waited for to complete the operation to perform the corresponding transfer action.

[0007] In a second aspect, an embodiment of the present application provides a semiconductor process equipment, comprising: at least one process chamber, each of the process chambers comprising two working positions; a wafer transfer device for transferring unoperated wafers to the working positions of each of the process chambers; a controller, the controller comprising at least one processor and at least one memory, the memory storing a computer program, and when the computer program is executed by the processor, the wafer transfer scheduling method as described in the first aspect of the present application is implemented.

[0008] At least one of the above technical solutions adopted in the embodiments of the present application can achieve the following beneficial effects:

[0009] In the embodiment of the present application, when wafer transfer scheduling is performed on the wafers in the wafer box, the operable status of two working positions in the process chamber corresponding to the wafer box to be scheduled is obtained. If the number of first-type process chambers is P and P is greater than zero, the P first-type process chambers are traversed in sequence. For each first-type process chamber, the robot is controlled to transfer the two unoperated wafers in the wafer box for operation. The first-type process chamber is a process chamber in which the operable status of the two working positions are both operable. After the traversal of the P first-type process chambers is completed, if the number of second-type process chambers is S and S is greater than zero, the S second-type process chambers are traversed in sequence. For each second-type process chamber, the robot is controlled to transfer the unoperated single wafer for operation. The second-type process chamber is a process chamber in which the operable status of only one working position is operable. After the traversal of the S second-type process chambers is completed, the target process chamber is determined according to the number of unoperated wafers in the wafer box, and the target process chamber is waited for to complete the operation to perform the corresponding transfer action. The embodiment of the present application identifies the first type of process chamber and the second type of process chamber by identifying the operable state of two operating positions in each process chamber. When the number of the first type of process chamber and the second type of process chamber is greater than zero, for each transmission of a single wafer that has not been operated by the second type of process chamber, and for each transmission of two wafers that have not been operated by the first type of process chamber, a single method of transmitting two wafers each time is no longer used, so that when one of the operating positions ST in a process chamber PM cannot be operated, the entire PM (i.e., the second type of process chamber) where the ST that cannot be operated is located can still be used, thereby improving the efficiency of wafer transmission and the production capacity of the equipment. In addition, during transmission, the first type of process chamber is preferentially traversed for operation, further ensuring the efficiency of wafer transmission. After the traversal of the second type of process chamber is completed, the target process chamber as the new starting point of the traversal is determined according to the number of wafers that have not been operated, and the target process chamber is waited for to complete the operation to perform the corresponding transmission action, further improving the efficiency of wafer transmission and the production capacity of the equipment. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0011] Figure 1 A flowchart of a film transmission scheduling method provided for one embodiment of the present application;

[0012] Figure 2 A flowchart of a film transmission scheduling method provided for another embodiment of the present application;

[0013] Figure 3A flowchart of a film transmission scheduling method provided for another embodiment of the present application;

[0014] Figure 4 A flowchart of a film transmission scheduling method provided for another embodiment of the present application;

[0015] Figure 5 A flowchart of a film transmission scheduling method provided for another embodiment of the present application;

[0016] Figure 6 A schematic diagram of the overall flow of a film transmission scheduling method provided for another embodiment of the present application;

[0017] Figure 7 A schematic structural diagram of a semiconductor process equipment provided for one embodiment of the present application. DETAILED DESCRIPTION

[0018] In order to make the purpose, technical solution and advantages of the present application clearer, the technical solution of the present application will be clearly and completely described below in combination with the specific embodiments of the present application and the corresponding drawings. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present application.

[0019] The terms "first", "second", etc. in this application are used to distinguish similar objects, and are not used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable under appropriate circumstances, so that the embodiments of the present application can be implemented in an order other than those illustrated or described here. In addition, the "and / or" in this application represents at least one of the connected objects, and the character " / " generally represents that the front and back associated objects are in an "or" relationship. It should be noted that the data involved in this application are all obtained on the premise of obtaining user authorization.

[0020] In the field of integrated circuit manufacturing, in order to improve the production capacity of chip manufacturing equipment, it is particularly important to process two or even more wafers at a time in the equipment, thus producing dual-chamber equipment (processing two wafers at a time) and furnace tube equipment (processing 50 to 200 wafers at a time). For furnace tube equipment, the wafers are placed manually (horizontal furnace) or by a robot (vertical furnace). Since the wafers in the vertical furnace are placed vertically and flat, which is consistent with the arrangement in the wafer box, the furnace tube equipment does not have high requirements for the scheduling algorithm. In the dual-chamber equipment, the two positions (i.e., the operating positions) ST for processing wafers are arranged horizontally, which is inconsistent with the arrangement in the wafer box, so the scheduling algorithm has higher requirements, especially when there are multiple wafer boxes corresponding to multi-chamber operations.

[0021] The chip manufacturing equipment may also include multiple process chambers PM, each PM includes two STs. For example, a chip manufacturing equipment includes two PMs, which include four STs, that is, PM1 includes ST1 and ST2, and PM2 includes ST3 and ST4. In this mode, the wafers in the wafer box are grouped before the operation starts, two wafers in a group, and during the operation, a pair of manipulators simultaneously take and place the wafers to achieve simultaneous entry and exit. However, in the actual operation process, it may happen that one of the STs in a PM cannot operate (such as downtime, vacuum conditions are not met, etc.). In this case, the scheduling method of the above two wafers entering and exiting at the same time will make the entire PM where the ST that cannot operate is located unusable, and the wafer transfer efficiency and equipment production capacity are low. To this end, the present application proposes a wafer transfer scheduling method and semiconductor process equipment to solve the problem that when one of the STs in a PM cannot operate in the related technology, the entire PM cannot be used, and the wafer transfer efficiency and equipment production capacity are low.

[0022] The technical solutions provided by various embodiments of the present application are described in detail below in conjunction with the accompanying drawings.

[0023] Figure 1 A flowchart of a transmission scheduling method provided by an embodiment of the present application is shown below. Figure 1 As shown, the film transmission scheduling method of the embodiment of the present application may specifically include the following steps:

[0024] S101, obtaining the operable status of two operating positions in the process chamber corresponding to the wafer box to be scheduled.

[0025] In an embodiment of the present application, the executor of the chip transmission scheduling method of the embodiment of the present application is a controller, which can be set in a semiconductor process equipment (such as chip manufacturing equipment) having at least one process chamber PM, and specifically can be set in the host computer and / or the slave computer of the semiconductor process equipment, and each PM is provided with two work positions ST.

[0026] The PM corresponding to the wafer box to be scheduled, that is, the PM of the wafers in the wafer box that are allowed to operate, can be obtained by reading the wafer flow setting.

[0027] Get the operability status of the two STs in each PM, which includes operability and non-operability. Among them, there are two main situations when the ST is non-operable (or cannot be used). One is that the ST is already in operation, that is, it is occupied and cannot be operated. The other is that the hardware conditions of the ST are not met, such as the vacuum degree does not meet the operating requirements, the lack of necessary components and cannot operate normally, etc. These can be automatically identified by the software through electrical signals.

[0028] S102, according to the operable state, determining a process chamber whose two operating positions are both operable as a first type process chamber, and determining a process chamber whose only operating position is operable as a second type process chamber.

[0029] In the embodiment of the present application, if the operable states of both STs in a PM are operable, the PM is determined as a first type PM. If the operable state of only one ST among the two STs in a PM is operable, the PM is determined as a second type PM.

[0030] S103, for the second type process chamber, controlling the robot arm to transfer the unoperated single wafer in the wafer box for operation each time.

[0031] In the embodiment of the present application, for the second type PM, since only one ST can operate, when transferring the unoperated wafers in the wafer box to the second type PM for operation, the robot is controlled to transfer a single wafer each time.

[0032] S104, for the first type process chamber, controlling the robot arm to transfer two unoperated wafers in the wafer box for operation each time.

[0033] In the embodiment of the present application, for the first type PM, since both STs can operate, when transferring the unoperated wafers in the wafer box to the first type PM for operation, the robot is controlled to transfer two wafers each time. In special cases, when there is only one unoperated wafer left in the wafer box, the robot is controlled to transfer a single wafer each time.

[0034] It should be noted here that, through the wafer transfer scheduling method of the embodiment of the present application, the second type of process chamber can still be used, which improves the wafer transfer efficiency and equipment capacity. For example, assuming there are 4 PMs, one of the 4 PMs has 1 unusable ST, one PM has 2 unusable STs, and the remaining 2 PMs are normal, that is, there is 1 second type PM and 2 first type PMs. In the related technical solution, only 2 first type PMs are available, that is, 4 STs are available, while in the solution of the embodiment of the present application, in addition to 2 first type PMs, there is 1 second type PM available, that is, 5 STs are available. The number of available STs is increased, and therefore the wafer transfer efficiency and equipment capacity are also improved.

[0035] Further, according to the number of the first type process chambers and the number of the second type process chambers determined in step S102, transmission scheduling can be performed according to the following four situations.

[0036] In the first case, if the number of the first type of process chambers determined in step S102 is zero, and the number of the second type of process chambers is S, and S is greater than zero, then only step S103 is executed, that is, transmission scheduling (i.e., job task allocation) is performed only for the second type of process chambers. Figure 2 As shown, the above step S103 "for the second type process chamber, controlling the robot to transfer the unoperated single wafer in the wafer box to perform the operation each time" may specifically include the following steps:

[0037] S201, traversing S second-type process chambers in sequence, and for each second-type process chamber, controlling a robot arm to transfer an unoperated single wafer to perform an operation.

[0038] In the embodiment of the present application, S second-type PMs are arranged in sequence, starting from the first second-type PM, and the S second-type PMs are traversed in sequence. For each second-type PM, the robot is controlled to transfer the unoperated single wafer to the second-type PM for operation, and after the operation is completed, the robot is controlled to transfer the single wafer back to the wafer box. Those skilled in the art can understand that if the number of wafers in the wafer box is limited (less than S wafers), then during the traversal process, when all the wafers in the wafer box are operated, that is, when the number of unoperated wafers is zero, the transmission operation is stopped, and the transmission scheduling of the untraversed second-type PM is no longer performed.

[0039] S202, the traversal of S second-type process chambers is completed.

[0040] In the embodiment of the present application, if the number of wafers in the wafer box is large (equal to or greater than S wafers), then wait for the traversal of S second-type PMs to be completed.

[0041] S203, determining a second type process chamber with the least remaining operation time among the S second type process chambers as a target process chamber, and waiting for the target process chamber to complete the operation.

[0042] In an embodiment of the present application, if the number of wafers in the wafer box is large (greater than S wafers), and there are still unoperated wafers after traversing S second-type PMs, a new traversal starting point is re-determined: the second-type PM with the least remaining operation time among the S second-type PMs is determined as the target PM (i.e., the new traversal starting point), and the target PM is waited for to complete the operation.

[0043] It should be noted here that, for the second type PM in the non-operating state, the remaining operating time is 0.

[0044] In addition, if there are multiple second-type PMs with the shortest remaining operating time, one of the second-type PMs can be randomly determined as the target PM, or the second-type PM with the highest ranking can be determined as the target PM. The embodiments of the present application do not impose too many restrictions on this.

[0045] S204, starting from the target process chamber, traverse to the last second-type process chamber in order again, and for each second-type process chamber that is not in operation, control the robot arm to transfer the single wafer that is not in operation to operate.

[0046] In the embodiment of the present application, the target PM determined in step S203 is used as a new traversal starting point, and the last (i.e., the Sth) second-type PM is traversed in order. For each second-type PM, the robot is controlled to transfer the unoperated single wafer to the second-type PM for operation, and after the operation is completed, the robot is controlled to transfer the single wafer back to the wafer box. Similarly, if all the wafers in the wafer box are operated during the traversal to the last second-type PM, that is, the number of unoperated wafers is zero, the transmission operation is stopped, and the transmission scheduling of the untraversed second-type PM is no longer performed.

[0047] S205: The traversal is completed. Return to step S203.

[0048] In the embodiment of the present application, if there are a large number of wafers in the wafer box, the traversal is completed. If there are still unoperated wafers after traversing to the last (i.e., the Sth) second type PM and completing the transfer operation, the process returns to step S203 to re-determine a new traversal starting point and perform the next traversal.

[0049] It should be noted here that when the target PM is not the first second-type PM, the second-type PMs scheduled in this traversal process must be less than S.

[0050] In the second case, if the number of the second type process chambers determined in step S102 is zero, and the number of the first type process chambers is P, and P is greater than zero, only step S104 is executed, that is, transmission scheduling (i.e., job task allocation) is performed only for the first type process chambers. Figure 3 As shown, the above step S104 "for the first type of process chamber, controlling the robot to transfer two unoperated wafers in the wafer box to perform operation each time" may specifically include the following steps:

[0051] S301, traversing P first-type process chambers in sequence, and for each first-type process chamber, controlling a robot arm to transfer two unoperated wafers for operation.

[0052] In an embodiment of the present application, P first type PMs are arranged in sequence, starting from the first first type PM, and the P second type PMs are traversed in sequence. For each first type PM, the robot is controlled to transfer two unoperated wafers to the first type PM for operation, and after the operation is completed, the robot is controlled to transfer the two wafers back to the wafer box.

[0053] It should be noted here that when traversing the second type PM in sequence, for each first type PM, if the number of unoperated wafers in the wafer box is equal to or greater than two, the robot is controlled to transfer the two unoperated wafers to the first type PM for operation, and after the operation is completed, the robot is controlled to transfer the two wafers back to the wafer box. If the number of unoperated wafers in the wafer box is one, the robot is controlled to transfer the wafer to the first type PM for operation, and after the operation is completed, the robot is controlled to transfer the wafer back to the wafer box.

[0054] Those skilled in the art will understand that if the number of wafers in the wafer box is limited (less than 2P-2 wafers), then during the traversal process, when all the wafers in the wafer box have been operated, that is, the number of unoperated wafers is zero, the transmission operation is stopped and the transmission scheduling will no longer be performed for the first type PM that has not been traversed.

[0055] S302, the traversal of P first-type process chambers is completed.

[0056] In the embodiment of the present application, if the number of wafers in the wafer box is large (equal to or greater than 2P wafers), then wait for the traversal of P first-type PMs to be completed.

[0057] S303 , determining a first type process chamber with the least remaining operation time among the P first type process chambers as a target process chamber, and waiting for the target process chamber to complete the operation.

[0058] In an embodiment of the present application, if the number of wafers in the wafer box is large (greater than 2P wafers), and there are still unoperated wafers after traversing P first-type PMs, a new traversal starting point is re-determined: the first-type PM with the shortest remaining operation time among the P first-type PMs is determined as the target PM (i.e., the new traversal starting point), and the target PM is waited for to complete the operation.

[0059] It should be noted here that, for the first type PM in the non-operating state, the remaining operating time is 0.

[0060] In addition, if there are multiple first-type PMs with the shortest remaining operating time, one of the first-type PMs can be randomly determined as the target PM, or the first-type PM with the highest ranking can be determined as the target PM. The embodiments of the present application do not impose too many restrictions on this.

[0061] S304, starting from the target process chamber, traverse to the last first-type process chamber in order again, and for each first-type process chamber that is not in operation, control the robot arm to transfer two wafers that are not in operation to perform operation.

[0062] In an embodiment of the present application, the target PM determined in step S303 is used as a new traversal starting point, and the traversal is performed in sequence to the last (i.e., the Pth) first type PM. For each first type PM, if the number of unoperated wafers in the wafer box is equal to or greater than two, the robot is controlled to transfer the two unoperated wafers to the first type PM for operation, and after the operation is completed, the robot is controlled to transfer the two wafers back to the wafer box. If the number of unoperated wafers in the wafer box is one, the robot is controlled to transfer the wafer to the first type PM for operation, and after the operation is completed, the robot is controlled to transfer the wafer back to the wafer box. Similarly, if all the wafers in the wafer box are operated during the traversal to the last first type PM, that is, when the number of unoperated wafers is zero, the transmission operation is stopped, and the transmission scheduling of the first type PM that has not been traversed is no longer performed.

[0063] S305: The traversal is completed. Return to step S303.

[0064] In the embodiment of the present application, if there are a large number of wafers in the wafer box, the traversal is completed. If there are still unoperated wafers after traversing to the last (i.e., the Pth) first type PM and completing the transfer operation, the process returns to step S303 to re-determine a new traversal starting point and perform the next traversal.

[0065] It should be noted here that when the target PM is not the first first-type PM, the number of first-type PMs scheduled in this traversal process must be less than P.

[0066] In the third case, if the number of the second type process chambers determined in step S102 is S, S is greater than zero, and the number of the first type process chambers is P, P is greater than zero, then steps S103 and S104 are executed, i.e., transmission scheduling (i.e., job task allocation) is performed for the second type process chambers and the first type process chambers. Figure 4 As shown, the above steps S103 and S104 "for the second type process chamber, control the robot to transfer the single wafer that is not in operation in the wafer box to perform the operation each time; for the first type process chamber, control the robot to transfer the two wafers that are not in operation in the wafer box to perform the operation each time" may specifically include the following steps:

[0067] S401, traversing P first-type process chambers in sequence, and for each first-type process chamber, controlling a robot arm to transfer two unoperated wafers for operation.

[0068] In the embodiment of the present application, if the number of second type PMs and the number of first type PMs are not zero, the first type PMs are traversed first. The process of traversing P first type PMs in this step can be referred to the relevant description in step S301 of the above embodiment, which will not be repeated here.

[0069] S402, the traversal of P first-type process chambers is completed.

[0070] In the embodiment of the present application, the specific process of this step can refer to the relevant description in step S302 of the above embodiment, which will not be repeated here.

[0071] S403, traversing S second-type process chambers in sequence, and for each second-type process chamber, controlling the robot arm to transfer an unoperated single wafer to perform an operation.

[0072] In the embodiment of the present application, the specific process of this step can refer to the relevant description in step S201 of the above embodiment, which will not be repeated here.

[0073] S404, after the traversal of the S second-type process chambers is completed, the number of unoperated wafers in the wafer box is obtained.

[0074] In the embodiment of the present application, if the number of wafers in the wafer box is large (equal to or greater than 2P+S wafers), then wait for the traversal of S second-type PMs to be completed.

[0075] Considering that a box of wafers generally contains 25 wafers, which is an odd number, or that some wafers have been scrapped in the previous processing steps, resulting in an odd number less than 25 wafers, such as 23 wafers or 21 wafers, the number of unoperated wafers in the wafer box is obtained after the traversal of S second-type process chambers is completed.

[0076] S405, determining a target process chamber according to the number of unoperated wafers in the wafer box, and waiting for the target process chamber to complete the operation to perform a corresponding transfer action.

[0077] In the embodiment of the present application, the process chamber to be scheduled and the scheduling method are determined according to the number of unoperated wafers in the wafer box. Specifically, this step may include the following steps:

[0078] S4051, if the number of unoperated wafers in the wafer box is greater than two, the first-type process chamber with the least remaining operation time among the P first-type process chambers is determined as the target process chamber, and the target process chamber is waited for to complete the operation; starting from the target process chamber, the process is traversed in order to the last first-type process chamber again, and for each first-type process chamber that is not in operation, the robot is controlled to transfer the two unoperated wafers for operation, and the traversal is waited for completion. Return to step S403.

[0079] In the embodiment of the present application, if the number of unoperated wafers in the wafer box is greater than two, a new traversal starting point is re-determined in the P first-type process chambers, and a traversal process is performed, and after the traversal is completed, the second-type process chamber is traversed. The specific process of this step can be referred to the relevant description in the above steps S303 and S304, which will not be repeated here.

[0080] S4052, if the number of unoperated wafers in the wafer box is two, determine the first type process chamber with the least remaining operation time among the P first type process chambers as the target process chamber; wait for the target process chamber to complete the operation; control the robot to transfer the two wafers to the target process chamber for operation.

[0081] In an embodiment of the present application, if the number of unoperated wafers in the wafer box is two, then one of P first-type process chambers is selected for operation: the process chamber with the least remaining operation time among the P first-type process chambers is selected, and after the process chamber completes the operation, the robot is controlled to transfer the two wafers to the process chamber for operation, and after the operation is completed, the robot is controlled to transfer the two wafers back to the wafer box.

[0082] S4053, if the number of unoperated wafers in the wafer box is one, the process chamber with the least remaining operation time among the P first-type process chambers and the S second-type process chambers is determined as the target process chamber; wait for the target process chamber to complete the operation; control the robot to transfer the wafer to the target process chamber for operation.

[0083] In an embodiment of the present application, if the number of unoperated wafers in the wafer box is one, then one of P first-type process chambers and S second-type process chambers is selected for operation: the process chamber with the least remaining operation time among the P first-type process chambers and the S second-type process chambers is selected, and after the process chamber completes the operation, the robot is controlled to transfer the wafer to the process chamber for operation, and after the operation is completed, the robot is controlled to transfer the wafer back to the wafer box.

[0084] In a fourth case, if the number of the second type process chambers determined in step S102 is zero and the number of the first type process chambers is also zero, the following steps are performed: outputting an alarm message for prompting the user that there is no operable process chamber.

[0085] Furthermore, the second and third cases mentioned above can be combined and processed as follows:

[0086] If the number of first-type process chambers determined in step S102 is P, and P is greater than zero, the number of second-type process chambers is not considered first, and step S104 is executed, that is, transmission scheduling (i.e., job task allocation) is performed for the first-type process chambers first. After the traversal of P first-type process chambers is completed, it is determined based on the number of second-type process chambers whether to execute step S103, that is, whether to perform transmission scheduling (i.e., job task allocation) for the second-type process chambers. Figure 5 As shown, the following steps may be specifically included:

[0087] S501, if the number of first-type process chambers is P, and P is greater than zero, then the P first-type process chambers are traversed in sequence, and for each first-type process chamber, the robot is controlled to transfer two unoperated wafers for operation.

[0088] S502, the traversal of P first-type process chambers is completed.

[0089] If the number of the second type process chambers is S and S is greater than zero, then step S503 is performed. If the number of the second type process chambers is zero, then step S506 is performed.

[0090] S503, traversing S second-type process chambers in sequence, and for each second-type process chamber, controlling the robot arm to transfer an unoperated single wafer to perform an operation.

[0091] S504, after the traversal of the S second-type process chambers is completed, the number of unoperated wafers in the wafer box is obtained.

[0092] S505, determining a target process chamber according to the number of unoperated wafers in the wafer box, and waiting for the target process chamber to complete the operation to perform a corresponding transfer action.

[0093] S506 , determining a first type process chamber with the least remaining operation time among the P first type process chambers as a target process chamber, and waiting for the target process chamber to complete the operation.

[0094] S507, starting from the target process chamber, traverse to the last first-type process chamber in order again, and for each first-type process chamber that is not in operation, control the robot arm to transfer two wafers that are not in operation to perform operation.

[0095] S508: The traversal is completed. Return to step S506.

[0096] In summary, the wafer transfer scheduling method of the embodiment of the present application, when scheduling wafer transfer of wafers in a wafer box, obtains the operable status of two operating positions in the process chamber corresponding to the wafer box to be scheduled, and if the number of first-type process chambers is P, and P is greater than zero, then the P first-type process chambers are traversed in sequence, and for each first-type process chamber, the robot is controlled to transfer the two unoperated wafers in the wafer box for operation. The first-type process chamber is a process chamber in which the operable status of the two operating positions are both operable. P first-type process chambers After the traversal of the process chambers is completed, if the number of second-type process chambers is S and S is greater than zero, the S second-type process chambers are traversed in sequence. For each second-type process chamber, the robot is controlled to transfer the unoperated single wafer for operation. The second-type process chamber is a process chamber with only one operating position in an operable state. After the traversal of the S second-type process chambers is completed, the target process chamber is determined according to the number of unoperated wafers in the wafer box, and the target process chamber is waited for to complete the operation to perform the corresponding transfer action. The embodiment of the present application identifies the first type of process chamber and the second type of process chamber by identifying the operable state of two operating positions in each process chamber. For each transmission of a single wafer that is not in operation by the second type of process chamber, for each transmission of two wafers that are not in operation by the first type of process chamber, when there is only one wafer that is not in operation, a single wafer is transmitted, and a single method of transmitting two wafers each time is no longer adopted. When one of the operating positions ST in a process chamber PM cannot operate, the entire PM (i.e., the second type of process chamber) where the ST that cannot operate is located can still be used, thereby improving the efficiency of wafer transmission and the production capacity of the equipment. According to the number of the first type of process chamber and the second type of process chamber, different wafer transmission scheduling schemes are executed to further ensure the efficiency of wafer transmission. When the number of the first type of process chamber and the second type of process chamber is not zero, the first type of process chamber is traversed first, which further ensures the efficiency of wafer transmission. When the new traversal starting point is re-determined after the traversal is completed, the process chamber with the least remaining process time is selected to further ensure the efficiency of wafer transmission. When the number of unoperated wafers is two, the first type process chamber with the least remaining process time is selected for operation. When the number of unoperated wafers is one, the process chamber with the least remaining process time between the first type process chamber and the second type process chamber is selected for operation, further ensuring the wafer transfer efficiency.

[0097] To clearly illustrate the transmission scheduling method of the present application embodiment, the following is combined with Figure 6 A feasible implementation method of the overall process of the transmission scheduling method of the embodiment of the present application (corresponding to the above four situations) is described in detail. Figure 6 As shown, the transmission scheduling method of the embodiment of the present application may specifically include the following steps:

[0098] S601, executing the wafer box scanning function to obtain the number W of wafers in the wafer box.

[0099] S602, reading the number N of PMs that are allowed to operate on the wafers in the wafer box in the wafer path setting.

[0100] S603, let the PM serial number n=1, the number of second type PMs S=0, and the number of first type PMs P=0.

[0101] S604, determine whether there is an unusable ST in the nth PM. If not, execute step S605. If yes, execute step S606.

[0102] S605, n=n+1, P=P+1. Execute step S609.

[0103] S606, determine whether two STs in the nth PM cannot be used at the same time. If not, execute step S607. If yes, execute step S608.

[0104] S607, n=n+1, S=S+1. Execute step S609.

[0105] S608, n=n+1. Execute step S609.

[0106] S609, determine whether n=N. If yes, execute step S610. If no, return to step S604.

[0107] It should be noted here that the purpose of the above steps S603-S609 is to determine the number of second type PMs and the number of first type PMs among the N PMs.

[0108] S610, let the number of operated wafers w = 0, the serial number of the first type PM p = 1, and the serial number of the second type PM s = 1. Continue to execute step S611.

[0109] S611, determine whether S=0 and whether P=0.

[0110] If P=0 and S is greater than 0, step S612 is executed (corresponding to the first case in the above embodiment).

[0111] If P is greater than 0, S=0, then step S618 is executed (corresponding to the second case in the above embodiment).

[0112] If P is greater than 0 and S is greater than 0, step S627 is executed (corresponding to the third case in the above embodiment).

[0113] If P=0, S=0, then execute step S646 (corresponding to the fourth case in the above embodiment).

[0114] S612, determine whether the sth second type PM is operating. If not, execute step S613. If yes, execute step S615.

[0115] S613, transfer the unoperated wafer to the s-th second type PM for operation, and w = w + 1. Continue to step S614.

[0116] S614, determine whether w=W. If yes, execute step S646. If no, execute step S615.

[0117] S615, s=s+1. Continue to step S616.

[0118] S616, determine whether s>S. If not, return to step S612. If yes, execute S617.

[0119] S617, assign the value s to the PM with the least remaining operation time among the S second type PMs, and wait for the PM to complete the operation. Execute step S612.

[0120] S618, determine whether the pth first type PM is operating. If not, execute step S619. If yes, execute step S624.

[0121] S619, determine whether Ww≥2. If yes, execute step S620. If no, execute step S621.

[0122] S620, transfer two unoperated wafers to the pth first type PM for operation, and w=w+2. Execute step S623.

[0123] S621, determine whether Ww=1. If yes, execute step S622. If no, execute step S646.

[0124] S622, transfer the unoperated wafer to the pth first type PM for operation, and w = w + 1. Execute step S646.

[0125] S623, determine whether w=W. If yes, execute step S646. If no, execute step S624.

[0126] S624, p=p+1. Continue to step S625.

[0127] S625, determine whether p>P. If not, return to step S618. If yes, execute S626.

[0128] S626, assign the value p to the PM with the least remaining operation time among the P first-type PMs, and wait for the PM to complete the operation. Return to step S618.

[0129] S627, determine whether the pth first type PM is operating. If not, execute step S628. If yes, execute step S633.

[0130] S628, determine whether the number of unoperated wafers Ww≥2. If yes, execute step S629. If no, execute step S630.

[0131] S629, transfer two unoperated wafers to the pth first type PM for operation, and w=w+2. Execute step S632.

[0132] S630, determine whether Ww=1. If yes, execute step S631. If no, execute step S646.

[0133] S631, transfer a single unoperated wafer to the pth first type PM for operation, and w=w+1. Execute step S646.

[0134] S632, determine whether w=W. If yes, execute step S646. If no, execute step S633.

[0135] S633, p=p+1. Continue to step S634.

[0136] S634, determine whether p>P. If not, return to step S627. If yes, execute S635.

[0137] S635, determine whether s>S. If not, execute step S636. If yes, execute S640.

[0138] S636, determine whether the sth second type PM is operating. If not, execute step S637. If yes, execute step S639.

[0139] S637, transfer the unoperated wafer to the s-th second type PM for operation, and w = w + 1. Continue to step S638.

[0140] S638, determine whether w=W. If yes, execute step S646. If no, execute step S639.

[0141] S639, s=s+1. Return to step S635.

[0142] S640, determine whether Ww≤2. If not, execute step S641. If yes, execute step S642.

[0143] S641, assign the value p to the PM with the least remaining operation time among the P first-type PMs, and wait for the PM to complete the operation. Execute step S627.

[0144] S642, determine whether Ww=1. If yes, execute step S643. If no, execute step S644.

[0145] S643, wait for the PM with the least remaining operation time among the S second type PMs and the P first type PMs to complete the operation, and transfer the single unoperated wafer to the PM for operation. Execute step S646.

[0146] S644, wait for the PM with the least remaining operation time among the P first-type PMs to complete the operation, and transfer the two unoperated wafers to the PM for operation. Execute step S646.

[0147] S645, output an alarm message to prompt the user that there is no workable PM.

[0148] S646, ending the film transmission scheduling process.

[0149] The present application also provides a semiconductor process equipment. Figure 7 As shown, the semiconductor process equipment 700 includes:

[0150] There is at least one process chamber 400 , and each process chamber 400 includes two working positions.

[0151] The wafer transfer device 300 is used to transfer unoperated wafers to the operating positions of each process chamber 400 .

[0152] The robot module includes an atmospheric robot 110 located in the loading and unloading module 100 and a vacuum robot 310 located in the wafer transfer device 300 .

[0153] The semiconductor process equipment 700 of the embodiment of the present application also includes: a controller (not shown), the controller includes at least one processor and at least one memory, the memory stores a computer program, and when the computer program is executed by the processor, it implements the chip transmission scheduling method shown in any of the above embodiments.

[0154] It should be noted here that the controller may be arranged in a lower computer (not shown) and / or an upper computer (not shown) of the semiconductor process equipment 700, and the lower computer and the upper computer are communicatively connected.

[0155] Furthermore, the semiconductor process equipment 700 of the embodiment of the present application further includes: a load lock module 200, which is disposed between the loading and unloading module 100 and the wafer transfer device 300, and is used for switching between a vacuum environment and an atmospheric environment.

[0156] The semiconductor process equipment of the embodiment of the present application identifies the first type process chamber and the second type process chamber by identifying the operable state of two operating positions in each process chamber. For each transmission of a single wafer that is not in operation by the second type process chamber, for each transmission of two wafers that are not in operation by the first type process chamber, when there is only one wafer that is not in operation, a single wafer is transmitted, and no longer a single method of transmitting two wafers each time is adopted, so that when one of the operating positions ST in a process chamber PM cannot operate, the entire PM (i.e., the second type process chamber) where the ST that cannot operate is located can still be used, thereby improving the efficiency of wafer transmission and the production capacity of the equipment. According to the number of the first type process chamber and the second type process chamber, different wafer transmission scheduling schemes are executed to further ensure the efficiency of wafer transmission. When the number of the first type process chamber and the second type process chamber is not zero, the first type process chamber is traversed first, which further ensures the efficiency of wafer transmission. When the new traversal starting point is re-determined after the traversal is completed, the process chamber with the least remaining process time is selected to further ensure the efficiency of wafer transmission. When the number of unoperated wafers is two, the first type process chamber with the least remaining process time is selected for operation. When the number of unoperated wafers is one, the process chamber with the least remaining process time between the first type process chamber and the second type process chamber is selected for operation, further ensuring the wafer transfer efficiency.

[0157] An embodiment of the present application also proposes a readable storage medium, on which one or more computer programs are stored. The one or more computer programs include instructions. When the program or instructions are executed by a processor in a semiconductor process equipment including multiple application programs, the processor in the semiconductor process equipment can execute the various processes of the above-mentioned chip scheduling method embodiment, and is specifically used to execute the steps of any of the above-mentioned chip scheduling method embodiments.

[0158] The readable storage medium of the embodiment of the present application identifies the first type process chamber and the second type process chamber by identifying the operable state of two operating positions in each process chamber. For each transmission of a single wafer that is not operated by the second type process chamber, for each transmission of two wafers that are not operated by the first type process chamber, when there is only one wafer that is not operated, a single wafer is transmitted, and a single method of transmitting two wafers each time is no longer adopted, so that when one of the operating positions ST in a process chamber PM cannot operate, the entire PM (i.e., the second type process chamber) where the ST that cannot operate is located can still be used, thereby improving the efficiency of film transmission and the production capacity of the equipment. According to the number of the first type process chamber and the second type process chamber, different film transmission scheduling schemes are executed to further ensure the efficiency of film transmission. When the number of the first type process chamber and the second type process chamber is not zero, the first type process chamber is traversed first, which further ensures the efficiency of film transmission. When the new traversal starting point is re-determined after the traversal is completed, the process chamber with the least remaining process time is selected to further ensure the efficiency of film transmission. When the number of unoperated wafers is two, the first type process chamber with the least remaining process time is selected for operation. When the number of unoperated wafers is one, the process chamber with the least remaining process time between the first type process chamber and the second type process chamber is selected for operation, further ensuring the wafer transfer efficiency.

[0159] The systems, devices, modules or units described in the above embodiments may be implemented by computer chips or entities, or by products with certain functions. A typical implementation device is a computer. Specifically, the computer may be, for example, a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

[0160] For the convenience of description, the above device is described in various units according to their functions. Of course, when implementing the present application, the functions of each unit can be implemented in the same or multiple software and / or hardware.

[0161] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0162] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0163] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0164] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0165] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0166] The memory may include non-permanent storage in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.

[0167] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.

[0168] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.

[0169] The present application may be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. The present application may also be practiced in distributed computing environments where tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules may be located in local and remote computer storage media, including storage devices.

[0170] Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0171] The above are only embodiments of the present application and are not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included within the scope of the claims of the present application.

Claims

1. A wafer transmission scheduling method, applicable to a semiconductor process equipment having at least one process chamber, wherein the process chamber has two operating positions. It is characterized in that include: Acquire the operable status of the two operating positions in the process chamber corresponding to the wafer box to be scheduled; If the number of the first type process chambers is P, and P is greater than zero, the P first type process chambers are sequentially traversed, and for each of the first type process chambers, the robot is controlled to transfer two unoperated wafers in the wafer box for operation; The first type of process chamber is a process chamber in which both of the two operating positions are in an operable state; After the traversal of the P first-type process chambers is completed, if the number of the second-type process chambers is S, and S is greater than zero, the S second-type process chambers are traversed in sequence, and for each of the second-type process chambers, the robot is controlled to transfer an unoperated single wafer to perform an operation; The second type of process chamber is a process chamber in which only one of the operation positions is in an operable state; After the traversal of the S second-type process chambers is completed, the target process chamber is determined according to the number of unoperated wafers in the wafer box, and the target process chamber is waited to complete the operation to perform the corresponding transfer action.

2. The method according to claim 1, It is characterized in that The step of determining a target process chamber according to the number of unoperated wafers in the wafer box, and waiting for the target process chamber to complete the operation to perform a corresponding transfer action includes: If the number of unoperated wafers in the wafer box is one, the process chamber with the least remaining operation time among the P first-type process chambers and the S second-type process chambers is determined as the target process chamber, and the target process chamber is waited for to complete the operation, and the robot is controlled to transfer the wafer to the target process chamber for operation.

3. The method according to claim 1, It is characterized in that The step of determining a target process chamber according to the number of unoperated wafers in the wafer box, and waiting for the target process chamber to complete the operation to perform a corresponding transfer action includes: If the number of unoperated wafers in the wafer box is two, the first type process chamber with the least remaining operation time among the P first type process chambers is determined as the target process chamber, and the target process chamber is waited for to complete the operation, and the robot is controlled to transfer the two wafers to the target process chamber for operation.

4. The method according to claim 1, It is characterized in that The step of determining a target process chamber according to the number of unoperated wafers in the wafer box, and waiting for the target process chamber to complete the operation to perform a corresponding transfer action includes: If the number of unoperated wafers in the wafer box is greater than two, the first-type process chamber with the least remaining operation time among the P first-type process chambers is determined as the target process chamber, and the target process chamber is waited to complete the operation; Starting from the target process chamber, traverse in sequence again to the last first-type process chamber, for each first-type process chamber that is not in operation, control the robot to transfer two unoperated wafers for operation, and after the traversal is completed, return to the step of traversing the S second-type process chambers in sequence.

5. The method according to claim 1, It is characterized in that Also includes: After the traversal of the P first-type process chambers is completed, if the number of the second-type process chambers is zero, the first-type process chamber with the least remaining operation time among the P first-type process chambers is determined as the target process chamber, and the target process chamber is waited for to complete the operation; Starting from the target process chamber, traverse again in order to the last first-type process chamber, for each first-type process chamber that is not in operation, control the robot to transfer two non-operating wafers for operation, and after the traversal is completed, return to the first-type process chamber with the least remaining operation time among the P first-type process chambers, and determine it as the target process chamber step.

6. The method according to any one of claims 1 to 5, It is characterized in that When the first type process chambers are traversed in sequence, for each of the first type process chambers that are not in operation, controlling the robot to transfer two wafers that are not in operation to perform operation includes: For each of the first type process chambers that are not in operation, if the number of wafers that are not in operation is equal to or greater than two, the robot arm is controlled to transfer the two wafers that are not in operation for operation.

7. The method according to claim 6, It is characterized in that When the first type process chambers are traversed in sequence, for each of the first type process chambers that are not in operation, controlling the robot to transfer two wafers that are not in operation to perform operation further includes: If the number of unoperated wafers is one, the robot is controlled to transfer the wafer for operation.

8. The method according to claim 1, It is characterized in that Also includes: If the number of the first-type process chambers is zero, and the number of the second-type process chambers is S, and S is greater than zero, the S second-type process chambers are sequentially traversed, and for each second-type process chamber, the robot is controlled to transfer an unoperated single wafer to perform an operation; After the traversal of the S second-type process chambers is completed, the second-type process chamber with the least remaining operation time among the S second-type process chambers is determined as the target process chamber, and the target process chamber is waited for to complete the operation; Starting from the target process chamber, traverse again in order to the last second-type process chamber, for each second-type process chamber that is not in operation, control the robot to transfer the non-operating single wafer for operation, and after the traversal is completed, return to the second-type process chamber with the least remaining operation time among the S second-type process chambers, and determine it as the target process chamber step.

9. The method according to claim 1, It is characterized in that Also includes: If the number of the second-type process chambers is zero and the number of the first-type process chambers is zero, an alarm message is outputted to prompt the user that there is no operable process chamber.

10. A semiconductor process equipment, It is characterized in that include: at least one process chamber, each of the process chambers having two working positions; A wafer transfer device, used for transferring unoperated wafers to the operating positions of the respective process chambers; A controller, wherein the controller includes at least one processor and at least one memory, wherein a computer program is stored in the memory, and when the computer program is executed by the processor, the film transmission scheduling method as described in any one of claims 1 to 9 is implemented.

Citation Information

Patent Citations

  • Material conveying method and semiconductor process equipment

    CN114373699A

  • Wafer scheduling control method and device under abnormal working condition of semiconductor processing equipment

    CN115116909A

  • Scheduling method and device of semiconductor processing equipment and semiconductor processing equipment

    CN116190277A

  • A method and device for optimized dispatch of wafer

    WO2009089715A1

  • Process starting method, process scheduling method, electronic device, storage medium, and process device

    WO2024140517A1