Scheduling method and related device

By judging the chip conditions based on the release time of the process chamber and the time threshold of the unscheduled wafer in the semiconductor process equipment, the process path is generated, and the deadlock problem caused by the wafer occupancy module in the equipment is solved, and production efficiency and fault tolerance are improved. Rate.

CN118919444APending Publication Date: 2024-11-08BEIJING NAURA MICROELECTRONICS EQUIP CO LTD
View PDF 0 Cites 3 Cited by

Patent Information

Application Number
CN202410946959.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-15
Publication Date
2024-11-08

AI Technical Summary

Technical Problem

The fault tolerance of wafer scheduling technology in semiconductor process equipment is low, which is prone to deadlock problems. In the event of abnormal equipment modules, the production efficiency is reduced due to the wafer occupying a large number of modules.

Method used

In the semiconductor process equipment, whether the wafer can be output can be determined based on the release time of the process chamber and the time threshold of the unscheduled wafer is generated to control the wafer output rhythm, reduce the probability of deadlock and improve production efficiency .

Benefits of technology

It effectively reduces the probability of deadlock of semiconductor process equipment, improves the fault tolerance of scheduling methods, reduces the idle time of the process chamber, and improves the working efficiency of the equipment.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118919444A_ABST
    Figure CN118919444A_ABST
Patent Text Reader

Abstract

According to the scheduling method provided by the embodiment of the invention, in the generation process of the process path, the process path corresponding to the unscheduled wafer is generated only when it is judged that the unscheduled wafer can be discharged, and the unscheduled wafer is scheduled based on the process path, so that rhythm control of generating the process path for the unscheduled wafer is realized, and the scheduling efficiency is improved. The probability of deadlock caused by the fact that many wafers in the device occupy a large number of device modules when a certain device module of the semiconductor process device is abnormal is reduced, and the error-tolerant rate of the scheduling method is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present specification relates to the field of semiconductor technology, specifically, to wafer scheduling technology under the field of semiconductor technology, and more specifically, to a scheduling method and related devices. Background Art

[0002] Semiconductor process equipment is a type of equipment used for semiconductor wafer manufacturing. Semiconductor process equipment may include modules such as an alignment module (Aligner), a robot, a vacuum lock (LoadLock), a wafer loading and unloading position (LoadPort) and multiple process chambers (Process Chamber). Semiconductor process equipment can be used to achieve automatic processing and circulation of wafers.

[0003] In order to improve the working efficiency of semiconductor process equipment, semiconductor process equipment can be used to process multiple wafers in parallel. However, the current scheduling technology for wafers in semiconductor process equipment has a low fault tolerance rate and is prone to deadlock problems. Summary of the invention

[0004] The embodiments of this specification provide a scheduling method and related devices to achieve the purpose of improving the fault tolerance of the scheduling method.

[0005] To achieve the above technical objectives, the embodiments of this specification provide the following technical solutions:

[0006] In a first aspect, an embodiment of the present specification provides a scheduling method, which is applied to a host computer of a semiconductor process equipment, wherein the semiconductor process equipment further includes a slave computer and a plurality of process chambers, and the scheduling method includes:

[0007] Based on a first material list corresponding to the process chamber and the status of the wafers that have been discharged in the first material list, a release time corresponding to the process chamber is obtained, wherein the first material list is used to store the wafers that have been discharged in the semiconductor process equipment, and the target chamber is the process chamber; the release time corresponding to the process chamber represents the time required for the last wafer that has been discharged in the first material list to be processed in the process chamber; the status of the wafer that has been discharged is used to represent the position and process status of the wafer that has been discharged in the semiconductor process equipment;

[0008] Based on the release time corresponding to the process chamber and the time threshold corresponding to the unscheduled wafer in the second material list, determine whether the unscheduled wafer can be discharged; when it is determined that the unscheduled wafer can be discharged, determine the unscheduled wafer as a wafer to be scheduled, and generate a process path corresponding to the wafer to be scheduled based on the scheduling algorithm; the second material list includes multiple unscheduled wafers, and the time threshold represents the time required for the unscheduled wafer to be discharged from the process chamber to the target chamber corresponding to the unscheduled wafer.

[0009] In a second aspect, an implementation of this specification provides a scheduling device, including: a processor and a memory;

[0010] Wherein, the memory is connected to the processor, and the memory is used to store a computer program;

[0011] The processor is used to implement any of the scheduling methods described above by running the computer program stored in the memory.

[0012] In a third aspect, an embodiment of the present specification provides a semiconductor process equipment, including: a host computer, a slave computer and a plurality of process chambers; wherein,

[0013] The upper computer is configured to generate a process path for the wafer to be scheduled based on any of the scheduling methods described above, and generate a process action based on the process path and send it to the lower computer;

[0014] The lower computer is configured to receive and execute the process action.

[0015] In a fourth aspect, an embodiment of the present specification further provides a computing device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the scheduling method as described above when executing the computer program.

[0016] In a fifth aspect, an embodiment of the present specification further provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the scheduling method as described above is implemented.

[0017] In a sixth aspect, an embodiment of the present specification provides a computer program product or a computer program, wherein the computer program product includes a computer program, and the computer program is stored in a computer-readable storage medium; the processor of the computer device reads the computer program from the computer-readable storage medium, and the processor implements the steps of the above-mentioned scheduling method when executing the computer program.

[0018] It can be seen from the above technical scheme that the scheduling method provided in the embodiment of this specification generates a process path for the unscheduled wafer in the second material list, first based on the first material list corresponding to the process chamber and the state of the wafer that has been discharged, obtain the release time corresponding to the process chamber, and then based on the release time corresponding to the process chamber and the time threshold corresponding to the unscheduled wafer, determine whether the unscheduled wafer can be discharged, and in the case that the unscheduled wafer can be discharged, the unscheduled wafer is determined as a wafer to be scheduled, and a process path corresponding to the wafer to be scheduled is generated based on the scheduling algorithm, so that the upper computer can generate a specific execution action based on the process path and send it to the lower computer to indicate that the lower computer can perform discharge and subsequent scheduling actions on the wafer to be scheduled based on the execution action. In the process of generating the process path, only when it is determined that the unscheduled wafer can be discharged, the process path corresponding to the unscheduled wafer is generated, so that it can be scheduled based on the process path, and the rhythm control of the process path generated by the unscheduled wafer is realized, and the probability of deadlock caused by more wafers occupying a large number of equipment modules in the equipment when a certain equipment module of the semiconductor process equipment is abnormal is reduced, and the fault tolerance of the scheduling method is improved.

[0019] In addition, in the scheduling method, the release time corresponding to the process chamber represents the time required for the last wafer in the first material list to be processed in the process chamber, and the time threshold corresponding to the unscheduled wafer represents the time required for the unscheduled wafer to arrive at the process chamber corresponding to the unscheduled wafer from the time of being discharged. In this way, based on the release time corresponding to the process chamber and the time threshold corresponding to the unscheduled wafer, it is possible to more reasonably judge whether the unscheduled wafer can be discharged. For example, once the release time corresponding to the process chamber is less than the time threshold corresponding to the unscheduled wafer, it can be determined that the unscheduled wafer can be discharged, so that when the unscheduled wafer arrives at the process chamber based on the corresponding process path, the process chamber has just become available, which is beneficial to reduce the idle time of the process chamber and improve the working efficiency of semiconductor process equipment. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] In order to more clearly illustrate the embodiments of this specification or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of this specification. For ordinary technicians in this field, other drawings can be obtained based on the provided drawings without paying creative work.

[0021] Figure 1 It is a structural schematic diagram of a semiconductor process equipment;

[0022] Figure 2 A flowchart of a scheduling method provided for one embodiment of this specification;

[0023] Figure 3 A schematic diagram of software and hardware modules related to wafer scheduling in a host computer and a slave computer provided for one embodiment of this specification;

[0024] Figure 4 A schematic diagram of the distribution of wafers in a semiconductor process equipment provided for one embodiment of this specification;

[0025] Figure 5 A schematic diagram of the structure of a computing device provided for one embodiment of the present specification. DETAILED DESCRIPTION

[0026] Unless otherwise defined, the technical terms or scientific terms used in the embodiments of this specification shall have the common meanings understood by persons with ordinary skills in the field to which this specification belongs. The words "first", "second" and similar words used in the embodiments of this specification do not indicate any order, quantity or importance, but are only used to avoid confusion of constituent elements.

[0027] Unless the context requires otherwise, throughout the specification, "plurality" means "at least two", and "including" is interpreted as an open, inclusive meaning, that is, "including, but not limited to". In the description of the specification, the terms "one embodiment", "some embodiments", "exemplary embodiments", "examples", "specific examples" or "some examples" are intended to indicate that a particular feature, structure, material or characteristic associated with the embodiment or example is included in at least one embodiment or example of the specification. The schematic representation of the above terms does not necessarily refer to the same embodiment or example.

[0028] The technical solutions in the embodiments of this specification will be described below in conjunction with the drawings in the embodiments of this specification. Based on the embodiments in this specification, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this specification.

[0029] Overview

[0030] refer to Figure 1 , taking cluster equipment as an example, Figure 1 The structure diagram of a semiconductor process equipment is shown, and the semiconductor process equipment may include a first robot 10, a second robot 20, a wafer loading and unloading position 21, a calibration module 22, a cooling plate 23, a buffer module 24, a vacuum lock 25 and a plurality of process chambers 11; wherein,

[0031] Each wafer loading and unloading position 21 can hold a wafer box, and each wafer box can hold multiple wafers.

[0032] The calibration module 22 may include a slot, and the calibration module 22 may calibrate the wafer placed in the slot.

[0033] Processing chamber 11 (Processing Module), each process chamber 11 may have a slot, which can hold a wafer for processing.

[0034] The cooling plate 23 (Cooler) is used to cool the wafer after processing.

[0035] The first robot 10 can be a double-arm robot. The two arms of the double-arm robot can be 180° and fixed. Each arm has a slot, and each slot can hold a wafer. Generally, the two arms cannot perform wafer picking and placing operations at the same time; the first robot 10 is responsible for transporting wafers between the vacuum lock 25 and multiple process chambers 11.

[0036] The vacuum lock (LoadLock) 25 may have two slots, each slot may hold a wafer, and the vacuum lock 25 may switch between atmospheric state and vacuum state, wherein when the vacuum lock state is switched to atmospheric state, the wafer located on the side of the second robot 20 may be sent into the vacuum lock 25; when the vacuum lock 25 is switched to vacuum state, the wafer located on the side of the first robot 10 may be sent into the vacuum lock 25. The second robot 20 may be a single-arm robot, and the second robot 20 may have one slot, which may hold a wafer, and the second robot 20 may be responsible for transporting wafers between the wafer loading and unloading position 11, the calibration module 22 and the vacuum lock 25.

[0037] The buffer module (Buffer) 24, also known as a material buffer, can load multiple wafers and can be used to prevent the wafer loading and unloading position 21 from storing both processed wafers and unprocessed wafers.

[0038] Understandably, Figure 1 The following is only used to exemplify the feasible structure of the semiconductor process equipment. In other embodiments, the semiconductor process equipment may include more or fewer types of equipment modules. For example, some semiconductor process equipment may include a first robot 10, a second robot 20, a wafer loading and unloading position 21, a calibration module 22, a cooling plate 23, a buffer module 24, a vacuum lock 25 and at least some equipment modules in multiple process chambers 11; the number of equipment modules of the same type included in the semiconductor process equipment may also be different, for example, in Figure 1In the semiconductor process equipment shown, the number of wafer loading and unloading positions 21 is 3, the number of buffer modules 24 is 4, the number of vacuum locks 25 is 2, and the number of process chambers 11 is 4. However, in other embodiments, the number of wafer loading and unloading positions 21 of the semiconductor process equipment can be 2 or 4, etc., the number of buffer modules 24 can be 6 or 8, etc., the number of vacuum locks 25 can be 3 or 4, etc., and the number of process chambers 11 can be 6 or 8, etc. This specification does not limit this, and it depends on the actual situation.

[0039] The process route of a wafer refers to the path and time required for a wafer to pass through a semiconductor process device, which is determined based on the process recipe corresponding to the wafer. For example, it may include multiple equipment modules that the wafer passes through in the semiconductor process device and the process time required for the wafer to pass through each equipment module. The process route can be generated by a scheduling algorithm based on the process recipe. For example, the wafer process route may include: wafer loading and unloading position -> second robot (3 seconds) -> calibration module (1 second) ->

[0040] Second robot (3 seconds) -> vacuum lock (3 seconds) -> first robot (3 seconds) -> first process chamber (60 seconds) -> first robot (3 seconds) -> second process chamber (120 seconds) -> first robot (3 seconds) -> third process chamber (60 seconds) -> first robot (3 seconds) -> fourth process chamber (60 seconds) -> first robot (3 seconds) -> vacuum lock (3 seconds) -> second robot (3 seconds) -> cooling plate (1 second) -> second robot (3 seconds) -> wafer loading and unloading position, where each step passes through the device Each standby module can be called a process node. The wafer consumes time in the process of each process node. The time marked in brackets can be the time required for the process node. The wafer can be processed in parallel or serially in multiple process chambers 11. In the above process path example, if the first process chamber to the fourth process chamber are all different process chambers, the above process path can be called a serial process path; if there are at least two identical process chambers 11 in the first process chamber to the fourth process chamber, the above process path can be called a re-entrant process path. In addition to the serial process path and the re-entrant process path, if there are multiple selectable process chambers 11 for a certain process node, the process path can be called a parallel process path.

[0041] When the process time required for the wafer in the process chamber is relatively long (for example, in the example provided above, the process time of the wafer in the process chamber is significantly longer than the time required for the wafer in the handling step (for example, the step in which the robot grabs the wafer from each equipment module)), the process path corresponding to the wafer can be called a long process time path, and when the process time required for the wafer in the process chamber is relatively short (for example, assuming that the process time of the wafer in the process chamber is similar to the duration of the handling step, for example, in the above example, when the process time of the wafer in the process chamber is 10 seconds or less, the process time of the wafer in the process chamber is not significantly or much longer than the time required for the wafer handling step), the process path corresponding to the wafer can be called a short process time path.

[0042] During the wafer scheduling process, the upper computer of the semiconductor process equipment can use the scheduling algorithm to generate a corresponding process path for each wafer, and generate an execution action based on the process path and the status of the wafer in the semiconductor process equipment and send it to the lower computer. The lower computer can execute the corresponding action on the wafer based on the execution action.

[0043] In the related art, the host computer puts all the wafers in the wafer loading and unloading position into the list of materials to be scheduled, and generates process paths corresponding to each wafer for all the wafers in the list of materials to be scheduled, generates execution actions according to the process paths corresponding to each wafer, and sends them to the lower computer to instruct the lower computer to perform wafer extraction (i.e., the action of grabbing the wafer in the wafer loading and unloading position to the second manipulator, which can also be called wafer extraction) or other actions in the process path. This method will maximize the efficiency of wafer scheduling by semiconductor process equipment, because the host computer will generate process paths for all wafers to be scheduled, so that the host computer can schedule multiple wafers to be scheduled in parallel, and the equipment modules in the semiconductor process equipment can be fully utilized. However, the inventors have discovered that in this case, on the one hand, the host computer needs to generate process paths for a large number of wafers, which results in a large amount of calculation required to generate the process paths and a long calculation time; on the other hand, once an abnormality occurs in a device module (such as a process chamber) in the semiconductor process equipment, the lower computer will again request the host computer to recalculate the process paths of each wafer. At this time, if the various device modules in the semiconductor process equipment are too full with wafers, a feasible process path may not be obtained through recalculation, resulting in a deadlock.

[0044] In order to solve this problem, the inventors discovered through research that the rhythm of the unscheduled wafer generation process path can be controlled. For example, the time interval between adjacent unscheduled wafer generation process paths can be increased to achieve control of the wafer output (or wafer extraction) rhythm of the unscheduled wafers, thereby avoiding the situation where a large number of wafers occupy most equipment modules in the semiconductor process equipment. This reduces the probability of deadlock caused by a large number of wafers occupying a large number of equipment modules in the equipment when a certain equipment module of the semiconductor process equipment is abnormal, thereby improving the fault tolerance of the scheduling method.

[0045] However, if the time interval between adjacent unscheduled wafers generating process paths is too large, the process chamber may be idle for a long time, resulting in reduced production efficiency. For example, in a feasible implementation, all wafers to be scheduled are stored in the list of materials to be scheduled, and each process chamber has a list of materials that have been discharged, which stores the discharged wafers that need to go to the process chamber for processing. Before generating a process path for the wafer in the scheduled material list, first determine the process chamber that the wafer is going to, and determine whether the wafer can be discharged based on the list of discharged materials corresponding to the process chamber. Specifically, assuming that the list of discharged materials corresponding to the process chamber is empty, it indicates that the process chamber is currently idle and the wafer can be discharged; assuming that the list of discharged materials corresponding to the process chamber is not empty, then when the wafer in the list of discharged materials has arrived at the process chamber and the remaining process time of the wafer is less than the time threshold corresponding to the wafer, it is determined that the wafer can be discharged. The time threshold can represent the time required for the unscheduled wafer to arrive at the process chamber corresponding to the unscheduled wafer from discharge to arrival at the process chamber corresponding to the unscheduled wafer. In this way, it can be ensured that when the unscheduled wafer arrives at its corresponding process chamber after discharge, the process chamber is in an idle state, thereby avoiding the situation in which a large number of wafers wait for the process chamber to be available in the semiconductor process equipment, resulting in the wafers occupying a large number of equipment modules, and reducing the probability of deadlock when a certain equipment module of the semiconductor process equipment is abnormal.

[0046] However, the inventors further discovered that this scheduling method may lead to a long idle time in the process chamber, thereby adversely affecting production efficiency, especially for short process time paths, which is more likely to lead to a long idle time in the process chamber. For example, assuming that the process time of a wafer M that has been discharged in process chamber A is 10 seconds, and the target chamber of the unscheduled wafer N (that is, the process chamber to be processed) is also process chamber A, but the time threshold corresponding to the unscheduled wafer N is 30 seconds (that is, the time required for the unscheduled wafer N to reach the process chamber corresponding to the unscheduled wafer from discharge is 30 seconds), then when the discharged wafer M enters process chamber A, the upper computer starts to generate a process path for the unscheduled wafer N, and based on the generated process path, instructs the lower computer to control M to discharge the wafer and perform subsequent scheduling. At this time, after 10 seconds, process chamber A has completed process N and is in an idle state, but M still needs at least 20 seconds to reach process chamber A, resulting in process chamber A being idle for 20 seconds. In this example, the idle time of process chamber A is at least twice the process time of the wafer, which will lead to the problem of long idle time of the process chamber, which has a negative impact on production efficiency.

[0047] In order to reduce the deadlock probability of semiconductor process equipment, improve the fault tolerance rate, reduce the idle waiting time of the process chamber, and ensure that the semiconductor process equipment has high production efficiency, the inventors found through research that before generating a process path for the unscheduled wafers in the second material list, the release time corresponding to the process chamber is obtained based on the first material list corresponding to the process chamber and the status of the wafers that have been discharged. Then, based on the release time corresponding to the process chamber and the time threshold corresponding to the unscheduled wafer, it is determined whether the unscheduled wafer can be discharged. If the unscheduled wafer can be discharged, the unscheduled wafer is determined as a wafer to be scheduled, and a process path corresponding to the wafer to be scheduled is generated based on the scheduling algorithm, so that the upper computer can generate a specific execution action based on the process path and send it to the lower computer to instruct the lower computer to discharge the wafer to be scheduled and perform subsequent scheduling actions based on the execution action. During the generation of the process path, the process path corresponding to the unscheduled wafer is generated only when it is determined that the unscheduled wafer can be produced, so that it can be scheduled based on the process path, thereby realizing rhythm control of the process path generation of the unscheduled wafer, reducing the probability of deadlock caused by a large number of wafers occupying a large number of equipment modules in the equipment when a certain equipment module of the semiconductor process equipment is abnormal, and improving the fault tolerance of the scheduling method.

[0048] In addition, in the scheduling method, the release time corresponding to the process chamber represents the time required for the last wafer in the first material list to be processed in the process chamber, and the time threshold corresponding to the unscheduled wafer represents the time required for the unscheduled wafer to arrive at the process chamber corresponding to the unscheduled wafer from the time of being discharged. In this way, based on the release time corresponding to the process chamber and the time threshold corresponding to the unscheduled wafer, it is possible to more reasonably judge whether the unscheduled wafer can be discharged. For example, once the release time corresponding to the process chamber is less than the time threshold corresponding to the unscheduled wafer, it can be determined that the unscheduled wafer can be discharged, so that when the unscheduled wafer arrives at the process chamber based on the corresponding process path, the process chamber has just become available, which is beneficial to reduce the idle time of the process chamber and improve the working efficiency of semiconductor process equipment.

[0049] Based on the above concept, an implementation manner of this specification provides a scheduling method. The scheduling method provided in the implementation manner of this specification will be exemplarily described below in conjunction with the accompanying drawings.

[0050] Exemplary Methods

[0051] To be applied to Figure 1 Taking the upper computer of the semiconductor process equipment shown in as an example, the semiconductor process equipment also includes a lower computer and multiple process chambers. The embodiment of this specification provides a scheduling method, such as Figure 2 As shown, the scheduling method includes:

[0052] S201: Based on a first material list corresponding to the process chamber and the status of the wafers that have been discharged in the first material list, obtaining a release time corresponding to the process chamber, wherein the first material list is used to store the wafers that have been discharged in the semiconductor process equipment, and the target chamber is the process chamber; the release time corresponding to the process chamber represents the time required for the last wafer that has been discharged in the first material list to be processed in the process chamber; the status of the wafer that has been discharged is used to represent the position and process status of the wafer that has been discharged in the semiconductor process equipment;

[0053] S202: Based on the release time corresponding to the process chamber and the time threshold corresponding to the unscheduled wafer in the second material list, determine whether the unscheduled wafer can be discharged; when it is determined that the unscheduled wafer can be discharged, determine the unscheduled wafer as a wafer to be scheduled, and generate a process path corresponding to the wafer to be scheduled based on the scheduling algorithm; the second material list includes multiple unscheduled wafers, and the time threshold represents the time required for the unscheduled wafer to be discharged from the process chamber corresponding to the unscheduled wafer.

[0054] First, several concepts in the scheduling method provided in the implementation manner of this specification are explained:

[0055] The wafer that has been discharged refers to the wafer for which the process path has been generated. The upper computer can generate an execution action based on the process path and the status of the discharged wafer and send it to the lower computer. The lower computer executes the actual discharge action or other scheduling actions after the discharge action in the process path based on the execution action. In some embodiments, after receiving the execution action, the lower computer forwards it to a controller such as a PLC (Programmable Logic Controller), and the controller specifically controls the first manipulator or the second manipulator and other equipment modules to perform specific actions.

[0056] An unscheduled wafer may refer to a wafer for which a process path has not been generated and for which it has not been determined whether it can be produced. The host computer needs to determine whether the unscheduled wafer meets the conditions for producing the wafer. When the conditions for producing the wafer are met, it is determined to be an unscheduled wafer that can be produced, and a scheduling algorithm can be used to generate a process path for it.

[0057] Wafers to be scheduled refer to wafers that have been determined to be ready for production but for which a process path has not yet been generated. The host computer can generate a process path for the wafers to be scheduled based on a scheduling algorithm.

[0058] In the process path corresponding to the outgoing wafer, the process chamber that processes the outgoing wafer is called the target chamber of the outgoing wafer. Assuming that according to the process path corresponding to the outgoing wafer A, the outgoing wafer A needs to be processed in the process chamber 1, then the process chamber 1 is the target chamber of the outgoing wafer A.

[0059] refer to Figure 3 , Figure 3 The software and hardware modules related to wafer scheduling in the upper and lower computers are shown, wherein at the initial moment of scheduling, the module initial state and component action execution time can be set in the simulation scheduling algorithm layer of the upper computer, wherein the module initial state can refer to the state of each equipment module in the semiconductor process equipment, such as whether there is a wafer in the process chamber, the remaining process time of the wafer, and other states, and also such as whether the first manipulator has grasped a wafer, the next target equipment module of the grasped wafer, etc. The component action execution time can refer to the execution time required for each type of action in the process path, such as the time required for the first manipulator to grasp / place the wafer, the time required for the process chamber A to perform a certain process on the wafer, and the time required for the second manipulator to grasp / place the wafer.

[0060] The simulation scheduling algorithm layer is used to generate process paths for wafers to be scheduled and send them to the material transfer logic control layer. The process path execution control logic layer in the material transfer logic control layer can generate corresponding execution actions based on the process path and send them to the lower computer. After the lower computer action execution layer of the lower computer completes the execution of the action, it returns the action execution status to the upper computer. The process path execution control logic layer of the upper computer updates the status of the wafers that have been shipped in the status control module according to the action execution status. The material transfer logic control layer returns the status of the wafers that have been shipped to the simulation scheduling algorithm layer, so that the simulation scheduling algorithm layer can refer to the status of the wafers that have been shipped, generate process paths, and determine whether unscheduled wafers can be shipped. Figure 3 In the framework structure shown, the simulation scheduling algorithm layer, the material transmission logic control layer and the lower computer action execution layer can be software modules or hardware modules integrated with relevant logic (such as programmable logic controllers, etc.). In some implementations, the simulation scheduling algorithm layer and the material transmission logic control layer can also be integrated into one software and hardware module. This manual does not limit this and it depends on the actual situation.

[0061] In the scheduling method provided in the implementation mode of this specification, each process chamber may correspond to a first material list (i.e., the list of discharged materials mentioned above), and the first material list is used to store discharged wafers that need to be processed by the corresponding process chamber. In other words, if a discharged wafer needs to be processed in a process chamber, the discharged wafer corresponds to the process chamber, and the discharged wafer can be placed in the first material list corresponding to the process chamber.

[0062] The status of the wafer that has been released may include the position of the wafer in the semiconductor process equipment (for example, the equipment module where the wafer is currently located) and the process status (for example, whether the wafer has started the process in the process chamber, the remaining process time, etc.).

[0063] Based on the first material list corresponding to the process chamber and the status of the wafers that have been produced in the first material list, the release time corresponding to the process chamber can be obtained. For example, assuming that the first material list corresponding to process chamber A includes wafer 1 that has been produced, the status of wafer 1 includes: being located in process chamber A and having been processed for 10 seconds. If in the process path of wafer 1 that has been produced, the process time required in process chamber A is 30 seconds, then the release time corresponding to process chamber A is 20 seconds.

[0064] For another example, assuming that the first material list corresponding to process chamber A includes wafer 1 that has been produced and wafer 2 that has been produced, the status of wafer 1 includes: being located in process chamber A and having been processed for 30 seconds, assuming that in the process path of wafer 1 that has been produced, the process time required in process chamber A is 30 seconds; the status of wafer 2 includes: being located in Figure 1 On the second robot shown, assuming that according to the process path of the outgoing wafer 2, the actions that still need to be performed on the outgoing wafer 2 include: the second robot places the outgoing wafer 2 into the vacuum robot, which takes 3 seconds; the first robot takes out the outgoing wafer 2 from the vacuum lock, which takes 3 seconds; the first robot puts the outgoing wafer 2 into the process chamber A, which takes 3 seconds; the process chamber A processes the outgoing wafer 2, which takes 20 seconds. Then the last wafer in the first material list of the process chamber A is the outgoing wafer 2, and the release time of the process chamber A at this time is the time required for the outgoing wafer 2 to be processed in the process chamber A, which is equal to 3 seconds + 3 seconds + 3 seconds + 20 seconds = 29 seconds.

[0065] After obtaining the release time corresponding to the process chamber, it is possible to determine whether the unscheduled wafer can be produced based on the release time corresponding to the process chamber and the time threshold corresponding to the unscheduled wafer in the second material list. Only when it is determined that the unscheduled wafer can be produced, the unscheduled wafer is determined as the wafer to be scheduled, and a process path corresponding to the wafer to be scheduled is generated based on the scheduling algorithm, so that it is scheduled based on the process path, thereby realizing the rhythm control of the process path generated for the unscheduled wafer, reducing the probability of deadlock caused by a large number of wafers occupying a large number of equipment modules in the equipment when a certain equipment module of the semiconductor process equipment is abnormal, and improving the fault tolerance of the scheduling method.

[0066] In addition, in the scheduling method, the release time corresponding to the process chamber represents the time required for the last wafer in the first material list to be processed in the process chamber, and the time threshold corresponding to the unscheduled wafer represents the time required for the unscheduled wafer to arrive at the process chamber corresponding to the unscheduled wafer from the time of being discharged. In this way, based on the release time corresponding to the process chamber and the time threshold corresponding to the unscheduled wafer, it is possible to more reasonably judge whether the unscheduled wafer can be discharged. For example, once the release time corresponding to the process chamber is less than the time threshold corresponding to the unscheduled wafer, it can be determined that the unscheduled wafer can be discharged, so that when the unscheduled wafer arrives at the process chamber based on the corresponding process path, the process chamber has just become available, which is beneficial to reduce the idle time of the process chamber and improve the working efficiency of semiconductor process equipment.

[0067] In some implementations, a feasible method for determining the release time corresponding to a process chamber is provided. Specifically, in one implementation, obtaining the release time corresponding to the process chamber based on a first material list corresponding to the process chamber and a status of wafers that have been removed from the first material list includes:

[0068] When the first material list corresponding to the process chamber is empty, determining that the release time corresponding to the process chamber is zero;

[0069] When the first material list corresponding to the process chamber includes at least one of the wafers that have been produced, the time for the wafers to be released from the process chamber is calculated based on the state of the wafers that have been produced and the task time consumption parameters of the wafers that have been produced; the task time consumption parameters of the wafers that have been produced include the process time consumption of the wafers that have been produced, and the process time consumption of the wafers that have been produced represents the time consumption required for the wafers that have been produced to complete the process in the process chamber according to the process path corresponding to the wafers that have been produced;

[0070] Based on the time when each of the wafers released from the process chamber in the first material list is released from the process chamber, the release time corresponding to the process chamber is determined.

[0071] In this embodiment, if the first material list corresponding to the process chamber is empty, it means that at the current moment, the process chamber is already in an idle state and there are no wafers waiting for processing, so the release time corresponding to the process chamber is zero.

[0072] If the first material list corresponding to the process chamber is not empty, the time for the released wafers to release the process chamber is calculated based on the status of the wafers and the task time parameters of the wafers. Then, the release time corresponding to the process chamber can be determined based on the time when each wafer releases the process chamber. In this way, the release time corresponding to the process chamber is determined by comprehensively considering the release times of multiple wafers in the first material list. This can accurately predict the release time corresponding to the process chamber, which is beneficial to improving the calculation accuracy of the release time corresponding to the process chamber.

[0073] In an optional implementation, the task type corresponding to the shipped wafer is determined based on the position of the shipped wafer in the semiconductor process equipment, and the shipped wafer includes a sequence identifier (SequenceID) and a selection identifier (SortedID), the sequence identifier of the shipped wafer is used to characterize the shipping priority of the shipped wafer, and the selection identifier is used to characterize the priority of the shipped wafer of the same task type when being grabbed by the robot of the semiconductor process equipment, and the selection identifier is determined based on the sequence identifier;

[0074] The task time parameters also include: the waiting time of the output wafer, the waiting time of the output wafer represents the time the output wafer waits for the robot to grab other wafers corresponding to the output wafer; the other wafers corresponding to the output wafer include other output wafers with the same task type as the output wafer; the waiting time of the output wafer is determined based on the output wafer and the selection identifier.

[0075] In this embodiment, the task type corresponding to the wafer that has been taken out is determined based on the position of the wafer in the semiconductor process equipment. For example, assuming that the wafer that has been taken out has not yet entered the target chamber corresponding to it, then the wafer that has been taken out is a wafer that has not arrived at the chamber, which corresponds to one type of task type. assuming that the wafer that has been taken out has entered the target chamber corresponding to it, but the process has not yet been started, then the wafer that has been taken out is called a wafer that has arrived at the chamber but the process has not been started, which corresponds to another type of task type. assuming that the wafer that has been taken out has entered the target chamber corresponding to it and the process has been started, then the wafer that has been taken out is called a wafer that has arrived at the chamber and the process has been started, and this type of wafer corresponds to another type of task type.

[0076] When the task types are the same, there may be a problem of the order in which the robot grabs. Therefore, the priority of the wafers of the same task type when being grabbed by the robot of the semiconductor process equipment can be represented by selecting an identifier. For example, assuming Figure 1 The two vacuum locks shown in the figure respectively place the outgoing wafer 1 and the outgoing wafer 2. The target chamber of the outgoing wafer 1 is the process chamber A, and the target chamber of the outgoing wafer 2 is the process chamber B. Both the outgoing wafer 1 and the outgoing wafer 2 have not been processed. At this time, the task types of the outgoing wafer 1 and the outgoing wafer 2 are the same. The first robot can usually operate one wafer at the same time. Therefore, it is necessary to distinguish the order in which the robot performs the two actions of "grabbing the outgoing wafer 1" and "grabbing the outgoing wafer 2". At this time, the outgoing wafer 1 can be processed according to the process chamber A. The sequence identifiers corresponding to the new wafer 1 and the out-of-wafer 2 respectively determine the selection identifiers of the out-of-wafer 1 and the out-of-wafer 2. In some embodiments, the sequence identifier represents the priority of the wafer in the wafer loading and unloading position. For example, the smaller the sequence identifier, the higher the wafer output priority. Correspondingly, the selection identifier can correspond to the sequence identifier. When the sequence identifier is smaller, the selection identifier is smaller, and the smaller the selection identifier is, the higher the priority of being grabbed by the robot arm. In this way, it can be ensured that the wafer with a smaller sequence identifier can be processed in the process chamber first and returned to the wafer loading and unloading position. In the above example, assuming that the selection mark of the output wafer 1 is smaller than the selection mark of the output wafer 2, the robot will give priority to grabbing the output wafer 1. At this time, the output wafer 2 needs to wait for the robot to grab the output wafer 1. Correspondingly, the time for the output wafer 2 to release the process chamber B also needs to consider the time required for the output wafer 2 to wait for the robot to grab the output wafer 1 (that is, the waiting time of the output wafer 2). In this way, the time for the output wafer to release the process chamber is more in line with reality, thereby improving the calculation accuracy of the time for the output wafer to release the process chamber, thereby improving the calculation accuracy of the release time corresponding to the process chamber.

[0077] In a feasible implementation manner, the calculation process of the waiting time of the wafers that have been shipped includes:

[0078] Based on the selection identifier of the shipped wafer with the same task type, determining the number of waiting grabbing times corresponding to the shipped wafer; the number of waiting grabbing times corresponding to the shipped wafer is equal to the number of wafers whose selection identifiers are smaller than the selection identifier of the shipped wafer among other wafers corresponding to the shipped wafer, and the selection identifier is negatively correlated with the priority of the shipped wafer when being grabbed by the robot;

[0079] The product of the number of waiting grabbing times corresponding to the wafer that has been released and the unit grabbing time is taken as the waiting time consumption of the wafer that has been released.

[0080] Still referring to the example in the previous article, assuming that the selection mark of the outgoing wafer 1 is smaller than the selection mark of the outgoing wafer 2, the robot will give priority to grabbing the outgoing wafer 1. At this time, the outgoing wafer 2 needs to wait for the robot to grab the outgoing wafer 1, that is, the number of waiting grabs corresponding to the outgoing wafer 2 is 1. If the unit grab time of the robot (that is, the time to perform a wafer grabbing action) is 3 seconds, then the waiting time of the outgoing wafer 2 is equal to 1×3 seconds=3 seconds. Through this method, it is only necessary to count the number of waiting grabs of the outgoing wafer, and the waiting time of the outgoing wafer can be quickly calculated by the product method, which is conducive to improving the execution efficiency of the method.

[0081] In a feasible implementation, a method for quickly estimating a release time corresponding to a process chamber is provided, specifically, the task type corresponding to the outgoing wafer is determined based on the position of the outgoing wafer in the semiconductor process equipment;

[0082] The determining of the release time corresponding to the process chamber based on the time when each of the wafers released from the process chamber in the first material list includes:

[0083] Based on the task type corresponding to each of the released wafers in the first material list, the time for each of the released wafers to be released from the process chamber is accumulated or the maximum value is taken to obtain the release time corresponding to the process chamber.

[0084] In this embodiment, based on the task type corresponding to the wafers that have been released, the release time of each wafer that has been released from the process chamber is simply accumulated or the maximum value is taken to estimate the release time corresponding to the process chamber, which is beneficial to improving the execution efficiency of the method.

[0085] Specifically, in one embodiment,

[0086] The task types corresponding to the wafers that have been taken out include: first-category tasks, second-category tasks, third-category tasks and fourth-category tasks; wherein, the first-category tasks include tasks for wafers that have not arrived at the process chamber, and the duration of the tasks may include the sum of the duration of transporting the wafers from the current position to the process chamber and the duration of the process for the wafers to start the process in the process chamber until the process is completed; the second-category tasks include tasks for wafers that have arrived at the process chamber but have not started the process, and the duration of the tasks may include the duration of the process for the wafers to start the process in the process chamber until the process is completed; the third-category tasks include tasks for wafers that have arrived at the process chamber and are in the process of being taken out, and the duration of the tasks is the duration of the process for the wafers to continue to complete the process in the process chamber; the fourth-category tasks include tasks for wafers that have completed the process in the process chamber, and the duration of the tasks includes the duration of the process required to take the wafers out of the process chamber;

[0087] The accumulating or taking the maximum value of the time for each of the wafers to release the process chamber based on the task type corresponding to each of the wafers in the first material list includes:

[0088] When the task type of the adjacent wafers that have been released is a parallel task combination, the time for releasing the process chamber of the adjacent wafers that have been released is processed to obtain the maximum value; the parallel task combination includes: a combination of the first type of task and the third type of task, a combination of the first type of task and the second type of task, a combination of the second type of task and the second type of task, and a combination of the third type of task and the third type of task;

[0089] When the task type of the adjacent wafers that have been released is a serial task combination, the time for releasing the process chamber of the adjacent wafers that have been released is accumulated; the serial task combination includes: the combination of the first type of task and the first type of task, and the fourth type of task and the fourth type of task.

[0090] In this embodiment, by distinguishing between serial task combinations and parallel task combinations, the processing method for releasing the time of the process chamber for adjacent wafers that have been taken out (accumulation or taking the maximum value) can be quickly determined, which is conducive to quickly estimating the release time corresponding to the process chamber, thereby improving the execution efficiency of the method.

[0091] Regarding the task type corresponding to the wafer that has been taken out, as mentioned above, the task type corresponding to the wafer that has been taken out can be determined based on the position of the wafer in the semiconductor process equipment. For example, assuming that the wafer that has been taken out has not yet entered the target chamber corresponding to it, then the wafer that has been taken out is a wafer that has not arrived at the chamber, which corresponds to the first type of task. Assuming that the wafer that has been taken out has entered the target chamber corresponding to it, but the process has not yet started, then the wafer that has been taken out is called a wafer that has arrived at the chamber but the process has not started, which corresponds to the second type of task. Assuming that the wafer that has been taken out has entered the target chamber corresponding to it and the process has started, then the wafer that has been taken out is called a wafer that has arrived at the chamber and has started the process, which corresponds to the third type of task. Assuming that the process of the wafer that has been taken out has been completed in the target chamber and is waiting to be grabbed by the robot, then the wafer that has been taken out is called a wafer that has completed the process, which corresponds to the fourth type of task. The wafers that have completed the process in the process chamber and the wafers that have completed the process and left the process chamber will not affect the release time of the process chamber corresponding to the wafers. Therefore, these two types of wafers can be ignored when calculating the release time of the process chamber.

[0092] In one embodiment, in order to find a more suitable film output time, the scheduling method further includes:

[0093] When there are no unscheduled wafers that can be produced in the second material list, based on the process path corresponding to the produced wafers in the first material list corresponding to each process chamber, the status of the produced wafers in the first material list is updated, and the first material list corresponding to the process chamber and the status of the produced wafers in the first material list are returned to obtain the release time corresponding to the process chamber.

[0094] If there are no unscheduled wafers that can be produced in the second material list, it means that there are no unscheduled wafers suitable for generating a process path in the current state. Then, the state of the produced wafers in the first material list can be updated based on the process path corresponding to the produced wafers in the first material list corresponding to each of the process chambers, that is, according to the process path corresponding to the produced wafers in the first material list corresponding to each of the process chambers, the corresponding execution actions are generated and sent to the lower computer. After the lower computer executes these execution actions, the new state of the produced wafers is returned to realize the update of the state of the produced wafers in the first material list. After the state of the produced wafers is updated, return to step S201 to update the release time corresponding to the process chamber, and judge whether each unscheduled wafer is suitable for production based on the release time corresponding to the new process chamber. In this way, the unscheduled wafers suitable for production at the current moment can be found.

[0095] In order to facilitate the management of wafers to be scheduled, in one embodiment, when it is determined that the unscheduled wafers can be shipped, the unscheduled wafers are determined as wafers to be scheduled, and a process path corresponding to the wafers to be scheduled is generated based on a scheduling algorithm, including:

[0096] When it is determined that the unscheduled wafer can be shipped, the unscheduled wafer is deleted from the first material list, and the unscheduled wafer is changed to a wafer to be scheduled and added to a third material list, where the third material list is used to store the wafer to be scheduled;

[0097] Based on the scheduling algorithm, a process path corresponding to the wafer to be scheduled for which a process path has not been generated in the third material list is generated.

[0098] In this embodiment, the first material list (also called MatList, material list), the second material list (also called NeedScheduleMatList, need to schedule material list) and the third material list (HasSchedulerMatList, scheduled material list) are used to manage different types of wafers respectively, which is convenient for the management and identification of different types. During the scheduling process, the wafer type can be changed by storing and removing wafers in different material lists. There is no need to set an identification for each wafer to identify whether the wafer needs to generate a process path, whether the process path has been generated, and other states, which is conducive to simplifying the method and improving execution efficiency.

[0099] In a specific implementation, a feasible scheduling method execution process is provided, referring to Figure 4 In order to distinguish different process chambers, vacuum locks and wafer loading and unloading positions, Figure 4 In the table, LP1, LP2 and LP3 refer to three different wafer loading and unloading positions, LLA and LLB refer to two different vacuum locks, PM1, PM2, PM3 and PM4 refer to four different process chambers, and Mat1, Mat2, Mat3, Mat4, Mat5 and Mat6 refer to six different wafers that have been produced. The status and task types of the six wafers that have been produced can be found in Table 1.

[0100] Table 1: Status of wafers that have been shipped

[0101]

[0102] After determining the status of each wafer that has been shipped and generating the corresponding tasks, tasks of the same task type can be grouped together, and a selection sequence can be generated for the wafers in the same group to satisfy the calculation of the waiting time of the wafers that have been shipped. If the number of wafers in the same group is less than or equal to 1, there is no need to calculate the waiting time. If the number of wafers in the same group is greater than 1, the sequence identifiers of the wafers in the same group can be sorted in ascending order, and the corresponding selection identifier is generated according to the sorting result. The generation result of the selection identifier (SortedID) refers to Table 2.

[0103] Table 2 Selection mark table

[0104]

[0105] According to the different target chambers, the wafers are grouped, and the obtained grouping results may include:

[0106] Group 1 (wafers with target chamber PM2): Mat2, Mat6

[0107] The second group (wafers with target chamber PM3): Mat3

[0108] The third group (wafers with target chamber PM4): Mat4

[0109] Group 4 (wafers with target chamber PM1): Mat5

[0110] Mat1 has completed the process and left PM. Mat1 will not generate any type of tasks, so Mat1 does not enter any group.

[0111] According to the sequence identifiers in each group of wafers, the tasks corresponding to each group of wafers can be put into the task list corresponding to each process chamber to obtain the task list corresponding to each process chamber:

[0112] The PM1 task list is in the following order: Mat5's NoArrivalPMTaskType (first type of task)

[0113] The PM2 task list is in the following order: HasProcessedTaskType of Mat2 (the fourth type of task); NoArrivalPMTaskType of Mat6 (the first type of task);

[0114] The PM3 task list is in the following order: HasProcessedTaskType of Mat3 (the fourth type of task);

[0115] The PM4 task list is in the following order: Mat5's InProcessingTaskType (the third type of task).

[0116] After determining the selection identifier of each wafer that has been produced, the waiting time can be calculated based on the selection identifier. In this example, taking Mat5 and Mat6 as examples, the task types of these two wafers that have been produced are the same, and the sequence identifier of Mat5 is in the front, then the selection identifier of Mat5 is smaller than the selection identifier of Mat6, and Mat5 can be grabbed by the robot first. The selection identifiers of Mat5 and Mat6 can be incremented from 0, so that the value of the selection identifier of the wafer that has been produced can represent the number of waiting grabs corresponding to the wafer that has been produced. Assuming that the time it takes for the robot to perform a wafer picking action is PickTime (i.e., unit grabbing time), the waiting time corresponding to Mat6 can be calculated as follows: SortedID×PickTime.

[0117] After calculating the waiting time of the wafer that has been released, the process time (CostTime) can be calculated based on the process path of the wafer that has been released. The process time and the waiting time are summed to obtain the time (TaskReleaseDone) when the wafer that has been released is released from the process chamber:

[0118] TaskReleaseDone=CostTime+SortedID*PickTime;

[0119] The process time can be calculated based on the process path and status of the wafers that have been produced. Taking Mat5 as an example, the process time of Mat5 is equal to the process time in the process chamber in the process path plus the transportation time of Mat5 from LLA to PM1. Taking Mat4 as an example, the process time of Mat4 is equal to the remaining process time in the process chamber in the process path. Through the above formula of TaskReleaseDone, the time for each wafer to release its corresponding process chamber can be calculated.

[0120] After obtaining the time for each wafer to be released from the process chamber, based on the task type corresponding to each wafer in the first material list, the time for each wafer to be released from the process chamber is accumulated or the maximum value is taken to obtain the release time corresponding to the process chamber. In this way, the release time corresponding to each process chamber can be obtained.

[0121] More specifically, still referring to Figure 4 ,by Figure 4 Taking Mat1 and Mat2 in as an example, a specific feasible implementation process is given below. It is assumed that the time consumption of different equipment modules to perform corresponding actions refers to Table 3.

[0122] Table 3 Time consumption of different equipment modules to perform corresponding actions

[0123] Action Description time consuming Wafer grabbing action of robot 4s Wafer placement action of the robot 4s Wafer process time 10s Vacuum lock vacuum 18s Vacuum lock filled with air 12s The material is calibrated in the calibration module 8s

[0124] The process paths of Mat1 and Mat2 can refer to Table 4, where ATR represents the second manipulator and VTR represents the first manipulator.

[0125] Table 4 Process path

[0126]

[0127] According to Table 3 and Table 4, the time threshold (Threshold) corresponding to the unscheduled wafers is calculated:

[0128] Threshold=4s[ATRPickFromLP]+4s[ATRPlaceToAligner]+8s[Wafer aligns in Aligner]+4s[ATRPickFromAligner]+4s[ATRPlaceToLoadLock]+18s[LoadLock evacuates]+4s[VTRPickFromLoadLock]=38s

[0129] Among them, ATRPickFromLP means that the second robot grabs the wafer from the wafer loading and unloading position, ATRPlaceToAligner means that the second robot places the wafer on the calibration module, and the wafer is aligned in the Aligner, which means that the wafer is calibrated on the calibration module; ATRPickFromAligner means that ATR grabs the wafer from the calibration module; ATRPlaceToLoadLock means that the second robot places the wafer in the vacuum lock; LoadLock vacuumization means that the vacuum lock is vacuumized; VTRPickFromLoadLock means that the first robot grabs the wafer from the vacuum lock.

[0130] Mat1 and Mat2 are added to the second material list, the third material list is empty, and the first material list of each process chamber is also empty.

[0131] Since the process path of no wafer has been calculated, the release time corresponding to PM1 is 0, which is less than the time threshold of Mat1. Mat1 is deleted from the second material list and added to the third material list. The process path of Mat1 is calculated by the simulation algorithm layer.

[0132] When Mat1 does not reach PM1, the first type of task will be added to the PM1 list. When Mat1 reaches each position shown in Table 5, the corresponding release time of PM1 can be obtained respectively.

[0133] Table 5 The release time of PM1 when Mat1 is in different states

[0134]

[0135] According to the above table, when Mat1 is moved to LLA, it is found that the release time of PM1 will be less than the time threshold of Mat2, that is, before Mat1 is moved to LLA, Mat2 cannot be produced, and when Mat1 is moved to LLA, Mat2 is determined to be able to produce, so Mat2 can be deleted from the second material list, put into the third material list and generate a process path corresponding to Mat2. In this way, when Mat1 executes the subsequent process until the process is completed in PM1, it takes 36 seconds, and Mat2 generates the process path and is moved to the first robot. It takes 38 seconds, then PM1 only needs to be idle for about 2 seconds to continue the process on Mat2, reducing the idle time of PM1.

[0136] If the Mat2 process path is generated after Mat1 enters PM1, PM1 will take 10 seconds to complete the Mat1 process, and then it will take at least (38-10=)28 seconds to continue the Mat2 process. This greatly improves the production efficiency of semiconductor process equipment.

[0137] Exemplary Devices

[0138] In an exemplary embodiment of the present specification, a scheduling device is also provided, which is applied to a host computer of a semiconductor process equipment, wherein the semiconductor process equipment further includes a slave computer and a plurality of process chambers, and the scheduling device includes:

[0139] A release time calculation module is used to obtain the release time corresponding to the process chamber based on a first material list corresponding to the process chamber and the status of the wafers that have been discharged in the first material list, wherein the first material list is used to store the wafers that have been discharged in the semiconductor process equipment, and the target chamber is the process chamber; the release time corresponding to the process chamber represents the time required for the last wafer that has been discharged in the first material list to be processed in the process chamber; the status of the wafer that has been discharged is used to represent the position and process status of the wafer that has been discharged in the semiconductor process equipment;

[0140] The wafer discharge judgment module is used to judge whether the unscheduled wafer can be discharged based on the release time corresponding to the process chamber and the time threshold corresponding to the unscheduled wafer in the second material list. When it is determined that the unscheduled wafer can be discharged, the unscheduled wafer is determined as a wafer to be scheduled, and a process path corresponding to the wafer to be scheduled is generated based on a scheduling algorithm; the second material list includes multiple unscheduled wafers, and the time threshold represents the time required for the unscheduled wafer to be discharged from the discharge to the target chamber corresponding to the unscheduled wafer.

[0141] For the specific definition of the scheduling device, please refer to the definition of the scheduling method above, which will not be repeated here. Each module in the above scheduling device can be implemented in whole or in part by software, hardware and a combination thereof. The above modules can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory of the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules.

[0142] Exemplary Devices

[0143] Another embodiment of the present specification also provides a scheduling device, including: a processor and a memory;

[0144] Wherein, the memory is connected to the processor, and the memory is used to store a computer program;

[0145] The processor is used to implement the scheduling method as described in any of the above embodiments by running the computer program stored in the memory.

[0146] Another embodiment of this specification also provides a computing device, see Figure 5 As shown, an exemplary embodiment of the present specification also provides a computing device, including: a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the steps of the scheduling method according to various embodiments of the present specification described in the above embodiments of the present specification are executed.

[0147] The internal structure of the computing device can be as follows Figure 5 As shown, the computing device includes a processor, a memory, a network interface and an input device connected through a system bus. Among them, the processor of the computing device is used to provide computing and control capabilities. The memory of the computing device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The network interface of the computing device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, the steps of the scheduling method according to various embodiments of the present specification described in the above embodiments of the present specification are performed.

[0148] The processor may include a main processor and may also include a baseband chip, a modem, etc.

[0149] The memory stores a program for executing the technical solution of the present invention, and may also store an operating system and other key services. Specifically, the program may include a program code, and the program code includes computer operation instructions. More specifically, the memory may include a read-only memory (ROM), other types of static storage devices that can store static information and instructions, a random access memory (RAM), other types of dynamic storage devices that can store information and instructions, a disk storage, a flash, and the like.

[0150] The processor may be a general-purpose processor, such as a general-purpose central processing unit (CPU), a microprocessor, etc., or an application-specific integrated circuit (ASIC), or one or more integrated circuits for controlling the execution of the program of the scheme of the present invention. It may also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component.

[0151] The input device may include a device for receiving data and information input by a user, such as a keyboard, a mouse, a camera, a scanner, a light pen, a voice input device, a touch screen, a pedometer, or a gravity sensor.

[0152] Output devices may include means that allow information to be output to a user, such as display screens, printers, speakers, etc.

[0153] The communication interface may include using any transceiver or the like to communicate with other devices or communication networks, such as Ethernet, Radio Access Network (RAN), Wireless Local Area Network (WLAN), etc.

[0154] The processor executes the program stored in the memory and calls other devices, which can be used to implement each step of any scheduling method provided in the above embodiments of this specification.

[0155] The computing device may also include a display component and a voice component. The display component may be a liquid crystal display or an electronic ink display. The input device of the computing device may be a touch layer covered on the display component, or a button, trackball or touchpad provided on the housing of the computing device, or an external keyboard, touchpad or mouse.

[0156] Those skilled in the art will understand that Figure 5The structure shown in the figure is only a block diagram of a part of the structure related to the scheme of this specification, and does not constitute a limitation on the computing device to which the scheme of this specification is applied. The specific computing device may include more or fewer components than shown in the figure, or combine certain components, or have a different arrangement of components.

[0157] Exemplary computer program products and storage media

[0158] In addition to the above-mentioned methods and devices, the scheduling method provided in the embodiments of this specification may also be a computer program product, which includes computer program instructions, which, when executed by a processor, enable the processor to execute the steps of the scheduling method according to various embodiments of this specification described in the above "Exemplary Method" section of this specification.

[0159] The computer program product may be implemented in hardware, software or a combination thereof. In one optional embodiment, the computer program product is implemented as a computer storage medium. In another optional embodiment, the computer program product is implemented as a software product, such as a software development kit (SDK).

[0160] The computer program product may be written in any combination of one or more programming languages ​​to write program code for performing the operations of the embodiments of the present specification, including object-oriented programming languages ​​such as Java, C++, etc., and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server.

[0161] In addition, an embodiment of the present specification also provides a computer-readable storage medium on which a computer program is stored, and the computer program is executed by a processor to execute the steps of the scheduling method according to various embodiments of the present specification described in the above "Exemplary Method" section of the present specification.

[0162] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiments can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this specification can include non-volatile and / or volatile memory. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. As an illustration and not limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

[0163] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0164] The above-mentioned embodiments only express several implementation methods of this specification, and the descriptions are relatively specific and detailed, but they cannot be understood as limiting the scope of the solutions provided by the embodiments of this specification. It should be pointed out that for ordinary technicians in this field, several modifications and improvements can be made without departing from the concept of this specification, which all belong to the protection scope of this specification. Therefore, the protection scope of the patent of this specification shall be based on the attached claims.

Claims

1. A scheduling method, It is characterized in that A host computer applied to a semiconductor process equipment, wherein the semiconductor process equipment further comprises a slave computer and a plurality of process chambers, and the scheduling method comprises: Based on a first material list corresponding to the process chamber and the status of the wafers that have been discharged in the first material list, a release time corresponding to the process chamber is obtained, wherein the first material list is used to store the wafers that have been discharged in the semiconductor process equipment, and the target chamber is the process chamber; the release time corresponding to the process chamber represents the time required for the last wafer that has been discharged in the first material list to be processed in the process chamber; the status of the wafer that has been discharged is used to represent the position and process status of the wafer that has been discharged in the semiconductor process equipment; Based on the release time corresponding to the process chamber and the time threshold corresponding to the unscheduled wafer in the second material list, determine whether the unscheduled wafer can be discharged; when it is determined that the unscheduled wafer can be discharged, determine the unscheduled wafer as a wafer to be scheduled, and generate a process path corresponding to the wafer to be scheduled based on the scheduling algorithm; the second material list includes multiple unscheduled wafers, and the time threshold represents the time required for the unscheduled wafer to be discharged from the process chamber to the target chamber corresponding to the unscheduled wafer.

2. The method according to claim 1, It is characterized in that The obtaining the release time corresponding to the process chamber based on the first material list corresponding to the process chamber and the status of the wafers that have been discharged in the first material list includes: When the first material list corresponding to the process chamber is empty, determining that the release time corresponding to the process chamber is zero; When the first material list corresponding to the process chamber includes at least one of the wafers that have been produced, the time for the wafers to be released from the process chamber is calculated based on the state of the wafers that have been produced and the task time consumption parameters of the wafers that have been produced; the task time consumption parameters of the wafers that have been produced include the process time consumption of the wafers that have been produced, and the process time consumption of the wafers that have been produced represents the time consumption required for the wafers that have been produced to complete the process in the process chamber according to the process path corresponding to the wafers that have been produced; Based on the time when each of the wafers released from the process chamber in the first material list is released from the process chamber, the release time corresponding to the process chamber is determined.

3. The method according to claim 2, It is characterized in that The task type corresponding to the shipped wafer is determined based on the position of the shipped wafer in the semiconductor process equipment, the shipped wafer includes a sequence identifier and a selection identifier, the sequence identifier of the shipped wafer is used to characterize the shipping priority of the shipped wafer, the selection identifier is used to characterize the priority of the shipped wafer of the same task type when being grabbed by the robot of the semiconductor process equipment, and the selection identifier is determined based on the sequence identifier; The task time parameters also include: the waiting time of the output wafer, the waiting time of the output wafer represents the time the output wafer waits for the robot to grab other wafers corresponding to the output wafer; the other wafers corresponding to the output wafer include other output wafers with the same task type as the output wafer; the waiting time of the output wafer is determined based on the output wafer and the selection identifier.

4. The method according to claim 3, It is characterized in that The calculation process of the waiting time of the wafers that have been shipped includes: Based on the selection identifier of the shipped wafer with the same task type, determining the number of waiting grabbing times corresponding to the shipped wafer; the number of waiting grabbing times corresponding to the shipped wafer is equal to the number of wafers whose selection identifiers are smaller than the selection identifier of the shipped wafer among other wafers corresponding to the shipped wafer; The product of the number of waiting grabbing times corresponding to the wafer that has been released and the unit grabbing time is taken as the waiting time consumption of the wafer that has been released.

5. The method according to claim 2, It is characterized in that The task type corresponding to the shipped wafer is determined based on the position of the shipped wafer in the semiconductor process equipment; The determining of the release time corresponding to the process chamber based on the time when each of the wafers released from the process chamber in the first material list includes: Based on the task type corresponding to each of the released wafers in the first material list, the time for each of the released wafers to be released from the process chamber is accumulated or the maximum value is taken to obtain the release time corresponding to the process chamber.

6. The method according to claim 5, It is characterized in that The task types corresponding to the wafers that have been released include: first-category tasks, second-category tasks, third-category tasks and fourth-category tasks; wherein the first-category tasks include tasks for wafers that have not arrived at the process chamber; the second-category tasks include tasks for wafers that have arrived at the process chamber but have not started the process; the third-category tasks include tasks for wafers that have arrived at the process chamber and are in the process of being processed; the fourth-category tasks include tasks for wafers that have completed the process in the process chamber; The accumulating or taking the maximum value of the time for each of the wafers to release the process chamber based on the task type corresponding to each of the wafers in the first material list includes: When the task type of the adjacent wafers that have been released is a parallel task combination, the time for releasing the process chamber of the adjacent wafers that have been released is processed to obtain the maximum value; the parallel task combination includes: a combination of the first type of task and the third type of task, a combination of the first type of task and the second type of task, a combination of the second type of task and the second type of task, and a combination of the third type of task and the third type of task; When the task type of the adjacent wafers that have been released is a serial task combination, the time for releasing the process chamber of the adjacent wafers that have been released is accumulated; the serial task combination includes: the combination of the first type of task and the first type of task, and the fourth type of task and the fourth type of task.

7. The method according to claim 1, It is characterized in that Also includes: When there are no unscheduled wafers that can be produced in the second material list, based on the process path corresponding to the produced wafers in the first material list corresponding to each process chamber, the status of the produced wafers in the first material list is updated, and the first material list corresponding to the process chamber and the status of the produced wafers in the first material list are returned to obtain the release time corresponding to the process chamber.

8. The method according to claim 1, It is characterized in that When it is determined that the unscheduled wafer can be shipped, the unscheduled wafer is determined as a wafer to be scheduled, and a process path corresponding to the wafer to be scheduled is generated based on a scheduling algorithm, including: When it is determined that the unscheduled wafer can be shipped, the unscheduled wafer is deleted from the first material list, and the unscheduled wafer is changed to a wafer to be scheduled and added to a third material list, where the third material list is used to store the wafer to be scheduled; Based on the scheduling algorithm, a process path corresponding to the wafer to be scheduled for which a process path has not been generated in the third material list is generated.

9. A scheduling device, It is characterized in that include: Processor and memory; Wherein, the memory is connected to the processor, and the memory is used to store a computer program; The processor is used to implement the scheduling method according to any one of claims 1 to 8 by running the computer program stored in the memory.

10. A computer-readable storage medium, It is characterized in that The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the scheduling method according to any one of claims 1 to 8 is implemented.

Citation Information

Cited By

  • Scheduling method and related device

    CN119786390A

  • A scheduling method and related apparatus

    CN119786390B

  • Wafer scheduling method, semiconductor process device, and computer-readable storage medium

    WO2026144728A1