Overhead crane dispatching control method and device based on AMHS system

By calculating the cost measurement value between the task and the AMHS system and optimizing the task allocation strategy, the problem of low automation transmission efficiency under the large-scale AMHS system is solved, and production efficiency and resource utilization are improved.

CN118917762BActive Publication Date: 2024-12-03华芯(嘉兴)智能装备有限公司
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202411412777.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-10-11
Publication Date
2024-12-03
Estimated Expiration
2044-10-11

AI Technical Summary

Technical Problem

The task priority-based scheduling strategies in existing AMHS systems are difficult to meet the point-to-point automated transmission requirements of wafers and other materials under large-scale AMHS systems, resulting in a decrease in production efficiency and resource utilization.

Method used

A sky train scheduling control method based on AMHS system is proposed. By calculating the first and second price measurement values ​​between each task and each sky train, a cost measurement matrix is ​​generated, and the task matching pair is determined according to the constraints. Collection, optimize the allocation strategy of the sky train and tasks.

Benefits of technology

It significantly improves the point-to-point automated transportation efficiency of semiconductor smart factories under large-scale trolley systems, and improves production efficiency and resource utilization.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118917762B_ABST
    Figure CN118917762B_ABST
Patent Text Reader

Abstract

The present application discloses a method and device for overhead crane scheduling control based on an AMHS system, belonging to the field of overhead crane control technology. The method calculates the first cost metric value between each task and each overhead crane based on the first ready time and relative ready time of each task in the candidate task set and the second ready time and task transfer time of each overhead crane, calculates the second cost metric value between each task and each overhead crane based on the weighted sum of the first cost metric value and the relative ready time of each task, calculates the cost metric matrix between the overhead crane set and the candidate task set based on the second cost metric value, determines the task matching pair set between the overhead crane set and the candidate task set according to the constraint conditions of the cost metric matrix, and controls each overhead crane to perform matching tasks based on the task matching pair set. The present application can significantly improve the point-to-point automated transportation efficiency of wafers and other materials in semiconductor smart factories in large-scale overhead crane system scenarios.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of overhead crane control, and in particular to an overhead crane dispatching control method and device based on an AMHS system. Background Art

[0002] AMHS (Automated Material Handling System) is an important component of semiconductor smart factories. It realizes point-to-point automated transmission of materials such as wafers in semiconductor factories through overhead cranes and suspended tracks, that is, wafers and other materials can be automatically transported directly from one process site to another. The AMHS system usually schedules and controls material transportation tasks based on the material control system (MCS) and the overhead crane control system (MOC). In the prior art, the priority of scheduling tasks is usually automatically allocated based on the real-time material location and process requirements to reduce the waiting time of material transportation tasks and the idle time of the overhead crane, thereby improving the production efficiency and resource utilization of semiconductor factories. However, with the increasing number of overhead cranes in the AMHS system, the material transportation tasks that need to be processed per unit time have increased sharply. This scheduling strategy based on task priority has been difficult to meet the point-to-point automated transmission requirements of materials such as wafers in semiconductor factories. Therefore, there is an urgent need for an improved overhead crane scheduling control method that is adapted to large-scale AMHS systems. Summary of the invention

[0003] In view of this, the present application proposes a crane scheduling control method and device based on the AMHS system, which can significantly improve the point-to-point automated transportation efficiency of wafers and other materials in semiconductor smart factories in large-scale crane system scenarios, thereby improving the production efficiency and resource utilization of semiconductor smart factories.

[0004] In a first aspect, an embodiment of the present application proposes a method for controlling a crane dispatching based on an AMHS system, the method comprising:

[0005] Calculate the first ready time and relative ready time of each task based on the starting process site of each task in the candidate task set, and calculate the second ready time and task transfer time of each crane based on the status information and position information of each crane in the crane set;

[0006] Calculating a first cost metric value of task scheduling between each task and each overhead crane based on the first ready time of each task, the second ready time of each overhead crane, and the task transfer time;

[0007] Calculating a second cost metric value for task scheduling between each task and each overhead crane based on a weighted sum of the first cost metric value and the relative ready time of each task;

[0008] A cost metric matrix between the overhead crane set and the candidate task set is calculated based on the second cost metric value, a task matching pair set between the overhead crane set and the candidate task set is determined according to the constraint conditions of the cost metric matrix, and each overhead crane in the overhead crane set is controlled to perform a matching task based on the task matching pair set.

[0009] In an optional implementation manner, the calculating the first ready time and the relative ready time of each task based on the starting process site of each task in the candidate task set includes:

[0010] Obtaining the total number of tasks for sending materials to other process sites generated by the starting process site of each task within a unit time period, and calculating the average task cycle time of the starting process site of each task based on the total number of tasks;

[0011] Based on the average task cycle time of the starting process site of each task and the station sorting index of each task at the starting process site, the initial estimated ready time of each task relative to the initial time is calculated, and the first ready time of each task relative to the current time is obtained based on the initial estimated ready time.

[0012] In an optional implementation manner, the calculating the first ready time and the relative ready time of each task based on the starting process site of each task in the candidate task set includes:

[0013] The difference between the initial estimated ready time of each task and the minimum value of the initial estimated ready time of all tasks in the candidate task set is calculated to obtain the relative ready time of each task.

[0014] In an optional implementation manner, the calculating the second ready time and the task transfer time of each overhead crane based on the status information and the position information of each overhead crane in the overhead crane set includes:

[0015] Calculating the sum of the remaining loading and unloading time and the remaining transportation time for each overhead crane to perform the currently assigned task, thereby obtaining the second ready time of each overhead crane;

[0016] And the time required for each overhead crane from the current position of completing the currently assigned task to moving to the starting process site of each task to receive each task is calculated to obtain the task transfer time of each overhead crane.

[0017] In an optional implementation manner, the calculating the first cost metric value of the task scheduling between each task and each overhead crane based on the first ready time of each task, the second ready time of each overhead crane, and the task transfer time comprises:

[0018] The sum of the second ready time and the task transfer time of each overhead crane and the difference between the first ready time of each task are calculated to obtain a first cost metric value of task scheduling between each task and each overhead crane.

[0019] In an optional implementation manner, the calculating the second cost metric value for task scheduling between each task and each overhead crane based on the weighted sum of the first cost metric value and the relative ready time of each task includes:

[0020] Calculate a first product of the relative ready time of each task and a first weight factor and a second product of the first cost metric value and a second weight factor;

[0021] The sum of the first product and the second product is calculated to obtain a second cost measurement value for task scheduling between each task and each overhead crane.

[0022] In an optional implementation, the first weight factor is a fixed value that does not change with the relative ready time of each task; and the second weight factor is a dynamically changing value that is inversely proportional to the first ready time of each task.

[0023] In an optional implementation, the calculating the cost metric matrix between the overhead traveling vehicle set and the candidate task set based on the second cost metric value includes:

[0024] The global sorting index of the relative ready time of each task in the candidate task set from small to large is used as the row index, the sequence number of each overhead crane in the overhead crane set is used as the column index, and the second cost measurement value between each task and each overhead crane is used as the matrix element to obtain the cost measurement matrix between the overhead crane set and the candidate task set.

[0025] In an optional implementation, determining a set of task matching pairs between the set of overhead traveling vehicles and a set of candidate tasks according to the constraint conditions of the cost metric matrix includes:

[0026] According to the ascending order of the row index of the cost metric matrix, the first constraint condition is that the second cost metric value between each target task and the target overhead crane to be assigned is minimized, and the second constraint condition is that the same overhead crane can only be assigned one task at the current moment, and the matching target overhead crane is determined from the remaining available overhead crane set indicated by the cost metric matrix for the target task in each row in turn to obtain the task matching pair set.

[0027] In a second aspect, an embodiment of the present application provides an overhead crane dispatching control device based on an AMHS system, the device comprising:

[0028] A time estimation unit, used to calculate the first ready time and relative ready time of each task based on the starting process site of each task in the candidate task set, and to calculate the second ready time and task transfer time of each crane based on the status information and position information of each crane in the crane set;

[0029] A first metric calculation unit, configured to calculate a first cost metric value of task scheduling between each task and each overhead crane based on the first ready time of each task, the second ready time of each overhead crane, and the task transfer time;

[0030] A second metric calculation unit, configured to calculate a second cost metric value for task scheduling between each task and each overhead crane based on a weighted sum of the first cost metric value and the relative ready time of each task;

[0031] A metric matrix calculation unit is used to calculate the cost metric matrix between the overhead crane set and the candidate task set based on the second cost metric value, determine the task matching pair set between the overhead crane set and the candidate task set according to the constraint conditions of the cost metric matrix, and control each overhead crane in the overhead crane set to perform matching tasks based on the task matching pair set.

[0032] This application can at least achieve the following beneficial effects:

[0033] The embodiment of the present application calculates the first cost metric value of task scheduling between each task and each overhead crane based on the first ready time and relative ready time of each task in the candidate task set, and based on the second ready time and task transfer time of each overhead crane in the overhead crane set, and calculates the second cost metric value of task scheduling between each task and each overhead crane based on the weighted sum of the first cost metric value and the relative ready time of each task, and finally calculates the cost metric matrix between the overhead crane set and the candidate task set based on the second cost metric value, determines the task matching pair set between the overhead crane set and the candidate task set according to the constraint conditions of the cost metric matrix, and controls each overhead crane in the overhead crane set to perform matching tasks based on the task matching pair set. Therefore, the embodiment of the present application can significantly improve the point-to-point automated transportation efficiency of wafers and other materials in semiconductor smart factories in large-scale overhead crane system scenarios, thereby improving the production efficiency and resource utilization of semiconductor smart factories. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the following briefly introduces the drawings required for use in the embodiments of the present application. It should be understood that the following drawings only illustrate certain embodiments of the present application and should not be regarded as limiting the scope of the present application.

[0035] Figure 1 It is a schematic diagram of the architecture of an exemplary AMHS system for wafer material transportation in a semiconductor factory;

[0036] Figure 2 It is a flowchart of a method for overhead travelling crane dispatching control based on an AMHS system according to an embodiment of the present application;

[0037] Figure 3 is a partial flow chart of a method for overhead crane dispatching control based on an AMHS system according to another embodiment of the present application;

[0038] Figure 4 is a partial flow chart of a method for overhead crane dispatching control based on an AMHS system according to another embodiment of the present application;

[0039] Figure 5 is a schematic diagram of a cost metric matrix between a set of overhead traveling vehicles and a set of candidate tasks according to an embodiment of the present application;

[0040] Figure 6 is a schematic diagram of executing a scheduling strategy based on a cost metric matrix according to an embodiment of the present application;

[0041] Figure 7 is a structural schematic diagram of an overhead crane dispatching control device based on an AMHS system according to an embodiment of the present application;

[0042] Figure 8 is a partial structural schematic diagram of an overhead crane dispatching control device based on an AMHS system according to another embodiment of the present application;

[0043] Fig. 9 It is a partial structural diagram of an overhead crane dispatching control device based on an AMHS system according to another embodiment of the present application. DETAILED DESCRIPTION

[0044] To make the purpose, technical solutions and advantages of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the accompanying drawings of the embodiments of the present application. However, it should be understood that the described embodiments are only some exemplary embodiments of the present application, rather than all embodiments, and therefore the following detailed description of the embodiments of the present application is not intended to limit the scope of protection claimed in the present application. Based on the embodiments of the present application, all other embodiments obtained by those skilled in the art without making creative work belong to the scope of protection of the present application.

[0045] It should be noted that the terms "first", "second", etc. in the specification and claims of this application are only used to distinguish and describe similar objects, rather than to describe a specific order or sequence, and cannot be understood as indicating or implying relative importance.

[0046] As mentioned above, in the existing AMHS system, the priority of the scheduling task is usually automatically assigned based on the real-time material location and process requirements, so as to reduce the waiting time of the material transportation task and the idle time of the overhead crane, thereby improving the production efficiency and resource utilization of the semiconductor factory. However, as the number of overhead cranes in the AMHS system increases, the material transportation tasks that need to be processed per unit time increase sharply. This scheduling strategy based on task priority has been difficult to meet the point-to-point automated transmission requirements of materials such as wafers in semiconductor factories. To this end, the embodiment of the present application proposes a method and device for overhead crane scheduling control based on the AMHS system, which can significantly improve the point-to-point automated transportation efficiency of materials such as wafers in semiconductor smart factories in the scenario of large-scale overhead crane systems, thereby improving the production efficiency and resource utilization of semiconductor smart factories.

[0047] Figure 1 The following is a schematic diagram of the architecture of an exemplary AMHS system for wafer material transportation in a semiconductor factory. Figure 1 As shown, the AMHS system 100 includes a plurality of suspended tracks 110, a plurality of process stations located on both sides of the tracks 110, and a plurality of overhead hoists (OHT, full name Overhead Hoist Transport, i.e., overhead hoist transport vehicles, referred to as overhead hoists) running on the tracks 110. For ease of description, Figure 1 Only six process stations (120-1 to 120-6) and five trolleys (130-1 to 130-5) are shown as examples. The actual number of process stations and trolleys in a semiconductor factory may be greater, and this application does not impose any limitation on this.

[0048] like Figure 1 As shown, each process station (120-1 to 120-6) has a material unloading point 121 and a material loading point 122. Each process station will generate material transportation tasks to other process stations at any time according to process requirements. These material transportation tasks will be dispatched to the designated overhead crane by the overhead crane control system (MOC) in the AMHS system. The designated overhead crane will transport the materials to the material loading point 122 of the starting process station where the material transportation task is generated for material loading, and automatically transport them to the destination process station via the planned path on the track 110, and unload the materials at the material unloading point 121 of the destination process station, so that the destination process station can perform corresponding process processing.

[0049] Figure 2 FIG. 1 is a flow chart of a method for controlling a crane dispatching based on an AMHS system according to an embodiment of the present application. Figure 2 As shown, the overhead crane dispatching control method based on the AMHS system in the embodiment of the present application includes the following steps:

[0050] Step S210, calculating the first ready time and relative ready time of each task based on the starting process site of each task in the candidate task set, and calculating the second ready time and task transfer time of each crane based on the status information and position information of each crane in the crane set;

[0051] Step S220, calculating a first cost metric value of task scheduling between each task and each overhead crane based on the first ready time of each task, the second ready time of each overhead crane, and the task transfer time;

[0052] Step S230, calculating a second cost metric value for task scheduling between each task and each overhead crane based on a weighted sum of the first cost metric value and the relative ready time of each task;

[0053] Step S240, calculating the cost metric matrix between the overhead crane set and the candidate task set based on the second cost metric value, determining the task matching pair set between the overhead crane set and the candidate task set according to the constraint conditions of the cost metric matrix, and controlling each overhead crane in the overhead crane set to perform matching tasks based on the task matching pair set.

[0054] In this embodiment, the AMHS system may include a set of candidate tasks to be scheduled and a set of overhead cranes. The candidate task set represents a set of material transportation tasks to be scheduled generated by various process sites in the current system from the current time to a certain period in the future, and the overhead crane set represents a set of available overhead cranes to which each task in the candidate task set can be assigned to perform material transportation tasks. In one embodiment, the number of tasks in the candidate task set and the number of overhead cranes in the overhead crane set may be consistent. Assume that the number of tasks in the candidate task set and the number of overhead cranes in the overhead crane set are both M, and M is an integer greater than 1. Then, the candidate task set can be expressed as , the crane set can be expressed as .

[0055] In this embodiment, the first ready time of each task in the candidate task set can be defined. The first ready time of each task refers to the time when each task in the candidate task set can be scheduled to any crane in the crane set for execution. For tasks generated by various process sites in the future, the first ready time is an estimated value relative to the current time. The first ready time can be calculated based on the starting process site of each task in the candidate task set.

[0056] Secondly, the second ready time and task transfer time of each crane in the crane set can be defined. The second ready time of each crane refers to the time required for each crane in the crane set to complete the currently assigned task, that is, the time required from the non-ready state of performing the material transportation task to the ready state after unloading the material. The ready state is the idle state of each crane that can receive a newly assigned task. The second ready time of each crane can be estimated based on the current state of each crane, the starting process station, the destination process station, the crane scheduling path and the travel speed. The task transfer time of each crane refers to the time required for each crane in the crane set to go from the ready state to the predetermined process station to receive the newly assigned task. The task transfer time can be estimated based on the current position of each crane, the starting process station of the newly assigned task, the crane scheduling path and the travel speed.

[0057] In one embodiment, if Figure 3 As shown, in step S210, calculating the first ready time and the relative ready time of each task based on the starting process site of each task in the candidate task set may include:

[0058] Step S310, obtaining the total number of tasks for sending materials to other process sites generated by the starting process site of each task within a unit time period, and calculating the average task cycle time of the starting process site of each task based on the total number of tasks;

[0059] Step S320, based on the average task cycle time of the starting process site of each task and the station sorting index of each task at the starting process site, calculate the initial estimated ready time of each task relative to the initial time, and obtain the first ready time of each task relative to the current time based on the initial estimated ready time.

[0060] In this embodiment, it is assumed that each task in the candidate task set The first ready time of the i-th task is expressed as So, the first ready time Can be based on each task The initial estimated ready time for each task calculated by the starting process site To calculate. Each task Initial estimated time to readiness It can be initialized and estimated based on the average task cycle time of the starting process site that generates the task.

[0061] Assume that each task The starting process site is represented as process site m, then the number of material transportation tasks sent by process site m to any other process site n within a unit time period can be expressed as , then the total number of tasks generated by process site m in a unit time period is It can be calculated by the following formula:

[0062] .

[0063] Among them, m is not equal to n, and N represents the total number of process sites in the system.

[0064] Then, the average task cycle time of process station m is It can be calculated by the following formula:

[0065] .

[0066] Then, at the set initial time is the starting time, assuming that each task The in-station sorting index generated in process station m is Local_ , you can get each task Initial estimated time to readiness for:

[0067] .

[0068] In this embodiment, the current time of each task scheduling execution in the system is then used. As the reference time, calculate each task Initial estimated time to readiness Relative to current time The deviation time of each task is obtained The first ready time is expressed as Each task First Ready Time It can be calculated by the following formula:

[0069] .

[0070] The above formula indicates that when each task Initial estimated time to readiness Greater than the current time , that is, each task It is a task generated in the future. The first ready time It is the difference between the initial estimated ready time and the current time. Initial estimated time to readiness Less than or equal to the current time , that is, each task If the current time has been generated and is in the ready state, the first ready time It is set to 0 to avoid generating a negative first ready time, which affects the calculation of the first cost metric value of task scheduling between each subsequent task and each overhead crane.

[0071] In one embodiment, in step S210, the step of calculating the first ready time and the relative ready time of each task based on the starting process site of each task in the candidate task set further includes:

[0072] The difference between the initial estimated ready time of each task and the minimum value of the initial estimated ready time of all tasks in the candidate task set is calculated to obtain the relative ready time of each task.

[0073] In this embodiment, in order to prevent future generated tasks from being scheduled to the overhead crane in priority over the recent ready jobs, it is also necessary to calculate the number of tasks in the candidate task set. Initial estimated time to readiness The relative ready time relative to the minimum of the initial estimated ready times of all tasks in the candidate task set Each task Relative ready time Indicates the initial estimated ready time for each task The difference between the minimum values ​​of the initial estimated ready time of all tasks in the candidate task set. It can be calculated by the following formula:

[0074] .

[0075] In the above formula, Represents the minimum value of the initial estimated ready time of all tasks in the candidate task set. , M represents the total number of tasks in the candidate task set.

[0076] In one embodiment, in step S210, calculating the second ready time and the task transfer time of each overhead crane based on the status information and the position information of each overhead crane in the overhead crane set may include:

[0077] Calculating the sum of the remaining loading and unloading time and the remaining transportation time for each overhead crane to perform the currently assigned task, thereby obtaining the second ready time of each overhead crane;

[0078] And the time required for each overhead crane from the current position of completing the currently assigned task to moving to the starting process site of each task to receive each task is calculated to obtain the task transfer time of each overhead crane.

[0079] In this embodiment, it is assumed that each overhead crane in the overhead crane set The second ready time of (also called the jth overhead travelling crane) is expressed as , then each overhead crane Second Ready Time It can be calculated based on the status information and position information of each overhead crane.

[0080] As shown above, each overhead crane The second ready time of the crane is used to calculate the ready time of each crane in the current crane set. It is the time required for each overhead crane to complete the currently assigned task, that is, the time required to change from the occupied non-ready state to the ready state after unloading the materials.

[0081] For each crane in the crane collection For the second ready time, It can be calculated by the following formula:

[0082]

[0083] in, Each overhead crane The remaining task loading and unloading time relative to the current time; Each overhead crane The remaining transportation time of the currently assigned task from the starting process site to the destination process site relative to the current time. The currently assigned task has been completed and is in the ready state. The second ready time It is set to 0 to avoid generating a negative second ready time, which affects the calculation of the first cost metric value of task scheduling between each subsequent task and each overhead crane.

[0084] For each crane in non-ready state , second ready time It is the sum of the remaining task loading and unloading time and the remaining transportation time. In one embodiment, the remaining transportation time It can be calculated based on the average travel time of multiple candidate paths of the j-th overhead crane from the starting process station to the destination process station estimated by the overhead crane control system (MOC) in the AMHS system.

[0085] In this embodiment, it is assumed that each overhead crane in the overhead crane set The task delivery time is expressed as Each overhead crane Task delivery time Each overhead crane The time required to go from the ready state to the scheduled process site to receive the newly assigned i-th task. The task delivery time is also an estimate relative to the current time. It can be calculated based on the travel time from the current position of the j-th overhead crane to the starting process site of the i-th task.

[0086] In one embodiment, when the jth overhead travelling vehicle is in a non-ready state to transport the currently assigned task, the task transfer time It can be calculated based on the travel time of the jth crane from the destination process station where the current task is completed to the starting process station of the i-th task. For example, if the jth crane unloads the currently transported materials at the destination process station n to complete the current task and is in a ready state, and the i-th task newly assigned to the jth crane is located at the starting process station m, then the task transfer time is It can be calculated based on the travel time of the jth overhead crane from process station n to process station m. If the jth overhead crane is currently in the ready state and is located at any position on the track 110, the task transfer time It can be calculated based on the travel time from the current position of the j-th overhead travelling vehicle on the track 110 to the starting process station of the i-th task. Preferably, the task transfer time It can be calculated based on the average travel time of multiple candidate paths from the current position of the j-th overhead crane estimated in the overhead crane control system (MOC) in the AMHS system to the starting process site of the i-th task.

[0087] In this embodiment, in step S220, the first ready time of each task has been calculated in the previous step. and the second ready time of each overhead crane and task delivery time After that, the first ready time can be integrated , Second Ready Time and task delivery time , calculate the first cost metric value of task scheduling between each task and each overhead crane. First cost metric value It represents the first time cost of scheduling the i-th task to the j-th overhead crane.

[0088] In one embodiment, in step S220, calculating the first cost metric value of task scheduling between each task and each overhead crane based on the first ready time of each task, the second ready time of each overhead crane, and the task transfer time may include:

[0089] The difference between the sum of the second ready time and the task transfer time of each overhead crane and the first ready time of each task is calculated to obtain a first cost measurement value of task scheduling between each task and each overhead crane.

[0090] In this embodiment, the first cost metric value It can be calculated by the following formula:

[0091] .

[0092] The above formula indicates that when the second ready time of each overhead crane is and task delivery time The sum is greater than each task First Ready Time , that is, each task Before every overhead crane Second Ready Time The sum of the task delivery time and the ready state, the first cost metric The second ready time of each overhead crane and task delivery time The sum of the first ready time of each task minus the first ready time of each task The difference between the second ready time of each overhead crane and task delivery time The sum is less than or equal to each task First Ready Time , that is, each task Later than each overhead travelling vehicle Second Ready Time and the sum of the task delivery time and is in the ready state, then the first cost metric value Set to 0.

[0093] In this embodiment, in step S230, the first cost metric value of task scheduling between each task and each overhead crane is calculated in the above step. Afterwards, based on the first cost metric value and the relative ready time of each task The weighted sum of the second cost metric value of the task scheduling between each task and each overhead crane is calculated. The second cost metric It represents the second time cost of scheduling the i-th task to the j-th overhead crane.

[0094] In one embodiment, if Figure 4As shown, in step S230, the calculation of the second cost metric value for task scheduling between each task and each overhead crane based on the weighted sum of the first cost metric value and the relative ready time of each task may include:

[0095] Step S410, calculating a first product of the relative ready time of each task and a first weight factor and a second product of the first cost metric value and the second weight factor;

[0096] Step S420: Calculate the sum of the first product and the second product to obtain a second cost measurement value for task scheduling between each task and each overhead crane.

[0097] In this embodiment, the first cost metric value of task scheduling between each task and each overhead crane is calculated in the above steps. After that, we need to calculate the first cost metric , the relative ready time of each task , the first weight factor and the second weighting factor , further calculate the second cost metric value of task scheduling between each task and each overhead crane The second cost metric value It can be calculated by the following formula:

[0098] .

[0099] in, a is the first weight factor, which is used to characterize the relative ready time of each task. In the second cost metric The first weight factor a is not related to the relative ready time of each task A fixed value that varies. The relative ready time of tasks generated some time in the future Relative ready time compared to the most recently generated task The first weight factor is greater, so that the scheduling time cost of future generation tasks can be increased by the first weight factor. It can be understood that the second cost metric value calculated for the most recently generated task with a smaller relative ready time will be relatively smaller, and the second cost metric value calculated for the future generation task with a larger relative ready time will be relatively larger. By multiplying the first weight factor by the relative ready time of the task , then the relative ready time The larger the task, the larger the second cost metric value. Therefore, in order to reduce the second cost metric value of scheduling the task to the overhead crane, the relative ready time The smaller the recently generated task is, the higher the priority can be and the more likely it is to be scheduled first. It should be noted that the first weight factor can be appropriately adjusted according to the scale of the overhead travelling vehicle and the scale of the candidate tasks in the AMHS system.

[0100] also, is the second weight factor, which is used to characterize the accuracy of the first ready time estimate of each task. Since the estimated value of the first ready time of the task generated in the future may have a certain error from the actual situation. Generally speaking, the accuracy of the estimated value of the first ready time of the most recently generated task closer to the current time is higher, and the accuracy of the first ready time estimate of the future generated task farther from the current time is lower. Therefore, the second weight factor can be set to be related to the first ready time of each task. As an example, the second weight factor It can be calculated by the following formula:

[0101] .

[0102] Among them, c and d in the above formula are preset constants greater than 0, d>c, for tasks that are already in the ready state at the current time, the first ready time is 0, so the second weight factor The maximum value d is taken; as the first ready time of the future generated task is farther from the current time, The larger the second weight factor is, the The value is getting closer and closer to the minimum value c, which is the second weight factor The value range of is in the interval (c, d].

[0103] In this embodiment, the second weight factor Multiply by the first cost metric , then the most recent generated task closer to the current time has the second weight factor Therefore, in order to reduce the second cost metric of scheduling tasks to the crane, the most recently generated tasks closer to the current time are more likely to be scheduled to minimize the first cost metric. The second ready time and task delivery time The smaller the overhead crane, the faster it can be put into operation.

[0104] In this embodiment, in the step S240, based on the second cost metric value of task scheduling between each task and each overhead crane that has been calculated above, a cost metric matrix between the overhead crane set and the candidate task set is further calculated based on the second cost metric value, and a set of task matching pairs between the overhead crane set and the candidate task set is determined according to the constraint conditions of the cost metric matrix, so that each overhead crane in the overhead crane set can be controlled to perform matching tasks through the overhead crane control system (MOC) in the AMHS system based on the task matching pair set.

[0105] The cost metric matrix between the crane set and the candidate task set is a cost metric matrix constructed with the second cost metric value of the task scheduling between each task and each crane as a matrix element, and is used to determine the task matching pair set between the crane set and the candidate task set based on the specified constraint conditions. The task matching pair set between the crane set and the candidate task set is a set of task-crane matching pairs formed by assigning each task in the candidate task set to a matching crane in the crane set, and constitutes the basis for generating instructions for controlling each crane in the crane set to perform matching tasks.

[0106] In one embodiment, in step S240, calculating the cost metric matrix between the overhead traveling vehicle set and the candidate task set based on the second cost metric value may include:

[0107] The global sorting index of the relative ready time of each task in the candidate task set from small to large is used as the row index, the sequence number of each overhead crane in the overhead crane set is used as the column index, and the second cost measurement value between each task and each overhead crane is used as the matrix element to obtain the cost measurement matrix between the overhead crane set and the candidate task set.

[0108] In this embodiment, the relative ready time of each task in the candidate task set calculated based on the above steps is , based on the relative ready time of each task Sorting in ascending order can obtain the global sorting index of each task in the candidate task set. . Global sort index Indicates the relative ready time of each task Then, the global sorting index of each task in the candidate task set is As the row index, take each crane in the crane set The serial number is the column index, and the second cost measurement value between each task and each overhead crane is the matrix element, so as to construct a cost measurement matrix between the overhead crane set and the candidate task set.

[0109] Figure 5 is a schematic diagram of a cost metric matrix between the overhead traveling vehicle set and the candidate task set according to an embodiment of the present application. As an example, Figure 5 The cost metric matrix shown is based on the number of tasks in the candidate task set and the number of overhead cranes in the overhead crane set, 5, as an example. , , , , , the relative ready times corresponding to the five tasks are , , , , , the relative ready time of each task is in the following order from small to large: < < < < , so that the global sorting index of each task in the crane set can be obtained , , , , It can be understood that the global sorting index of each task in the overhead crane set is , , , , The values ​​are 1, 2, 3, 4, and 5 respectively.

[0110] like Figure 5 As shown, the cost metric matrix uses the global sorting index of each task in the crane set as the row index and the five cranes in the crane set as the row index. , , , , The serial numbers 1, 2, 3, 4, and 5 are column indices, and the second cost metric value of the task scheduling between each task and each overhead crane is used as the matrix element at the position marked by the row index and column index. For example, the row index The elements of the first row of the identified matrix are , , , , , and so on, row index The elements in the last row of the identified matrix are , , , , .

[0111] In one embodiment, in step S240, determining the task matching pair set between the overhead traveling vehicle set and the candidate task set according to the constraint conditions of the cost metric matrix may include:

[0112] According to the ascending order of the row index of the cost metric matrix, the first constraint condition is that the second cost metric value between each target task and the target overhead crane to be assigned is minimized, and the second constraint condition is that only one task can be assigned to the same overhead crane at the current time, and the matching target overhead crane is determined from the remaining available overhead crane set indicated by the cost metric matrix for the target task in each row in turn to obtain the task matching pair set.

[0113] In this embodiment, after constructing the cost metric matrix, it is necessary to further determine the task matching pair set between the overhead traveling vehicle set and the candidate task set according to the constraint conditions of the cost metric matrix. Figure 6 As shown, first, the minimum second cost measurement value between each target task and the target overhead crane to be assigned is used as the first constraint condition, and the same overhead crane can only be assigned one task at the current time as the second constraint condition, and the matching overhead crane is determined for each task in the candidate task set according to the order of the row index of the cost measurement matrix from small to large.

[0114] For example, first, for the first row of global sorted index Corresponding target tasks , and its relative ready time is Minimum, that is, the closest generated task in the candidate task set. Based on the first constraint, the element with the smallest second cost metric value is determined from the elements in the first row of the matrix. ( Figure 6 ), which means the target task Assigned to Skytrain ; Secondly, for the second row of global sort index Corresponding target tasks , based on the first constraint, determine the element with the smallest second cost metric value from the second row of the matrix ( Figure 6 ), which means the target task Assigned to Skytrain ; Again, for the third row global sort index Corresponding target tasks , based on the first constraint, the element with the smallest second cost metric value is determined from the elements in the third row of the matrix ( Figure 6 ), which means the target task Assigned to Skytrain ; Then, for the fourth row, globally sort the index Corresponding target tasks , based on the first constraint, the element with the smallest second cost metric value is determined from the fourth row of the matrix ( Figure 6 However, according to the second constraint, that is, the same crane can only be assigned one task at the current time, Already assigned a target task , does not belong to the remaining available overhead travelling vehicles, so the second cost metric with the second smallest value is determined again. ( Figure 6 The target task is shown in the dashed box. Assigned to Skytrain ; Finally, for the last row, globally sort the index Corresponding target tasks , determine the element with the smallest second cost metric value from the elements in the last row of the matrix ( Figure 6 The target task is shown in the dashed box Assigned to Skytrain .

[0115] Therefore, according to the above scheduling strategy, the task matching pair set between the overhead travelling vehicle set and the candidate task set can be obtained as follows:

[0116] .

[0117] Subsequently, based on the task matching pair set between the overhead crane set and the candidate task set determined according to the constraint conditions of the cost metric matrix, each overhead crane in the overhead crane set can be controlled by the overhead crane control system (MOC) in the AMHS system to perform the matching task. After receiving the corresponding matching task instruction, each overhead crane can automatically walk to the starting process site of the target task based on the starting process site of the newly assigned target task to complete material loading after completing the currently assigned task and arriving at the destination process site to complete material unloading, and then automatically transport to the destination process site of the newly assigned target task according to the planned scheduling path.

[0118] It should be noted that the method described in the present application can be executed periodically based on a predetermined period, and the candidate task set in the AMHS system will be continuously updated according to the passage of time and the task completion status, and the second cost measurement value between each task and each overhead crane will be calculated based on the recalculated first ready time and relative ready time of each task in the new candidate task set, and the recalculated second ready time and task transfer time of each overhead crane in the overhead crane set. Finally, a new cost measurement matrix is ​​constructed based on the second cost measurement value, and a task matching pair set between the overhead crane set and the new candidate task set is determined according to the constraints of the cost measurement matrix. Based on the task matching pair set, each overhead crane in the overhead crane set is controlled to execute the matched new task.

[0119] The embodiment of the present application calculates the first cost metric value of task scheduling between each task and each overhead crane based on the first ready time and relative ready time of each task in the candidate task set, and based on the second ready time and task transfer time of each overhead crane in the overhead crane set, and calculates the second cost metric value of task scheduling between each task and each overhead crane based on the weighted sum of the first cost metric value and the relative ready time of each task, and finally calculates the cost metric matrix between the overhead crane set and the candidate task set based on the second cost metric value, determines the task matching pair set between the overhead crane set and the candidate task set according to the constraint conditions of the cost metric matrix, and controls each overhead crane in the overhead crane set to perform matching tasks based on the task matching pair set. Therefore, the embodiment of the present application can significantly improve the point-to-point automated transportation efficiency of wafers and other materials in semiconductor smart factories in large-scale overhead crane system scenarios, thereby improving the production efficiency and resource utilization of semiconductor smart factories.

[0120] Figure 7 1 is a schematic diagram of the structure of an overhead crane dispatching control device based on an AMHS system according to an embodiment of the present application. Figure 7 As shown, the overhead travelling crane dispatching control device based on the AMHS system in the embodiment of the present application includes the following units:

[0121] The time estimation unit 710 is used to calculate the first ready time and the relative ready time of each task based on the starting process site of each task in the candidate task set, and calculate the second ready time and the task transfer time of each crane based on the status information and position information of each crane in the crane set;

[0122] A first metric calculation unit 720, configured to calculate a first cost metric value of task scheduling between each task and each overhead crane based on the first ready time of each task, the second ready time of each overhead crane, and the task transfer time;

[0123] A second metric calculation unit 730, configured to calculate a second cost metric value for task scheduling between each task and each overhead crane based on a weighted sum of the first cost metric value and the relative ready time of each task;

[0124] The metric matrix calculation unit 740 is used to calculate the cost metric matrix between the overhead crane set and the candidate task set based on the second cost metric value, determine the task matching pair set between the overhead crane set and the candidate task set according to the constraint conditions of the cost metric matrix, and control each overhead crane in the overhead crane set to perform matching tasks based on the task matching pair set.

[0125] In one embodiment, if Figure 8 As shown, the time estimation unit 710 may include:

[0126] The first estimation subunit 810 is used to obtain the total number of tasks for sending materials to other process sites generated by the starting process site of each task within a unit time period, and calculate the average task cycle time of the starting process site of each task based on the total number of tasks;

[0127] The second estimation subunit 820 is used to calculate the initial estimated ready time of each task relative to the initial time based on the in-station sorting index of each task at the starting process site, and to obtain the first ready time of each task relative to the current time based on the initial estimated ready time.

[0128] In one implementation, the time estimation unit 710 may further include:

[0129] The third estimation subunit is used to calculate the difference between the initial estimated ready time of each task and the minimum value of the initial estimated ready time of all tasks in the candidate task set to obtain the relative ready time of each task.

[0130] In one implementation, the time estimation unit 710 may further include:

[0131] The fourth estimation subunit is used to calculate the sum of the remaining loading and unloading time and the remaining transportation time for each overhead crane to perform the currently assigned task, thereby obtaining the second ready time of each overhead crane; and calculate the time required for each overhead crane to move from the current position of completing the currently assigned task to the starting process site of each task to receive each task, thereby obtaining the task transfer time of each overhead crane.

[0132] In one implementation, the first metric calculation unit 720 may be configured to:

[0133] The difference between the sum of the second ready time and the task transfer time of each overhead crane and the first ready time of each task is calculated to obtain a first cost measurement value of task scheduling between each task and each overhead crane.

[0134] In one embodiment, if Fig. 9 As shown, the second metric calculation unit 730 may include:

[0135] A first calculation subunit 910, configured to calculate a first product of the relative ready time of each task and a first weight factor and a second product of the first cost metric value and a second weight factor;

[0136] The second calculation subunit 920 is used to calculate the sum of the first product and the second product to obtain a second cost measurement value for task scheduling between each task and each overhead crane.

[0137] In one implementation, the metric matrix calculation unit 740 may be used to:

[0138] The relative ready time of each task in the candidate task set is sorted from small to large as the row index, the sequence number of each overhead crane in the overhead crane set is used as the column index, and the second cost measurement value between each task and each overhead crane is used as the matrix element to obtain the cost measurement matrix between the overhead crane set and the candidate task set.

[0139] In one implementation, the metric matrix calculation unit 740 may also be used to:

[0140] According to the ascending order of the row index of the cost metric matrix, the first constraint condition is that the second cost metric value between each target task and the target overhead crane to be assigned is minimized, and the second constraint condition is that only one task can be assigned to the same overhead crane at the current time, and the matching target overhead crane is determined from the remaining available overhead crane set indicated by the cost metric matrix for the target task in each row in turn to obtain the task matching pair set.

[0141] The overhead crane scheduling control method and device based on the AMHS system of the embodiment of the present application calculates the first cost metric value of task scheduling between each task and each overhead crane based on the first ready time and relative ready time of each task in the candidate task set, and based on the second ready time and task transfer time of each overhead crane in the overhead crane set, and calculates the second cost metric value of task scheduling between each task and each overhead crane based on the weighted sum of the first cost metric value and the relative ready time of each task, and finally calculates the cost metric matrix between the overhead crane set and the candidate task set based on the second cost metric value, determines the task matching pair set between the overhead crane set and the candidate task set according to the constraint conditions of the cost metric matrix, and controls each overhead crane in the overhead crane set to perform matching tasks based on the task matching pair set. Therefore, the embodiment of the present application can significantly improve the point-to-point automated transportation efficiency of wafers and other materials in semiconductor smart factories in large-scale overhead crane system scenarios, thereby improving the production efficiency and resource utilization of semiconductor smart factories.

[0142] It should be noted that those skilled in the art can understand that the different implementation methods described in the method embodiments of the present application and their explanations and technical effects achieved are also applicable to the device embodiments of the present application and will not be repeated here.

[0143] Furthermore, an embodiment of the present application also proposes an electronic device, which may include: a processor and a memory. The memory stores computer program instructions, and the processor may call the computer program instructions in the memory to execute all or part of the steps of the method described in any embodiment of the present application. The computer program instructions in the above-mentioned memory may be implemented in the form of a software functional unit and may be stored in a computer-readable storage medium when sold or used as an independent product.

[0144] Furthermore, the present application also provides a computer program product, which includes a non-transitory computer-readable storage medium storing a computer program. When the computer-readable storage medium is connected to a computer device and the computer program is executed by one or more processors of the computer device, it can execute all or part of the steps of the method described in any embodiment of the present application.

[0145] Furthermore, the present application also provides a non-transitory computer-readable storage medium having a computer program stored thereon, which can be executed by one or more processors to perform all or part of the steps of the method described in any embodiment of the present application.

[0146] Through the description of the above implementation methods, those skilled in the art can clearly understand that the various implementation methods of the present application can be implemented by means of software or software combined with necessary general hardware platforms, and of course can also be implemented by hardware functions. Based on such an understanding, the technical solution of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art. The software product is stored in a storage medium, including several instructions to enable a computer device, such as but not limited to a personal computer, a server, or a network device, to perform all or part of the steps of the method described in any implementation method of the present application. The aforementioned storage medium may include: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk, etc., various media that can store computer program codes.

[0147] The above describes the exemplary embodiments of the present application. It should be understood that the above exemplary embodiments are not restrictive but illustrative, and the protection scope of the present application is not limited thereto. It should be understood that those skilled in the art can modify and vary the embodiments of the present application without departing from the spirit and scope of the present application, and these modifications and variations should be within the protection scope of the present application.

Claims

1. A method for overhead crane dispatching control based on AMHS system. It is characterized in that The method comprises: Calculate the first ready time and relative ready time of each task based on the starting process site of each task in the candidate task set, and calculate the second ready time and task transfer time of each crane based on the status information and position information of each crane in the crane set; Calculating a first cost metric value of task scheduling between each task and each overhead crane based on the first ready time of each task, the second ready time of each overhead crane, and the task transfer time; Calculating a second cost metric value for task scheduling between each task and each overhead crane based on a weighted sum of the first cost metric value and the relative ready time of each task; A cost metric matrix between the overhead crane set and the candidate task set is calculated based on the second cost metric value, a task matching pair set between the overhead crane set and the candidate task set is determined according to the constraint conditions of the cost metric matrix, and each overhead crane in the overhead crane set is controlled to perform a matching task based on the task matching pair set.

2. The overhead crane dispatching control method based on the AMHS system according to claim 1, It is characterized in that The step of calculating the first ready time and the relative ready time of each task based on the starting process site of each task in the candidate task set includes: Obtaining the total number of tasks for sending materials to other process sites generated by the starting process site of each task within a unit time period, and calculating the average task cycle time of the starting process site of each task based on the total number of tasks; Based on the average task cycle time of the starting process site of each task and the station sorting index of each task at the starting process site, the initial estimated ready time of each task relative to the initial time is calculated, and the first ready time of each task relative to the current time is obtained based on the initial estimated ready time.

3. The overhead crane dispatching control method based on the AMHS system according to claim 2, It is characterized in that The step of calculating the first ready time and the relative ready time of each task based on the starting process site of each task in the candidate task set includes: The difference between the initial estimated ready time of each task and the minimum value of the initial estimated ready time of all tasks in the candidate task set is calculated to obtain the relative ready time of each task.

4. The overhead crane dispatching control method based on the AMHS system according to claim 3, It is characterized in that The step of calculating the second ready time and task transfer time of each overhead crane based on the status information and position information of each overhead crane in the overhead crane set comprises: Calculating the sum of the remaining loading and unloading time and the remaining transportation time for each overhead crane to perform the currently assigned task, thereby obtaining the second ready time of each overhead crane; And the time required for each overhead crane from the current position of completing the currently assigned task to moving to the starting process site of each task to receive each task is calculated to obtain the task transfer time of each overhead crane.

5. The overhead crane dispatching control method based on the AMHS system according to claim 1, It is characterized in that The calculating of the first cost metric value of the task scheduling between each task and each overhead crane based on the first ready time of each task, the second ready time of each overhead crane, and the task transfer time comprises: The sum of the second ready time and the task transfer time of each overhead crane and the difference between the first ready time of each task are calculated to obtain a first cost metric value of task scheduling between each task and each overhead crane.

6. The overhead crane dispatching control method based on the AMHS system according to claim 5, It is characterized in that The step of calculating the second cost metric value for task scheduling between each task and each overhead crane based on the weighted sum of the first cost metric value and the relative ready time of each task includes: Calculate a first product of the relative ready time of each task and a first weight factor and a second product of the first cost metric value and a second weight factor; The sum of the first product and the second product is calculated to obtain a second cost measurement value for task scheduling between each task and each overhead crane.

7. The overhead crane dispatching control method based on the AMHS system according to claim 6, It is characterized in that The first weight factor is a fixed value that does not change with the relative ready time of each task; and the second weight factor is a dynamically changing value that is inversely proportional to the first ready time of each task.

8. The overhead crane dispatching control method based on the AMHS system according to claim 1, It is characterized in that The calculating of the cost metric matrix between the overhead traveling vehicle set and the candidate task set based on the second cost metric value comprises: The global sorting index of the relative ready time of each task in the candidate task set from small to large is used as the row index, the sequence number of each overhead crane in the overhead crane set is used as the column index, and the second cost measurement value between each task and each overhead crane is used as the matrix element to obtain the cost measurement matrix between the overhead crane set and the candidate task set.

9. The overhead crane dispatching control method based on the AMHS system according to claim 8, It is characterized in that Determining a set of task matching pairs between the set of overhead traveling vehicles and the set of candidate tasks according to the constraint conditions of the cost metric matrix includes: According to the ascending order of the row index of the cost metric matrix, the first constraint condition is that the second cost metric value between each target task and the target overhead crane to be assigned is minimized, and the second constraint condition is that the same overhead crane can only be assigned one task at the current moment, and the matching target overhead crane is determined from the remaining available overhead crane set indicated by the cost metric matrix for the target task in each row in turn to obtain the task matching pair set.

10. A crane dispatching control device based on AMHS system, It is characterized in that The device comprises: A time estimation unit, used to calculate the first ready time and relative ready time of each task based on the starting process site of each task in the candidate task set, and to calculate the second ready time and task transfer time of each crane based on the status information and position information of each crane in the crane set; A first metric calculation unit, configured to calculate a first cost metric value of task scheduling between each task and each overhead crane based on the first ready time of each task, the second ready time of each overhead crane, and the task transfer time; A second metric calculation unit, configured to calculate a second cost metric value for task scheduling between each task and each overhead crane based on a weighted sum of the first cost metric value and the relative ready time of each task; A metric matrix calculation unit is used to calculate the cost metric matrix between the overhead crane set and the candidate task set based on the second cost metric value, determine the task matching pair set between the overhead crane set and the candidate task set according to the constraint conditions of the cost metric matrix, and control each overhead crane in the overhead crane set to perform matching tasks based on the task matching pair set.

Citation Information

Patent Citations

  • Crown block scheduling method and system, processor and storage medium

    CN116128240A

  • Crown block transportation scheduling method based on multi-layer AMHS system

    CN116777126A