Backflow scheduling method and suspension system

Abstract

The invention relates to a backflow scheduling method and a hanging system. The method is applied to a control platform of a hanging system and comprises the following steps: in response to the processing requirements of processing equipment, determining obstacle objects which do not meet the processing requirements from storage objects at warehouse outlets of target warehouse locations corresponding to the processing equipment; determining a task association relationship between the obstacle object and each processing device; according to the task association relationship, determining a backflow scheduling strategy corresponding to the obstacle object; according to a backflow scheduling strategy, the obstacle object is scheduled to a corresponding target backflow storage location; the obstacle object which does not meet the current processing requirement at the warehouse exit of the target warehouse location is identified, and the corresponding backflow scheduling strategy is intelligently determined based on the task association relationship between the obstacle object and each processing device, so that the automatic identification and dynamic scheduling processing of the non-warehouse-out object in the hanging system are realized, and the processing efficiency is improved. The scheduling delay caused by the fact that the obstacle object blocks the warehouse-out path is effectively avoided, and the warehouse-out efficiency and the scheduling flexibility of the hanging system are improved.

Description

Technical Field

[0001] This application relates to the field of intelligent manufacturing technology, and in particular to a return flow scheduling method and a hanging system. Background Technology

[0002] In garment production, hanging systems are widely used in sewing and other stages due to their high efficiency and automation. However, when faced with diverse garment types, existing hanging systems, lacking reasonable buffering and scheduling mechanisms, are prone to frequent relocation and return during the outbound process, reducing operational efficiency. Therefore, improving the scheduling efficiency and flexibility of hanging systems in multi-variety, small-batch production has become a pressing technical challenge in the field of intelligent garment manufacturing.

[0003] There is currently no effective solution to the problems of low scheduling efficiency and low flexibility of the suspension system in related technologies. Summary of the Invention

[0004] Therefore, it is necessary to provide a backflow scheduling method and a hanging system to address the aforementioned technical problems.

[0005] Firstly, this application provides a return flow scheduling method applied to the control platform of a hanging system; the hanging system further includes a hanging storage warehouse and at least one processing device; the hanging storage warehouse includes multiple unidirectional flow storage locations; the method includes:

[0006] In response to the processing requirements of each processing equipment, obstacles that do not meet the processing requirements are identified from the storage objects at the outlet of the target storage location corresponding to each processing equipment.

[0007] Determine the task association relationship between the obstacle object and each of the processing devices;

[0008] Based on the task association, determine the backflow scheduling strategy corresponding to the obstacle object;

[0009] According to the backflow scheduling strategy, the obstacle object is scheduled to the corresponding target backflow storage location.

[0010] In one embodiment, the step of determining obstacle objects that do not meet the processing requirements from the storage objects at the exit of the target storage location corresponding to each processing device, in response to the processing requirements of each processing device, includes:

[0011] In response to the processing requirements of each processing equipment, at least one target storage location corresponding to each processing equipment is determined from the hanging storage location warehouse;

[0012] For each target storage location, identify the physical attributes of the storage object at the outlet of the target storage location;

[0013] If the physical properties of the stored object do not meet any of the processing requirements, the stored object is determined to be an obstacle object.

[0014] In one embodiment, determining the backflow scheduling strategy corresponding to the obstacle object based on the task association includes:

[0015] If the obstacle object has no task association with any of the processing equipment, then the backflow scheduling strategy corresponding to the obstacle object is determined to be the first backflow scheduling strategy;

[0016] If the obstacle object has a task association relationship with any of the processing equipment, then the backflow scheduling strategy corresponding to the obstacle object is determined to be the second backflow scheduling strategy.

[0017] In one embodiment, the backflow scheduling strategy includes a first backflow scheduling strategy; the target backflow storage location includes the original storage location corresponding to the obstacle object; the step of scheduling the obstacle object to the corresponding target backflow storage location according to the backflow scheduling strategy includes:

[0018] When the return scheduling strategy corresponding to the obstacle object is the first return scheduling strategy, the outbound point of the original storage location where the obstacle object is located is determined as the starting point of the first return path, and the inbound point of the original storage location where the obstacle object is located is determined as the ending point of the first return path.

[0019] Based on the starting point and ending point of the first return path, determine the first shortest return path corresponding to the obstacle object;

[0020] Control the obstructed object to flow back into the storage along the first shortest return path to the original storage location.

[0021] In one embodiment, the backflow scheduling strategy includes a second backflow scheduling strategy; the target backflow storage location includes a target cache storage location; and scheduling the obstacle object to the corresponding target backflow storage location according to the backflow scheduling strategy includes:

[0022] When the backflow scheduling strategy corresponding to the obstacle object is the second backflow scheduling strategy, determine the target cache location that matches the obstacle object;

[0023] The outbound point of the original storage location where the obstacle object is located is determined as the starting point of the second return path, and the inbound point of the target cache storage location is determined as the ending point of the second return path.

[0024] Based on the starting point and ending point of the second return path, determine the second shortest return path corresponding to the obstacle object;

[0025] Control the obstacle object to flow back into the storage along the second shortest return path to the target cache location.

[0026] In one embodiment, the storage location includes a priority outbound cache storage location and a delayed outbound cache storage location; determining the target cache storage location matching the obstacle object includes:

[0027] Obtain the processing task order corresponding to the processing equipment that has a task association relationship with the obstacle object;

[0028] If the sorting of the obstacle object in the processing task order meets the preset priority condition, then the priority outbound cache location is determined as the target cache location corresponding to the obstacle object;

[0029] If the sorting of the obstacle object in the processing task order does not meet the preset priority condition, then the delayed outbound cache location is determined as the target cache location corresponding to the obstacle object.

[0030] In one embodiment, the method further includes:

[0031] If the physical properties of the stored object satisfy any of the processing requirements, the stored object is determined to be an outbound object;

[0032] According to a preset priority order, the outbound objects are scheduled to the target processing equipment that matches the outbound objects.

[0033] In one embodiment, the storage location further includes a sorting storage location; the step of scheduling the outgoing object to a target processing device matching the outgoing object according to a preset priority order includes:

[0034] For each of the outbound objects, during the outbound operation on the outbound object, the outbound consumption time corresponding to the outbound object is determined;

[0035] If the outbound processing time exceeds a preset time threshold, the outbound process for the object is determined to be abnormal, and the outbound operation for the object is terminated.

[0036] In one embodiment, the suspension system further includes a vehicle storage device; the method further includes:

[0037] For each processing device, the carriers corresponding to the processed outbound objects are sequentially scheduled to the carrier storage devices according to the processing completion order.

[0038] In one embodiment, the step of sequentially scheduling the vehicles corresponding to the processed outbound objects to the vehicle storage device according to the processing completion order includes:

[0039] For each of the aforementioned carriers, the exit point of the processing equipment is determined as the starting point of the third return path, and the entry point of the carrier storage device is determined as the ending point of the third return path.

[0040] Path constraint factors are determined according to preset scheduling rules;

[0041] The third shortest return path corresponding to the vehicle is determined based on the path constraint factor, the starting point of the third return path, and the ending point of the third return path.

[0042] Control the vehicle to be scheduled to the vehicle storage device along the third shortest return path.

[0043] Secondly, this application also provides a hanging system, which includes at least a control platform, a hanging storage compartment, at least one processing device, and a carrier storage device;

[0044] The control platform is used to execute the backflow scheduling method described in any of the embodiments of the first aspect above.

[0045] Thirdly, this application also provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps of the method described in any of the embodiments of the first aspect above.

[0046] Fourthly, this application also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the method described in any of the embodiments of the first aspect above.

[0047] Fifthly, this application also provides a computer program product, including a computer program that, when executed by a processor, implements the steps of the method described in any of the embodiments of the first aspect above.

[0048] The aforementioned reflux scheduling method and hanging system, in response to the processing needs of each processing equipment, identify obstacle objects that do not meet processing requirements from the storage objects at the outbound port of the target storage location corresponding to each processing equipment; determine the task association relationship between the obstacle objects and each processing equipment; determine the reflux scheduling strategy corresponding to the obstacle objects based on the task association relationship; and schedule the obstacle objects to the corresponding target reflux storage location according to the reflux scheduling strategy. By identifying obstacle objects at the outbound port of the target storage location that do not meet the current processing needs, and intelligently determining their corresponding reflux scheduling strategies based on the task association relationship between the obstacle objects and each processing equipment, the automatic identification and dynamic scheduling processing of non-outbound objects in the hanging system is achieved, effectively avoiding scheduling delays caused by obstacle objects blocking the outbound path, and improving the outbound efficiency and scheduling flexibility of the hanging system. Attached Figure Description

[0049] To more clearly illustrate the technical solutions in the embodiments of this application or related technologies, the drawings used in the description of the embodiments of this application or related technologies will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0050] Figure 1 This is a flowchart illustrating the backflow scheduling method in one embodiment;

[0051] Figure 2 This is a flowchart illustrating the first backflow scheduling strategy in one embodiment;

[0052] Figure 3 This is a schematic diagram of a suspension system in one embodiment;

[0053] Figure 4 This is a flowchart illustrating the second backflow scheduling strategy in one embodiment;

[0054] Figure 5 This is a schematic diagram of a processing order corresponding to a processing device in one embodiment;

[0055] Figure 6 This is a flowchart illustrating the vehicle scheduling steps in one embodiment;

[0056] Figure 7 This is an internal structural diagram of a computer device in one embodiment. Detailed Implementation

[0057] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0058] The importance of hanging systems in the garment industry is increasingly evident. Traditional hanging systems are mostly used in the sewing process, while the cutting process usually still relies on manual handling and has not yet been incorporated into the hanging system. Especially in the production of bespoke garments, individual cutting is often required, which is time-consuming and complex. The waiting time for materials and the waiting time for material loading in the cutting process seriously affect the overall production progress. Including the fabric cutting process in the hanging operation would increase the complexity of the hanging system. Therefore, the hanging system urgently needs buffering capabilities to temporarily store processed garments for a period of time to achieve production line balance. Since the buffer storage takes up a lot of space, without reasonable storage rules, the storage of garments in the buffer will tend to be disordered, leading to low efficiency in subsequent scheduling and outbound processing.

[0059] In short, due to the physical structure of the hanging system, if multiple garments are mixed on the same hanging rod in the hanging buffer, when a certain garment needs to be retrieved, the garments obstructing the view must first be removed before the target workpiece can be retrieved and then transported to the corresponding processing station. Based on this, this application proposes a reflow scheduling method to effectively improve the low efficiency and low flexibility of reflow scheduling.

[0060] In one embodiment, the suspension system includes at least a control platform, a suspended storage bin, a track, and at least one processing device.

[0061] The suspension system refers to an automated system used for suspending, conveying, and managing workpieces (such as clothing and fabrics). The control platform may, but is not limited to, consist of an industrial computer, a programmable logic controller, scheduling software, and a database.

[0062] A hanging storage area refers to an area used for temporary storage of workpieces awaiting processing. A hanging storage area includes multiple unidirectional flow storage locations; each location can accommodate at least one stored item (such as a garment hanger); these locations are typically arranged along a circular or linear track. It is understood that each storage location has a unidirectional flow characteristic, meaning that the stored items in the location can only move in a fixed direction and cannot be reversed. For example, in the garment manufacturing industry, a storage area can be a storage rod, and the stored item can be a garment hanger with a care label.

[0063] The storage object entry process is as follows: Taking the cutting process as an example, when executing the entry process for each storage object, the target entry location corresponding to each storage object needs to be determined according to the preset entry rules. The shortest path algorithm is used to calculate the optimal transportation path corresponding to each storage object, and the storage object is transported to the target entry location for storage according to the optimal transportation path.

[0064] The preset inbound rules can include, but are not limited to, allocating storage locations based on physical attributes, interaction dates, etc., to ensure that hangers with the same physical attributes are stored together in the same location as much as possible. For example, the preset inbound rules could be "same fabric first, empty storage location second, mixed storage location last" to reduce the category mixing of a single storage location (i.e., storage bar), allowing hangers to be stored according to attributes such as fabric and delivery date, reducing unnecessary searching during outbound operations. The shortest path algorithm can include, but is not limited to, Dijkstra's algorithm; no specific limitation is made here.

[0065] Understandably, each stored object is optimized and allocated according to preset warehousing rules based on its physical attributes (such as fabric type, color, and process requirements) upon entry into the warehouse. Objects with similar attributes are centrally stored in the same or adjacent storage locations. This not only reduces the scheduling complexity during subsequent processing but also effectively avoids path conflicts and equipment waiting issues caused by mixing multiple product categories. This optimization strategy at the warehousing stage lays the foundation for improving outbound and return efficiency, achieving collaborative optimization and intelligent operation of the entire hanging system process.

[0066] Processing equipment refers to the equipment or workstations that perform specific processing tasks, such as cutting equipment (cutting tables) and sewing equipment. It is understood that each piece of equipment has its specific processing capabilities and task requirements, which need to be set according to actual needs; no specific limitations are made here.

[0067] In one embodiment, such as Figure 1 As shown, Figure 1 This is a flowchart illustrating a backflow scheduling method in one embodiment; the backflow scheduling method is applied to the control platform of a suspension system; the backflow scheduling method includes the following steps:

[0068] Step S101: In response to the processing requirements of each processing equipment, identify the obstacle objects that do not meet the processing requirements from the storage objects at the outlet of the target storage location corresponding to each processing equipment.

[0069] The processing requirements include at least the physical properties of the material to be processed and the remaining processing capacity. The physical properties of the material to be processed refer to the physical characteristics required by the processing equipment at the current stage of the process for the object to be processed. These physical properties may include, but are not limited to, material type; for example, in a cutting process, the physical property of the material to be processed can be the fabric type. The remaining processing capacity characterizes the current capacity that the processing equipment can accept; identifying the remaining processing capacity corresponding to the processing equipment can help avoid overloading the equipment.

[0070] Among them, "obstacle objects" refer to stored objects that do not meet the current processing requirements of various processing equipment. It is understandable that obstacle objects do not meet the outbound conditions and need to be returned accordingly.

[0071] Step S102: Determine the task association relationship between the obstacle object and each processing equipment.

[0072] Among them, the task association is used to determine the task affiliation between the obstacle object and each processing equipment, and then to determine the corresponding return scheduling strategy for the obstacle object, so as to ensure that the obstacle object is scheduled to the target return storage location that matches its subsequent processing steps in terms of spatial location, time rhythm and process flow, so as to prepare for subsequent processing.

[0073] It is understandable that by determining the task association between the obstacle object and each processing device, it is possible to determine whether the obstacle object is an object that each processing device will need to process in the future. For example, if there is no task association between the obstacle object and any processing device, it means that the obstacle object is not an object that any processing device will need to process in the future. If there is a task association between the obstacle object and any processing device, it means that the obstacle object is an object that processing device will need to process in the future.

[0074] Step S103: Determine the backflow scheduling strategy corresponding to the obstacle object based on the task association relationship.

[0075] Step S104: According to the backflow scheduling strategy, the obstacle object is scheduled to the corresponding target backflow storage location.

[0076] For example, the backflow scheduling method is illustrated using a processing device as an example. Assume that processing device A sends a processing request to the control platform, and the processing request includes the physical properties of the material to be processed; wherein, the physical property of the material to be processed is black fabric. The control platform receives the processing request and, in response to the processing needs of processing device A, identifies the storage object at the outlet of the target storage location corresponding to processing device A. If the storage object at the outlet of the target storage location does not meet the processing needs (i.e., does not meet the requirement that the physical property of the material to be processed is black fabric), it is identified as an obstacle object. Further, the task association relationship between the obstacle object and processing device A is determined. Based on the task association relationship, the backflow scheduling strategy corresponding to the obstacle object is determined. According to the backflow scheduling strategy, the obstacle object is scheduled to the corresponding target backflow storage location. If the storage object at the outlet of the target storage location meets the processing needs, the storage object is scheduled to processing device A, and so on, until the processing needs corresponding to processing device A are completed.

[0077] It is understood that this embodiment uses a single processing device as an example for explanation and illustration, aiming to clearly illustrate the core process and logical relationship of the reflow scheduling method, and is not intended to limit this application. The reflow scheduling method described in this application can be applied to complex hanging systems containing multiple processing devices, and can support multi-station parallel operation, cross-device task collaboration, and global warehouse resource scheduling.

[0078] In this embodiment, by identifying obstacles at the exit of the target storage location that do not meet the current processing requirements, and based on the task association between the obstacles and each processing equipment, the corresponding return scheduling strategy is intelligently determined, thereby realizing the automatic identification and dynamic scheduling of non-outbound objects in the hanging system. This effectively avoids scheduling delays caused by obstacles blocking the outbound path, and improves the outbound efficiency and scheduling flexibility of the hanging system.

[0079] In one embodiment, in response to the processing requirements of each processing device, determining the obstacle objects that do not meet the processing requirements from the storage objects at the exit of the target storage location corresponding to each processing device includes the following steps:

[0080] Step 1: In response to the processing needs of each processing equipment, determine at least one target storage location corresponding to each processing equipment from the hanging storage location warehouse.

[0081] The target storage location contains a storage object that matches at least one processing requirement.

[0082] Step 2: For each target storage location, identify the physical attributes of the stored objects at the outlet of the target storage location.

[0083] In one exemplary embodiment, the hanging system automatically identifies the physical attribute information of the storage object currently located at the front of the exit, including key parameters such as fabric type, by using an RFID reader or machine vision device deployed near the exit of the target storage location. This identification process is triggered in real time when the storage object arrives at the exit preparation position, ensuring data accuracy and timeliness.

[0084] Step 3: If the physical properties of the stored object do not meet any processing requirements, the stored object is identified as an obstacle object.

[0085] In an exemplary embodiment, the control platform matches the identified physical attributes of the stored object with the processing requirements of each processing device. If the physical attributes of the stored object do not match the physical attributes of the material to be processed required by any processing device, the stored object is determined to be an obstacle object. It is understood that although an obstacle object is located at the outbound port, it cannot be processed by any processing device and will block the outbound process of subsequent compliant stored objects. Therefore, a subsequent return flow scheduling strategy needs to be initiated to remove it from the outbound channel of the target storage location and release the channel resources.

[0086] It should be noted that when there are multiple processing devices, the processing requirements of each device are somewhat different. For example, the processing requirement of processing device A is that the physical property of the material to be processed is black fabric; the processing requirement of processing device B is that the physical property of the material to be processed is red fabric; and the processing requirement of processing device C is that the physical property of the material to be processed is yellow fabric. Assuming that the storage objects corresponding to black fabric and red fabric are stored in storage location C5, and the storage object corresponding to yellow fabric is stored in storage location C4, it can be determined that the target storage locations corresponding to each processing device are storage locations C5 and C4.

[0087] Taking storage location C5 as an example, the hanging system automatically identifies the physical attributes of the stored object currently located at the front of the exit of storage location C5 through RFID readers or machine vision devices deployed near the exit of the target storage location. The control platform matches the identified physical attributes of the stored object with the processing requirements of each processing equipment. If the physical attributes of the stored object (e.g., the stored object is blue fabric) do not meet the physical attributes of the material to be processed (i.e., black fabric and red fabric) required by processing equipment A and processing equipment B, the stored object is determined to be an obstacle object; if the physical attributes of the stored object (e.g., the stored object is red fabric) meet the physical attributes of the material to be processed (i.e., red fabric) required by processing equipment B, the stored object is determined to be an outbound object, and so on.

[0088] In this embodiment, intelligent perception and obstacle recognition of the warehouse outlet status are realized, providing accurate input for the subsequent formulation of return flow scheduling strategy based on task association, and effectively improving the operating efficiency and automation level of the hanging system in multi-variety, small-batch production mode.

[0089] In one embodiment, determining the backflow scheduling strategy corresponding to the obstacle object based on task association includes the following steps:

[0090] If the obstacle object has no task association with any of the processing equipment, then the return scheduling strategy corresponding to the obstacle object is determined to be the first return scheduling strategy.

[0091] If the obstacle object has a task association relationship with any processing equipment, then the backflow scheduling strategy corresponding to the obstacle object is determined to be the second backflow scheduling strategy.

[0092] The first reflow scheduling strategy is used to reflow the obstructed object back to its original storage location. The second reflow scheduling strategy is used to reflow the obstructed object back to the target cache storage location; the target cache storage location is used to provide temporary storage space for storage objects that are about to enter or will subsequently enter the processing stage, so as to facilitate timely retrieval later.

[0093] In this embodiment, based on the task association relationship between obstacle objects and various processing equipment, a corresponding return scheduling strategy is matched to achieve accurate classification and differentiated scheduling of obstacle objects, effectively avoiding resource waste or scheduling chaos caused by "one-size-fits-all" return. By determining whether an obstacle object belongs to any processing equipment's pending task, the system can intelligently select to return it to the original storage location or the target cache storage location. This releases the outbound channel, ensures continuous material supply, and takes into account the orderly connection of subsequent processing tasks. This not only improves the utilization efficiency of storage space resources and reduces invalid movement and path conflicts, but also enhances the responsiveness of the hanging system in a multi-variety, variable-batch production environment.

[0094] In one embodiment, such as Figure 2 As shown, Figure 2 This is a flowchart illustrating the first reflow scheduling strategy in one embodiment; the target reflow storage location includes the original storage location corresponding to the obstacle object; according to the reflow scheduling strategy, the obstacle object is scheduled to the corresponding target reflow storage location, including the following steps:

[0095] Step S201: When the return flow scheduling strategy corresponding to the obstacle object is the first return flow scheduling strategy, the outbound point of the original storage location where the obstacle object is located is determined as the starting point of the first return flow path, and the inbound point of the original storage location where the obstacle object is located is determined as the ending point of the first return flow path.

[0096] Step S202: Determine the first shortest return path corresponding to the obstacle object based on the starting point and ending point of the first return path.

[0097] The method for determining the first shortest return path can be, but is not limited to, using Dijkstra's algorithm; no specific limitation is made here.

[0098] It should be noted that when determining the first shortest return path, system business constraints need to be comprehensively considered, such as the direction of track operation and the unidirectional flow characteristics of the storage location, to ensure the feasibility of the first shortest return path.

[0099] Step S203: Control the obstructed object to return to the original storage location along the first shortest return path.

[0100] In one exemplary embodiment, with Figure 3Taking the aforementioned hanging system as an example, the hanging system includes main rails 100, 200, and 300 running counterclockwise; storage locations C1-C14 arranged along main rail 100; fast aisles C21-C23 arranged along main rail 300; processing equipment; carrier storage equipment; and shelving equipment. Storage locations C1-C14 can be functionally divided into empty hanger return rods C14, sorting rods C13, hanger storage rods C4-C7 and C9-C12, priority outbound buffer rod C8, delayed outbound buffer rod C3, and return rod C2. It should be noted that the sharp corners at each storage location and fast aisle in the diagram indicate the flow direction. Carrier storage equipment is used to store carriers, such as empty hangers; shelving equipment is used to implement the storage of objects.

[0101] Furthermore, assuming the target storage location corresponding to the processing equipment is storage location C5, and the physical property of the material to be processed is black fabric; the control platform identifies... Figure 3 The orange fabric garment at the exit of storage location C5 is identified as an obstacle object, and since it has no task association with the processing equipment, the corresponding return flow scheduling strategy is determined to be the first return flow scheduling strategy. At this point, the exit point of storage location C5, where the obstacle object is located, is determined as the starting point of the first return flow path, and the entry point of storage location C5, where the obstacle object is located, is determined as the ending point of the first return flow path. Based on the Dijkstra algorithm, according to the starting point of the first return flow path and the... The first shortest return path is determined at the end point of the return path. The first shortest return path is as follows: the obstacle object is discharged from the starting point of the first return path (i.e., the outlet of storage location C5) to the main rail 100, and then the obstacle object is transmitted to the inlet point of storage location C2 by the main control 100. Based on the unidirectional flow characteristics of storage location C2, the obstacle object is transmitted from storage location C2 to the main rail 200, and then the obstacle object is transmitted to the end point of the first return path (i.e., the inlet of storage location C5) for storage.

[0102] Understandably, when calculating the first shortest return path, the outbound and inbound points of each storage location are considered as nodes, and a corresponding adjacency matrix is ​​constructed based on parameters such as distance and direction between nodes. Then, based on the adjacency matrix, the starting point of the first return path, and the ending point of the first return path, the Dijkstra algorithm can be used to determine the first shortest return path corresponding to the obstacle object.

[0103] In this embodiment, by determining the outbound and inbound points of the original storage location as the start and end nodes of the return path, and combining this with system business constraints, intelligent return path planning and automatic relocation of obstructed objects are realized. This not only solves the outbound congestion problem, but also provides a foundation for subsequent task scheduling.

[0104] In one embodiment, such as Figure 4 As shown, Figure 4 This is a flowchart illustrating the second reflow scheduling strategy in one embodiment; the target reflow storage location includes a target cache storage location; the target cache storage location is used to provide temporary storage space for storage objects that are about to enter or will subsequently enter the processing stage, so as to facilitate timely subsequent retrieval. According to the reflow scheduling strategy, scheduling the obstructed object to the corresponding target reflow storage location includes the following steps:

[0105] Step S401: When the backflow scheduling strategy corresponding to the obstacle object is the second backflow scheduling strategy, determine the target cache location that matches the obstacle object.

[0106] The storage locations include priority outbound cache locations and delayed outbound cache locations. It's understood that priority outbound cache locations have a higher outbound priority than delayed outbound cache locations. Priority outbound cache locations are temporary storage locations used to store objects that are about to enter the next processing stage or are about to be issued; delayed outbound cache locations are temporary storage locations used to store objects that are not currently requiring urgent processing but will be processed or issued at a future time.

[0107] In one exemplary embodiment, determining the target cache location that matches the barrier object includes the following steps:

[0108] Step 1: Obtain the processing task order corresponding to the processing equipment that has a task association relationship with the obstacle object.

[0109] Here, a processing task sheet refers to a set of multiple processing tasks to be executed corresponding to a processing device, used to record the workpiece information that the processing device needs to process within the current production plan cycle; the workpiece information may include, but is not limited to, fabric type, carrier identification, outbound priority, etc.; in an exemplary embodiment, taking a cutting processing device as an example, the processing task sheet corresponding to the cutting processing device is as follows: Figure 5 As shown, it includes fabric type, hanger number, and outbound priority; where hanger number is the unique identifier for the hanger, used to identify the hanger; in the outbound priority column, "1" is the highest outbound priority, and so on.

[0110] It should be noted that when generating processing task orders for each processing device, the control platform categorizes and statistically analyzes the physical attributes of objects stored in the warehouse. It then sorts these categories in reverse order based on the quantity of each type of object. Finally, based on the number of processing devices and their processing capabilities, the platform adds each category of objects to the corresponding processing task order in reverse order. This ensures that objects with the same physical attributes are centrally assigned to a single processing device, avoiding warehouse location confusion caused by cross-device calls and improving the continuous processing efficiency of similar objects. The processing capabilities of the processing device refer to the physical attributes of the materials that the device is allowed to process.

[0111] For example, suppose the storage location has 50 storage objects, and the hanging system includes 2 processing devices. The 50 storage objects are statistically categorized and sorted in reverse order according to fabric type, resulting in 25 storage objects for red fabric, 20 for black fabric, and 5 for yellow fabric. Processing device A is capable of processing black and yellow fabrics, while processing device B is capable of processing red fabric. Based on this, the 25 red fabric storage objects are added to the processing task sheet of processing device B in reverse order, and the 20 black fabric storage objects and 5 yellow fabric storage objects are added to the processing task sheet of processing device A.

[0112] Step 2: If the sorting of the obstacle object in the processing task order meets the preset priority conditions, then the priority outbound cache location is determined as the target cache location corresponding to the obstacle object.

[0113] Among them, the preset priority conditions are used to determine whether the obstacle object needs to be responded to quickly and processed with priority in its associated processing task list.

[0114] Step 3: If the sorting of the obstacle object in the processing task order does not meet the preset priority conditions, then the delayed outbound cache location is determined as the target cache location corresponding to the obstacle object.

[0115] For example, with Figure 3 For example, the priority outbound cache location is location C8, and the delayed outbound cache location is location C3. Assume the preset priority condition is to determine whether the order of the obstacle object is within the top 10 in its associated processing task order. If so, the order of the obstacle object in the processing task order is determined to meet the preset priority condition, and the priority outbound cache location, i.e., location C8, is determined as the target cache location corresponding to the obstacle object. If not, the order of the obstacle object in the processing task order is determined to not meet the preset priority condition, and the delayed outbound cache location, i.e., location C3, is determined as the target cache location corresponding to the obstacle object.

[0116] Step S402: Determine the outbound point of the original storage location where the obstacle object is located as the starting point of the second return path, and determine the inbound point of the target cache storage location as the ending point of the second return path.

[0117] Step S403: Determine the second shortest return path corresponding to the obstacle object based on the starting point and ending point of the second return path.

[0118] Step S404: Control the obstacle object to flow back into the storage along the second shortest return path to the target cache location.

[0119] It should be noted that the logic for determining the second shortest return path is the same as that for determining the first shortest return path. Both require comprehensive consideration of system business constraints, such as the direction of track operation and the unidirectional flow characteristics of the storage location, which will not be elaborated here.

[0120] In one exemplary embodiment, based on Figure 3 Taking the target cache location as the priority outbound cache location (location C8) and the original location of the obstacle object as location C5 as an example, the outbound point of the original location of the obstacle object (location C5) is determined as the starting point of the second return path, and the inbound point of the priority outbound cache location (location C8) is determined as the ending point of the second return path. Based on the Dijkstra algorithm, the second shortest return path corresponding to the obstacle object is determined according to the starting point and ending point of the second return path. The second shortest return path is as follows: the obstacle object is outbound from the starting point of the second return path (i.e., the outbound port of location C5) to the main rail 100, and then transmitted to the inbound point of location C2 by the main control 100. Based on the unidirectional flow characteristic of location C2, the obstacle object is transmitted from location C to the main rail 200, and then transmitted to the ending point of the second return path (i.e., the inbound port of location C8) for inbound caching.

[0121] In this embodiment, based on whether the order of obstacle objects in the processing task order meets preset priority conditions, the system intelligently determines their target cache location. Then, based on the original location and the target cache location, a return path is planned, achieving differentiated and precise return scheduling for obstacle objects. For obstacle objects that meet the preset priority conditions, they are returned to the priority outbound cache location to ensure rapid subsequent outbound processing and improve system response speed. For obstacle objects that do not meet the preset priority conditions, they are returned to the delayed outbound cache location, rationally releasing core channel resources and avoiding cache congestion. This not only ensures the continuity and timeliness of critical processing tasks but also optimizes the utilization efficiency of cache space and path resources, enhancing the intelligent scheduling capability and operational stability of the hoisting system in complex production environments.

[0122] In one embodiment, the reflow scheduling method further includes the following steps:

[0123] Step 1: If the physical attributes of the stored object meet any processing requirement, determine the stored object as the outbound object.

[0124] It is understandable that items eligible for shipment can be dispatched to corresponding processing equipment for further processing.

[0125] Step 2: According to the preset priority order, schedule the outbound objects to the target processing equipment that matches the outbound objects.

[0126] The preset priority order is used to determine the scheduling order of multiple outbound objects.

[0127] Understandably, the priority of an outbound object can be determined based on the processing task order corresponding to the processing equipment that matches the outbound object, and then the outbound object can be scheduled to the target processing equipment that matches the outbound object according to the preset priority order.

[0128] Among these, storage locations also include sorting storage locations. It can be understood that sorting storage locations are used to sequentially buffer and reorganize multiple outbound objects, preventing congestion at the processing equipment entrance.

[0129] In one exemplary embodiment, with Figure 3 For example, storage location C13 is defined as a sorting storage location. For instance, when an outgoing object leaves the storage, it is transported along the main rail 100 and transported to the inbound point of storage location C13 according to a preset priority order. Based on the unidirectional flow characteristics of storage location C13, the outgoing object is transported from storage location C13 to the main rail 200, then through the main rail 200 to the fast channel C21, and finally through the main rail 300 to the corresponding processing equipment for processing.

[0130] In one embodiment, step 2, which schedules the outbound objects to the target processing equipment that matches the outbound objects according to a preset priority order, includes the following steps:

[0131] Step 2.1: For each outbound object, determine the outbound consumption time corresponding to the outbound object during the outbound operation.

[0132] Among them, outbound operation refers to the process of controlling the outbound object to start from the outbound point of its target storage location, leave the storage location, and enter the conveyor track.

[0133] The outbound consumption time refers to the time elapsed from when the system issues an outbound command to when the outbound object actually leaves the target storage location's outbound point. This outbound consumption time is used to monitor whether the outbound process is normal and to determine if there are any issues such as delays, congestion, or equipment malfunctions. In an exemplary embodiment, the method for determining the outbound consumption time corresponding to an outbound object can be, but is not limited to, using a timer; no specific limitation is made here.

[0134] Step 2.2: If the outbound consumption time is greater than the preset time threshold, the outbound object is determined to be abnormal, and the outbound operation on the outbound object is terminated.

[0135] The preset time threshold is the maximum allowable time for outbound shipments set by the system. The preset time threshold needs to be set according to the outbound shipment time of normal outbound operations, and no specific limit is set here.

[0136] For example, for each outbound object, during the outbound operation, the outbound consumption time corresponding to the outbound object is determined; if the outbound consumption time is greater than a preset time threshold, the outbound object is determined to be abnormal (e.g., the outbound object has an abnormality such as hardware detachment), the outbound operation for the outbound object is terminated, and the above steps are continued for the next outbound object; if the outbound consumption time is less than or equal to the preset time threshold, it indicates that the outbound object is normal.

[0137] In this embodiment, by setting a preset time threshold and comparing the outbound consumption time of the corresponding outbound object with the preset time threshold in real time, the execution efficiency of the outbound process can be effectively monitored. When the outbound consumption time exceeds the preset time threshold, the system immediately determines it as an "outbound anomaly" and automatically terminates the current scheduling operation for that outbound object. It can also mark the object as an abnormal object and trigger an alarm mechanism to notify technical personnel for intervention. This effectively avoids the problem of long waiting times for processing equipment due to outbound anomalies of individual outbound objects, improves the stability and automation level of the hanging system, and ensures the continuity of processing equipment.

[0138] In one embodiment, the hanging system further includes a carrier storage device for storing carriers, such as empty garment hangers. A carrier refers to a movable device in the hanging system used to carry and transport workpieces (such as garment hangers). The reflow scheduling method also includes:

[0139] For each processing device, the carriers corresponding to the processed outbound objects are sequentially scheduled to the carrier storage devices according to the order of processing completion.

[0140] In one exemplary embodiment, such as Figure 6 As shown, Figure 6 This is a flowchart illustrating the vehicle scheduling steps in one embodiment; the process involves sequentially scheduling the vehicles corresponding to the completed outbound objects to the vehicle storage device according to the order of completion of processing, including the following steps:

[0141] Step S601: For each carrier, the exit point of the processing equipment is determined as the starting point of the third return path, and the entry point of the carrier storage device is determined as the ending point of the third return path.

[0142] Step S602: Determine the path constraint factor according to the preset scheduling rules.

[0143] Among them, the preset scheduling rules are logical rules used to guide the decision-making of the vehicle return path, ensuring that the path is safe, efficient, and in line with the production cycle. The preset scheduling rules may include, but are not limited to, avoiding high-congestion areas and prohibiting reverse transmission, etc., and need to be set according to the business constraints of the hoisting system. No specific limitations are made here.

[0144] Among them, path constraint factors may include, but are not limited to, node occupancy status; it is understood that by determining path constraint factors according to preset scheduling rules and incorporating them into the path calculation model, potential blockage points can be avoided, ensuring that vehicles can be transported to vehicle storage devices efficiently and reliably.

[0145] Step S603: Determine the third shortest return path corresponding to the vehicle based on the path constraint factor, the starting point of the third return path, and the ending point of the third return path.

[0146] Step S604: Control the vehicle to be scheduled to the vehicle storage device along the third shortest return path.

[0147] For example, with Figure 3 Taking the suspension system as an example, for each vehicle, the exit point of the processing equipment is determined as the starting point of the third return path, and the entry point of the vehicle's storage equipment is determined as the ending point of the third return path. According to preset scheduling rules, path constraint factors are determined to avoid vehicle scheduling affecting the return scheduling of obstacle objects or the outbound scheduling of outbound objects. For example, the outbound point of storage location C2 is determined as a path unavailable node. Furthermore, the outbound and inbound points of each storage location are considered as nodes. Based on the path constraint factors and parameters such as distance and direction between nodes, a corresponding adjacency matrix is ​​constructed. Based on the adjacency matrix, the starting point of the third return path, and the ending point of the third return path, the Dijkstra algorithm can be used to determine the third shortest return path corresponding to the vehicle. Then, the vehicle is controlled to be scheduled to the vehicle storage device along the third shortest return path. The third shortest return path is as follows: the vehicle starts from the starting point of the third return path (i.e., the exit point of the processing equipment) and is first transported to the main rail 300; after being transported by the main rail 300, the vehicle is transferred to the fast channel C23; after completing an efficient transfer through the fast channel C23, it is connected to the main rail 200; it continues to run along the main rail 200 to the storage location C1, and then transfers to the main rail 100 through the storage location C1; the vehicle is scheduled to the storage location C14 through the main rail 100, and then reconnected to the main rail 200 from the storage location C14; finally, the vehicle is transported to the end point of the third return path (i.e., the entry point of the vehicle storage device) for storage along the main rail 200.

[0148] In this embodiment, by introducing a path constraint factor, the recovery process of empty vehicles can be ensured to be safe, efficient, and in line with the overall system operation rhythm, effectively avoiding return delays caused by path conflicts, congestion, or reverse transmission. By automatically controlling vehicles to return to the vehicle storage device along the optimal path, rapid recycling and reuse of vehicle resources is achieved.

[0149] In one embodiment, a hoisting system is provided, which includes at least a control platform, a hoisting storage compartment, at least one processing device, and a carrier storage device.

[0150] The control platform is used to execute the backflow scheduling method described in any of the above embodiments, and will not be repeated here.

[0151] Understandable Figure 3 The hanging system described herein is only for illustrative purposes and is not intended to limit this application. The hanging system can be adaptively expanded and adjusted according to actual application needs, and no specific limitations are made here.

[0152] In other embodiments, in addition to directly generating processing task orders corresponding to the processing equipment, deep integration with third-party management systems such as Enterprise Resource Planning (ERP) and Manufacturing Execution Systems (MLS) can be achieved through standardized API interfaces. This allows for real-time synchronization of order data, fabric inventory, equipment status, and other information, enabling automated flow of production data throughout the entire process. After integration, the priority of hanger outbound processing in the processing task order can be dynamically modified based on information such as order urgency and fabric inventory alerts from the third-party management system, improving scheduling flexibility.

[0153] In other embodiments, when determining the target cache location that matches the obstacle object, the corresponding target cache location can also be matched to the obstacle object based on the real-time processing speed of the processing equipment, the frequency of fabric use, etc.; for example, using Figure 3 For example, frequently used fabrics are prioritized for allocation to storage locations closer to processing equipment (such as storage locations C10-C12), while infrequently used fabrics are prioritized for storage in more distant locations (such as C3-C8) to reduce transportation time. Furthermore, historical processing data can be combined with machine learning to predict the frequency of fabric usage in the future, allowing high-frequency fabrics to be pre-stored in designated cache locations to further reduce the need for repatriation.

[0154] In other embodiments, when an emergency order needs to be prioritized, it is permissible to temporarily break the preset warehousing rules, such as "low mixing priority", and insert the hangers of the emergency order into the existing storage location (even if there is a small amount of product mixing). The corresponding scheduling is carried out through the above-mentioned return flow scheduling method to balance efficiency and the rigidity of the rules.

[0155] It should be understood that although the steps in the flowcharts of the embodiments described above are shown sequentially according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the flowcharts of the embodiments described above may include multiple steps or multiple stages. These steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these steps or stages is not necessarily sequential, but can be performed alternately or in turn with other steps or at least some of the steps or stages of other steps.

[0156] In one exemplary embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be as follows: Figure 7 As shown, this computer device includes a processor, memory, input / output (I / O) interfaces, and a communication interface. The processor, memory, and I / O interfaces are connected via a system bus, and the communication interface is also connected to the system bus via the I / O interfaces. The processor provides computational and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system, computer programs, and a database. The internal memory provides the environment for the operating system and computer programs stored in the non-volatile storage media. The database stores backflow scheduling-related data. The I / O interfaces are used for exchanging information between the processor and external devices. The communication interface is used for communicating with external terminals via a network connection. When the computer program is executed by the processor, it implements a backflow scheduling method.

[0157] Those skilled in the art will understand that Figure 7 The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0158] In one embodiment, a computer device is also provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps in the above method embodiments.

[0159] In one embodiment, a computer-readable storage medium is provided having a computer program stored thereon that, when executed by a processor, implements the steps in the above method embodiments.

[0160] In one embodiment, a computer program product is provided, including a computer program that, when executed by a processor, implements the steps in the above method embodiments.

[0161] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, data stored, data displayed, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of the relevant data must comply with relevant regulations.

[0162] Those skilled in the art will understand that all or part of the processes in the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium, and when executed, it can include the processes of the embodiments of the above methods. Any references to memory, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM). The databases involved in the embodiments provided in this application may include at least one type of relational database and non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the embodiments provided in this application may be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, artificial intelligence (AI) processors, etc., and are not limited to these.

[0163] The technical features of the above embodiments can be combined in any way. For the sake of brevity, 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 application.

[0164] The embodiments described above are merely illustrative of several implementation methods of this application, and while the descriptions are specific and detailed, they should not be construed as limiting the scope of this patent application. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the protection scope of this application should be determined by the appended claims.

Claims

1. A backflow scheduling method, characterized in that, A control platform for a suspended system; the suspended system further includes suspended storage locations and at least one processing device; the suspended storage locations include multiple unidirectional flow storage locations; the method includes: In response to the processing requirements of each processing equipment, obstacles that do not meet the processing requirements are identified from the storage objects at the outlet of the target storage location corresponding to each processing equipment. Determine the task association relationship between the obstacle object and each of the processing devices; Based on the task association, determine the backflow scheduling strategy corresponding to the obstacle object; According to the backflow scheduling strategy, the obstacle object is scheduled to the corresponding target backflow storage location.

2. The method according to claim 1, characterized in that, In response to the processing requirements of each processing device, the process of identifying obstacle objects that do not meet the processing requirements from the storage objects at the exit of the target storage location corresponding to each processing device includes: In response to the processing requirements of each processing equipment, at least one target storage location corresponding to each processing equipment is determined from the hanging storage location warehouse; For each target storage location, identify the physical attributes of the storage object at the outlet of the target storage location; If the physical properties of the stored object do not meet any of the processing requirements, the stored object is determined to be an obstacle object.

3. The method according to claim 1, characterized in that, The step of determining the backflow scheduling strategy corresponding to the obstacle object based on the task association includes: If the obstacle object has no task association with any of the processing equipment, then the backflow scheduling strategy corresponding to the obstacle object is determined to be the first backflow scheduling strategy; If the obstacle object has a task association relationship with any of the processing equipment, then the backflow scheduling strategy corresponding to the obstacle object is determined to be the second backflow scheduling strategy.

4. The method according to claim 1, characterized in that, The backflow scheduling strategy includes a first backflow scheduling strategy; the target backflow storage location includes the original storage location corresponding to the obstacle object; the step of scheduling the obstacle object to the corresponding target backflow storage location according to the backflow scheduling strategy includes: When the return scheduling strategy corresponding to the obstacle object is the first return scheduling strategy, the outbound point of the original storage location where the obstacle object is located is determined as the starting point of the first return path, and the inbound point of the original storage location where the obstacle object is located is determined as the ending point of the first return path. Based on the starting point and ending point of the first return path, determine the first shortest return path corresponding to the obstacle object; Control the obstacle object to re-enter the storage along the first shortest return path back to the original storage location.

5. The method according to claim 1, characterized in that, The backflow scheduling strategy includes a second backflow scheduling strategy; the target backflow storage location includes a target cache storage location; the step of scheduling the obstacle object to the corresponding target backflow storage location according to the backflow scheduling strategy includes: When the backflow scheduling strategy corresponding to the obstacle object is the second backflow scheduling strategy, determine the target cache location that matches the obstacle object; The outbound point of the original storage location where the obstacle object is located is determined as the starting point of the second return path, and the inbound point of the target cache storage location is determined as the ending point of the second return path. Based on the starting point and ending point of the second return path, determine the second shortest return path corresponding to the obstacle object; Control the obstacle object to flow back into the storage along the second shortest return path to the target cache location.

6. The method according to claim 5, characterized in that, The storage location includes priority outbound cache storage locations and delayed outbound cache storage locations; determining the target cache storage location that matches the obstacle object includes: Obtain the processing task order corresponding to the processing equipment that has a task association relationship with the obstacle object; If the sorting of the obstacle object in the processing task order meets the preset priority condition, then the priority outbound cache location is determined as the target cache location corresponding to the obstacle object; If the sorting of the obstacle object in the processing task order does not meet the preset priority condition, then the delayed outbound cache location is determined as the target cache location corresponding to the obstacle object.

7. The method according to claim 2, characterized in that, The method further includes: If the physical properties of the stored object satisfy any of the processing requirements, the stored object is determined to be an outbound object; According to a preset priority order, the outbound objects are scheduled to the target processing equipment that matches the outbound objects.

8. The method according to claim 7, characterized in that, The storage location also includes a sorting storage location; the step of scheduling the outbound object to the target processing equipment matching the outbound object according to a preset priority order includes: For each of the outbound objects, during the outbound operation on the outbound object, the outbound consumption time corresponding to the outbound object is determined; If the outbound processing time exceeds a preset time threshold, the outbound process for the object is determined to be abnormal, and the outbound operation for the object is terminated.

9. The method according to claim 1, characterized in that, The suspension system further includes a vehicle storage device; the method further includes: For each processing device, the carriers corresponding to the processed outbound objects are sequentially scheduled to the carrier storage devices according to the processing completion order.

10. The method according to claim 9, characterized in that, The step of sequentially scheduling the carriers corresponding to the processed outbound objects to the carrier storage device according to the processing completion order includes: For each of the aforementioned carriers, the exit point of the processing equipment is determined as the starting point of the third return path, and the entry point of the carrier storage device is determined as the ending point of the third return path. Path constraint factors are determined according to preset scheduling rules; The third shortest return path corresponding to the vehicle is determined based on the path constraint factor, the starting point of the third return path, and the ending point of the third return path. Control the vehicle to be scheduled to the vehicle storage device along the third shortest return path.

11. A suspension system, characterized in that, The hoisting system includes at least a control platform, a hoisting storage compartment, at least one processing device, and a carrier storage device; The control platform is used to execute the backflow scheduling method according to any one of claims 1 to 10.

Images