Towel production plan intelligent scheduling method and system

By constructing a conflict chain graph and optimizing the task chain, the problem of resource conflict in towel production was solved, improving resource utilization efficiency and production scheduling flexibility.

CN121543938APending Publication Date: 2026-02-17HEBEI BAILIXIN HOME TEXTILE CO LTD

Patent Information

Application Number
CN202511639909.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-11-11
Publication Date
2026-02-17

AI Technical Summary

Technical Problem

Existing towel production planning and scheduling methods are difficult to adapt to real-world scenarios with frequent resource conflicts and complex overlapping of orders and tasks, leading to problems such as duplicate resource allocation and queuing delays.

Method used

By constructing a conflict chain map and a conflict release priority area, path compression and task reconstruction are performed based on compressible marker fields and process priority identifiers, generating optimized task chains and path adjustment records, and updating the towel scheduling table and structure diagram.

Benefits of technology

Significantly improves resource utilization efficiency, reduces task blockage and scheduling bottlenecks, and enhances the visibility and flexibility of production scheduling.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN121543938A_ABST
    Figure CN121543938A_ABST
Patent Text Reader

Abstract

The invention relates to the field of production scheduling, in particular to an intelligent scheduling method and system for towel production plans. The method comprises the following steps: obtaining towel production order data and a process execution sequence of a towel production information platform, constructing a dependency relationship between process task nodes and tasks according to the process execution sequence and the towel production order data, and generating a towel process task chain set; analyzing resource occupation overlapping conditions among the towel process task chains to construct conflicting resource nodes, analyzing the conflicting resource nodes, constructing conflicting paths, generating a conflicting chain graph, and dividing conflicting release priority areas; analyzing the towel process task chain based on the conflict release priority area and the conflict chain atlas, generating an optimized task chain, and obtaining a schedulable task chain and a path adjustment record; and updating the process task node through the path adjustment record, and generating a towel scheduling table and a towel scheduling structure chart. The method can improve the reasonability of towel production resource scheduling.
Need to check novelty before this filing date? Find Prior Art

Description

TECHNICAL FIELD

[0001] The present application relates to the field of production scheduling, in particular to a towel production plan intelligent scheduling method and system. BACKGROUND

[0002] With the continuous intensification of the scale of the towel industry and the trend of order individualization, production enterprises have higher requirements for the efficiency and flexibility of scheduling. The production process of towels usually covers multiple process links such as spinning, dyeing, setting, sewing, packaging, etc. There are strict sequence dependency and resource constraint conditions between processes, especially in the post-processing stage, different orders often share key production resources such as dyeing and finishing equipment and drying equipment.

[0003] The Chinese patent with publication number CN112446526A discloses a production scheduling system and method, which includes a data cleaning module for cleaning production data from multiple databases, a pre-processing calculation module for pre-processing the production data from the data cleaning module to obtain extraction data, and a reinforcement learning model for generating optimal scheduling decisions according to a scoring function and the extraction data. Accordingly, a production scheduling method is disclosed.

[0004] In the prior art, the towel production plan scheduling still generally adopts a strategy based on fixed rules or single task priority driving, which is difficult to adapt to the actual scene of frequent resource conflicts and complex order task interlacing. This leads to problems such as repeated occupation and queuing delay of resource scheduling, and unreasonable task compression, which are problems we need to solve. SUMMARY

[0005] The present application aims to solve the problems in the background art and provides a towel production plan intelligent scheduling method and system.

[0006] The technical solution of the present application is a towel production plan intelligent scheduling method, which includes the following steps: S1, obtaining towel production order data and process execution order of a towel production information platform, analyzing the towel production order data according to the process execution order, constructing process task nodes and task dependency relationships, and generating a set of towel process task chains; S2, analyzing the resource occupation overlap between each towel process task chain to construct conflict resource nodes, analyzing the conflict resource nodes, constructing conflict paths, generating a conflict chain map, and dividing conflict release priority areas; S3. Based on the conflict release priority area and conflict chain map, analyze the towel process task chain, generate an optimized task chain, and obtain schedulable task chains and path adjustment records; update the process task nodes through path adjustment records to generate a towel scheduling table and a towel scheduling structure diagram.

[0007] Preferably, the process of acquiring towel production order data and process execution sequence from the towel production information platform, analyzing the towel production order data according to the process execution sequence, constructing process task nodes and task dependencies, and generating a set of towel process task chains includes: The towel production order data includes order number, product specifications, and post-processing flow. Based on the post-processing flow and execution order of each towel production order, the data is divided into multiple process tasks. Process task nodes are then constructed based on these tasks. Each process task node includes a task number, its corresponding order number, process type, estimated time period, target resource type, compressibility flag, process priority identifier, and task hierarchy number. The compressibility flag includes compressible and incompressible tasks; the process priority identifier includes high-priority, medium-priority, and low-priority identifiers. For each towel production order data, establish task dependencies among multiple process task nodes according to the corresponding process execution order. Establish dependency edges between process task nodes through task dependencies, and link adjacent process task nodes through dependency edges to generate a process task chain. Summarize the process task chains corresponding to each towel production order data to construct a towel process task chain set.

[0008] Preferably, the process of analyzing the resource overlap between various towel-making task chains to construct conflicting resource nodes, analyzing the conflicting resource nodes, constructing conflict paths, and generating a conflict chain graph includes: Traverse the target resource types involved in the towel process task chain set, identify cases where any two or more process task nodes have overlapping expected time periods for the same target resource type. If the expected time periods overlap, mark the process task node corresponding to the expected time period as a conflicting task node, and construct the corresponding conflicting resource node according to the target resource type associated with the conflicting task node, and construct a set of conflicting resource nodes. In the set of conflicting resource nodes, obtain the task dependency relationship of each conflicting task node in the process task chain, and construct the upstream and downstream dependency relationship between conflicting task nodes based on the task dependency relationship of each conflicting task node in the process task chain. If there is a continuous occupation of conflicting resources between the preceding task node and the subsequent task node, a conflict path is established between the corresponding conflicting resource nodes; the set of structures formed by multiple conflicting resource nodes and the conflict paths between them is denoted as a conflict chain graph.

[0009] Preferably, the process of dividing the conflict release priority area, analyzing the towel manufacturing task chain based on the conflict release priority area and the conflict chain map, and generating an optimized task chain is as follows: The resource scarcity of conflict paths in the conflict chain graph is analyzed. Combining the process priority and compressibility markers of process task nodes, the priority of conflict resource nodes in the graph is evaluated. Conflict resource nodes marked with both high priority and compressible tasks are classified as immediate release nodes; those marked with both low priority and compressible tasks are classified as sequential release nodes; and those marked with incompressible tasks are classified as delayed release nodes. The immediate release nodes, sequential release nodes, and delayed release nodes are then summarized and marked to form conflict release priority areas. The conflicting resource nodes in the conflict release priority area are parsed to identify weakly dependent nodes. Under the conditions of satisfying the preset path compression conditions and resource release threshold, the connection between the weakly dependent nodes and the corresponding subsequent task nodes is disconnected to generate a structural path break. The broken task chain structure is then reconstructed to obtain an optimized task chain.

[0010] Preferably, the process of analyzing the towel manufacturing task chain and generating a schedulable task chain based on the conflict release priority area and conflict chain map includes: The optimized task chain in the conflict release priority area is traversed to identify process task nodes with compressible tag fields. Based on the process type of the process task node and the corresponding target resource type, the resource binding relationship between the process task node and the resource is established. The preset process compression rule table is called to obtain the minimum running time threshold and acceptable compression ratio allowed by the process type. By combining the original estimated time period of the process task node, comparing the minimum running time threshold with the acceptable compression ratio, the compression operation space of the corresponding process task node is determined, the estimated time period of the process task node is compressed, and the connection relationship between the incoming and outgoing edges of the compressed process task node is adjusted synchronously to generate the execution time period. Based on the resource binding relationship and execution time period of each process task node in the optimized task chain, the occupancy of each resource is dynamically analyzed to generate a usage plan for the target resource. The usage plan for the target resource is analyzed to identify whether there is an available idle time window. When the execution time period of the compressed process task node can fall completely within the idle time window, the compressed process task node is adjusted to the idle time window to obtain a schedulable task chain.

[0011] Preferably, the process of analyzing the towel manufacturing task chain and generating path adjustment records based on the conflict release priority area and conflict chain map includes: The process task node set in the conflict release priority area within the schedulable task chain is traversed to identify process task nodes with yield control fields set; the yield control fields include incompressible tasks that are not allowed to yield, incompressible tasks that are allowed to yield, and compressible tasks. Construct a set of conflicting task pairs based on task dependencies and resource conflict paths in the conflict chain graph; The conflicting task sets are sorted according to the scheduling priority rules. Based on the sorting results, the execution time of the process task nodes that are ranked lower is reallocated, and the order of process task nodes in the schedulable task chain and the dependency relationship between process task nodes are adjusted. The task position adjustment process includes: reallocating the time windows of process task nodes and adjusting the time sequence relationship between process task nodes and their corresponding preceding and subsequent task nodes; and generating path adjustment records during the task position adjustment process.

[0012] Preferably, the process of updating process task nodes through path adjustment records to generate a towel scheduling table and a towel scheduling structure diagram includes: Extract the compressed execution time period and adjusted resource number of each process task node from the path adjustment record; update the resource binding relationship based on the compressed execution time period and adjusted resource number; By combining the arrangement order of each process task node in the schedulable task chain and the incoming and outgoing edge connection structure between the process task node and its adjacent preceding and subsequent task nodes, an execution order table for the schedulable task chain is constructed; the information in the path adjustment record is integrated to construct a task scheduling table; based on the task scheduling table, the execution order table, and the resource binding relationship, a towel scheduling table and a towel scheduling structure diagram are generated.

[0013] This invention also discloses an intelligent scheduling system for towel production planning, including a management center, which is communicatively connected to a towel order module, a towel task analysis module, and a towel production planning and scheduling module. The towel order module is used to obtain towel production order data and process execution order from the towel production information platform, analyze the towel production order data according to the process execution order, construct process task nodes and task dependencies, and generate a set of towel process task chains. The towel task analysis module is used to analyze the resource occupation overlap between various towel process task chains, construct conflict resource nodes, analyze the conflict resource nodes, construct conflict paths, generate conflict chain graphs, and divide conflict release priority areas. The towel production planning and scheduling module is used to analyze the towel process task chain based on the conflict release priority area and conflict chain map, generate optimized task chains, and obtain schedulable task chains and path adjustment records; the process task nodes are updated through path adjustment records to generate a towel scheduling table and a towel scheduling structure diagram.

[0014] Compared with the prior art, the above-mentioned technical solution of the present invention has the following beneficial technical effects: By constructing a conflict chain graph and a conflict release priority area, and performing path compression and task reconstruction based on compressible marker fields and process priority identifiers, it is possible to intelligently compress and give way to task nodes with resource conflicts in the process task chain, thereby significantly improving resource utilization efficiency and reducing the frequency of task blocking rate and scheduling bottleneck problems caused by resource overlap in traditional towel scheduling; Through the generation of path adjustment records and the update mechanism of schedulable task chains, the dynamic reconfiguration of task node execution time periods and resource binding relationships is realized, and a towel scheduling table and scheduling structure diagram are constructed, which can support the refined execution and dynamic review of subsequent production plans, effectively enhancing the visibility and flexibility of the towel production scheduling process. Attached Figure Description

[0015] Figure 1 This is a flowchart of one embodiment of the present invention. Detailed Implementation

[0016] Example 1, as Figure 1 As shown, the present invention proposes an intelligent scheduling method for towel production planning, which includes the following steps: S1. Obtain towel production order data and process execution sequence from the towel production information platform, analyze the towel production order data according to the process execution sequence, construct process task nodes and task dependencies, and generate a set of towel process task chains. S2. Analyze the resource occupation overlap between each towel process task chain to construct conflict resource nodes, analyze the conflict resource nodes, construct conflict paths, generate a conflict chain graph, and divide the conflict release priority area. S3. Based on the conflict release priority area and conflict chain map, analyze the towel process task chain, generate an optimized task chain, and obtain schedulable task chains and path adjustment records; update the process task nodes through path adjustment records to generate a towel scheduling table and a towel scheduling structure diagram.

[0017] It should be further explained that, in the specific implementation process, the process of obtaining towel production order data and process execution sequence from the towel production information platform, analyzing the towel production order data according to the process execution sequence, constructing process task nodes and task dependencies, and generating a set of towel process task chains is as follows: The towel production order data includes order number, product specifications, planned delivery time, and post-processing process flow. The post-processing process flow includes, but is not limited to, embroidery, shearing, laser marking, packaging, sewing, and folding. The product specifications include fabric type, color code, and customer attribute information. The process execution order refers to the execution order of the post-processing process flow. Based on the post-processing process flow and process execution sequence of each towel production order data, the towel production order data is divided into multiple process tasks, and process task nodes are constructed based on the multiple process tasks of the towel production order data. The process task node is used to represent the execution requirement of a certain process in the towel production order, and includes task number, order number, process type, expected time period, target resource type, compressible marker field, process priority identifier, and task level sequence number. It should be noted that in the process task node, the order number and process type are the original data fields provided in the towel production order data; the task number and task level sequence number are unique identifiers automatically generated by the towel production information platform according to the task parsing order during the process task node construction process; the estimated time period is calculated by the system based on the process type, equipment production capacity, order quantity, and process standard parameters; the target resource type is automatically matched by the towel production information platform based on the process type and resources; the compressibility marker is generated by the towel production information platform according to the process adjustability strategy, including compressible tasks and incompressible tasks; the process priority identifier is automatically assigned by the towel production information platform according to the order delivery requirements, customer priority, or task characteristics, including high priority identifier, medium priority identifier, and low priority identifier. For each towel production order data, multiple process task nodes are established according to the corresponding process execution order to establish task dependency relationships. Dependency edges are established between process task nodes through task dependency relationships. The dependency edges are used to describe the process sequence constraints and resource connection requirements of process task nodes. Adjacent process task nodes are linked through dependency edges to generate a process task chain. The process task chains corresponding to each towel production order data are summarized to construct a towel process task chain set, which is used to represent the execution order network structure of multiple orders.

[0018] It should be further explained that, in the specific implementation process, the process of analyzing the resource overlap between each towel-making task chain to construct conflicting resource nodes, analyzing the conflicting resource nodes to construct conflict paths, generating a conflict chain graph, and delineating priority areas for conflict release is as follows: Traverse the target resource types involved in the towel process task chain set, identify cases where any two or more process task nodes have overlapping expected time periods for the same target resource type. If the expected time periods overlap, mark the process task node corresponding to the expected time period as a conflicting task node, and construct the corresponding conflicting resource node according to the target resource type associated with the conflicting task node, and construct a set of conflicting resource nodes. In the set of conflicting resource nodes, the task dependencies of each conflicting task node in the process task chain are obtained. Based on the task dependencies of each conflicting task node in the process task chain, upstream and downstream dependencies between conflicting task nodes are constructed. The upstream and downstream dependencies refer to the logical sequential associations established between conflicting resource nodes based on the execution order or resource waiting order of the conflicting resource nodes in their respective process task chains, which are used to represent the propagation direction of resource conflicts between different tasks. If there is continuous occupation of conflicting resources between a preceding task node and a subsequent task node, a conflict path is established between the corresponding conflicting resource nodes. The conflict path represents the sequential propagation relationship of resource conflicts. The preceding task node refers to a task node that must be completed before a certain task node starts execution based on the process flow. The subsequent task node refers to a task node that depends on the completion of the preceding task node before it can start execution. Continuous occupation refers to a resource usage arrangement with no buffer gap or only a very short transition time in time, that is, the resource is in a continuous occupation state. The set of structures consisting of multiple conflicting resource nodes and their conflict paths is called a conflict chain graph. The conflict chain graph is used to characterize the propagation path features of resource occupation conflicts among multiple process task chains. The resource stress level of conflict paths in the conflict chain graph is analyzed. Resource stress level refers to the intensity of repeated occupation of a resource type by multiple task nodes in the conflict chain graph. This can be measured by statistically analyzing the number of times the same resource is repeatedly requested by multiple process task nodes per unit time, or by calculating its time occupation density. Combining the process priority identifier and compressibility marker of the process task nodes, the conflict resource nodes in the graph are prioritized. Conflict resource nodes simultaneously marked with high priority and compressible tasks are classified as immediately released nodes; those simultaneously marked with low priority and compressible tasks are classified as sequentially released nodes; and those marked with incompressible tasks are classified as delayed release nodes. Immediately released nodes, sequentially released nodes, and delayed release nodes are then summarized and marked to form conflict release priority regions, which include immediate release priority regions, sequential release priority regions, and delayed release priority regions.

[0019] It should be further explained that, in the specific implementation process, based on the conflict release priority area and conflict chain map, the towel process task chain is analyzed to generate an optimized task chain, and schedulable task chains and path adjustment records are obtained; the process task nodes are updated through the path adjustment records to generate the towel scheduling table and towel scheduling structure diagram as follows: The conflict resource nodes in the conflict release priority area are parsed to identify weakly dependent nodes. The weakly dependent nodes refer to the subsequent task nodes in the process task chain and the task dependency relationship, which can be executed in advance or in parallel at the scheduling level and do not constitute a mandatory execution order in the process. Under the conditions of satisfying preset path compression conditions and resource release thresholds, the connection between weakly dependent nodes and their corresponding subsequent task nodes is disconnected, generating a structural path break, and the task chain structure after the break is reconstructed to obtain an optimized task chain; the path compression conditions include, but are not limited to, satisfying the logical closure of the task chain after disconnection, not violating order delivery requirements, and not causing resource congestion in subsequent tasks; the resource release threshold conditions include, but are not limited to, the idle time period of resources released after disconnection being not less than a set duration or the proportion of available time exceeding a preset threshold.

[0020] The optimized task chain in the conflict release priority area is traversed to identify process task nodes with compressible marker fields. Based on the process type of the process task node and the corresponding target resource type, a resource binding relationship between the process task node and the resource is established. A preset process compression rule table is called to obtain the minimum running time threshold and acceptable compression ratio allowed for the process type. The process compression rule table includes the minimum running time threshold and the acceptable compression ratio. By combining the original estimated time period of the process task node, comparing the minimum running time threshold with the acceptable compression ratio, the compression operation space of the corresponding process task node is determined. The compression operation space is the compressible time range of the process task node without violating the process execution requirements. The estimated time period occupied by the process task node is compressed. The compression process includes shortening the duration of the original task execution, resetting the start and end times of the task, so that the length of the compressed time period is within the allowable range, and ensuring that the execution logic of the process task chain is not disrupted. The incoming and outgoing edge connections of the compressed process task nodes are synchronously adjusted to generate execution time periods. The incoming edge represents the time dependency between the current task node and its predecessor, and the outgoing edge represents the time dependency between the current task node and its successor. The synchronous adjustment includes updating the time order between upstream and downstream task nodes according to the compressed time periods to ensure the continuity and effectiveness of the task chain's temporal connection. The execution time period refers to the actual start and end time of the task's operation in the task chain, obtained by synchronously adjusting the time connection relationships of the incoming and outgoing edges. Based on the resource binding relationship and execution time period of each process task node in the optimized task chain, the occupancy of each resource is dynamically analyzed to generate a target resource usage plan. The target resource usage plan is used to record the task occupancy time period and idle time window of each target resource. The target resource usage plan is analyzed to identify whether there is an available resource idle time window. The resource idle time window refers to the schedulable time period on the same resource that is not occupied by any task. When the execution time period of the compressed process task node can fall completely within the idle time window, the compressed process task node is adjusted to the idle time window to obtain a schedulable task chain.

[0021] The process task node set in the conflict release priority area within the schedulable task chain is traversed to identify process task nodes with a yield control field. The yield control field is used to indicate whether the process task node has a yield attribute in the competition for conflicting resources, including incompressible and not allowed to yield, incompressible but allowed to yield, and compressible tasks. Based on the task dependencies and resource conflict paths in the conflict chain graph, pair up task nodes with yield control fields to construct a set of conflicting task pairs. The conflicting task pairs are sorted according to the scheduling priority rules, which include priority for "incompressible and not allowed to yield" tasks; if one is "incompressible but allowed to yield" and the other is "compressible task", the former takes priority; if both are "compressible tasks", their process priority identifiers are compared and the one with higher priority takes priority; if the priority identifiers are the same, they are sorted according to the delivery time limit of the order to which they belong. Based on the sorting results, the execution time periods of the process task nodes that are ranked later are reallocated, and the order of the process task nodes in the schedulable task chain and the dependency relationships between the process task nodes are adjusted. The task position adjustment process includes: reallocating the time window of the process task node and adjusting the time sequence relationship between the process task node and its corresponding preceding and subsequent task nodes, so that the overall structure of the process task chain maintains logical continuity and schedulability. During the task location adjustment process, a path adjustment record is generated. The path adjustment record is used to record the information involved in each task location adjustment, including the task number, start and end time before adjustment, start and end time after adjustment, resource number, yielding status information, compression ratio, and path disconnection status.

[0022] Extract the compressed execution time period, adjusted resource number, yield status information, and path disconnection status field of each process task node from the path adjustment record; Based on the compressed execution time period and the adjusted resource number, update the planned start time and planned end time of the process task node, and update the target resource binding relationship. The planned start time and planned end time refer to the final actual running time period of the process task node in the scheduling result. By combining the arrangement order of each process task node in the schedulable task chain and the incoming and outgoing edge connection structure between the process task node and its adjacent preceding and subsequent task nodes, an execution order table of the schedulable task chain is constructed. The execution order table is used to record the actual execution order of tasks within the schedulable task chain and the scheduling context logic structure. The task number of the process task node, the updated planned start time and planned end time, the target resource number, the compression ratio, the yielding status, and the path disconnection status are integrated to construct a task scheduling table. The scheduling mapping table is used to represent the resource occupation and adjustment records of the task in the entire scheduling structure, and supports scheduling optimization traceability and multiple rounds of optimization iteration. Based on the task scheduling table and the execution order table of schedulable task chains, a towel scheduling table and a towel scheduling structure diagram are generated. The towel scheduling table is a task scheduling list based on a time axis, and the towel scheduling structure diagram is a visual graph data structure that displays the execution flow, resource binding relationship and conflict adjustment history between multiple task chains. The towel production plan is scheduled and controlled through the towel scheduling table and the towel scheduling structure diagram.

[0023] Example 2: The intelligent scheduling system for towel production planning proposed in this invention is applied to the intelligent scheduling method for towel production planning described in Example 1. Specifically, it includes a management center, which is communicatively connected to a towel order module, a towel task analysis module, and a towel production planning and scheduling module. The towel order module is used to obtain towel production order data and process execution order from the towel production information platform, analyze the towel production order data according to the process execution order, construct process task nodes and task dependencies, and generate a set of towel process task chains. The towel task analysis module is used to analyze the resource occupation overlap between various towel process task chains, construct conflict resource nodes, analyze the conflict resource nodes, construct conflict paths, generate conflict chain graphs, and divide conflict release priority areas. The towel production planning and scheduling module is used to analyze the towel process task chain based on the conflict release priority area and conflict chain map, generate optimized task chains, and obtain schedulable task chains and path adjustment records; the process task nodes are updated through path adjustment records to generate a towel scheduling table and a towel scheduling structure diagram.

[0024] The embodiments of the present invention have been described in detail above with reference to the accompanying drawings. However, the present invention is not limited thereto. Various changes can be made within the scope of knowledge possessed by those skilled in the art without departing from the spirit of the present invention.

Claims

1. A method of intelligent scheduling of towel production plan, characterized in that, The method comprises the following steps: S1, obtaining towel production order data and process execution sequence of a towel production information platform, analyzing the towel production order data according to the process execution sequence, constructing process task nodes and task dependency relationships, and generating a set of towel process task chains; S2, analyzing resource occupation overlap conditions among the towel process task chains to construct conflict resource nodes, analyzing the conflict resource nodes, constructing conflict paths, generating a conflict chain atlas, and dividing conflict release priority areas; S3, based on the conflict release priority areas and the conflict chain atlas, analyzing the towel process task chains, generating optimized task chains, and obtaining schedulable task chains and path adjustment records; The process task nodes are updated through the path adjustment records to generate a towel scheduling table and a towel scheduling structure diagram.

2. The intelligent scheduling method for towel production planning according to claim 1, characterized in that, The process of obtaining the towel production order data and the process execution sequence of the towel production information platform, analyzing the towel production order data according to the process execution sequence, constructing the process task nodes and the task dependency relationships, and generating the set of towel process task chains comprises: The towel production order data includes order number, product specification, and post-processing process flow; according to the post-processing process flow and the process execution sequence of each towel production order data, the towel production order data is split into multiple process tasks, and the process task nodes are constructed based on the multiple process tasks of the towel production order data, which include task number, order number, process type, expected occupation time period, target resource type, compressible flag field, process priority identifier, and task level sequence number; the compressible flag includes compressible tasks and incompressible tasks; the process priority identifier includes high priority identifier, medium priority identifier, and low priority identifier; The multiple process task nodes corresponding to each towel production order data are linked according to the corresponding process execution sequence to establish the task dependency relationship, the dependency edges between the process task nodes are established through the task dependency relationship, the corresponding adjacent process task nodes are linked through the dependency edges to generate the process task chains; the process task chains corresponding to each towel production order data are summarized to construct the set of towel process task chains.

3. The intelligent scheduling method for towel production planning according to claim 2, characterized in that, The process of analyzing the resource occupation overlap conditions among the towel process task chains to construct the conflict resource nodes, analyzing the conflict resource nodes, constructing the conflict paths, and generating the conflict chain atlas comprises: The target resource types involved in the set of towel process task chains are traversed to identify the situation that any two or more process task nodes have overlapping expected occupation time periods on the same target resource type; if the expected occupation time periods overlap, the process task nodes corresponding to the expected occupation time periods are marked as conflict task nodes, and the corresponding conflict resource nodes are constructed according to the target resource types associated with the conflict task nodes to construct a set of conflict resource nodes; In the set of conflict resource nodes, the task dependency relationships of the conflict task nodes in the process task chains are obtained, and the upstream and downstream dependency relationships among the conflict task nodes are constructed according to the task dependency relationships of the conflict task nodes in the process task chains; If there is a continuous occupation of the conflict resource between the preceding task node and the subsequent task node, a conflict path is established between the corresponding conflict resource nodes; the structure set composed of multiple conflict resource nodes and the conflict paths therebetween is referred to as a conflict chain atlas.

4. The intelligent scheduling method for towel production planning according to claim 3, wherein, The process of dividing the conflict release priority area, analyzing the towel process task chain based on the conflict release priority area and the conflict chain atlas, and generating the optimized task chain is as follows: The resource tension degree of the conflict path in the conflict chain atlas is analyzed, the priority of the conflict resource node in the atlas is evaluated in combination with the process priority identifier and the compressible mark of the process task node, the conflict resource node marked with the high priority identifier and the compressible task at the same time is divided into an immediate release node; the conflict resource node marked with the low priority identifier and the compressible task at the same time is divided into a sequential release node; the conflict resource node marked with the incompressible task is divided into a delayed release node; the immediate release node, the sequential release node and the delayed release node are respectively summarized and marked, and are divided into the conflict release priority area; the conflict resource node in the conflict release priority area is analyzed, and the weak dependency node is identified; under the conditions that the preset path compression condition and the resource release threshold condition are met, the connection relationship between the weak dependency node and the corresponding subsequent task node is disconnected, the structural path is broken, the task chain structure after the break is reconstructed, and the optimized task chain is obtained.

5. The intelligent scheduling method for towel production planning according to claim 4, wherein, The process of analyzing the towel process task chain based on the conflict release priority area and the conflict chain atlas, and generating the schedulable task chain includes: The optimized task chain in the conflict release priority area is traversed, the process task node with the compressible mark field is identified, the resource binding relationship between the process task node and the resource is established according to the process type and the target resource type of the process task node, and the preset process compression rule table is called to obtain the minimum running time threshold and the acceptable compression ratio allowed by the process type; the compression operation space of the corresponding process task node is determined by comparing the minimum running time threshold and the acceptable compression ratio in combination with the original estimated occupation time period of the process task node, the estimated occupation time period of the process task node is compressed, the in-edge and out-edge connection relationship of the compressed process task node is adjusted synchronously, and the execution time period is generated; based on the resource binding relationship and the execution time period of each process task node in the optimized task chain, the occupation of each resource is dynamically analyzed, the use plan of the target resource is generated, and whether there is an available resource idle time window is identified by analyzing the use plan of the target resource; when the execution time period of the compressed process task node can completely fall into the idle time window, the compressed process task node is adjusted to the idle time window, and the schedulable task chain is obtained.

6. The intelligent scheduling method for towel production planning according to claim 5, wherein, The process of analyzing the towel process task chain based on the conflict release priority area and the conflict chain atlas, and generating the path adjustment record includes: The process task node set in the conflict release priority area in the schedulable task chain is traversed, and the process task node with the yielding control field is identified; the yielding control field includes the non-compressible and non-yielding, the non-compressible but yielding, and the compressible task; According to the task dependency relationship and the resource conflict path in the conflict chain graph, a conflict task pair set is constructed; According to the scheduling priority rule, the conflict task pair set is sorted, and according to the sorting result, the execution time period of the process task node arranged in the rear position is re-allocated, and the arrangement order of the process task node in the schedulable task chain and the dependency connection relationship between the process task nodes are adjusted. The task position adjustment process includes: re-allocating the time window of the process task node, and adjusting the time sequence relationship between the process task node and the corresponding preceding task node and the subsequent task node; in the task position adjustment process, a path adjustment record is generated.

7. The intelligent scheduling method for towel production planning according to claim 6, wherein, Through the path adjustment record, the process task node is updated, and the towel scheduling table and the towel scheduling structure diagram are generated, including: Obtaining the path adjustment record, extracting the compressed execution time period of each process task node and the adjusted resource number; based on the compressed execution time period and the adjusted resource number, updating the resource binding relationship; Combining the arrangement order of each process task node in the schedulable task chain and the in-edge and out-edge connection structure between the process task node and the adjacent preceding task node and the subsequent task node, an execution order table of the schedulable task chain is constructed; the information in the path adjustment record is integrated to construct a task scheduling table; according to the task scheduling table, the execution order table and the resource binding relationship, a towel scheduling table and a towel scheduling structure diagram are generated.

8. A towel production plan intelligent scheduling system, particularly applied to the towel production plan intelligent scheduling method of any one of claims 1 to 7, comprising a management center, characterized in that, The management center is communicatively connected with a towel order module, a towel task analysis module and a towel production plan scheduling module: The towel order module is used to obtain the towel production order data and the process execution order of the towel production information platform, analyze the towel production order data according to the process execution order, construct the process task node and the task dependency relationship, and generate a set of towel process task chains; The towel task analysis module is used to analyze the resource occupation overlap between the towel process task chains, construct the conflict resource nodes, analyze the conflict resource nodes, construct the conflict paths, generate the conflict chain graph, and divide the conflict release priority area; The towel production plan scheduling module is used to analyze the towel process task chain based on the conflict release priority area and the conflict chain graph, generate an optimized task chain, and obtain a schedulable task chain and a path adjustment record; Through the path adjustment record, the process task node is updated, and the towel scheduling table and the towel scheduling structure diagram are generated.

Citation Information

Patent Citations

  • Production scheduling system and method

    CN112446526A

  • Multi-AGV real-time scheduling path optimization method based on time window

    CN114661047A

  • Optimized scheduling method and system for hardware mold production process

    CN119272932A

  • Construction progress control system based on BIM

    CN120634168A

  • Development process management method based on knowledge graph

    CN120653256A

Cited By

  • Dynamic priority scheduling method and system for nursing resources of a nursing home

    CN122243149A

  • A method and system for dynamic priority scheduling of nursing resources in elderly care institutions

    CN122243149B