An intelligent scheduling method for land guarantee of major projects
Patent Information
- Application Number
- CN202610997240.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2026-07-06
- Publication Date
- 2026-10-23
- Estimated Expiration
- 2046-07-06
AI Technical Summary
[0005]本发明针对现有基于通用工作流引擎的审批管理路线难以兼顾重大项目用地保障场景下的复杂项目分级组织、并行依赖调度、跨层级状态同步以及督办闭环控制的技术问题,提出一种重大项目用地保障智能调度方法
[0020]其一,通过构建采用同构属性结构的L1、L2和L3三级项目分类体系,并结合虚拟升维机制,能够对分期建设、打捆申报和片区统筹等复杂重大项目进行统一建模和动态视图切换,从而提高复杂项目的分级管理能力和进度追踪精度;
Smart Images

Figure CN122529431B_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of land management and government affairs collaborative scheduling technology, and in particular to an intelligent scheduling method for ensuring land use for major projects. Background Technology
[0002] The process of securing land for construction typically requires collaboration among multiple departments, including natural resources, development and reform, industry and information technology, ecology and environment, and local governments, and often spans different administrative levels such as provinces, cities, and counties. For major projects involving phased construction, bundled applications, and regional coordination, the scheduling system not only needs to complete the approval process but also needs to take into account multi-level project organization, cross-departmental collaboration, and status synchronization control.
[0003] In the prior art, Chinese patent document CN117973828B discloses a general approval process management method and apparatus based on Activiti. This solution uses a general workflow engine to realize process definition, deployment, instantiation, task allocation, status tracking, and user role permission configuration, which can meet the process flow and basic permission management needs in general approval workflow scenarios.
[0004] However, in the context of ensuring land use for major projects, the aforementioned approval management approach based on a general workflow engine is primarily geared towards general approval flows. It typically organizes business processing according to general process configurations and task flow methods, making it difficult to simultaneously adapt to the hierarchical management needs of complex projects such as phased construction, bundled applications, and regional coordination. Furthermore, it struggles to establish a unified hierarchical scheduling mechanism for parallel processes, cross-group dependencies, and multi-level status feedback relationships. Simultaneously, access control in such solutions is usually limited to role-level or department-level controls, lacking a joint filtering mechanism that combines departmental identity, role, and administrative region. Progress statistics, overdue warnings, and problem supervision also rely heavily on manual tracking, easily leading to problems such as unclear boundaries of authority and responsibility, excessively broad node visibility, untimely status synchronization, and insufficient efficiency in the supervision loop. Therefore, how to achieve hierarchical organization of complex projects, parallel dependency scheduling, cross-level status synchronization, and closed-loop control for supervision on the basis of a general workflow approval management approach, specifically for ensuring land use for major projects, has become a technical problem that needs to be solved in this field. Summary of the Invention
[0005] This invention addresses the technical challenges of existing approval management methods based on general workflow engines, which struggle to simultaneously address the complex hierarchical organization, parallel dependency scheduling, cross-level state synchronization, and closed-loop control of major project land use guarantees. It proposes an intelligent scheduling method for major project land use guarantees.
[0006] This invention provides an intelligent scheduling method for ensuring land use for major projects, comprising: constructing a recursive three-level project classification system, wherein the recursive three-level project classification system includes an L1-level root project node, an L2-level sub-project node, and an L3-level task unit node, wherein the L1-level root project node has no parent node, the parent node of the L2-level sub-project node is the L1-level root project node, and the parent node of the L3-level task unit node is the L2-level sub-project node, and the L1-level root project node, L2-level sub-project node, and L3-level task unit node adopt a isomorphic attribute structure; and constructing a three-level template for the entire process of construction land, wherein the three-level template for the entire process of construction land includes a Stage node, a Tache node, and a Process node, wherein the parent node of the Tache node is the Stage node, and the parent node of the Process node is the Tache node, and the nodes in the three-level template for the entire process of construction land include at least an implementing department, a management department, an operable role, an operable administrative region level, an application status, and a prerequisite dependency node. The system includes: 1) Obtaining basic project information for the project to be scheduled; 2) Automatically matching the three-level template for the entire construction land process with the basic project information and a preset semantic keyword library; 3) Binding the matched target template to the project node corresponding to the project to be scheduled; 4) When the state of any Process node is solidified, firstly, parse the preceding dependent nodes of that Process node. After the preceding dependent nodes meet the activation conditions, select the corresponding execution chain from the preset policy routing mapping table according to the solidified target state, and execute state propagation from bottom to top according to the paths of Process node, Tache node, and Stage node; 5) During the state propagation process, perform aggregation verification on the Tache node. When the aggregation verification is satisfied, update the state of the Tache node and continue to update the state of the Stage node upwards. When the aggregation verification is not satisfied, circuit break the execution chain at the current level; 6) Based on the preset department identity dimension, role dimension, and administrative region dimension of the node, perform three-layer filtering on user-visible nodes and operable nodes, and output the scheduling result.
[0007] Furthermore, the isomorphic attribute structure includes at least a unique identifier, node name, administrative region, industry type, domain type, binding template, completion progress, project category, extended attributes, parent node identifier, and hierarchy identifier. Child nodes inherit the administrative region, industry type, domain type, and binding template attributes of the parent node by default, and it is allowed to override and modify the inherited attributes of the child nodes.
[0008] Furthermore, the recursive three-level project classification system also includes a parent node progress aggregation step, which calculates the parent node completion rate according to the rule that the parent node completion rate is equal to the sum of the number of completed child nodes divided by the sum of the total number of child nodes.
[0009] Furthermore, the recursive three-level project classification system also includes a virtual dimensionality upgrade step, which calculates the dimensionality upgrade tendency score based on the industry classification matching degree, domain classification matching degree, and key project matching degree of the target project node. When the dimensionality upgrade tendency score reaches a preset threshold or the target project node meets the preset key project conditions, the target project node is automatically promoted to the temporary logical root node of the current view to generate an independent management view.
[0010] Furthermore, in the three-level template for the entire construction land process, at least one parallel process group is set under the same Stage node. The parallel process group is configured with a full completion rule or an arbitrary completion rule, and allows setting cross-parallel group prerequisite dependencies for the Process nodes within the parallel process group.
[0011] Furthermore, the automatic matching of the three-level templates for the entire construction land process based on the basic project information and the preset semantic keyword library includes: parsing the project information table uploaded by the user to extract the project name, land use type, industry type and field type; matching and scoring the extracted project attributes with the keyword sets corresponding to each standard template; and using the standard template with the highest matching score as the target template.
[0012] Furthermore, after constructing the three-level template for the entire construction land process, a corresponding tree-structured JSON template is generated, and closed-loop verification is performed on the preceding dependency nodes in the tree-structured JSON template to identify and block template configurations with dependency loops.
[0013] Furthermore, the three-layer filtering includes: firstly, performing the first layer of administrative region filtering based on the visible administrative region range of the node; then, performing the second layer of role permission filtering based on the list of operable roles bound to the node; and finally, performing the third layer of department identity filtering based on the execution department and management department bound to the node.
[0014] Furthermore, the step of selecting the corresponding execution chain from the preset policy routing mapping table based on the solidified target state includes: mapping the pass state to the pass execution chain, mapping the rejection state to the rejection execution chain, mapping the suspended state to the suspended execution chain, and recording the link log and interrupting the upward propagation when an aggregation verification failure or node processing abnormality occurs at any level of the execution chain.
[0015] Furthermore, after the state transmission is completed or after the project's basic data changes, an event message containing the project identifier is sent to the message queue. The event message indicating that the scheduling is complete is sent to the scheduling completion channel, and the event message indicating that the project's basic data has changed is sent to the data change channel. The asynchronous consumer then performs cross-level state recalculation and data verification based on the event message.
[0016] Furthermore, after receiving the event message, the asynchronous consumer performs consistency checks on the progress data of the L1-level root project node, the L2-level sub-project node, and the L3-level task unit node, and updates the visualization indicators corresponding to the project completion rate, stage completion status, and overdue node percentage.
[0017] Furthermore, it also includes an intelligent early warning step, which periodically scans incomplete projects and overdue incomplete nodes based on distributed timed tasks, and sends reminder information to the corresponding schedulers according to preset overdue thresholds or completion rate thresholds.
[0018] Furthermore, it also includes intelligent supervision closed-loop steps, which include: when a problem is associated with a specific process node, automatically determining the problem recipient and sending supervision information based on the executing department, management department, role, and administrative region bound to the process node; when the problem recipient uploads the processing result and it is confirmed by the initiator, actively closing the account; and when the subsequent status of the process node associated with the problem changes to "passed", automatically closing the account.
[0019] Compared with the prior art, the present invention has at least the following beneficial effects:
[0020] Firstly, by constructing a three-level project classification system of L1, L2 and L3 with isomorphic attribute structure, and combining it with a virtual dimensionality upgrade mechanism, it is possible to uniformly model and dynamically switch views for complex and major projects such as phased construction, bundled application and regional coordination, thereby improving the hierarchical management capability and progress tracking accuracy of complex projects.
[0021] Secondly, by dividing the entire process of land acquisition into Stage nodes, Tache nodes, and Process nodes, and supporting full completion rules, arbitrary completion rules, and cross-parallel group pre-dependency configurations under the same Stage node, the parallel processing capability of dependency-free links can be improved and the approval cycle can be shortened while ensuring business constraints.
[0022] Third, the execution department and the management department are configured separately at the template stage. By refining the preset permissions of nodes into a three-layer filtering mechanism of departmental identity dimension, role dimension and administrative region dimension, the boundaries of execution responsibility and management responsibility can be clearly defined in multi-department and cross-administrative region collaborative scenarios, reducing the risk of unauthorized access and shirking responsibility.
[0023] Fourth, by using node states as routing instructions and transmitting states from bottom to top based on pre-defined execution chains, and by combining message queues to achieve asynchronous decoupling of scheduling completion channels and data change channels, the consistency of state synchronization and system response efficiency can be improved.
[0024] Fifth, by linking intelligent early warning with the closed-loop supervision of issues, and automatically canceling the record when the status of the issue-related node changes to "passed", the efficiency and traceability of the closed-loop supervision in the process of ensuring land use for major projects can be improved. Attached Figure Description
[0025] Figure 1 This is an overall flowchart of the intelligent scheduling method for ensuring land use for major projects according to the present invention;
[0026] Figure 2 Flowchart for constructing a recursive three-level project classification system;
[0027] Figure 3 Generate flowcharts for virtual upgrades and independent management views;
[0028] Figure 4 A flowchart for constructing a three-level template for the entire process of land use for construction;
[0029] Figure 5 Flowchart for obtaining basic project information and automatically matching templates;
[0030] Figure 6 Flowchart for generating tree-structured JSON templates and performing closed-loop validation of pre-dependencies;
[0031] Figure 7 A flowchart illustrating the rules for the full completion of parallel processes;
[0032] Figure 8 A flowchart illustrating the rules for arbitrary completion of parallel processes;
[0033] Figure 9 Flowchart for process node state solidification and strategy routing selection;
[0034] Figure 10 This is a flowchart of the bottom-up state propagation and aggregation verification process;
[0035] Figure 11 Flowchart of node-level three-tier permission filtering;
[0036] Figure 12 Flowchart for asynchronous state synchronization and visualization metric updates;
[0037] Figure 13 A flowchart for intelligent early warning and supervision closed-loop process. Detailed Implementation
[0038] like Figure 1 As shown, the intelligent scheduling method for ensuring land use for major projects in this invention generally includes the construction of a recursive three-level project classification system, the construction of a three-level template for the entire process of construction land, the acquisition of basic project information and template matching, the resolution of pre-dependencies after the process node status is solidified, the selection of the strategy execution chain, the bottom-up state transmission, aggregation verification, three-level permission filtering, and the output of scheduling results.
[0039] The specific embodiments of the present invention will be further described below with reference to the accompanying drawings. It should be understood that the following embodiments are for illustrative purposes only and are not intended to limit the scope of protection of the present invention.
[0040] Example 1: Recursive Three-Level Project Classification System
[0041] like Figure 2 As shown, this embodiment addresses land use guarantee for major projects. First, a recursive three-level project classification system is established on the project management side. This classification system then serves as the project foundation for subsequent template binding, process scheduling, and progress aggregation. The system divides project nodes into L1-level root project nodes, L2-level sub-project nodes, and L3-level task unit nodes. The three levels adopt a homogeneous attribute structure; that is, L1, L2, and L3 nodes use the same set of fields, the same parent-child reference fields, the same template binding fields, the same progress statistics fields, and the same extended attribute carrying methods. Furthermore, the different levels differ only in parent node constraints and business meanings. Therefore, nodes at different levels can be created, inherited, filtered, and statistically analyzed within the same data structure.
[0042] The system uses L1-level root project nodes to represent major bundled projects, regional development projects, or city-wide integrated projects. These nodes do not have parent nodes and serve as the logical root node. L2-level sub-project nodes represent phased projects under major projects or individual projects under bundled projects; their parent node is the L1-level root project node. L3-level task unit nodes represent specific construction tasks or independently submitted units under sub-projects; their parent node is the L2-level sub-project node. Through this parent-child constraint, the system can organize complex projects according to the structure of "overall project, phased or sectioned, individual task."
[0043] In a specific implementation, each project node is configured with at least a unique identifier, name, administrative region, industry type, domain type, binding template, completion progress, project category, extended attributes, parent node identifier, and hierarchical identifier. It can also be extended with fields such as responsible person, construction unit, funding status, or other business fields. L2-level sub-project nodes and L3-level task unit nodes inherit the administrative region, industry type, domain type, and binding template from their parent node by default. When there are differences in actual phases, sections, or individual projects, business personnel can override and modify the inherited attributes.
[0044] The system aggregates progress according to recursive isomorphic rules. For any parent node, the system reads the number of completed nodes and the total number of nodes of its subordinate child nodes, and calculates the parent node completion rate according to "parent node completion rate = sum of the number of completed nodes of all child nodes / sum of the total number of nodes of all child nodes". In this way, the processing status of the underlying Process nodes can be transmitted level by level to L3 task units, L2 sub-projects and L1 root projects, so that phased construction, segmented investment and bundled application projects can all be counted under the same caliber.
[0045] In global search, conditional filtering, or thematic statistics scenarios, the system also dynamically generates views for the matched L2-level sub-project nodes or L3-level task unit nodes. If the filtering results converge to a specific node, the system does not require the user to manually set it as the root node; instead, it temporarily promotes the matched node to the logical root node of the current view and generates an independent management view for that node. For example, ... Figure 3 As shown, when the target topic statistics hit the L2 level sub-project node G6512 Xiushan to Congjiang Guogao Songtao project, the system can use the L2 node as a temporary root node to generate an independent management view, while not changing its parent-child relationship in the original three-level project tree.
[0046] To determine whether a node is suitable for temporary dimensionality upscaling, the system calculates a node's dimensionality upscaling tendency score: .in, For project nodes, For industry classification matching degree, For domain classification matching degree, Matching score for key projects. When industry category matches. Take 1 if the match is not found, and 0 if the match is found in the domain category. Use 1 if no match is found, and 0 if no match is found; This applies when business personnel manually mark a project as a key project, and the key project has at least one of the following: industry classification or field classification. Select 1 if the dimensionality promotion tendency score is not lower than 0.4, or if the target node meets the key project conditions, the system will automatically promote the L2 or L3 node to the temporary logical root node of the current view.
[0047] Based on the aforementioned recursive isomorphism mechanism and virtual dimensionality upgrade mechanism, the system can follow... Figure 2 and Figure 3 The process shown generates a dynamic three-level project tree and supports topic viewing, hierarchical scheduling, and progress tracking without disrupting the underlying data relationships.
[0048] For phased construction projects, the system can replicate the hierarchical structure of the project after the first phase is completed, and continue the confirmed templates, permissions, and progress tracking configurations in subsequent construction cycles. For bundled application projects, the system can temporarily bundle multiple independent sub-items into a joint scheduling unit for unified scheduling, while retaining the independent templates, data entries, and management permissions of each sub-item. In this way, adjustments at any level can be aggregated upwards and passed downwards, and complex projects are no longer compressed into flat templates.
[0049] Example 2: Construction of a Three-Level Template for the Entire Construction Land Use Process
[0050] like Figure 4 As shown, this embodiment abstracts the entire process of ensuring construction land use into Stage nodes, Tache nodes, and Process nodes. Stage nodes represent the top-level business domain, signifying stages such as project initiation, land use pre-approval, document preparation and approval, and post-approval supply. Tache nodes represent departmental collaborative task packages, signifying stages such as surveying and demarcation, preparation of land-saving chapters, mineral resource overlay queries, and geological disaster queries. Process nodes represent the smallest execution task unit, signifying specific actions such as county-level review, document uploading, municipal-level approval, and report preparation. The parent node of a Tache node is always a Stage node, and the parent node of a Process node is always a Tache node.
[0051] During template configuration, each scheduling node is configured with basic attributes that describe the node structure, execution order, responsibility boundaries, dependencies, and status enumeration. These basic attributes include parentNode, name, type, sort, reporting_dept, responsible_dept, role, pac_level, approval, pre_node, status_options, and other_config. `parentNode` records the parent node identifier; `name` describes the node's business name; `type` defines the stage, link, or process node type; `sort` determines the order of sibling nodes. `reporting_dept` is the executing department field, recording the department responsible for status reporting and material uploading. `responsible_dept` is the management or responsible department field, recording the department responsible for review, supervision, progress statistics, and cross-departmental coordination. `role` and `pac_level` define the set of operable roles and the provincial, municipal, and county administrative levels, respectively. `approval` records application statuses such as not submitted, in application, and approved. `pre_node` records the preceding dependent nodes. `status_options` maintains the text mapping for statuses such as approved, not approved, completed, incomplete, and suspended. `other_config` contains extended fields such as text, dropdowns, and switches.
[0052] The implementing and management departments are clearly defined at the template stage. The implementing department is only responsible for filling in and uploading materials for its assigned nodes, while the management department is responsible for reviewing, supervising, and tracking progress within its jurisdiction. This establishes a clear boundary of responsibility at the template level: "whoever fills in the form is responsible, and whoever manages supervises."
[0053] Within the same Stage node, the system allows the creation of at least one parallel stage group, and the configuration of a full completion rule or an arbitrary completion rule for the parallel stage group. For example... Figure 7 As shown, when the parallel process group adopts the full completion rule, only after all the internal processes of the group submission stage, such as the farmland compensation balance and the modification scheme of the overall national land space plan, are completed, can the downstream stages such as land use approval be allowed. Figure 8 As shown, when the parallel process group adopts the arbitrary completion rule, the downstream node can be activated after any target process in the group is completed. For example, in the site selection stage, as long as any process within or outside the urban development boundary (large-scale development plan) is completed, the pre-land acquisition procedure stage can be entered.
[0054] Parallel process groups do not exclude local serial dependencies. For Process nodes within a parallel process group, the system still allows for individual configuration of cross-parallel group prerequisite dependencies. For example... Figure 9 As shown, the approval issuance process can configure land use fee payment as a prerequisite node. The approval issuance process will only be activated after the land use fee payment stage is completed.
[0055] like Figure 6 As shown, after the template configuration is complete, the system generates a tree-structured JSON template based on the parent-child relationships between Stage nodes, Tache nodes, and Process nodes. Here, JSON is an abbreviation for JavaScript Object Notation, representing a lightweight data exchange format. The tree-structured JSON template is used to record the parent-child relationships, node attributes, and prerequisite dependencies of Stage nodes, Tache nodes, and Process nodes in a hierarchical key-value structure. The system further performs closed-loop verification on the prerequisite dependencies in the tree-structured JSON template. If the verification finds a circular dependency where node A depends on node B, and node B directly or indirectly depends on node A, the system blocks the release of the template. Based on this mechanism, the system can generate standard templates such as single-use land and industrial land, and supports custom template extensions and version management.
[0056] In specific scheduling, the standard template provides a unified kernel, while differentiated node configurations, parallel process groups, and pre-dependency configurations provide project-level adaptability, enabling different regions and different types of projects to form a fine-grained scheduling structure with one template per project. When non-dependent processes are processed in parallel and strongly dependent processes are constrained by pre-conditions, the system can shorten the approval cycle while maintaining clear responsibilities and compliance control.
[0057] Example 3: Intelligent Project Entry and Automatic Template Matching
[0058] like Figure 5 As shown, during the intelligent project entry phase, the system uses a table file parsing component to parse the project information table uploaded by the user, extracting fields such as project name, land use type, project manager, manager's phone number, construction unit, investment funds, allocated funds, engineering construction status, industry type, and field type, and then writes the parsed basic project information into a relational database.
[0059] The system extracts high-frequency words from land-related standards, policy documents, and major local project names to form a basic thesaurus. It pre-configures semantic keyword libraries for various standard full-process templates. For example, the keyword set for a single land use template may include words such as industrialization, highway, reservoir, and energy, while the keyword set for an industrial land use template may include words such as industrial park, base, industrial chain, and cluster. The keyword set can also support administrators to manually add, delete, or modify any keywords. After a project is entered into the database, the system matches and scores the four attribute fields—project name, land use type, industry type, and field type—again against the keyword sets of each standard template. Specifically, the system defines the weight of land use type as 0.4, project name as 0.3, and industry type and field type as 0.15. A Chinese word segmentation tool is used to segment all attribute fields, extracting business terms such as forest resources, shale gas, warehousing, and power plants. The segmented results are then matched against the terms in the keyword set, and the current single-field matching score is calculated. The matching degree is calculated as: (Number of valid keywords in the segmented field / Total number of segmented fields) * Field weight value. Finally, the matching scores of all fields are summed, and the standard template with the highest matching score is used as the target template and bound to the project to be scheduled.
[0060] The automatic template matching results allow for manual correction. When business personnel confirm that a project has a special approval path or regional differences, they can manually adjust the bound template. After the template is bound, the system automatically labels the project as an L1 level root project node, an L2 level sub-project node, or an L3 level task unit node based on the project size, project type, and manual correction rules, and links this level label with the aforementioned recursive three-level project classification system.
[0061] Example 4: Multi-span Collaborative Intelligent Scheduling and Execution
[0062] This embodiment supports three levels of granularity for scheduling configuration: stage, link, and process. The system provides granularity query, enabling or disabling status control, and configuring the estimated completion time in a visual interface. All configuration changes generate audit logs, recording the operator, effective time, and content of the changes.
[0063] For phase-level scheduling, the system by default covers the entire lifecycle of a project, including project initiation, land use pre-approval, and document submission. Phase progress is automatically aggregated by its subordinate links and processes. When an administrator disables a phase, its subordinate links and processes are also disabled and no longer included in the current progress statistics, nor are new pending tasks generated. For phases that were completed before being disabled, the system retains historical data but hides it from the current pending task dashboard, ensuring that the historical process is traceable.
[0064] For process-level scheduling, the system can be configured to address regional policy differences or approval reform needs. For example, projects not involving forest land permits can disable the forest land permit approval process, and non-mining projects can disable the mining license process for mining projects. Once a process is disabled, its subordinate processes are automatically disabled, and the system automatically adjusts the flow logic of upstream and downstream processes, ensuring that after process A is completed, it can directly flow to process C without manual intervention. Processes can also be configured with estimated completion times, and the total duration of all processes within the same stage is correlated with the total completion time of the stage. The system performs real-time verification during configuration; if a process times out, the system generates a timeout record, marks the timed-out process, and sends a reminder SMS to the corresponding reporting personnel.
[0065] For process-level scheduling, the system controls tasks at the smallest granularity, such as county-level review and reporting, special document preparation, and national review. When a specific project does not require national review or other processes, the system can directly disable the corresponding Process node. Disabled processes do not generate pending tasks, their status is automatically marked as "no processing required," and they are simultaneously included in the progress statistics of their respective Tache stages.
[0066] During scheduling and execution, the system adopts a state-driven, pre-defined link flow architecture, rather than relying on passive state polling. Process nodes act as the trigger source for the execution chain, Tache nodes act as intermediate processors, and Stage nodes act as top-level coordinators. The system maintains a pre-defined policy routing mapping table, for example, mapping the pass status to the pass execution chain, the rejection status to the rejection execution chain, and the suspended status to the suspended execution chain.
[0067] This state-driven architecture does not rely on passive polling or post-event listening as the primary method for state advancement. Instead, it immediately selects the execution chain based on the state when the process node state is solidified, enabling process nodes, link nodes, and stage nodes to synchronously complete state modification, permission unlocking, or abnormal circuit breaking within the same link.
[0068] Before any process node triggers scheduling, the system first parses whether the process node is configured with a preceding dependent node. If a preceding dependent node exists, the system enters a serial blocking mode, and the current process node is only allowed to be activated if the preceding node's state meets the activation conditions such as "passed". If no preceding dependent node exists, the system determines that the process node is the starting point of a parallel branch, and the node can be activated independently and enter the scheduling process.
[0069] like Figure 9 and Figure 10As shown, once a Process node completes its business processing and its target state is solidified, the system uses this solidified state as a routing instruction to select the corresponding execution chain from the pre-defined policy routing mapping table. The selected execution chain starts from the Process node and propagates upwards along the path of the Process node, Tache stage node, and Stage stage node. When the execution chain reaches the Tache stage node, the system performs an aggregation check to determine whether all Process nodes to be counted in this stage meet the pass conditions, or whether the parallel stage group to which it belongs meets the arbitrary completion rule.
[0070] If the aggregation verification is satisfied, the system updates the state of the Tache stage node and continues to update the state of the Stage stage node. If the aggregation verification is not satisfied, the system maintains the current stage state and circuit breaks the execution chain at that level to prevent the upper-level stage from being updated prematurely. During each level of the execution chain, the system also records a link log, including the initial state, the matching link name, and the processing time at each level. Permission verification is performed before triggering state modification. When a node processing error occurs or the aggregation verification fails, the system interrupts the link and records the error information to ensure consistency of state data.
[0071] It is worth mentioning that the above mechanism is not used for progress aggregation in this stage. Instead, the following calculation method is used: Parent node completion rate = Sum of the number of completed child nodes / Sum of the total number of child nodes. This method allows the calculation of the parent node completion rate to be performed without waiting for the execution chain to be fully executed, thus enabling real-time statistics of the parent node completion rate.
[0072] Example 5: Three-dimensional permission filtering
[0073] like Figure 11 As shown, to ensure clear permission boundaries in multi-department, cross-administrative region collaboration scenarios, the system employs a role-based access control (RBAC) permission system and a database row-level security mechanism. During the template stage, three types of permission rules are preset: departmental identity, role, and administrative region. Template permissions are automatically inherited after project creation, eliminating the need for repeated configuration for each project.
[0074] The departmental identity dimension distinguishes between implementing and management departments. Implementing departments are the business departments that actually undertake the node tasks, responsible for data entry, material upload, and processing feedback; management departments are responsible for overall node progress control, material review, and cross-departmental issue coordination. The role dimension distinguishes between roles such as administrator, scheduler, data entry clerk, and viewer. The administrative region dimension limits the administrative region under the node's jurisdiction, supporting configuration at the provincial, municipal, and county levels; for example, a provincial key project node can be configured to be visible only at the provincial level, and not visible at the municipal and county levels; projects spanning multiple administrative regions can be configured to be visible to multiple administrative regions.
[0075] When a user accesses the scheduling results, the system filters visible and operable nodes using a three-layer logic. The first layer is administrative region filtering, where the system determines whether the user's administrative region falls within the visible administrative region range configured for the node. The second layer is role and permission filtering, where the system determines whether the user's role is within the operable role list bound to the node. The third layer is department identity filtering, where the system determines whether the user's department belongs to the execution or management department configured for the node. Only after all three layers of filtering are satisfied will the system output the corresponding node and its executable operations to the user.
[0076] Example 6: Asynchronous state synchronization, progress warning and supervision closed loop
[0077] like Figure 12 As shown, after the process scheduling is completed or the project's basic data changes, the system builds a highly reliable asynchronous state synchronization and data verification engine through a message queue middleware. The system defines standardized message contracts, and each message must contain at least a project identifier, event type, and change source. The message queue routing mechanism is used to deliver different events to different channels.
[0078] For events arising from the strategy execution chain reaching its end, the system sends a message containing the project identifier to the scheduling completion channel, notifying the asynchronous consumer to perform data change calculations due to the process flow. For events arising from the project management module maintaining L1, L2, and L3 basic data or check items, the system sends the project identifier and change type to the data change channel, triggering state verification due to data maintenance. After completing the core business logic, the request thread is only responsible for sending messages to the designated exchange; it returns immediately upon successful message transmission, without waiting for time-consuming cross-level state recalculation.
[0079] After receiving the message, the asynchronous consumer performs consistency checks on the progress data of the L1-level root project node, L2-level sub-project nodes, and L3-level task unit nodes, and updates visualization metrics such as project completion rate, stage completion status, and the percentage of overdue nodes. The progress visualization data can aggregate three-level project and three-level node data based on materialized views of a relational database, and supports filtering by administrative region, field, industry, completion status, and project type.
[0080] like Figure 13 As shown, the system also builds an intelligent early warning mechanism based on a distributed scheduled task engine. In one specific implementation, a scheduled task to scan for incomplete projects is executed weekly to scan all incomplete projects and push a reporting reminder to the corresponding scheduler; on the last day of each week, a scheduled task to remind overdue nodes is executed to scan overdue incomplete nodes and push a follow-up reminder again. Early warning rules can be customized by users, including overdue days thresholds, completion rate thresholds, etc. After a rule is triggered, the system sends a reminder message to the responsible person.
[0081] The early warning module can generate tiered early warnings according to rule types. For example, it can trigger a yellow light reminder for nodes that are about to expire, and a red light reminder for nodes that have already expired or have abnormal resources. The reminder information will be sent to the person in charge and copied to the relevant management personnel so that the execution responsibility and the supervision responsibility can be recorded simultaneously.
[0082] In the scenario of issue supervision, if the issue is associated with a specific process node, the system will automatically determine the issue recipient based on the implementing department, management department, role, and administrative region bound to that process node in the three-level template of the entire construction land process, and trigger an SMS notification push through the message queue; if the issue is directly associated with a project, the system will determine the recipient and send a notification based on the user's expected coordination level.
[0083] The system further provides two automated supervision methods: one-click supervision and early warning supervision. When a higher-level user selects to supervise a single project or batch supervision according to the project progress, the system automatically extracts the progress information of the project process nodes, generates a supervision summary, and sends an SMS to the scheduling personnel of the implementing department. On the last day of each week, the system automatically filters projects that have not had progress updates this week and pushes progress update reminders to the scheduling personnel of all levels of administrative regions.
[0084] The closed-loop supervision system includes proactive and automatic closure. In proactive closure, the recipient uploads the processing result or supplementary materials, and the issue is closed after confirmation by the initiator. In automatic closure, if the subsequent status of the process node associated with the issue changes to "passed," the system automatically closes the issue and archives it. Through the linkage of alerts, distribution, processing, confirmation, and archiving, the system forms a traceable closed-loop supervision system.
[0085] During the automatic cancellation process, the system can also verify the status of related nodes, the results of material correction, or key progress indicators through data interfaces. When the verification results meet the preset cancellation conditions, the system automatically archives the supervision records, thereby connecting early warning, distribution, rectification, verification, and cancellation into a continuous closed loop.
Claims
1. A method for intelligent scheduling of land use guarantees for major projects, characterized in that, include: A recursive three-level project classification system is constructed, comprising an L1-level root project node, an L2-level sub-project node, and an L3-level task unit node. The L1-level root project node has no parent node, the parent node of the L2-level sub-project node is the L1-level root project node, and the parent node of the L3-level task unit node is the L2-level sub-project node. Furthermore, the L1-level root project node, L2-level sub-project node, and L3-level task unit node adopt a homogeneous attribute structure. The recursive three-level project classification system also includes a virtual dimensionality upgrade step. Based on the industry classification matching degree, domain classification matching degree, and key project matching degree of the target project node, an dimensionality upgrade tendency score is calculated. When the dimensionality upgrade tendency score reaches a preset threshold or the target project node meets preset key project conditions, the target project node is automatically promoted to a temporary logical root node of the current view to generate an independent management view. A three-level template for the entire process of land use construction is constructed. The three-level template for the entire process of land use construction includes Stage nodes, Tache nodes, and Process nodes. The parent node of the Tache node is the Stage node, and the parent node of the Process node is the Tache node. The nodes in the three-level template for the entire process of land use construction include at least the implementing department, management department, operable role, operable administrative region level, application status, prerequisite dependent nodes, and status options. Obtain the basic project information of the project to be scheduled, automatically match the three-level template of the entire construction land process with the basic project information and the preset semantic keyword library, and bind the matched target template to the project node corresponding to the project to be scheduled. When the state of any Process node is solidified, the preceding dependent nodes of that Process node are first parsed. After the preceding dependent nodes meet the activation conditions, the corresponding execution chain is selected from the preset policy routing mapping table according to the solidified target state, and the state propagation is performed from bottom to top according to the path of Process node, Tache node, and Stage node. During the state propagation process, the Tache node is aggregated and verified. When the aggregate verification is satisfied, the state of the Tache node is updated and the state of the Stage node continues to be updated upwards. When the aggregate verification is not satisfied, the execution chain is broken at the current level. Based on the preset department identity dimension, role dimension, and administrative region dimension of the node, the scheduling result is output after performing three layers of filtering on user-visible nodes and operable nodes.
2. The intelligent scheduling method for ensuring land use for major projects according to claim 1, characterized in that, The isomorphic attribute structure includes at least a unique identifier, node name, administrative region, industry type, domain type, binding template, completion progress, project category, extended attributes, parent node identifier, and hierarchy identifier. Child nodes inherit the administrative region, industry type, domain type, and binding template attributes of the parent node by default, and it is allowed to override and modify the inherited attributes of the child nodes.
3. The intelligent scheduling method for ensuring land use for major projects according to claim 1, characterized in that, The recursive three-level project classification system also includes a parent node progress aggregation step, which calculates the parent node completion rate according to the rule that the parent node completion rate is equal to the sum of the number of completed child nodes divided by the sum of the total number of child nodes.
4. The intelligent scheduling method for ensuring land use for major projects according to claim 1, characterized in that, In the three-level template for the entire construction land process, at least one parallel process group is set under the same Stage node. The parallel process group is configured with a full completion rule or an arbitrary completion rule, and allows setting cross-parallel group pre-dependencies for the Process nodes within the parallel process group.
5. The intelligent scheduling method for ensuring land use for major projects according to claim 1, characterized in that, The automatic matching of the three-level templates for the entire construction land process based on the basic project information and the preset semantic keyword library includes: parsing the project information table uploaded by the user to extract the project name, land use type, industry type and field type; matching and scoring the extracted project attributes with the keyword sets corresponding to each standard template; and using the standard template with the highest matching score as the target template.
6. The intelligent scheduling method for ensuring land use for major projects according to claim 1, characterized in that, After constructing the three-level template for the entire construction land process, a corresponding tree-structured JSON template is generated, and closed-loop verification is performed on the preceding dependency nodes in the tree-structured JSON template to identify and block template configurations with dependency loops.
7. The intelligent scheduling method for ensuring land use for major projects according to claim 1, characterized in that, The three-layer filtering includes: first, performing the first layer of administrative region filtering based on the visible administrative region range of the node; then, performing the second layer of role permission filtering based on the list of operable roles bound to the node; and finally, performing the third layer of department identity filtering based on the execution department and management department bound to the node.
8. The intelligent scheduling method for ensuring land use for major projects according to claim 1, characterized in that, The step of selecting the corresponding execution chain from the preset policy routing mapping table based on the solidified target state includes: mapping the pass state to the pass execution chain, mapping the rejection state to the rejection execution chain, mapping the suspended state to the suspended execution chain, and recording the link log and interrupting the upward propagation when an aggregation verification failure or node processing abnormality occurs at any level of the execution chain.
9. The intelligent scheduling method for ensuring land use for major projects according to claim 1, characterized in that, After the state transmission is completed or after the project's basic data changes, an event message containing the project identifier is sent to the message queue. Event messages indicating scheduling completion are sent to the scheduling completion channel, and event messages indicating changes in the project's basic data are sent to the data change channel. The asynchronous consumer then performs cross-level state recalculation and data verification based on the event messages.
10. The intelligent scheduling method for ensuring land use for major projects according to claim 9, characterized in that, After receiving the event message, the asynchronous consumer performs consistency checks on the progress data of the L1 level root project node, L2 level sub-project node, and L3 level task unit node, and updates the visualization indicators corresponding to the project completion rate, stage completion status, and overdue node percentage.
Citation Information
Patent Citations
Business-general approval process management method and device based on Activiti
CN117973828B
Scheduling and approval process control method and device for digital product online leasing
CN120612160A
Mechanism and system for representing and processing activity models
US20130268258A1