Method for multi-department collaborative order whole-process intelligent management of textile enterprises

Abstract

The application discloses a method for multi-department collaborative order whole-process intelligent management of a textile enterprise, and relates to the technical field of order management, comprising the following steps: according to an order digital thread reference, mapping each process in a process route list to a work node one by one, constructing static process flow transfer topology information according to the process flow transfer direction, then performing forward constraint transmission and backward tolerance backtracking, solving process dynamic constraint boundaries, and forming process state reference information; based on bottleneck drift scheduling correction information, performing linkage rearrangement on cross-department scheduling control objects of orders affected by the bottleneck, generating scheduling path allocation information, and writing the scheduling path allocation information back to the order digital thread to form whole-process performance update information. The application converts the window state difference amount in the order performance monitoring information into process blocking characteristic parameters and maps them to the node flow transfer relationship by constructing a dynamic process flow transfer dependency graph, so that the dynamic positioning of the work node blocking state is realized.

Description

Technical Field

[0001] This invention relates to the field of order management technology, and in particular to a method for intelligent management of the entire process of multi-department collaborative orders in textile enterprises. Background Technology

[0002] Order fulfillment management in textile enterprises is gradually evolving from simple production progress registration to a comprehensive collaborative management model covering order acceptance, process path linkage, work node breakdown, cross-departmental transfer, resource occupancy registration, and delivery constraint tracking. With the application of digital threads, process topology modeling, and dynamic status acquisition technologies in production management, the execution status of textile orders can be continuously transmitted along the stages of weaving preparation, dyeing and finishing, cutting and matching, sewing execution, finished product quality inspection, and logistics delivery, providing a data foundation for multi-departmental collaborative scheduling and fulfillment control.

[0003] Existing textile order management technologies mostly focus on displaying order progress, assigning departmental tasks, and recording abnormal states. They lack a dynamic and graphical representation of the continuation, transfer, and accumulation of bottlenecks between different processes during cross-node workflows. In particular, when bottlenecks drift from upstream to downstream work nodes, it is difficult to deduce the available time interval and resource release order by combining the current resource occupancy relationship. This results in a lack of executable timing and resource continuity basis for subsequent cross-departmental scheduling modifications. Summary of the Invention

[0004] In view of the aforementioned existing problems, the present invention is proposed.

[0005] Therefore, this invention provides a method for intelligent management of the entire process of multi-department collaborative orders in textile enterprises, which solves the problems of difficult tracking of cross-departmental obstruction in textile order transmission and difficulty in reverse-engineering and correcting bottleneck resource constraints.

[0006] To solve the above-mentioned technical problems, the present invention provides the following technical solution: This invention provides a method for intelligent management of the entire process of multi-department collaborative orders in textile enterprises. The method includes: attaching process paths to textile orders and establishing digital threads for orders according to their acceptance order, forming a digital thread acceptance benchmark; mapping each process in the process route list to a work node based on the digital thread acceptance benchmark, constructing static process flow topology information according to the process flow direction, and then performing forward constraint propagation and backward tolerance backtracking to solve the dynamic constraint boundaries of the processes, forming process status acceptance information; during the execution of textile orders, dynamically recording the work progress, waiting time, resource usage, handover results, and abnormal handling status of each work node based on the process status acceptance information, and... Each time cross-node flow occurs, the cross-node flow information to be verified is checked to form order fulfillment monitoring information. From the order fulfillment monitoring information, the process stagnation characteristic parameters of each work node within the sliding time window are extracted to construct a dynamic process flow dependency graph. The propagation trajectory of the delay signal is tracked. Based on the drift direction of the delay signal and the current resource occupancy topology, constraint back-reasoning is performed to calculate the feasible time interval and resource release sequence for scheduling correction, generating bottleneck drift scheduling correction information. Based on the bottleneck drift scheduling correction information, the cross-department scheduling control objects of orders affected by the bottleneck are re-arranged in a linked manner to generate scheduling path allocation information. The scheduling path allocation information is then written back to the order digital thread to form full-process fulfillment update information.

[0007] As a preferred embodiment of the intelligent management method for the entire process of multi-department collaborative orders in textile enterprises described in this invention, the specific steps for forming the order digital thread receiving benchmark are as follows: Extract the order acceptance field from the textile order, verify the completeness of the field, and form the basic order registration information; Based on the basic order registration information, the corresponding process route list is retrieved from the enterprise process route database, and the process path attachment elements in the process route list are associated to form process path attachment information; The basic order registration information and process path linkage information are written into the same order digital link to establish an order digital thread. The node acceptance relationship and delivery node in the order digital thread are marked with acceptance order and delivery constraints to form the order digital thread acceptance benchmark.

[0008] As a preferred embodiment of the method for intelligent management of the entire process of multi-department collaborative orders in textile enterprises according to the present invention, the specific steps for constructing static process flow topology information are as follows: Based on the process route list, node acceptance relationship and delivery node in the order digital thread acceptance benchmark, auxiliary records in the process route list that are not related to the current textile order production fulfillment are removed, and valid processes are retained to form process mapping range information; Within the process mapping range information, each valid process is converted into a corresponding operation node, and according to the acceptance position of the valid process in the textile order, the process acceptance element is written for the corresponding operation node to form process acceptance information; Based on the process acceptance information, according to the acceptance position of each operation node in the textile order, the flow order of each operation node in the process acceptance information is sorted out, and the flow output and acceptance input of adjacent sequence operation nodes are confirmed to connect and connect. Operation nodes with direct acceptance relationship are identified to form node flow relationship. The operation node is used as topology node, and the node flow relationship is used as topology connection edge to construct static process flow topology information.

[0009] As a preferred embodiment of the intelligent management method for the entire process of multi-department collaborative orders in textile enterprises as described in this invention, the specific steps for generating process status acceptance information are as follows: Taking the starting node in the static process flow topology information as the transmission starting point, the node flow relationship is transmitted to the work nodes sequentially along the topology connection edge. According to the acceptance direction between adjacent work nodes, the flow output of the upstream work node is converted into the acceptance input of the downstream work node. Combined with the process acceptance elements in the process acceptance information, the acceptance sources that each work node can receive and the continuous flow range are limited to form the forward acceptance constraint range. Using the delivery date corresponding to the delivery node as the backtracking endpoint, backtrack each operation node along the topological connection edge in the static process flow topology information. Using the forward acceptance constraint range of the operation node as the acceptance boundary, and the remaining performance margin between the operation node and the delivery node as the constraint source, deduct the constraint occupancy of the operation node to form the backward tolerance constraint parameter. The forward acceptance constraint range and the backward tolerance constraint parameters are matched in position. The overlap between the acceptable range defined by the forward acceptance constraint range and the retainable range defined by the backward tolerance constraint parameters is identified. Based on the overlap identification results, the dynamic constraint boundary of the process is determined and written into the corresponding operation node to form the process status acceptance information.

[0010] As a preferred embodiment of the intelligent management method for the entire process of multi-department collaborative orders in textile enterprises described in this invention, the specific steps for dynamically recording the work progress, waiting time, resource consumption, handover results, and abnormal handling status of each work node during the execution of textile orders are as follows: Within the scope of the process status acceptance information, determine the work nodes that enter the execution window in the current textile order, and establish a node status registration entry according to the process dynamic constraint boundary of the corresponding work node to form a node status registration benchmark. Based on the node status registration benchmark, the system receives node execution feedback content generated by each work node during execution, and collects and registers the node execution feedback content according to the correspondence between the work node and the node status registration entry, forming node feedback collection information.

[0011] As a preferred embodiment of the intelligent management method for the entire process of multi-department collaborative orders in textile enterprises as described in this invention, the specific steps for generating order fulfillment monitoring information are as follows: Identify the work nodes that have entered the cross-node transfer stage from the node feedback collection information, and mark the work nodes as transfer initiating nodes based on the node transfer relationship in the static process transfer topology information, and mark the work nodes that directly receive the transfer initiating nodes as receiving nodes, thus forming cross-node transfer pending verification information; Based on the cross-node transfer pending verification information and process status acceptance information, the node acceptance verification is performed on the transfer initiating node, the receiving node, and the execution status of this cross-node transfer. When the node acceptance verification passes, the receiving status of the receiving node is opened. When the node acceptance verification fails, the pending status of the transfer initiating node is maintained. Order fulfillment monitoring information is formed based on the receiving status of the receiving node and the pending status of the transfer initiating node.

[0012] As a preferred embodiment of the method for intelligent management of the entire process of multi-department collaborative orders in textile enterprises as described in this invention, the specific steps for constructing a dynamic process flow dependency graph are as follows: Based on order fulfillment monitoring information, sliding time windows are divided according to the execution timeline of textile orders. Based on the correspondence between sliding time windows and work nodes, the feedback collection information, receiving status and pending status of nodes within the same sliding time window are merged into the window record to form window status collection information. The window record of the previous sliding time window is used as the baseline record, and the window record of the current sliding time window is used as the control record. The state difference between the baseline record and the control record is calculated to obtain the window state difference quantity. The window state difference is converted into process stagnation feature parameters and mapped to the corresponding node flow relationship. The operation node is used as the dynamic graph node, and the mapped node flow relationship is used as the dynamic graph connection edge to construct a dynamic process flow dependency graph.

[0013] As a preferred embodiment of the intelligent management method for the entire process of multi-department collaborative orders in textile enterprises described in this invention, the specific steps for generating bottleneck drift scheduling correction information are as follows: In the dynamic process flow dependency graph, the process stalling characteristic parameters that exceed the dynamic constraint boundary of the process are marked as delay signals, and the transmission direction and arrival position of the delay signals are tracked along the connection edge of the dynamic graph to form delay propagation trajectory information. Based on the delayed propagation trajectory information, the direction of transmission of the delayed signal from the upstream operation node to the downstream operation node is determined as the drift direction of the delayed signal. Based on the window state collection information, the resource occupation content of each operation node within the sliding time window is associated with the corresponding node flow relationship to form the current resource occupation topology. Based on the drift direction of the delayed signal and the current resource occupancy topology, the delay propagation chain is determined along the dynamic process flow dependency graph. The last delayed node in the delay propagation chain arranged along the drift direction is taken as the starting point for reverse inference, and the reverse inference node sequence is arranged in reverse along the dynamic process flow dependency graph. The dynamic constraint boundary of the process is mapped to the node position of the current resource occupation topology, and the continuous acceptable time periods are merged to form a feasible time interval. Then, a resource release sequence is formed according to the order of the resource occupation end position, downstream accepting demand and continuous acceptable time periods corresponding to each back-dated node in the back-dated node sequence. The feasible time interval and the resource release sequence are encapsulated as bottleneck drift scheduling correction information.

[0014] As a preferred embodiment of the intelligent management method for the entire process of multi-department collaborative orders in textile enterprises as described in this invention, the specific steps for generating scheduling path allocation information are as follows: Align the feasible time interval, resource release sequence, and reverse node sequence in the bottleneck drift scheduling correction information with the job nodes in the order digital thread to determine the orders affected by the bottleneck and the cross-department scheduling control objects. Then, reset the acceptance order and resource occupancy order of the cross-department scheduling control objects according to the resource release sequence to form cross-department rescheduling information. In the cross-departmental rescheduling information, orders whose delivery constraints can still be maintained are assigned to the original acceptance path, orders affected by the continuous occupation of bottleneck resources are assigned to the rescheduled acceptance path, and orders that need to wait for resource release are assigned to the delayed acceptance path, thus forming scheduling path allocation information.

[0015] As a preferred embodiment of the method for intelligent management of the entire process of multi-department collaborative orders in textile enterprises as described in this invention, the specific steps for generating full-process fulfillment update information are as follows: The bottleneck-affected orders in the scheduling path allocation information are linked to the job nodes in the order digital thread, and the acceptance order and resource occupancy order in the cross-department rescheduling information are associated with the corresponding job nodes to form the order thread update information. Based on the order thread update information, the subsequent acceptance path, resource release order and fulfillment progress status of orders affected by bottlenecks are updated to form full-process fulfillment update information.

[0016] The beneficial effects of this invention are as follows: By constructing a dynamic process flow dependency graph, the window state difference in order fulfillment monitoring information is converted into process stagnation characteristic parameters and mapped to node flow relationships, thereby realizing the dynamic positioning of the stagnation status of work nodes; by generating bottleneck drift scheduling correction information, the propagation trajectory of delay signals is tracked, and the feasible time interval and resource release sequence are inferred from the current resource occupancy topology, supporting the linkage rescheduling of cross-department scheduling control objects, and promoting the coordinated updating of full-process fulfillment update information around order acceptance, resource continuation, and fulfillment progress status. Attached Figure Description

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

[0018] Figure 1 A flowchart illustrating a method for intelligent management of the entire order process across multiple departments in textile enterprises.

[0019] Figure 2 A flowchart for forming a baseline for order number threads.

[0020] Figure 3 This is a flowchart illustrating the dynamic constraint boundaries of a process.

[0021] Figure 4 A flowchart for generating bottleneck drift scheduling correction information. Detailed Implementation

[0022] To make the above-mentioned objects, features and advantages of the present invention more apparent and understandable, the specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

[0023] Many specific details are set forth in the following description in order to provide a full understanding of the invention. However, the invention may also be practiced in other ways different from those described herein, and those skilled in the art can make similar extensions without departing from the spirit of the invention. Therefore, the invention is not limited to the specific embodiments disclosed below.

[0024] Secondly, the term "one embodiment" or "embodiment" as used herein refers to a specific feature, structure, or characteristic that may be included in at least one implementation of the present invention. The phrase "in one embodiment" appearing in different places in this specification does not necessarily refer to the same embodiment, nor is it a single or selective embodiment that is mutually exclusive with other embodiments.

[0025] Reference Figures 1-4 This is one embodiment of the present invention, which provides a method for intelligent management of the entire process of multi-department collaborative orders in textile enterprises, including the following steps: S1: Connect the process path to the textile order and establish the order digital thread according to the order of acceptance of the textile order to form the order digital thread acceptance benchmark.

[0026] S1.1: Extract the order acceptance field from the textile order, verify the integrity of the field, and form the basic order registration information.

[0027] It should be noted that textile orders include product requirements, order identification details, product specifications, fabric and accessory requirements, process requirements, quantity requirements, quality requirements, delivery requirements, and packaging and distribution requirements. The order acceptance template is a field template corresponding to the content structure of a textile order. It is used to limit the field names, field order, and field value formats of various order contents in a textile order. The order acceptance field is located from textile orders based on the order acceptance template and is used to support order acceptance, process path linkage, production node acceptance, and delivery node association. Furthermore, based on the order acceptance template, the fields used for order acceptance, process linkage, production acceptance, and delivery acceptance in textile orders are located. The located order acceptance fields are then assigned to the corresponding order registration fields according to field name, field order, and field value position. For order acceptance fields with valid values ​​and value formats consistent with the order acceptance template, they are imported into the order acceptance record. For registration fields without values, with duplicate values, or with inconsistent value formats, field correction marks are generated and linked to the order correction entry. When the order acceptance record supports subsequent process path linkage, work node decomposition, and delivery node association, the association results of the order acceptance record, field correction marks, and order correction entry are compiled into basic order registration information.

[0028] S1.2: Based on the basic order registration information, retrieve the corresponding process route list from the enterprise process route library, and associate the process path attachment elements in the process route list to form process path attachment information.

[0029] It should be noted that the product type, fabric specifications, process requirements and quality requirements corresponding to the completed orders should be linked and organized with the actual process of weaving preparation, fabric circulation, dyeing and finishing, cutting and matching, sewing execution, finished product quality inspection, packaging and warehousing and logistics delivery. The process sequence, resource usage conditions, quality confirmation location and delivery node constraints in each process path should be solidified to form the enterprise process route library. The process route list refers to the process flow record determined from the enterprise's process route database based on the basic order registration information. It is used to limit the process path, process sequence, node execution requirements and delivery node constraints of the current textile order from weaving preparation, greige fabric circulation, dyeing and finishing, cutting and matching, sewing execution, finished product quality inspection, packaging and warehousing to logistics delivery. Furthermore, based on the order acceptance field in the basic order registration information, a list of process routes suitable for the current textile order is determined in the enterprise process route library. The enterprise process route library stores historical process paths, standard process acceptance relationships, process node execution requirements, and delivery node constraints corresponding to different textile products. After comparing the basic order registration information with the content stored in the library, a list of process routes covering the production fulfillment requirements of the current textile order is selected. According to the process acceptance sequence in the process route list, process paths such as weaving preparation, fabric transfer, dyeing and finishing, cutting and matching, sewing execution, finished product quality inspection, packaging and warehousing, and logistics delivery are respectively linked to the accepting department, material requirements, equipment resources, quality inspection points, and delivery nodes. After the acceptance relationships, resource constraints, and delivery nodes between each process path are all linked, process path linking information is formed.

[0030] S1.3: Write the basic order registration information and process path connection information into the same order digital link, establish an order digital thread, and mark the acceptance order and delivery constraints of the nodes in the order digital thread to form the acceptance benchmark of the order digital thread.

[0031] It should be noted that the basic order registration information is used as the starting content of the order digital link, and the process path attachment information is registered in the same order digital link according to the receiving position of the process path in the textile order. The basic order content, process path content, operation node content and delivery node content belong to the same textile order, and an order digital thread is established. The digital order thread refers to a full-process acceptance link formed by registering basic order registration information, process path linkage information, operation nodes, node acceptance relationships, status registration entry, exception feedback entry and delivery node in the same digital order link, with textile orders as the main line. It is used to support the status transmission, acceptance control and performance tracking of textile orders between various operation nodes. The receiving position refers to the position of the work node in the entire receiving chain of a textile order, and is used to characterize the connection relationship between the work node and the preceding work node, subsequent work node and delivery node. Furthermore, based on the connection relationships between various process paths in the process path connection information, the node flow connection is marked within the order digital thread to determine the preceding and following connection positions, flow direction, and handover dependencies of each operation node, generating node connection relationships, and establishing associations between each operation node and its corresponding delivery node; according to the node connection relationships, the order of acceptance of each operation node in the textile order is marked, and the delivery deadline, delivery batch, and delivery restrictions corresponding to the delivery node are attached to the relevant operation nodes to form the order digital thread acceptance benchmark.

[0032] S2: Based on the order digital thread acceptance benchmark, the processes in the process route list are mapped one by one to the work nodes, and static process flow topology information is constructed according to the process flow direction. Then, forward constraint transmission and backward tolerance backtracking are performed to solve the dynamic constraint boundary of the process and form the process status acceptance information.

[0033] S2.1: Based on the process route list, node acceptance relationship and delivery node in the order digital thread acceptance benchmark, auxiliary records in the process route list that are not related to the current textile order production and fulfillment are removed, and valid processes are retained to form process mapping range information.

[0034] It should be noted that the process route list is a process flow basis determined from the enterprise's process route database based on the basic order registration information, and is used to limit the acceptance path of the current textile order between each production fulfillment stage; Furthermore, based on the order digital thread acceptance benchmark, the process route list is associated with each process record and node acceptance relationship and delivery node to determine whether each process record has an acceptance position in the current textile order production fulfillment chain. When a process record has an acceptance position and the process output is connected with the subsequent process flow requirements and delivery node requirements, the process record is retained as a valid process and included in the process mapping range according to its acceptance position in the current textile order. When a process record does not have an acceptance position, or its content is only used for remarks, statistics, historical records, non-current order execution items, or items not involved in this production flow, the process record is removed as an auxiliary record. The retained valid processes are aggregated to form process mapping range information.

[0035] S2.2: Within the process mapping range information, each valid process is converted into a corresponding operation node, and according to the acceptance position of the valid process in the textile order, the process acceptance element is written for the corresponding operation node to form process acceptance information.

[0036] It should be noted that the process acceptance element refers to the node acceptance attribute generated based on the acceptance position, production flow responsibility, and delivery association position of the effective process in the textile order. It is used to limit the preceding source, subsequent destination, handover requirements, and performance constraints of the corresponding operation node in the order's digital thread. Furthermore, within the process mapping range information, the retained valid processes are processed into nodes one by one according to their acceptance position in the current textile order. Each valid process is assigned a corresponding operation node identifier, and the operation node identifier is associated with the order number thread of the current textile order. During node-based processing, based on the preceding and following positions, production flow responsibilities, and delivery association positions of the effective process in the process mapping range information, process acceptance elements are configured for the corresponding nodes, and the process acceptance elements are registered in the acceptance record of the corresponding node. When the effective process is connected to the node acceptance relationship in the order digital thread, the corresponding node is included in the node acceptance link of the current textile order. When the effective process is not connected to the node acceptance relationship, the corresponding node is marked as a node to be corrected and attached to the process review entry. All nodes that have been included in the node acceptance link are aggregated to form process acceptance information.

[0037] S2.3: Based on the process acceptance information, according to the acceptance position of each operation node in the textile order, organize the flow order of each operation node in the process acceptance information, and confirm the flow connection between the flow output and acceptance input of adjacent sequence operation nodes, identify operation nodes with direct acceptance relationship, form node flow relationship, take operation node as topology node, take node flow relationship as topology connection edge, and construct static process flow topology information.

[0038] Furthermore, based on the acceptance position of each operation node in the process acceptance information, each operation node is assigned a flow sequence mark that increases in the direction of textile order fulfillment, and the flow sequence mark is associated with the corresponding process acceptance element; between adjacent sequence operation nodes, the flow output formed by the previous operation node is used as the acceptance source, and the acceptance input required by the next operation node is used as the receiving target, and the flow connection is confirmed. When the output and the input are consistent in terms of source of acceptance, handover requirements, and performance constraints, adjacent sequence operation nodes are confirmed to have a direct acceptance relationship; when the output and the input are inconsistent in terms of source of acceptance, handover requirements, and performance constraints, no direct acceptance relationship is established between adjacent sequence operation nodes; based on the confirmed direct acceptance relationship, node flow relationship is formed, operation nodes are registered as topology nodes, node flow relationship is registered as topology connection edge, and topology nodes and topology connection edges are sequentially associated according to the flow sequence mark to obtain static process flow topology information.

[0039] S2.4: Taking the starting node in the static process flow topology information as the transmission starting point, the node flow relationship is transmitted to the work nodes sequentially along the topology connection edge. According to the acceptance direction between adjacent work nodes, the flow output of the upstream work node is converted into the acceptance input of the downstream work node. Combined with the process acceptance elements in the process acceptance information, the acceptance sources that each work node can receive and the continuous flow range are limited to form the forward acceptance constraint range.

[0040] Furthermore, taking the job node corresponding to the forward transmission starting point as the current processing node, the topological connection edge pointing from the current processing node to the subsequent job node is located in the static process flow topology information, and the receiving object connected by the topological connection edge is determined. Based on the process acceptance elements of the current processing node in the process acceptance information, organize the handover content generated after the completion of the current operation, and confirm the handover content with the receiving requirements of the receiving object in the process acceptance information; when the handover content is consistent with the receiving requirements, include the current processing node, topology connection edge, and receiving object in the same forward acceptance chain segment, and record the acceptance source and flow continuation range of the receiving object; when the handover content is inconsistent with the receiving requirements, mark the topology connection edge as a connection edge to be reviewed, and connect the connection edge to be reviewed. The current processing node, receiving object, and inconsistent content are included in the receiving review record; the inconsistent content in the receiving review record is re-verified for node receiving relationships, process receiving elements, and delivery node constraints. If the verification is successful, the connection edge to be reviewed is restored as a receiving connection edge and included in the next round of forward receiving chain segment. If the verification fails, the connection edge to be reviewed is marked as a receiving abnormal connection edge and registered in the process status receiving information; the forward receiving chain segments already included in this round are aggregated to form the forward receiving constraint scope.

[0041] S2.5: Using the delivery date corresponding to the delivery node as the backtracking endpoint, backtrack each operation node along the topological connection edge in the static process flow topology information. Use the forward acceptance constraint range of the operation node as the acceptance boundary, and use the remaining performance margin between the operation node and the delivery node as the constraint source. Deduct the constraint occupancy of the operation node to form the backward tolerance constraint parameter.

[0042] It should be noted that the constraint occupancy includes necessary operation occupancy, adjacent node takeover occupancy, and registered abnormal occupancy; Furthermore, when the delivery node has been associated with the delivery date, the delivery date is converted into the latest completion time of the order fulfillment chain, and the preceding operation node that is directly connected to the delivery node is located in the static process flow topology information. For the identified preceding work node, the allowed time boundary and flow boundary for entering the acceptance are determined based on the forward acceptance constraint range of the preceding work node. Based on the node connection segment between the preceding work node and the delivery node, the operation time occupied by the constraint, the node handover time, and the abnormal handling time within the node connection segment are calculated. When the constraint occupancy time is less than the remaining time available for performance between the preceding work node and the delivery node, the difference is used as the tolerance margin that the preceding work node can retain, and the backward tolerance constraint parameter is formed by combining the resource usage position corresponding to the preceding work node. When the constraint occupancy time reaches and exceeds the remaining time available for fulfillment between the preceding operation node and the delivery node, the preceding operation node is marked as a node with insufficient tolerance, and the backward tolerance constraint parameter is set to a compressed state; according to the connection order formed in the static process flow topology information, the same processing is repeated for each preceding operation node to obtain the backward tolerance constraint parameters covering the order fulfillment link.

[0043] S2.6: Perform positional correspondence between the forward acceptance constraint range and the backward tolerance constraint parameters, and identify the overlap between the acceptable interval defined by the forward acceptance constraint range and the retainable interval defined by the backward tolerance constraint parameters. Determine the dynamic constraint boundary of the process based on the overlap identification result, and write the dynamic constraint boundary of the process into the corresponding operation node to form the process status acceptance information.

[0044] It should be noted that, according to the flow order of each work node in the static process flow topology information, the forward acceptance constraint range and backward tolerance constraint parameters corresponding to the same work node are aligned to determine the node affiliation; the acceptance entry is merged and the flow boundary is converged based on the forward acceptance constraint range to determine the acceptable range of the work node; the tolerance margin is converted and the delivery boundary is recovered based on the backward tolerance constraint parameters to determine the retainable range of the work node. Furthermore, when there is an overlap between the acceptable range and the retainable range, the overlap is determined as the executable constraint range of the work node, and the boundary fields of the executable constraint range are fixed and the node status is attached to generate the dynamic constraint boundary of the process. When there is no overlap between the acceptable range and the retainable range, the corresponding operation node is marked as a boundary conflict node, and the boundary conflict node, conflict range, forward acceptance constraint range and backward tolerance constraint parameters are included in the acceptance review record. For conflict intervals in the acceptance review record, re-execute the acceptance source confirmation, flow range convergence, and tolerance margin conversion. If overlapping intervals are formed after review, the overlapping intervals are determined as the corrected executable constraint intervals, and the corresponding work node's process dynamic constraint boundary is generated. If no overlapping intervals are formed after review, the corresponding work node is marked as a constraint abnormal node, and constraint rearrangement trigger information is generated to restrict the corresponding work node from entering the execution window. The process dynamic constraint boundary, constraint abnormal node, and constraint rearrangement trigger information are all included in the process status acceptance information.

[0045] S3: During the execution of textile orders, the progress, waiting time, resource usage, handover results, and abnormal handling status of each work node are dynamically recorded based on the process status acceptance information. The cross-node transfer information is checked every time the cross-node transfer is completed, forming order fulfillment monitoring information.

[0046] S3.1: Within the scope of the process status acceptance information, determine the operation node that enters the execution window in the current textile order, and establish a node status registration entry according to the process dynamic constraint boundary of the corresponding operation node to form a node status registration benchmark.

[0047] Furthermore, within the scope of the process status acceptance information, the current textile order fulfillment progress is compared with the process dynamic constraint boundary of the corresponding work node according to the flow order of each work node in the static process flow topology information; when the current fulfillment progress falls into the process dynamic constraint boundary of the corresponding work node, and the previous acceptance status of the work node has been completed, the work node is marked as the work node entering the execution window, and a node status registration entry is established according to the node identity, flow order and process dynamic constraint boundary of the work node. When the current performance progress has not fallen into the dynamic constraint boundary of the corresponding work node, and the preceding acceptance status of the work node has not been completed, the work node is kept in the state of waiting to enter the execution window, and no node status registration entry is established; the node status registration entries that have been established are collected to form the node status registration benchmark.

[0048] S3.2: Based on the node status registration benchmark, receive the node execution feedback content generated by each work node during execution, and collect and register the node execution feedback content according to the correspondence between the work node and the node status registration entry to form node feedback collection information.

[0049] It should be noted that the node execution feedback content is generated by each work node during the textile order execution period based on the node status registration entry. The node execution feedback content is at least associated with the work node identifier, feedback formation time, acceptance stage identifier, execution status identifier, status duration, resource identifier, resource occupation start and end time, handover result identifier, pending items identifier, and abnormal handling result identifier. Furthermore, based on the node status registration benchmark, the work nodes that have established node status registration entry are used as feedback receiving objects, and feedback ownership marks are established for the corresponding nodes according to the flow order of each work node in the order digital thread. During the execution of textile orders, the node execution feedback from production flow, node handover, resource occupation and abnormal handling links are classified under the corresponding feedback attribution tag. According to the correspondence between the operation node and the node status registration entry, the feedback content under the same operation node is sorted in order. The sorted node execution feedback content is attached with the association tag of the operation node to which it belongs, the stage of acceptance, and the dynamic constraint boundary of the corresponding process, forming node feedback collection information.

[0050] S3.3: Identify the work nodes that have entered the cross-node transfer stage from the node feedback collection information, and mark the work nodes as transfer initiating nodes and the work nodes that directly receive the transfer initiating nodes as receiving nodes, based on the node transfer relationship in the static process transfer topology information, thus forming cross-node transfer pending verification information.

[0051] Furthermore, based on the information collected from node feedback, the flow status of the node execution feedback content of each work node is sorted out, and work nodes that have completed the feedback registration and generated handover results are selected. Associate the work node with the node flow relationship in the static process flow topology information to identify the direct subsequent receiving object of the work node in the current receiving link; when the work node has the state basis to flow to the subsequent node, and there is a direct subsequent receiving object in the node flow relationship, mark the work node as the flow initiating node and mark the direct subsequent receiving object as the receiving node. When a task node does not have the necessary state basis to transfer to subsequent nodes, or when there is no direct successor in the node transfer relationship, the task node will remain in the pending state at this node; the initiating node, the receiving node, and the direct successor relationship will be associated and registered to form cross-node transfer pending verification information.

[0052] S3.4: Based on the cross-node transfer pending verification information and process status acceptance information, perform node acceptance verification on the transfer initiating node, the receiving node, and the execution status of this cross-node transfer. When the node acceptance verification passes, the receiving status of the receiving node is enabled. When the node acceptance verification fails, the pending status of the transfer initiating node is maintained. Order fulfillment monitoring information is generated based on the receiving status of the receiving node and the pending status of the transfer initiating node.

[0053] Furthermore, based on the cross-node transfer information to be verified, the transfer output of the transfer initiating node, the acceptance input of the receiving node, and the execution status of this cross-node transfer are grouped into the same acceptance verification record; based on the node transfer relationship in the process status acceptance information, it is confirmed whether there is a direct acceptance link between the transfer initiating node and the receiving node, and the execution status of this cross-node transfer is checked against the process dynamic constraint boundary. When the output and input are aligned, the direct connection link is established, and the execution status falls within the dynamic constraint boundary of the process, the node acceptance verification is deemed successful, the receiving status of the receiving node is opened, and the receiving node is included in the subsequent execution window. When any of the following situations occur: the output of the transfer is inconsistent with the input of the receiving node, the direct receiving link is not established, or the execution status does not fall within the dynamic constraint boundary of the process, the node receiving verification is determined to have failed, the pending status of the transfer initiating node is maintained, and the corresponding cross-node transfer is retained in the pending review queue; based on the receiving status of the receiving node, the pending status of the transfer initiating node, and the verification record of the cross-node transfer, order fulfillment monitoring information is formed.

[0054] S4: Extract process bottleneck characteristic parameters of each operation node within the sliding time window from the order fulfillment monitoring information, construct a dynamic process flow dependency graph, track the propagation trajectory of the delay signal, perform constraint back-reasoning processing based on the drift direction of the delay signal and the current resource occupancy topology, calculate the feasible time interval and resource release sequence for scheduling correction, and generate bottleneck drift scheduling correction information.

[0055] S4.1: Based on the order fulfillment monitoring information, the sliding time window is divided according to the execution time axis of the textile order. According to the correspondence between the sliding time window and the operation node, the feedback collection information, receiving status and pending status of the nodes in the same sliding time window are merged into the window record to form the window status collection information.

[0056] Furthermore, based on the status formation time of each operation node in the order fulfillment monitoring information and the node flow relationship in the order digital thread, the time when the textile order enters the first operation node is taken as the starting point of the execution time axis, and the delivery date corresponding to the delivery node is taken as the ending point of the execution time axis. Based on the dynamic constraint boundaries of the process in the process status acceptance information, the start time and end time of the executable constraint interval of each operation node, as well as the status formation time in the order fulfillment monitoring information, are extracted and sorted according to the same time unit. The interval between adjacent time points in the same operation node is calculated, and the smallest interval greater than zero is taken as the candidate acceptance time granularity of the corresponding operation node. Then, the candidate acceptance time granularities of each operation node are merged, and the minimum value is taken as the minimum acceptance time granularity of the current textile order. The minimum acceptance time granularity is used as the window length of the sliding time window, and the time interval between the aggregation and registration of adjacent node statuses is used as the window sliding step size. Multiple sliding time windows are generated sequentially along the execution time axis. Each sliding time window is associated with a work node falling within its time range. The feedback collection information, receiving status, and pending status of nodes within the same sliding time window are merged into the window record of the corresponding work node. For status content that has not been processed even after crossing adjacent sliding time windows, it will be continued to be registered in the window record of the same work node in the next sliding time window. The window records are organized according to the window order and the work node position to form window status collection information.

[0057] S4.2: Take the window record of the previous sliding time window as the baseline record, take the window record of the current sliding time window as the comparison record, and calculate the state difference between the baseline record and the comparison record to obtain the window state difference quantity.

[0058] Furthermore, based on the window status collection information, the window records of the same job node in adjacent sliding time windows are aligned according to the window number, job node position and node status registration entry. The window record corresponding to the previous sliding time window is used as the baseline record, and the window record corresponding to the current sliding time window is used as the reference record. The difference between the reception status, pending status, and backlog of node feedback collection information in the baseline and control records is calculated, and the status continuation, status transition, and status stagnation of the current sliding time window relative to the previous sliding time window are marked as changes. When the comparison record shows an extended pending status, no subsequent acceptance in the receiving status, and an increased backlog of node feedback collection information compared to the baseline record, the corresponding difference is classified as the stagnation increment. When the comparison record shows a shortened pending status, the subsequent acceptance in the receiving status, and a decreased backlog of node feedback collection information compared to the baseline record, the corresponding difference is classified as the stagnation release amount. The stagnation increment and stagnation release amount are then converted into net stagnation and marked with the direction of change to generate the window status difference.

[0059] Among them, the duration of pending status is the cumulative duration of pending status within the same sliding time window, the duration of receiving status is the cumulative duration of receiving status within the same sliding time window, and the backlog of node feedback collection information is the number of feedback items that have not been processed within the same sliding time window. The window state difference refers to the state change of the same work node within adjacent sliding time windows, calculated from the difference between the duration of the receiving state, the duration of the pending state, and the backlog of node feedback information. It is used to characterize the direction and degree of the obstruction change of the current sliding time window relative to the previous sliding time window.

[0060] The formula for calculating the window state difference is: ; ; In the formula, Indicates the first The work node is at the The amount of difference in window state within a sliding time window Represents the natural logarithm operation. Indicates the first The work node is at the The increase in resistance relative to the previous sliding time window within each sliding time window. Indicates the first The work node is at the The amount of release that is inhibited relative to the previous sliding time window within each sliding time window. Indicates the first The work node is at the The status of pending actions within each sliding time window. Indicates the first The status of each task node in the pending process within the previous sliding time window. Indicates the first The work node is at the The duration of the reception status within each sliding time window. Indicates the first The status of each job node's reception during the previous sliding time window. Indicates the first The work node is at the The backlog of feedback information within each sliding time window indicates the extent of data accumulation. Indicates the first The backlog of node feedback collection information for each task node within the previous sliding time window. This means taking the maximum of the two values.

[0061] S4.3: Convert the window state difference into process stagnation feature parameters and map them to the corresponding node flow relationship. Use the operation node as the dynamic graph node and the mapped node flow relationship as the dynamic graph connection edge to construct a dynamic process flow dependency graph.

[0062] Furthermore, based on the work node, window number, and flow order corresponding to the window state difference, the window state difference is assigned to a node. Based on the results of the hindrance aggravation, hindrance mitigation, and state maintenance represented by the window state difference, the hindrance direction, hindrance duration, and hindrance transmission position of the corresponding work node in the current sliding time window are marked to form process hindrance characteristic parameters. Based on the node flow relationships in the static process flow topology information, process stagnation characteristic parameters are attached to the work nodes and adjacent receiving nodes where state differences occur. The node flow relationships carry the stagnation changes within the corresponding sliding time window. After the attachment is completed, the work nodes are registered as dynamic graph nodes, and the node flow relationships carrying process stagnation characteristic parameters are registered as dynamic graph connection edges. The dynamic graph nodes and dynamic graph connection edges are dynamically associated according to the order of the sliding time window to form a dynamic process flow dependency graph.

[0063] It should be noted that when converting the window state difference into process stagnation characteristic parameters, the sign of the difference determines the stagnation direction, the absolute value of the difference and the cumulative duration of the continuous window determine the stagnation duration, and the work node that generates the difference and the node flow relationship position determine the stagnation transmission position. The process stagnation characteristic parameters are used to characterize the stagnation change direction, stagnation duration and stagnation flow position of the work node within the current sliding time window, and serve as input for subsequent delay signal identification.

[0064] S4.4: In the dynamic process flow dependency graph, process stalling characteristic parameters that exceed the dynamic constraint boundary of the process are marked as delay signals, and the transmission direction and arrival position of the delay signals are tracked along the connection edge of the dynamic graph to form delay propagation trajectory information.

[0065] Furthermore, based on the dynamic graph connection edges carrying process stall characteristic parameters in the dynamic process flow dependency graph, when comparing the process stall characteristic parameters with the process dynamic constraint boundary, the judgment criteria are whether the duration corresponding to the stall duration exceeds the allowable dwell range in the process dynamic constraint boundary and whether the stall transmission position exceeds the allowable flow range in the process dynamic constraint boundary. When neither the stall duration nor the stall transmission position exceeds the process dynamic constraint boundary, the corresponding process stall characteristic parameter is retained as a normal stall record, and the normal stall record is registered in the order fulfillment monitoring log according to the work node, the corresponding sliding time window, and the associated dynamic graph connection edge. This is used for subsequent window status statistics, node stall trend tracing, and status reference before scheduling correction, and is not included in delay propagation tracking. When either the duration of the delay or the location of the delay exceeds the dynamic constraint boundary of the process, the corresponding process delay characteristic parameter is marked as a delay signal, and the operation node to which the delay signal belongs, the corresponding sliding time window, and the connection edge of the associated dynamic graph are recorded. For the marked delayed signals, the signals are traced edge by edge from the working node to the receiving node according to the pointing relationship of the dynamic graph connection edges. The transmission direction, receiving node and arrival window of the delayed signal are recorded each time a dynamic graph connection edge is passed, until the delayed signal stops transmitting or reaches the delivery node. The recorded transmission direction, receiving node, arrival window and associated dynamic graph connection edges are organized to form the delayed propagation trajectory information.

[0066] S4.5: Based on the delayed propagation trajectory information, the direction of transmission of the delayed signal from the upstream operation node to the downstream operation node is determined as the drift direction of the delayed signal. Based on the window state collection information, the resource occupation content of each operation node within the sliding time window is associated with the corresponding node flow relationship to form the current resource occupation topology.

[0067] Furthermore, based on the delayed propagation trajectory information, the flow direction of the delayed signal through the work nodes is sorted according to the arrival order of the delayed signal on the connection edge of the dynamic graph; when the delayed signal is continuously transmitted from the preceding work node to the subsequent receiving node, the corresponding transmission direction is determined as the drift direction of the delayed signal; when the delayed signal does not form a continuous transmission direction, the corresponding work node is marked as a local blocking node and the drift direction extension is stopped. Based on the information collected from the window status, the resource occupancy content corresponding to each job node within the same sliding time window is associated with the node flow relationship. According to the job node to which the resource occupancy content belongs, the time period of occupancy, and the receiving position, the resource occupancy content is attached to the corresponding topology node and topology connection edge. After the attachment is completed, the resource occupancy content on each topology node and topology connection edge is collected and organized to form the current resource occupancy topology.

[0068] S4.6: Based on the drift direction of the delayed signal and the current resource occupancy topology, determine the delay propagation chain along the dynamic process flow dependency graph, take the last delayed node in the delay propagation chain arranged along the drift direction as the starting point for reverse inference, and arrange the reverse inference node sequence in reverse along the dynamic process flow dependency graph.

[0069] Furthermore, based on the drift direction of the delayed signal, the dynamic graph connection edge carrying the delayed signal in the delayed propagation trajectory information is superimposed with the resource occupation content in the same position in the current resource occupation topology, and continuous connection segments that simultaneously have delayed propagation and resource occupation constraints are retained to form a delayed propagation chain. Arrange the delay nodes in the delay propagation chain in sequence according to the drift direction of the delayed signal, and mark the delay node at the end of the arrangement as the starting point for reverse propagation. Starting from the reverse tracing point, preceding task nodes are included level by level according to the reverse direction of the connecting edges in the dynamic process flow dependency graph. The included preceding task nodes are then linked to the resource occupancy content in the current resource occupancy topology. When the reverse tracing reaches any of the following conditions: no preceding task node, no delayed association between preceding task nodes, or no preceding task node participating in resource release, the inclusion of preceding task nodes is stopped. The included task nodes are then arranged in the order of the reverse tracing to form a reverse node sequence.

[0070] It should be noted that the back-pushing stopping condition refers to the control condition used to determine whether the preceding operation node should continue to be included in the back-pushing range when the back-pushing node sequence is arranged in reverse. It is determined based on the dynamic process flow dependency graph, delay propagation trajectory information and current resource occupation topology.

[0071] S4.7: Map the dynamic constraint boundary of the process to the current resource occupancy topology, merge the continuous available time periods to form a feasible time interval, and form a resource release sequence according to the resource occupancy end position, downstream demand and continuous available time periods corresponding to each reverse node in the reverse node sequence. Encapsulate the feasible time interval and resource release sequence into bottleneck drift scheduling correction information.

[0072] Furthermore, based on the reverse node sequence, according to the order of each reverse node in the sequence, the dynamic constraint boundary of the corresponding work node is aligned with the resource occupation content of the work node in the same order in the current resource occupation topology, and the candidate time period of each reverse node that is not occupied within the dynamic constraint boundary of the work process and can undertake downstream demand is determined. Candidate time periods are continuously organized according to node flow relationships and downstream acceptance needs. Time periods that are not continuous with downstream acceptance needs, are covered by resource-occupied content, or exceed the dynamic constraint boundary of the process are eliminated. Candidate time periods that are sequentially connected between adjacent back-investigation nodes are merged to form feasible time intervals. Based on the resource occupation end position, candidate time period start and end position, downstream acceptance demand and node flow order of each back-pull node in the back-pull node sequence, the order of resource release is arranged to form a resource release sequence; the feasible time interval, resource release sequence and corresponding back-pull node sequence are associated and encapsulated to form bottleneck drift scheduling correction information.

[0073] S5: Based on bottleneck drift scheduling correction information, the cross-department scheduling control objects of orders affected by bottlenecks are re-arranged in a coordinated manner to generate scheduling path allocation information, and the scheduling path allocation information is written back to the order digital thread to form full-process fulfillment update information.

[0074] S5.1: Align the feasible time interval, resource release sequence, and reverse node sequence in the bottleneck drift scheduling correction information with the job nodes in the order digital thread to determine the orders affected by the bottleneck and the cross-department scheduling control objects. Then, reset the acceptance order and resource occupancy order of the cross-department scheduling control objects according to the resource release sequence to form cross-department rescheduling information.

[0075] Furthermore, based on the bottleneck drift scheduling correction information, the starting and ending boundaries of the feasible time interval, the release order of the resource release sequence, and the job nodes in the order number thread are linked in order using the node position in the reverse node sequence as the index. During the sequence connection process, the order links involved in the delayed propagation chain are used as the screening scope. Orders that fall within the feasible time interval and occupy relevant resources in the resource release sequence are marked as bottleneck-affected orders. The work arrangements of bottleneck-affected orders that require changing the receiving position, releasing resource occupation, and rescheduling the flow time are identified as cross-departmental scheduling control objects. According to the order of resource release sequence, the order of acceptance, resource succession position and circulation time of cross-departmental scheduling control objects are rearranged. The rearranged acceptance position, resource occupation order and circulation time are included in the cross-departmental rearrangement results. The content included in the cross-departmental rearrangement results is collected to form cross-departmental rearrangement information.

[0076] S5.2: In cross-departmental rescheduling information, orders whose delivery constraints can still be maintained are assigned to the original receiving path, orders affected by the continuous occupation of bottleneck resources are assigned to the rescheduled receiving path, and orders that need to wait for resource release are assigned to the delayed receiving path, thus forming scheduling path allocation information.

[0077] Furthermore, based on the acceptance order, resource usage order, and flow time period in the cross-departmental rearrangement information, the bottleneck-affected orders are compared with the delivery nodes, process dynamic constraint boundaries, and feasible time intervals in the order digital thread. When the bottleneck-affected order is still within the process dynamic constraint boundary after rearrangement, and the flow time period does not compress the delivery node requirements, the corresponding order is kept in the original acceptance path and the original node acceptance order is used. When the subsequent flow of orders affected by bottlenecks is constrained by the continuous occupation of bottleneck resources, and can be transferred to other available work nodes through the resource release sequence, the corresponding orders will be transferred to the reassignment path, and the receiving objects of the corresponding work nodes will be updated. When an order is affected by a bottleneck and is not yet within the feasible time frame, and needs to wait for the resource occupation in the resource release sequence to end before it can be accepted, the corresponding order will be transferred to the delayed acceptance path, and the entry time of the corresponding job node will be updated. The path allocation entries will be encapsulated and the acceptance control will be attached according to the original node acceptance order, the updated acceptance object and the updated entry time to form the scheduling path allocation information.

[0078] S5.3: Link the bottleneck-affected orders in the scheduling path allocation information to the job nodes in the order number thread, and associate the acceptance order and resource occupancy order in the cross-departmental rescheduling information with the corresponding job nodes to form order thread update information.

[0079] Furthermore, based on the scheduling path allocation information, the path allocation entries corresponding to the orders affected by the bottleneck are linked to the job nodes in the order digital thread in order order. According to the job node's acceptance position in the order digital thread, the original node acceptance order, the updated acceptance object, and the updated entry time period are respectively associated with the corresponding job node. Based on the cross-departmental rearrangement information, the rearranged acceptance order and resource occupancy order are associated with the acceptance control position of the same work node, and the work nodes that have completed the order attachment and resource association are organized according to the acceptance order of the order number thread to form the order thread update information.

[0080] S5.4: Based on the order thread update information, update the subsequent acceptance path, resource release order and fulfillment progress status of orders affected by bottlenecks, forming full-process fulfillment update information.

[0081] Furthermore, based on the order thread update information, the subsequent work nodes corresponding to the bottleneck-affected orders are located in the order digital thread, and the acceptance path between work nodes is updated according to the acceptance order, acceptance object and entry time in the order thread update information. Simultaneously, based on the resource occupancy order in the order thread update information, the resource release sequence and resource continuation position of the relevant work nodes are re-registered, and the updated acceptance path and resource release order are associated with the current fulfillment stage of the bottleneck-affected order; after the association is completed, the status of the pending acceptance nodes, accepted nodes, resources to be released and subsequent progress positions of the bottleneck-affected order are sorted out to generate full-process fulfillment update information.

[0082] In summary, this invention achieves dynamic positioning of work node obstruction status by: constructing a dynamic process flow dependency graph, converting window state differences in order fulfillment monitoring information into process stagnation characteristic parameters, and mapping them to node flow relationships; generating bottleneck drift scheduling correction information, tracking the propagation trajectory of delay signals, and combining the current resource occupancy topology to infer feasible time intervals and resource release sequences, supporting cross-departmental scheduling control object linkage rescheduling, and promoting the coordinated updating of full-process fulfillment update information around order acceptance, resource continuation, and fulfillment progress status.

[0083] It should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and are not intended to limit it. Although the present invention has been described in detail with reference to preferred embodiments, those skilled in the art should understand that modifications or equivalent substitutions can be made to the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention, and all such modifications or substitutions should be covered within the scope of the claims of the present invention.

Claims

1. A method for multi-department collaborative order whole-process intelligent management of a textile enterprise, characterized in that, include: Connect the process path to the textile orders and establish order digital threads according to the order of textile order acceptance to form the order digital thread acceptance benchmark; Based on the order digital thread acceptance benchmark, the processes in the process route list are mapped one by one to work nodes, and static process flow topology information is constructed according to the process flow direction. Then, forward constraint transmission and backward tolerance backtracking are performed to solve the dynamic constraint boundary of the process and form process status acceptance information. During the execution of textile orders, the progress, waiting time, resource consumption, handover results and abnormal handling status of each work node are dynamically recorded based on the process status acceptance information. The cross-node transfer information is checked every time a cross-node transfer occurs, forming order fulfillment monitoring information. Extract process stagnation characteristic parameters of each work node within the sliding time window from order fulfillment monitoring information, construct a dynamic process flow dependency graph, track the propagation trajectory of delay signals, perform constraint back-calculation processing based on the drift direction of delay signals and the current resource occupancy topology, calculate the feasible time interval and resource release sequence for scheduling correction, and generate bottleneck drift scheduling correction information. Based on bottleneck drift scheduling correction information, the cross-departmental scheduling control objects of orders affected by bottlenecks are re-arranged in a coordinated manner to generate scheduling path allocation information, and the scheduling path allocation information is written back to the order digital thread to form full-process fulfillment update information.

2. The method for multi-department collaborative order whole-process intelligent management of a textile enterprise according to claim 1, characterized in that, The specific steps for forming the order digital thread acceptance benchmark are as follows: Extract the order acceptance field from the textile order, verify the completeness of the field, and form the basic order registration information; Based on the basic order registration information, the corresponding process route list is retrieved from the enterprise process route database, and the process path attachment elements in the process route list are associated to form process path attachment information; The basic order registration information and process path connection information are written into the same order digital link to establish an order digital thread. The node acceptance relationship and delivery node in the order digital thread are marked with acceptance order and delivery constraints to form the order digital thread acceptance benchmark.

3. The method for multi-department collaborative order whole-process intelligent management of a textile enterprise according to claim 1, characterized in that, The specific steps for constructing static process flow topology information are as follows: Based on the process route list, node acceptance relationship and delivery node in the order digital thread acceptance benchmark, auxiliary records in the process route list that are not related to the current textile order production fulfillment are removed, and valid processes are retained to form process mapping range information; Within the process mapping range information, each valid process is converted into a corresponding operation node, and according to the acceptance position of the valid process in the textile order, the process acceptance element is written for the corresponding operation node to form process acceptance information; Based on the process acceptance information, according to the acceptance position of each operation node in the textile order, the flow order of each operation node in the process acceptance information is sorted out, and the flow output and acceptance input of adjacent sequence operation nodes are confirmed to connect and connect. Operation nodes with direct acceptance relationship are identified to form node flow relationship. The operation node is used as topology node, and the node flow relationship is used as topology connection edge to construct static process flow topology information.

4. The method for multi-department collaborative order whole-process intelligent management of a textile enterprise according to claim 3, characterized in that, The specific steps for obtaining the process status information are as follows: Taking the starting node in the static process flow topology information as the transmission starting point, the node flow relationship is transmitted to the work nodes sequentially along the topology connection edge. According to the acceptance direction between adjacent work nodes, the flow output of the upstream work node is converted into the acceptance input of the downstream work node. Combined with the process acceptance elements in the process acceptance information, the acceptance sources that each work node can receive and the continuous flow range are limited to form the forward acceptance constraint range. Using the delivery date corresponding to the delivery node as the backtracking endpoint, backtrack each operation node along the topological connection edge in the static process flow topology information. Using the forward acceptance constraint range of the operation node as the acceptance boundary, and the remaining performance margin between the operation node and the delivery node as the constraint source, deduct the constraint occupancy of the operation node to form the backward tolerance constraint parameter. The forward acceptance constraint range and the backward tolerance constraint parameters are matched in position. The overlap between the acceptable range defined by the forward acceptance constraint range and the retainable range defined by the backward tolerance constraint parameters is identified. Based on the overlap identification results, the dynamic constraint boundary of the process is determined and written into the corresponding operation node to form the process status acceptance information.

5. The method for intelligent management of the entire process of multi-department collaborative orders in textile enterprises as described in claim 1, characterized in that, The process of dynamically recording the work progress, waiting time, resource usage, handover results, and anomaly handling status of each work node during the execution of textile orders is as follows: Within the scope of the process status acceptance information, determine the work nodes that enter the execution window in the current textile order, and establish a node status registration entry according to the process dynamic constraint boundary of the corresponding work node to form a node status registration benchmark. Based on the node status registration benchmark, the system receives node execution feedback content generated by each work node during execution, and collects and registers the node execution feedback content according to the correspondence between the work node and the node status registration entry, forming node feedback collection information.

6. The method for multi-department collaborative order whole-process intelligent management of a textile enterprise according to claim 5, characterized in that, The specific steps for generating order fulfillment monitoring information are as follows: Identify the work nodes that have entered the cross-node transfer stage from the node feedback collection information, and mark the work nodes as transfer initiating nodes based on the node transfer relationship in the static process transfer topology information, and mark the work nodes that directly receive the transfer initiating nodes as receiving nodes, thus forming cross-node transfer pending verification information; Based on the cross-node transfer pending verification information and process status acceptance information, the node acceptance verification is performed on the transfer initiating node, the receiving node, and the execution status of this cross-node transfer. When the node acceptance verification passes, the receiving status of the receiving node is opened. When the node acceptance verification fails, the pending status of the transfer initiating node is maintained. Order fulfillment monitoring information is formed based on the receiving status of the receiving node and the pending status of the transfer initiating node.

7. The method for multi-department collaborative order whole-process intelligent management of a textile enterprise according to claim 6, characterized in that, The specific steps for constructing the dynamic process flow dependency graph are as follows: Based on order fulfillment monitoring information, sliding time windows are divided according to the execution timeline of textile orders. Based on the correspondence between sliding time windows and work nodes, the feedback collection information, receiving status and pending status of nodes within the same sliding time window are merged into the window record to form window status collection information. The window record of the previous sliding time window is used as the baseline record, and the window record of the current sliding time window is used as the control record. The state difference between the baseline record and the control record is calculated to obtain the window state difference quantity. The window state difference is converted into process stagnation feature parameters and mapped to the corresponding node flow relationship. The operation node is used as the dynamic graph node, and the mapped node flow relationship is used as the dynamic graph connection edge to construct a dynamic process flow dependency graph.

8. The method for multi-department collaborative order whole-process intelligent management of a textile enterprise according to claim 7, characterized in that, The specific steps for generating bottleneck drift scheduling correction information are as follows: In the dynamic process flow dependency graph, the process stalling characteristic parameters that exceed the dynamic constraint boundary of the process are marked as delay signals, and the transmission direction and arrival position of the delay signals are tracked along the connection edge of the dynamic graph to form delay propagation trajectory information. Based on the delayed propagation trajectory information, the direction of transmission of the delayed signal from the upstream operation node to the downstream operation node is determined as the drift direction of the delayed signal. Based on the window state collection information, the resource occupation content of each operation node within the sliding time window is associated with the corresponding node flow relationship to form the current resource occupation topology. Based on the drift direction of the delayed signal and the current resource occupancy topology, the delay propagation chain is determined along the dynamic process flow dependency graph. The last delayed node in the delay propagation chain arranged along the drift direction is taken as the starting point for reverse inference, and the reverse inference node sequence is arranged in reverse along the dynamic process flow dependency graph. The dynamic constraint boundary of the process is mapped to the node position of the current resource occupation topology, and the continuous acceptable time periods are merged to form a feasible time interval. Then, a resource release sequence is formed according to the order of the resource occupation end position, downstream accepting demand and continuous acceptable time periods corresponding to each back-dated node in the back-dated node sequence. The feasible time interval and the resource release sequence are encapsulated as bottleneck drift scheduling correction information.

9. The method for intelligent management of the entire process of multi-department collaborative orders in textile enterprises as described in claim 8, characterized in that, The specific steps for generating the scheduled path allocation information are as follows: Align the feasible time interval, resource release sequence, and reverse node sequence in the bottleneck drift scheduling correction information with the job nodes in the order digital thread to determine the orders affected by the bottleneck and the cross-department scheduling control objects. Then, reset the acceptance order and resource occupancy order of the cross-department scheduling control objects according to the resource release sequence to form cross-department rescheduling information. In the cross-departmental rescheduling information, orders whose delivery constraints can still be maintained are assigned to the original acceptance path, orders affected by the continuous occupation of bottleneck resources are assigned to the rescheduled acceptance path, and orders that need to wait for resource release are assigned to the delayed acceptance path, thus forming scheduling path allocation information.

10. The method for intelligent management of the entire process of multi-department collaborative orders in textile enterprises as described in claim 9, characterized in that, The specific steps for generating full-process performance update information are as follows: The bottleneck-affected orders in the scheduling path allocation information are linked to the job nodes in the order digital thread, and the acceptance order and resource occupancy order in the cross-department rescheduling information are associated with the corresponding job nodes to form the order thread update information. Based on the order thread update information, the subsequent acceptance path, resource release order and fulfillment progress status of orders affected by bottlenecks are updated to form full-process fulfillment update information.

Images