Numerical control machining order priority ranking and production scheduling intelligent management system

Abstract

The invention relates to the technical field of intelligent production scheduling, and discloses a numerical control machining order priority ranking and production scheduling intelligent management system, which comprises a data acquisition and time interval division module, which is used for acquiring production basic data and equipment resource data and dividing a window locking time interval and a rolling time interval; the priority evaluation module is used for calculating an order priority score in combination with a preset weight; the initial schedule generation module is used for constructing a resource process diagram and generating an initial feasible schedule; the influence domain generation module is used for identifying a process set influenced by the production event and forming an influence domain; the scheduling optimization module is used for performing optimization in the influence domain based on the priority score and the cost matrix to generate a new schedule; and the execution issuing module is used for freezing the window locking period schedule and issuing a process execution list. According to the invention, intelligent sorting of production tasks and efficient and stable execution of feasible scheduling in a numerical control machining environment are realized.

Description

TECHNICAL FIELD

[0001] The application belongs to the technical field of intelligent production scheduling, and particularly relates to a numerical control machining order priority sequencing and production scheduling intelligent management system. BACKGROUND

[0002] With the improvement of the automation level of manufacturing industry, numerical control machining production has gradually developed from the traditional single batch machining mode to the multi-variety, small batch and flexible direction. In this process, the order type, delivery time requirement, equipment available state and material on-site condition of the production site all show the characteristics of frequent changes, which significantly improves the complexity of scheduling management. The traditional scheduling method usually relies on manual experience or static algorithm, and once there are sudden situations such as order insertion, equipment failure or material delay, the plan often cannot respond quickly, which easily causes problems such as equipment downtime, resource conflict or order delay.

[0003] Although the existing scheduling system introduces a scheduling strategy based on priority to a certain extent, most methods only consider a single factor such as delivery time or order value, and lack the measurement of comprehensive factors such as customer level, process switching cost and machining complexity. In addition, some systems use static global optimization method, lack of rolling optimization and lock window protection mechanism for production disturbance, which leads to the need to frequently recalculate the overall scheduling in actual operation, which not only increases the calculation burden, but also affects the continuity and executability of the production process. SUMMARY

[0004] The application provides a numerical control machining order priority sequencing and production scheduling intelligent management system, which solves the technical problems of single priority evaluation dimension of numerical control machining orders, slow scheduling response and insufficient scheduling stability after production disturbance in the related art.

[0005] The application provides a numerical control machining order priority sequencing and production scheduling intelligent management system, which includes:

[0006] A data acquisition and time period division module is configured to acquire production basic data and equipment resource data of numerical control machining orders, and divide a lock window period and a rolling period according to a current time;

[0007] A priority evaluation module is configured to calculate a priority score of each order according to the production basic data and the equipment resource data, in combination with a preset weight;

[0008] An initial scheduling generation module is configured to construct a resource process graph according to an order set, a process set and the equipment resource data, and determine an allocated equipment, a start time and a completion time of each process according to the priority score, to generate an initial feasible schedule;

[0009] An impact domain generating module is configured to identify a set of processes affected by the first production event based on the resource process map, form an impact domain, and reschedule within the impact domain;

[0010] An optimization scheduling module is configured to perform deterministic optimization based on the priority score, due date, process type switching cost matrix, and plan perturbation of the initial feasible schedule within the impact domain to obtain a new schedule version;

[0011] An execution issuing module is configured to mark the feasible schedule scheme as the current schedule version, freeze the schedule result within the lock window period, and issue a process execution list.

[0012] Further, the production base data includes: a set of orders, a set of processes, due dates, order values, customer grades, and material readiness statuses; the material readiness statuses include ready and not ready;

[0013] The equipment resource data includes: a set of processing equipment, processing time of each process on candidate equipment, equipment available time period, and process type switching cost matrix.

[0014] Further, the generation of the lock window period and the rolling period includes:

[0015] Step 11, taking the time when the scheduling task is received as the current time, and setting it as the unified time reference;

[0016] Step 12, presetting the lock window length and the plan length according to the production management cycle, wherein the plan length is greater than the lock window length;

[0017] Step 13, taking the current time as the starting point, dividing the lock window period according to the lock window length, and dividing the rolling period according to the plan length.

[0018] Further, the priority score of each order is calculated according to the production base data and the equipment resource data combined with the preset weight, including:

[0019] Step 21, determining the maximum processing time of all processes by obtaining the processing time of all processes in each order on the feasible equipment, and calculating the average processing complexity of each order by the ratio of the shortest processing time of the processes of each order to the maximum processing time;

[0020] Step 22, presetting the due date urgency weight, customer grade weight, order value weight, and processing complexity penalty weight, all of which are non-negative and the sum of which is one; taking the difference between the due date and the current time as the due date urgency, and standardizing the due date urgency, customer grade, and order value according to the due date, customer grade, and order value of each order, respectively;

[0021] Step 23, the standardized delivery urgency, customer level, order value and average processing complexity of each order are weighted and synthesized according to the corresponding weight to obtain the priority score of each order.

[0022] Further, in the resource process graph, nodes are each process, and the construction mode of edges includes:

[0023] When a subsequent process in the same order must start after the completion of a previous process, a process sequence edge is constructed between the two processes;

[0024] When different processes share the same equipment, a resource competition edge is constructed between the two processes;

[0025] When adjacent processes on the same equipment have different process types and switching costs exist, a process switching edge is constructed between the two processes;

[0026] When the execution of a process depends on the output material of another process and the material readiness state does not meet the requirement, a material dependency edge is constructed between the two processes.

[0027] Further, for each node, the start time and completion time of the process are determined, which satisfy the following constraints:

[0028] Process sequence constraint: the start time of a subsequent process of each order is not earlier than the completion time of a previous process;

[0029] Device occupation constraint: a device processes only one process at any time;

[0030] Material readiness constraint: the start time of a process is later than the corresponding material readiness time, and the material readiness state is ready;

[0031] Device available period constraint: the completion time of a process does not exceed the device available period;

[0032] The initial feasible schedule includes the assigned device, start time, completion time, order to which the process belongs, and priority score of each process.

[0033] Further, based on the resource process graph, a set of processes affected by the first production event is identified to form an impact domain, and the processes in the impact domain are rescheduled, including:

[0034] Step 31, when the first production event is detected, the process nodes directly associated with the event are located in the resource process graph to obtain an initial set of affected nodes, and an impact domain is formed; the first production event includes a device downtime event, an order insertion event, a material delay event, and a processing timeout event;

[0035] Step 32, using a pulse closure hybrid scheduling method, in the rolling period according to the priority score of each order, process type switching cost matrix, plan disturbance and equipment resource constraints, respectively for each device to perform multi-objective dominance pruning based on pulse search, generate process placement sequence; and with the minimum cost closure model for the process placement segment in each sequence to select consistency, determine the allocation of each process, processing start time and processing completion time, the placement meets the process order constraint, equipment occupation constraint, material readiness state constraint, equipment available period and process type switching time requirement;

[0036] Step 33, screen the process nodes in the influence domain, mark the processes in the lock window period as frozen nodes, retain the processes in the rolling period to form an adjustable node set, and form a limited local scheduling range; for the processes that cross the boundary between the lock window period and the rolling period, determine the frozen weight according to the intersection ratio of the planned completion time and the lock window boundary time, and when the frozen weight is lower than the preset threshold, the process is included in the adjustable node set;

[0037] Step 34, reassign the equipment, processing start time and processing completion time of the process in the influence domain according to the priority score as the basis for sorting, rearrange the results to meet the process order constraint, equipment occupation constraint and material readiness state constraint, and keep the scheduling of the frozen node unchanged.

[0038] Further, the step 32 specifically comprises:

[0039] Step 41, establish a pulse state set for each device, each pulse state containing device identification, current available time, process placement sequence and cumulative cost vector, the cumulative cost vector consisting of tardiness violation cost, process switching cost, plan disturbance and priority inversion cost;

[0040] Step 42, select a process that has not been scheduled from the process set of the device, determine the earliest feasible start time of the process according to the device available time, the completion time of the previous process and the material readiness time, and insert the switching time when the process type switches to expand to form a new pulse state;

[0041] Step 43, in the pulse state set of the same device, compare the cumulative cost vectors of the current pulse state and the stored pulse state in multiple dimensions, when the current pulse state is not better than any stored pulse state in all cost dimensions, eliminate the pulse state; at the same time, based on the minimum remaining processing time of the unprocessed process, the minimum switching time, the minimum absolute value of the difference between the plan start time and the current available time, and the minimum number of inversions, the cost lower limit is obtained by weighted summation, if the sum of the cumulative cost of the current pulse state and the cost lower limit is higher than the current known optimal upper limit, terminate the expansion of the pulse state;

[0042] Step 44, for each device, independently reserve the un-rejected process placement sequence, and construct the process placement segments in each sequence into a directed acyclic graph, and select the optimal closed set satisfying the process sequence constraint, device occupation constraint and material readiness state constraint in the minimum cost closed set model;

[0043] Step 45, combine the selected process placement segments to form the scheduling scheme of the allocation device, processing start time and completion time of each process, and mark the scheme as the scheduling version of the current rolling period.

[0044] Further, the optimization scheduling module specifically comprises:

[0045] Step 51, based on the initial feasible scheduling scheme, extract the allocation device, start time, completion time and priority score of each process in the influence domain, construct a comprehensive cost function by weighting the tardiness violation cost, process switching cost, planned disturbance amount and priority inversion cost;

[0046] Step 52, under the condition of satisfying the process sequence constraint, device occupation constraint and material readiness state constraint, solve the comprehensive cost function by using a deterministic optimization solving method, obtain the influence domain feasible scheduling scheme after the convergence of the comprehensive cost function by performing local insertion and exchange operations in each device and calculating the value of the comprehensive cost function in real time, and the scheme includes the adjusted allocation device, processing start time and processing completion time of each process;

[0047] Step 53, compare the feasible scheduling scheme with the initial feasible scheduling version, generate a difference report, record the process adjustment, total switching time change and priority inversion number change, and mark the feasible scheduling scheme as a new scheduling version.

[0048] Further, the feasible scheduling scheme is verified for constraint consistency, when it is detected that there is a violation of the process sequence constraint, device occupation constraint, material readiness state constraint or resource period constraint, a deterministic correction cycle is triggered, process time translation, process sequence adjustment and device reallocation operations are sequentially performed according to the fixed correction rule, and deterministic optimization is re-executed after each correction until the verification result satisfies all constraint conditions and converges to a feasible scheduling scheme.

[0049] The application has the beneficial effects that the application considers order delivery time, customer level, processing complexity and process switching cost and the like in the scheduling process, can quantitatively sort different orders, and thus improves the rationality of scheduling decision. Through the partition control of the lock window period and the rolling period, the system can only locally optimize the affected area when the production disturbance occurs, avoiding the calculation overhead caused by global rearrangement. The algorithm framework combining the pulse closure hybrid scheduling and the deterministic optimization makes the scheduling result realize the multi-objective balance under the premise of meeting the process sequence, equipment occupation and material readiness constraints. Further, the system has a scheduling consistency verification and deterministic correction mechanism, which can automatically identify and repair the process that does not meet the constraints, ensuring that the result is executable, stable and traceable. Overall, the application improves the response speed, scheduling stability and equipment utilization of production scheduling. BRIEF DESCRIPTION OF DRAWINGS

[0050] Figure 1 is a module schematic diagram of a numerical control machining order priority sorting and production scheduling intelligent management system of the application. DETAILED DESCRIPTION

[0051] The subject matter described herein will now be discussed with reference to example implementations. It should be understood that the discussion of these implementations is merely meant to provide a better understanding of the subject matter described herein and can include changes to the function and arrangement of the elements discussed without departing from the scope of the content of this specification. Various examples can omit, substitute, or add various procedures or components as desired. In addition, features described in relation to some examples can also be combined in other examples.

[0052] As shown in Figure 1 , a numerical control machining order priority sorting and production scheduling intelligent management system comprises:

[0053] A data acquisition and period division module 1 is configured to acquire production basic data and equipment resource data of numerical control machining orders, and divide a lock window period and a rolling period according to a current time;

[0054] A priority evaluation module 2 is configured to calculate a priority score of each order according to the production basic data and the equipment resource data, in combination with a preset weight;

[0055] An initial scheduling generation module 3 is configured to construct a resource process graph according to an order set, a process set and the equipment resource data, and determine an allocated equipment, a start time and a completion time of each process according to the priority score, to generate an initial feasible scheduling;

[0056] An influence domain generation module 4 is configured to identify a process set affected by a first production event based on the resource process graph, form an influence domain, and reschedule in the influence domain;

[0057] The optimization scheduling module 5 is used to perform deterministic optimization within the influence domain based on priority score, delivery date, process type switching cost matrix and initial feasible schedule perturbation, to obtain a new scheduling version;

[0058] The execution module 6 is used to mark feasible scheduling schemes as the current scheduling version, freeze the scheduling results within the locked window period, and issue the process execution list.

[0059] In one embodiment of the present invention, the production basic data includes: an order set, a process set, a delivery date, an order value, a customer level, and a material readiness status; the material readiness status includes ready and not ready; the order set refers to all orders to be processed within the scheduling cycle; the process set refers to all technological steps to be executed in each order, each process has a unique process identifier, and forms a one-to-one or one-to-many relationship with the corresponding order; the delivery date refers to the latest time required to complete the order; the order value is used to reflect the economic importance of the order; the customer level is used to reflect the service priority level of the order; and the material readiness status is used to describe whether the materials related to the process are ready for processing.

[0060] Equipment resource data includes: a set of processing equipment, the processing time of each process on candidate equipment, the available time period of equipment, and a process type switching cost matrix. The set of processing equipment refers to all CNC machining equipment participating in the scheduling, with each piece of equipment corresponding to a unique equipment identifier; candidate equipment refers to a subset of equipment capable of completing a certain process; the process type switching cost matrix is ​​used to quantify the adjustment time required for equipment to switch between different process types, reflecting the time loss caused by tooling changes, parameter resets, or calibration operations due to process differences in actual production. The rows and columns of the matrix correspond to the process type identifiers, and the matrix elements represent the adjustment time required for equipment to switch between two process types; for the same process type, its matrix element is 0, indicating that no switching is required; specifically, based on the equipment's historical operating data and process parameter records, the average switching time between various process types is statistically analyzed; based on the equipment's processing function, its executable process types are divided into several categories, such as turning, milling, drilling, grinding, etc., and a unique identifier is assigned to each process type; the operation process of each piece of equipment switching between two types of processes is recorded, the timestamps of the start and completion of the switch are obtained, and the switching duration is calculated through the time difference; the standard switching time between each process type is filled into the corresponding matrix element positions to form a complete process type switching cost matrix.

[0061] In one embodiment of the present invention, the generation of the window lock period and the scrolling period includes:

[0062] Step 11: Take the time when the scheduled task is received as the current time and set it as a unified time base;

[0063] Step 12: Preset the window lock duration and the planned duration according to the production management cycle. The planned duration is longer than the window lock duration. The window lock duration is a fixed time length used to limit the generated scheduling results within a certain period of time. The planned duration is the coverage time range of the entire scheduling calculation. The planned duration is longer than the window lock duration.

[0064] Step 13: Starting from the current moment, define the window locking period according to the window locking duration and the rolling period according to the planned duration. The window locking period represents the execution interval that cannot be changed, and the rolling period represents the dynamic interval that can be optimized and adjusted.

[0065] Through the above process, this invention achieves hierarchical control and a dynamic rolling mechanism for scheduling in the time dimension; the locked window period ensures the stable execution of issued tasks, avoiding production interruptions caused by frequent adjustments; the rolling period provides optimization space, enabling the system to dynamically optimize and schedule based on the latest orders, equipment status, and material readiness. While maintaining scheduling stability, it improves the system's real-time response capability to production changes and scheduling flexibility.

[0066] In one embodiment of the present invention, a priority score for each order is calculated based on production base data and equipment resource data, combined with preset weights, including:

[0067] Step 21: By obtaining the processing time of all processes in each order on feasible equipment, determine the maximum processing time of all processes, and calculate the average processing complexity of each order by the ratio of the shortest processing time of each process to the maximum processing time. The shortest processing time of a process refers to the shortest processing time that the process can achieve among all candidate equipment, and the maximum processing time is the maximum processing time among all process processes in all orders. The average processing complexity is used to reflect the proportion of time occupied by the order at the processing resource level. The larger the value, the more complex the order process, the longer the processing cycle, and the higher the resource consumption.

[0068] Step 22: Preset delivery urgency weight, customer level weight, order value weight, and processing complexity penalty weight. All four weights are non-negative and their sum is one. Use the difference between the delivery date and the current time as the delivery urgency. Standardize the delivery urgency, customer level, and order value for each order according to their delivery date, customer level, and order value. The standardization process refers to mapping the above data proportionally to the range of 0 to 1.

[0069] Step 23: Weight the standardized delivery urgency, customer level, order value, and average processing complexity of each order according to their respective weights to obtain a priority score for each order. Specifically, the standardized delivery urgency, customer level, and order value are weighted and summed according to their respective positive weights. The standardized value of the average processing complexity is then multiplied by a penalty weight and subtracted from the weighted sum to obtain the priority score for each order. This priority score comprehensively reflects the order's time urgency, customer importance, economic value, and process complexity. A higher score indicates that the order should be prioritized for processing resources in the current production stage.

[0070] Through the above steps, this invention enables the quantitative calculation of order priorities under multiple factors, avoiding the one-sidedness of traditional manual scheduling which relies solely on delivery dates or human experience for ranking, thereby improving the objectivity and consistency of scheduling decisions. Furthermore, by introducing average processing complexity, the system can automatically balance conflicts between high-value and high-complexity orders when allocating equipment resources, effectively improving equipment utilization and overall production coordination.

[0071] In one embodiment of the present invention, in the resource process diagram, nodes represent various processes, and each node includes attributes such as process identifier, associated order, set of feasible equipment, processing time, and material readiness status; the edge construction method includes:

[0072] When a subsequent process in the same order can only begin after the previous process is completed, a process sequence edge is constructed between the two processes; the process sequence edge is used to describe the dependencies between processes.

[0073] When different processes share the same equipment, a resource contention edge is constructed between the two processes; the resource contention edge is used to express the exclusive constraint at the equipment level.

[0074] When adjacent processes processed consecutively on the same equipment have different process types and there is a switching cost, a process switching edge is constructed between these two processes; the process switching edge is used to reflect the adjustment time cost required for the equipment to switch between different process types;

[0075] When the execution of a certain process depends on the material output of another process and the material readiness status is not met, a material dependency edge is constructed between the two processes; the material dependency edge is used to describe the material supply and demand relationship across orders or across devices.

[0076] In one embodiment of the present invention, for each node, its processing start time and completion time are determined, satisfying the following constraints:

[0077] Process sequence constraint: The start time of the subsequent process in each order shall not be earlier than the completion time of the preceding process;

[0078] Equipment occupancy constraint: The equipment can only process one operation at any given time;

[0079] Material readiness constraint: The start time of the process is later than the corresponding material readiness time, and the material readiness status is "ready".

[0080] Equipment availability time constraint: The process completion time shall not exceed the equipment availability time.

[0081] The initial feasible schedule includes: the equipment allocated to each process, the start time, the completion time, the order to which it belongs, and the priority score.

[0082] Through the above process, the present invention achieves a unified solution for the time allocation and constraints of process nodes. While ensuring the executability of the scheduling results, it improves the utilization rate of equipment resources and the stability of scheduling, and provides a high-quality initial solution for the dynamic adjustment in the subsequent scheduling optimization stage.

[0083] In one embodiment of the present invention, the process set affected by the first production event is identified based on the resource process diagram to form an influence domain, and the process is rescheduled within the influence domain, including:

[0084] Step 31: When the first production event is detected, the process nodes directly associated with the event are located in the resource process diagram to obtain an initial set of affected nodes. The system further expands hierarchically along the directed edges of the resource process diagram to identify related process nodes that have sequential relationships, shared equipment relationships, or material dependencies, forming an influence domain. The first production event includes: equipment downtime event, order insertion event, material delay event, and processing timeout event. Equipment downtime event refers to equipment suspending processing due to malfunction or maintenance. Order insertion event refers to adding a high-priority order in the current scheduling cycle. Material delay event refers to the failure of the materials required for the process to arrive before the planned time. Processing timeout event refers to the processing time of the process exceeding the original planned cycle.

[0085] Step 32: Using a pulse closure hybrid scheduling method, within the rolling period, based on the priority score of each order, the process type switching cost matrix, the plan disturbance, and the equipment resource constraints, pulse search based on multi-objective dominance pruning is performed on each piece of equipment to generate a process placement sequence; and the minimum cost closure model is used to perform consistency selection on the process placement segments in each sequence to determine the allocated equipment, processing start time, and processing completion time of each process. The placement satisfies the process sequence constraints, equipment occupancy constraints, material ready state constraints, equipment available time period, and process type switching time requirements.

[0086] Step 33: Filter the process nodes within the influence domain, marking processes within the locked window period as frozen nodes. This means keeping the current schedule unchanged while retaining processes within the rolling period to form an adjustable node set, creating a restricted local scheduling range. For processes crossing the boundary between the locked window period and the rolling period, determine the freezing weight based on the crossover ratio of its planned completion time to the locked window boundary time. When the freezing weight is lower than a preset threshold, the process is included in the adjustable node set. The formula for calculating the freezing weight is: , Indicates frozen weights. Indicates the planned completion time. Indicates the window lock boundary time. Indicates the start time of the window locking period;

[0087] Step 34: Based on the priority score, reallocate the equipment, processing start time and processing completion time of the process within the influence domain. The rearrangement result satisfies the process sequence constraints, equipment occupancy constraints and material ready state constraints, and keeps the scheduling of the frozen nodes unchanged.

[0088] Through the above process, this invention can quickly identify the affected process range after detecting production disturbances, and use a pulse closure hybrid scheduling model to perform deterministic optimization of locally feasible scheduling. While ensuring stable execution in the locked window area, it achieves dynamic adaptive adjustment of the rolling area. This method reduces the impact of event disturbances on the overall scheduling, improves the system's response speed and recovery capability to sudden events, and increases equipment utilization and on-time order completion rates.

[0089] In one embodiment of the present invention, step 32 specifically includes:

[0090] Step 41: Establish a pulse state set for each device. Each pulse state describes the local scheduling status of the device at a certain moment. Each pulse state includes the device identifier, current available time, process placement sequence, and cumulative cost vector. The cumulative cost vector consists of delivery delay cost, process changeover cost, plan disturbance amount, and priority reversal cost. The delivery delay cost is used to quantify the loss caused by the process completion time exceeding the delivery date. The delivery delay cost for each process is obtained by calculating the product of the difference between the actual completion time and the order's delivery date and a preset delivery delay penalty coefficient. The preset delivery delay penalty coefficient ranges from 1 to 3. The process changeover cost is calculated using the process type changeover cost matrix element. The planned disturbance is used to reflect the degree of deviation of the current scheduling scheme from the initial feasible schedule. The planned disturbance of each process is obtained by calculating the absolute difference between the planned start time of the initial feasible schedule and the planned start time in the adjusted schedule. The priority reversal cost is used to penalize the situation where high-priority orders are delayed due to scheduling changes. When a process has a lower priority score than another process, but its planned start time is earlier than another process in the optimized schedule, it is regarded as a priority reversal time. The priority reversal cost is obtained by calculating the product of the difference in priority scores between the two processes and the preset reversal penalty coefficient. The preset reversal penalty coefficient ranges from 1 to 3.

[0091] Step 42: Select the unscheduled process from the equipment's process set, determine the earliest feasible start time of the process according to the equipment availability time, the completion time of the preceding process, and the material readiness time, and insert the switching time when the process type is switched to expand and form a new pulse state; this process is used to expand the state space so that the scheduling result can take into account the time cost required for process switching.

[0092] Step 43: In the pulse state set of the same device, perform a multi-dimensional comparison of the cumulative cost vector of the current pulse state and the existing pulse states. If the current pulse state is not better than any existing pulse state in all cost dimensions, remove the pulse state. At the same time, based on the minimum remaining processing time of the unscheduled process, the minimum switching time, the minimum absolute value of the difference between the planned start time and the current available time, and the minimum number of reversals, obtain the lower limit of cost by weighted summation. If the sum of the cumulative cost of the current pulse state and the lower limit of cost is higher than the current known optimal upper limit, terminate the expansion of the pulse state to improve search efficiency and prevent invalid traversal. The cumulative cost of the current pulse state is the sum of the cumulative state and cost increment of the previous state under the expansion. The cost increment includes: delivery default cost increment, switching cost increment, planning disturbance increment, and priority reversal cost increment.

[0093] Step 44: For each piece of equipment, independently retain the process placement sequence that has not been eliminated, and construct a directed acyclic graph (DAG) for the process placement segments in each sequence. In this DAG, nodes represent feasible process placement segments, and edges represent the connectivity of different segments in terms of time and resource allocation. Select the optimal closed set that satisfies the process sequence constraints, equipment occupancy constraints, and material readiness constraints using a minimum cost closure model. Specifically, the minimum cost closure model is established by using node costs as weights. Its objective function is to minimize the sum of the cumulative costs of the selected nodes under the conditions of satisfying the process sequence constraints, equipment occupancy constraints, and material readiness constraints.

[0094] Step 45: Merge the selected processes into segments to form a scheduling plan for each process, including the allocation of equipment, processing start time, and completion time, and mark this plan as the scheduling version for the current rolling period.

[0095] Through the above process, this invention achieves an organic combination of impulse search and closure optimization, improving the computational efficiency of local search while ensuring constraint consistency. This method can quickly generate deterministic, feasible and cost-optimal local scheduling schemes within the rolling scheduling framework.

[0096] In one embodiment of the present invention, the optimized scheduling module specifically includes:

[0097] Step 51: Based on the initial feasible scheduling scheme, extract the allocated equipment, start time, completion time and priority score of each process in the influence domain. By weighting the delivery failure cost, process changeover cost, plan disturbance amount and priority reversal cost, construct a comprehensive cost function.

[0098] Step 52: Under the conditions of satisfying process sequence constraints, equipment occupancy constraints, and material readiness constraints, a deterministic optimization method is used to solve the comprehensive cost function. By performing local insertion and exchange operations within each piece of equipment, the processing sequence and equipment allocation of the processes are gradually adjusted, and the value of the comprehensive cost function is calculated in real time to obtain a feasible scheduling scheme with converged influence domain of the comprehensive cost function. That is, during continuous iteration, when the change in the value of the comprehensive cost function is less than the preset convergence threshold, the optimization process is considered to have converged, and the iteration stops. This scheme includes the adjusted equipment allocation, processing start time, and processing completion time for each process.

[0099] Step 53: Compare the feasible scheduling plan with the initial feasible schedule, generate a differential report, record the changes in process adjustment pairs, total changeover time, and priority reversal counts, and mark the feasible scheduling plan as the new scheduling version. The process adjustment pair represents two processes in the feasible scheduling plan that have different execution order or equipment allocation compared to the initial feasible schedule.

[0100] Through the above process, this invention achieves deterministic optimization of scheduling schemes within the influence domain by taking the comprehensive cost function as the objective, while ensuring constraint consistency. This embodiment realizes unified modeling and real-time convergence determination of multi-objective costs at the algorithm level, and can quickly obtain executable optimized scheduling results.

[0101] It should be noted that the influence domain generation module is used for influence domain identification and schedule reconstruction initialization, and only generates the schedule to be optimized. The schedule optimization module is used to optimize the calculation process, that is, to perform optimization solutions within the identified domain.

[0102] In one embodiment of the present invention, a constraint consistency verification is performed on the feasible scheduling scheme. During the verification phase, the system detects the dependencies between each process, equipment time conflicts, material readiness status, and equipment availability time periods. When a violation of process sequence constraints, equipment occupancy constraints, material readiness status constraints, or resource time period constraints is detected, a deterministic correction loop is triggered. The process time shift, process sequence adjustment, and equipment reallocation operations are executed sequentially according to a fixed correction rule. After each correction, deterministic optimization is re-executed until the verification result satisfies all constraints and converges to a feasible scheduling scheme. Specifically, process time shift refers to eliminating time overlaps or dependency conflicts by shifting the start time of conflicting processes backward without changing equipment allocation; process sequence adjustment refers to reordering the processing order based on priority scores, delivery urgency, and material readiness status when multiple processes within the same equipment have logical errors in processing sequence; and equipment reallocation refers to selecting feasible equipment from the candidate equipment set for replacement when a piece of equipment is overloaded or the processing time of a process exceeds the equipment availability time, and synchronously updating the start and finish times of the newly allocated equipment. After each correction operation, the system re-executes the deterministic optimization process, using the comprehensive cost function to quickly determine the convergence of the corrected solution. When the change in the value of the comprehensive cost function is less than a preset convergence threshold, the scheduling solution is considered converged, and the verification result satisfies all constraints. At this point, the corrected solution is determined as the final feasible scheduling solution.

[0103] It should be noted that the interval and threshold sizes are set for ease of comparison. The size of the threshold depends on the amount of sample data and the base number set by those skilled in the art for each set of sample data, as long as it does not affect the proportional relationship between the parameter and the quantized value. Furthermore, the above formulas are all dimensionless calculations, and the formulas are derived from software simulations using a large amount of collected data to obtain the most recent real-world results. The preset parameters in the formulas are set by those skilled in the art according to the actual situation.

[0104] The embodiments of the present invention have been described above, but the present invention is not limited to the specific embodiments described above. The specific embodiments described above are merely illustrative and not restrictive. Those skilled in the art can make many other forms based on the guidance of the present embodiments, all of which are within the protection scope of the present embodiments.

Claims

1. A smart management system for prioritizing CNC machining orders and scheduling production, characterized in that, include: The data acquisition and time period segmentation module is used to acquire the basic production data and equipment resource data of CNC machining orders, and to segment the time period into locked window and rolling time periods based on the current time. The priority evaluation module is used to calculate the priority score of each order based on production base data and equipment resource data, combined with preset weights. The initial scheduling generation module is used to construct a resource process diagram based on the order set, process set, and equipment resource data, and determine the allocated equipment, start time, and completion time of each process according to the priority score, thereby generating an initial feasible schedule; The influence domain generation module is used to identify the set of processes affected by the first production event based on the resource process diagram, form an influence domain, and reschedule within the influence domain; The optimization scheduling module is used to perform deterministic optimization within the influence domain based on priority scores, delivery dates, process type switching cost matrices, and initial feasible schedule perturbations to obtain a new scheduling version. The execution and distribution module is used to mark feasible scheduling schemes as the current scheduling version, freeze the scheduling results within the locked window period, and distribute the process execution list.

2. The intelligent management system for CNC machining order priority sorting and production scheduling according to claim 1, characterized in that, Production base data includes: order set, process set, delivery date, order value, customer level, and material readiness status; the material readiness status includes ready and not ready. Equipment resource data includes: a set of processing equipment, the processing time of each process on candidate equipment, the available time period of equipment, and a process type switching cost matrix.

3. The intelligent management system for CNC machining order priority sorting and production scheduling according to claim 1, characterized in that, The generation of the lock window period and scrolling period includes: Step 11: Take the time when the scheduled task is received as the current time and set it as a unified time base; Step 12: Preset the window locking duration and planned duration according to the production management cycle, where the planned duration is longer than the window locking duration; Step 13: Starting from the current moment, define the window locking period according to the window locking duration and the rolling period according to the planned duration.

4. The intelligent management system for CNC machining order priority sorting and production scheduling according to claim 2, characterized in that, Based on production baseline data and equipment resource data, and combined with preset weights, a priority score is calculated for each order, including: Step 21: By obtaining the processing time of all processes in each order on feasible equipment, determine the maximum processing time of all processes, and calculate the average processing complexity of each order by the ratio of the shortest processing time of each process to the maximum processing time. Step 22: Preset delivery urgency weight, customer level weight, order value weight, and processing complexity penalty weight. All four weights are non-negative and their sum is one. Use the difference between the delivery date and the current time as the delivery urgency. Standardize the delivery urgency, customer level, and order value according to the delivery date, customer level, and order value of each order. Step 23: The standardized delivery urgency, customer level, order value and average processing complexity of each order are weighted and synthesized according to their corresponding weights to obtain the priority score of each order.

5. The intelligent management system for CNC machining order priority sorting and production scheduling according to claim 1, characterized in that, In the resource process diagram, nodes represent various processes, and the edges are constructed in the following ways: When a subsequent process in the same order can only begin after the previous process is completed, a process sequence edge is constructed between the two processes; When different processes share the same equipment, a resource competition edge is constructed between the two processes; When adjacent processes processed consecutively on the same equipment have different process types and there is a switching cost, a process switching edge is constructed between the two processes; When the execution of a certain process depends on the material output by another process and the material is not ready, a material dependency edge is constructed between the two processes.

6. The intelligent management system for CNC machining order priority sorting and production scheduling according to claim 5, characterized in that, For each node, determine its processing start time and completion time, satisfying the following constraints: Process sequence constraint: The start time of the subsequent process in each order shall not be earlier than the completion time of the preceding process; Equipment occupancy constraint: The equipment can only process one operation at any given time; Material readiness constraint: The start time of the process is later than the corresponding material readiness time, and the material readiness status is "ready". Equipment availability time constraint: The process completion time shall not exceed the equipment availability time. The initial feasible schedule includes: the equipment allocated to each process, the start time, the completion time, the order to which it belongs, and the priority score.

7. The intelligent management system for CNC machining order priority sorting and production scheduling according to claim 1, characterized in that, Based on the resource process diagram, identify the set of processes affected by the first production event, form an influence domain, and reschedule within the influence domain, including: Step 31: When the first production event is detected, locate the process node directly associated with the event in the resource process diagram to obtain the initial set of affected nodes and form the influence domain; the first production event includes: equipment downtime event, order insertion event, material delay event and processing timeout event; Step 32: Using a pulse closure hybrid scheduling method, within the rolling period, pulse search based on multi-objective dominance pruning is performed on each piece of equipment according to the priority score of each order, the process type switching cost matrix, the planned disturbance amount, and the equipment resource constraints to generate a process placement sequence; and the minimum cost closure model is used to perform consistency selection on the process placement segments in each sequence to determine the allocated equipment, processing start time, and processing completion time of each process. The placement satisfies the process sequence constraints, equipment occupancy constraints, material ready state constraints, equipment available time period, and process type switching time requirements. Step 33: Screen the process nodes within the influence domain, mark the processes within the locked window period as frozen nodes, and retain the processes within the rolling period to form an adjustable node set, thus forming a limited local scheduling range; for processes that cross the boundary between the locked window period and the rolling period, determine the freezing weight according to the cross ratio of their planned completion time and the locked window boundary time. When the freezing weight is lower than the preset threshold, the process is included in the adjustable node set. Step 34: Based on the priority score, reallocate the equipment, processing start time and processing completion time of the process within the influence domain. The rearrangement result satisfies the process sequence constraints, equipment occupancy constraints and material ready state constraints, and keeps the scheduling of the frozen nodes unchanged.

8. The intelligent management system for CNC machining order priority sorting and production scheduling according to claim 7, characterized in that, Step 32 specifically includes: Step 41: Establish a pulse state set for each device. Each pulse state includes device identifier, current available time, process placement sequence, and cumulative cost vector. The cumulative cost vector consists of delivery default cost, process changeover cost, plan disturbance amount, and priority reversal cost. Step 42: Select the unscheduled process from the equipment's process set, determine the earliest feasible start time of the process according to the equipment availability time, the completion time of the preceding process, and the material readiness time, and insert the switching time when the process type is switched to expand and form a new pulse state; Step 43: In the pulse state set of the same device, perform a multi-dimensional comparison of the cumulative cost vector of the current pulse state and the existing pulse states. If the current pulse state is not better than any existing pulse state in all cost dimensions, remove the pulse state. At the same time, based on the minimum remaining processing time of the unscheduled process, the minimum switching time, the minimum absolute value of the difference between the planned start time and the current available time, and the minimum number of reversals, obtain the lower limit of cost by weighted summation. If the sum of the cumulative cost of the current pulse state and the lower limit of cost is higher than the current known optimal upper limit, then terminate the expansion of the pulse state. Step 44: For each piece of equipment, retain the process placement sequence that has not been removed, and construct the process placement segments in each sequence into a directed acyclic graph. Use the minimum cost closure model to select the optimal closed set that satisfies the process sequence constraint, equipment occupancy constraint and material ready state constraint. Step 45: Place the selected process segments into a merged array to form a scheduling scheme for each process, including the allocation of equipment, processing start time, and completion time, and mark this scheme as the scheduling version for the current rolling period.

9. The intelligent management system for CNC machining order priority sorting and production scheduling according to claim 1, characterized in that, The optimized scheduling module specifically includes: Step 51: Based on the initial feasible scheduling scheme, extract the allocated equipment, start time, completion time and priority score of each process in the influence domain. By weighting the delivery default cost, process changeover cost, plan disturbance amount and priority reversal cost, construct a comprehensive cost function. Step 52: Under the conditions of satisfying process sequence constraints, equipment occupancy constraints and material readiness constraints, the deterministic optimization solution method is used to solve the comprehensive cost function. By performing local insertion and exchange operations in each piece of equipment and calculating the value of the comprehensive cost function in real time, the feasible scheduling scheme of the influence domain after the comprehensive cost function converges is obtained. The scheme includes the allocated equipment, processing start time and processing completion time of each process after adjustment. Step 53: Compare the feasible scheduling plan with the initial feasible schedule, generate a differential report, record the changes in process adjustment pairs, total changeover time and priority reversal times, and mark the feasible scheduling plan as the new scheduling version.

10. The intelligent management system for CNC machining order priority sorting and production scheduling according to claim 1, characterized in that, Constraint consistency verification is performed on feasible scheduling schemes. When a violation of process sequence constraints, equipment occupancy constraints, material readiness constraints, or resource time constraints is detected, a deterministic correction loop is triggered. The process time shift, process sequence adjustment, and equipment reallocation operations are executed sequentially according to fixed correction rules. After each correction, deterministic optimization is re-executed until the verification result satisfies all constraints and converges to a feasible scheduling scheme.

Images