A production scheduling method, system, computer device and storage medium

Abstract

The application relates to the technical field of computers, and particularly discloses a production scheduling method and system, computer equipment and a storage medium, the method comprising the following steps: acquiring bill of materials information, generating a component plan package based on the bill of materials information; acquiring process route information, generating a process plan package of components based on the process route information, the process plan package containing a process plan of each component, the process plan comprising a work process; traversing the process plan package to perform pre-occupancy processing on each work process; and in response to the traversal being completed, outputting a work process sequence of a product to be processed. Through the scheme, the rationality of production and processing plan arrangement of a product is optimized, and the problem of inter-factory collaborative production scheduling is solved.

Description

Technical Field

[0001] This invention relates to the field of computer technology, and in particular to a production scheduling method, system, computer equipment, and storage medium. Background Technology

[0002] Currently, extensive management is prevalent in manufacturing industries, especially in large equipment, aerospace, and aviation workshops. Energy utilization is low, reliance on manual labor is high, and automation is low. Production planning in manufacturing workshops largely relies on workshop directors and planners using Excel spreadsheets and experience-based scheduling. This involves a huge human resource investment, and the quality of actual scheduling results is low. Especially when faced with plan adjustments or last-minute order insertions requiring rescheduling, the inability to respond promptly renders the issued plans ineffective, creating a disconnect between planning and actual production. This leads to energy waste and increased energy consumption in the workshop.

[0003] Currently, numerous APS (Automatic Production System) applications have been implemented for production lines or workshop operations, supporting production scheduling based on dimensions such as equipment utilization, economic batch size, and product integrity rate. These applications fill the gap in offline manufacturing production scheduling and improve the scientific and rational nature of planning. However, two problems also exist: First, in the pursuit of maximizing capacity and efficiency, the proportion of energy consumption considerations decreases, leading to a surge in demand per unit capacity, making production scheduling plans difficult to execute due to energy consumption factors. Second, the convenience and timeliness of logistics and transportation have significantly improved. Coupled with government planning for industrial land use, functional headquarters remain in central urban areas, while manufacturing plants relocate to the city's periphery, resulting in a scattered distribution. This gives rise to cross-plant production collaboration issues, making it difficult for production line and unit-level APS to provide effective production scheduling suggestions in inter-plant collaboration scenarios.

[0004] The current workshop production planning can be summarized into two modes: the first is offline manual scheduling, where workshop production planning relies on workshop directors and schedulers to manually arrange production offline using tools such as Excel; the second is system scheduling, where the workshop deploys a scheduling system that relies on manual labor and historical experience, combined with constraints such as resource calendars and work shifts, to schedule production plans forward or backward based on material input dates or delivery dates.

[0005] The first manual scheduling model has been gradually phased out due to difficulties in data aggregation, long scheduling cycles, and low flexibility. The second system-based scheduling model, with current technologies having largely improved data governance and modeling, offers relatively high planning rationality and can achieve flexible scheduling to some extent. However, it also has the following problems: First, optimization tends to prioritize the earliest delivery date, at the cost of excessive energy consumption, emphasizing maximum use of personnel and equipment while neglecting energy consumption considerations. Second, the optimized schedule does not avoid scenarios involving repeated machine and equipment start-ups and shutdowns, leading to increased costs for equipment wear and tooling wear, and low energy utilization. Third, in cross-plant collaborative production scenarios, current technologies lack consideration for inter-plant turnover factors, making cross-plant plans difficult to implement. Summary of the Invention

[0006] In view of this, the present invention proposes a production scheduling method, system, computer equipment and storage medium, which optimizes the rationality of product production and processing planning and solves the problem of inter-factory collaborative production scheduling; and integrates energy consumption into the production scheduling method, which solves the problem of energy waste and increased costs caused by the lack of path planning and energy consumption consideration in long-distance collaborative production.

[0007] To achieve the above objectives, one aspect of the present invention provides a production scheduling method, specifically including the following steps:

[0008] Obtain bill of materials information and generate a component planning package based on the bill of materials information;

[0009] Obtain process route information, and generate a process plan package for components based on the process route information. The process plan package contains a process plan for each component, and the process plan includes work operations.

[0010] Traverse the process plan package to pre-place each work process;

[0011] Upon completion of the traversal, output the sequence of work steps for the product to be processed.

[0012] In some implementations, the method further includes:

[0013] In response to the completion of the traversal, calculate the maximum energy consumption of the factory, as well as the total energy consumption of all operational processes;

[0014] Compare the maximum energy consumption with the total energy consumption;

[0015] In response to the total energy consumption exceeding the maximum energy consumption, an early warning message is output.

[0016] In some implementations, pre-positioning for each work step includes:

[0017] The maximum number of bits for calculation is determined based on the number of operation steps in the operation plan package;

[0018] The occupancy of each work process is determined based on its energy consumption.

[0019] In some implementations, determining the occupancy of each work step based on its energy consumption includes:

[0020] The occupancy step includes selecting the first operation with the least energy consumption from the set of first operation operations of all final-level parts to occupy the first position.

[0021] Repeat the placeholder steps until the placeholders for all work operations are determined.

[0022] In some implementations, selecting the first operation with the lowest energy consumption from the set of first operations for all final-stage parts to occupy the first position includes:

[0023] Calculate the energy consumption of the equipment group in the first operation of all final stage parts;

[0024] Determine whether the first processing step requires cross-factory processing;

[0025] If the first operation requires cross-plant processing, the shortest supply path for the first operation is found based on the Dijkstra algorithm, and the energy consumption of the path is calculated. The energy consumption of the first operation is obtained based on the energy consumption of the path and the energy consumption of the equipment group.

[0026] If the first operation does not require cross-plant processing, the energy consumption of the first operation is obtained based on the energy consumption of the equipment group in the first operation.

[0027] The first process with the lowest energy consumption is selected and assigned to the first position.

[0028] In some implementations, the method further includes:

[0029] When outputting the sequence of work processes for the product to be processed, the system also outputs the energy consumption of the equipment group for each work process and / or the shortest supply path and path consumption.

[0030] In some implementations, the component planning package includes a component plan for each component, the component plan including the gross requirement quantity of the component, the net requirement quantity of the component, the expected production start date of the component, and the expected output date of the component;

[0031] The process plan also includes the equipment group, pre-processing time, processing time, post-processing time, and transfer time.

[0032] Another aspect of this invention provides a production scheduling system, comprising:

[0033] A first generation module is configured to obtain bill of materials information and generate a component planning package based on the bill of materials information.

[0034] The second generation module is configured to acquire process route information and generate a process plan package for components based on the process route information. The process plan package contains a process plan for each component, and the process plan includes work operations.

[0035] A traversal placeholder module is configured to traverse the process plan package to perform pre-placement processing for each work process;

[0036] An output module is configured to output the sequence of work processes for the product to be processed in response to the completion of the traversal.

[0037] In another aspect of the present invention, a computer device is provided, comprising: at least one processor; and a memory storing a computer program executable on the processor, the computer program performing the steps of the method described above when executed by the processor.

[0038] In another aspect, the present invention provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described method steps.

[0039] The present invention has at least the following beneficial technical effects: it optimizes the rationality of the production and processing plan of the product and solves the problem of inter-factory collaborative production scheduling; and it integrates energy consumption into the production scheduling method, solving the problem of energy waste and increased costs caused by the lack of path planning and energy consumption consideration in long-distance collaborative production. Attached Figure Description

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

[0041] Figure 1 A block diagram of an embodiment of the production scheduling method provided by the present invention;

[0042] Figure 2 A schematic diagram of an embodiment of the production scheduling system provided by the present invention;

[0043] Figure 3 A schematic diagram of the structure of an embodiment of the computer device provided by the present invention;

[0044] Figure 4 This is a schematic diagram of an embodiment of the computer-readable storage medium provided by the present invention. Detailed Implementation

[0045] To make the objectives, technical solutions, and advantages of the present invention clearer, the embodiments of the present invention will be further described in detail below with reference to specific examples and the accompanying drawings.

[0046] It should be noted that all uses of "first" and "second" in the embodiments of the present invention are for the purpose of distinguishing two entities or parameters with the same name but different names. It is clear that "first" and "second" are only for the convenience of expression and should not be construed as limiting the embodiments of the present invention. Subsequent embodiments will not explain this in detail.

[0047] Based on the above objectives, a first aspect of the present invention provides an embodiment of a production scheduling method. For example... Figure 1 As shown, it includes the following steps:

[0048] S10. Obtain bill of materials information and generate a component planning package based on the bill of materials information;

[0049] S20. Obtain process route information, and generate a process plan package for the component based on the process route information. The process plan package contains a process plan for each component, and the process plan includes work procedures.

[0050] S30. Traverse the process plan package to pre-place each work process;

[0051] S40. In response to the completion of the traversal, output the sequence of work processes for the product to be processed.

[0052] Those skilled in the art will understand that the order of steps in the methods described above and below is not limited to the listed order, and can be adjusted as needed in practical applications. Some steps may also be combined or omitted without departing from the protection scope of the present invention.

[0053] Specifically, in step S10, the bill of materials information of the products to be produced is obtained. The bill of materials information can be obtained from a local computer or a remote computer. The products are decomposed into part-level plans based on the bill of materials information, which are called component planning packages.

[0054] In step S20, the process route information of the product to be produced is obtained. The process route information is further decomposed into the process-level plan based on the component planning package, which is called the process planning package.

[0055] In steps S30 and S40, the maximum number of bits for calculation is determined based on the number of work operations in the process plan package; pre-occupancy processing is performed on each work operation in the process plan package, and the occupancy of each operation can be determined by combining the energy consumption of the work operation and the processing sequence of the components; the process plan package is traversed to perform cyclic occupancy operation until the width and number of bits occupied by all work operations are found.

[0056] This invention optimizes the rationality of product production planning through the above-mentioned scheme, enabling inter-factory collaborative production scheduling; and it can integrate energy consumption into the production scheduling method to reduce energy waste and cost increases in long-distance collaborative production.

[0057] In some implementations, the method further includes:

[0058] In response to the completion of the traversal, calculate the maximum energy consumption of the factory, as well as the total energy consumption of all operational processes;

[0059] Compare the maximum energy consumption with the total energy consumption;

[0060] In response to the total energy consumption exceeding the maximum energy consumption, an early warning message is output.

[0061] In some implementations, pre-positioning for each work step includes:

[0062] The maximum number of bits for calculation is determined based on the number of operation steps in the operation plan package;

[0063] The occupancy of each work process is determined based on its energy consumption.

[0064] In some implementations, determining the occupancy of each work step based on its energy consumption includes:

[0065] The occupancy step includes selecting the first operation with the least energy consumption from the set of first operation operations of all final-level parts to occupy the first position.

[0066] Repeat the placeholder steps until the placeholders for all work operations are determined.

[0067] In some implementations, selecting the first operation with the lowest energy consumption from the set of first operations for all final-stage parts to occupy the first position includes:

[0068] Calculate the energy consumption of the equipment group in the first operation of all final stage parts;

[0069] Determine whether the first processing step requires cross-factory processing;

[0070] If the first operation requires cross-plant processing, the shortest supply path for the first operation is found based on the Dijkstra algorithm, and the energy consumption of the path is calculated. The energy consumption of the first operation is obtained based on the energy consumption of the path and the energy consumption of the equipment group.

[0071] If the first operation does not require cross-plant processing, the energy consumption of the first operation is obtained based on the energy consumption of the equipment group in the first operation.

[0072] The first process with the lowest energy consumption is selected and assigned to the first position.

[0073] In one specific embodiment, the process planning package can be pre-positioned in the following manner.

[0074] Before placing a placeholder, determine the number of placeholders. The number of work processes in the work process plan package can be used as the maximum number of placeholders for model calculation, which is called the maximum number of placeholders.

[0075] In the initial calculation, from the set of first processes of all final-level parts, the minimum energy consumption in the corresponding equipment group is sought as the optimal solution, i.e., the energy consumption of the process is used as the selection strategy. After selection, the corresponding number of bits is occupied. In the second calculation, the remaining processes in the process plan package are selected again, and the corresponding number of bits is occupied. This process continues until all work processes have found occupied bits.

[0076] In one specific embodiment, the energy consumption generated by cross-production transportation can also be considered, that is, transportation energy consumption and equipment energy consumption are combined as the energy consumption of each process, and the process with the smallest sum of transportation energy consumption and equipment energy consumption occupies the current number of bits.

[0077] Dijkstra's algorithm is mainly used to handle the problem of choosing the shortest supply path in cross-plant production. For example, if the main plant and branch plants 1, 2 and 3 have the conditions to process part A in some processes, then because the main plant's equipment capacity is insufficient, it is necessary to consider processing it by the branch plants, which generates the problem of choosing the shortest (shortest = minimum internal friction) path.

[0078] Take Table 1 as an example:

[0079] Table 1

[0080]

[0081]

[0082] Part A has the following machining paths:

[0083] Serial Number Processing path Transportation consumption / energy 1 Main Factory -> Branch Factory 1 -> Main Factory 20+20＝40 2 Main Factory -> Branch Factory 2 -> Main Factory 30+20＝85

[0084] Therefore, sequence number 1 is selected as the shortest supply path.

[0085] The above is merely an example of selecting the shortest supply path based on Dijkstra's algorithm. It should be understood that the embodiments described herein are for illustration and explanation only and are not intended to limit the invention.

[0086] The specific steps for pre-positioning the process planning package are as follows:

[0087] S11. Calculate the energy consumption of the equipment group for the first operation of all final-level parts in the set of first operation operations of all final-level parts.

[0088] S12. Determine whether the first processing step requires cross-factory processing;

[0089] S13. If the first operation requires cross-plant processing, find the shortest supply path for the first operation based on the Dijkstra algorithm and calculate the path energy consumption. Then, obtain the energy consumption of the first operation based on the path energy consumption and the energy consumption of the equipment group.

[0090] S14. If the first operation does not require cross-plant processing, the energy consumption of the first operation is obtained based on the energy consumption of the equipment group of the first operation.

[0091] S15. Select the first process with the lowest energy consumption and occupy it as the first step.

[0092] S16. Return to step S11. In the set of the first operation of the remaining final-level parts and the next operation of the operation occupied by the previous step, calculate the energy consumption of the equipment group for each operation until all operation operations have found the occupied bits.

[0093] In this embodiment of the invention, for the problem of inter-plant collaborative production, the process route and transportation energy consumption involving inter-plant turnover are taken into account as a factor in the pre-positioning algorithm to determine the positioning order of the entire operation process. This solves the problem that the existing technology cannot handle cross-plant process flow, and also supplements the existing technology with consideration of energy consumption.

[0094] In some implementations, the method further includes:

[0095] When outputting the sequence of work processes for the product to be processed, the system also outputs the energy consumption of the equipment group for each work process and / or the shortest supply path and path consumption.

[0096] In some implementations, the component planning package includes a component plan for each component, the component plan including the gross requirement quantity of the component, the net requirement quantity of the component, the expected production start date of the component, and the expected output date of the component;

[0097] The process plan also includes the equipment group, pre-processing time, processing time, post-processing time, and transfer time.

[0098] In one specific embodiment, the production plan for the product is arranged through the following steps:

[0099] Step 1: Using the BOM information set in the planning terminal, decompose the planning data to part-level plans, called component planning packages. Each component planning package contains component plans, including gross demand quantity, net demand quantity, expected production start date, and expected output date. The planning terminal can be a computer storing the product BOM information. The relationship between gross and net demand quantities is: Net Demand = Gross Demand Quantity - Component Inventory Quantity (Primary and Secondary Warehouses) - Component Procurement in Transit Quantity. If the model calculation selects not to consider inventory and in transit, then Net Demand Quantity = Gross Demand Quantity.

[0100] BOM information generally includes assembly relationships and assembly quotas. Assembly relationships refer to the assembly relationships of component production, such as: the production of component A requires parts B and C; assembly quotas refer to the required quantities for component production and processing, such as: the production of 1 component A requires 2 parts B and 3 parts C.

[0101] Step 2: The component planning package is further decomposed into process-level plans based on the process route information set in the planning terminal, becoming a process planning package. The process planning package contains process plans, which include work procedures, work equipment groups, pre-processing time, processing time, post-processing time, and transfer time.

[0102] The process route information includes process flow and process data. The process flow is the workshops that a part needs to pass through for processing in a single factory, and the factories that a part needs to pass through for processing in multiple factories. The process data is the process required for processing a part in a workshop.

[0103] Step 3: Using Dijkstra's algorithm, find the shortest supply route for the given path data, and calculate the energy consumption of the route based on the path calculation data, which is called the transportation cost.

[0104] Route data can include transportation methods and energy consumption, which are used to set the method, time, and energy consumption for inter-plant transportation. For example, there are two transportation methods from plant A to plant B: land transportation takes 3 days and consumes 4000 units of energy, while sea transportation takes 5 days and consumes 3000 units of energy.

[0105] Step 4: Pre-placement processing is performed on the process plan package. The number of operations in the process plan package serves as the maximum number of bits for model calculation, referred to as the "Max" bit count. During the initial calculation, from the set of first operations of all final-level parts, the minimum energy consumption within the corresponding equipment group is sought as the optimal solution. This means using process energy consumption as the selection strategy. If inter-plant transportation is involved, path energy calculation is performed using the method in Step 3, combining equipment group energy consumption and transportation cost as selection criteria. After selection, the corresponding bit count in the model is occupied.

[0106] Step 5: Traverse the process plan package, repeating the operations in Step 3 and Step 4 until all work processes have found occupied bits.

[0107] Step Six: Based on the energy status and usage status set in the basic data, obtain the maximum energy available to the main plant and each branch plant during this calculation, called the plant's maximum cost. Maximum Cost = Plant Expected Energy Consumption - Plant Incurred Energy Consumption.

[0108] Step 7: Accumulate the energy consumption data under the current model width and bit depth, compare it with the maximum Cost, and output a reminder message if it is greater than the maximum Cost.

[0109] Step 8: Output the work sequence, shortest path, work energy consumption, and transportation cost of the planning data in the main plant and branch plants.

[0110] The embodiments of the present invention solve the problem of inter-plant collaborative production. For example, in steps three and five, the process routes and transportation energy consumption involving inter-plant turnover are taken into account as a factor in the pre-positioning algorithm to determine the positioning order of the entire operation process. This solves the problem that the prior art cannot handle cross-plant process flow, and also supplements the prior art with consideration of energy consumption.

[0111] In this embodiment of the invention, energy consumption can also be predicted. Based on the information and consumption output in steps seven and eight, an energy consumption guarantee plan can be established for the main plant and each branch plant. For example, if the transportation cost between two certain work processes is much higher than that of other work processes, it should be considered whether the required work equipment is critical equipment and whether it should be purchased or relocated in a certain plant.

[0112] The embodiments of the present invention, through the above-described solution, make up for the lack of consideration for energy consumption when scheduling tasks in the prior art, and can provide energy consumption prediction over a long period of time; and also support the unified analysis of energy consumption and scheduling of the main plant and branch plants at the same time, and the branch plants can be cross-province or cross-country branch plants, which can meet the collaborative production under different spans.

[0113] Based on the same inventive concept, according to another aspect of the present invention, such as Figure 3As shown, embodiments of the present invention also provide a production scheduling system, including:

[0114] A first generation module 110 is configured to obtain bill of materials information and generate a component planning package based on the bill of materials information.

[0115] The second generation module 120 is configured to acquire process route information and generate a process plan package for components based on the process route information. The process plan package contains a process plan for each component, and the process plan includes work procedures.

[0116] Traversing the placeholder module 130, the traversing placeholder module 130 is configured to traverse the process plan package to perform pre-placement processing for each work process;

[0117] Output module 140 is configured to output the sequence of work processes for the product to be processed in response to the completion of traversal.

[0118] Based on the same inventive concept, according to another aspect of the present invention, such as Figure 3 As shown, an embodiment of the present invention also provides a computer device 30, which includes a processor 310 and a memory 320. The memory 320 stores a computer program 321 that can be run on the processor. When the processor 310 executes the program, it performs the steps of the method described above.

[0119] The memory, as a non-volatile computer-readable storage medium, can be used to store non-volatile software programs, non-volatile computer-executable programs, and modules, such as the program instructions / modules corresponding to the production scheduling method described in the embodiments of this application. The processor executes various system functions and data processing by running the non-volatile software programs, instructions, and modules stored in the memory, thereby implementing the production scheduling method described in the above embodiments.

[0120] The memory may include a program storage area and a data storage area. The program storage area may store the operating system and applications required for at least one function; the data storage area may store data created based on system usage. Furthermore, the memory may include high-speed random access memory and non-volatile memory, such as at least one disk storage device, flash memory device, or other non-volatile solid-state storage device. In some embodiments, the memory may optionally include memory remotely located relative to the processor, which can be connected to the local module via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0121] Based on the same inventive concept, according to another aspect of the present invention, such as Figure 4 As shown, embodiments of the present invention also provide a computer-readable storage medium 40, which stores a computer program 410 that, when executed by a processor, performs the methods described above.

[0122] Finally, it should be noted that those skilled in the art will understand that all or part of the processes in the above embodiments can be implemented by a computer program instructing related hardware. The program can be stored in a computer-readable storage medium, and when executed, it can include the processes of the embodiments of the methods described above. The storage medium for the program can be a magnetic disk, optical disk, read-only memory (ROM), or random access memory (RAM), etc. The above computer program embodiments can achieve the same or similar effects as any of the corresponding foregoing method embodiments.

[0123] Those skilled in the art will also understand that the various exemplary logic blocks, modules, circuits, and algorithm steps described in conjunction with the disclosure herein can be implemented as electronic hardware, computer software, or a combination of both. To clearly illustrate this interchangeability between hardware and software, the functionality of various illustrative components, blocks, modules, circuits, and steps has been generally described. Whether this functionality is implemented as software or as hardware depends on the specific application and the design constraints imposed on the system as a whole. Those skilled in the art can implement the functionality in various ways for each specific application, but such implementation decisions should not be construed as departing from the scope of the embodiments disclosed herein.

[0124] The above are exemplary embodiments disclosed in this invention. However, it should be noted that various changes and modifications can be made without departing from the scope of the embodiments of this invention as defined by the claims. The functions, steps, and / or actions of the methods according to the disclosed embodiments described herein do not need to be performed in any particular order. The sequence numbers of the disclosed embodiments of this invention are for descriptive purposes only and do not represent the superiority or inferiority of the embodiments. Furthermore, although the elements disclosed in the embodiments of this invention may be described or claimed individually, they may be understood as multiple unless explicitly limited to a singular number.

[0125] It should be understood that, as used herein, the singular form “a” is intended to include the plural form as well, unless the context clearly supports an exception. It should also be understood that, as used herein, “and / or” refers to any and all possible combinations of one or more of the associated listed items.

[0126] Those skilled in the art should understand that the discussion of any of the above embodiments is merely exemplary and is not intended to imply that the scope of the invention (including the claims) is limited to these examples. Within the framework of the invention, technical features of the above embodiments or different embodiments can be combined, and many other variations of different aspects of the invention exist, which are not provided in the details for the sake of brevity. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the invention should be included within the protection scope of the invention.

Claims

1. A production scheduling method, characterized in that, include: Obtain bill of materials information, and generate a component planning package based on the bill of materials information. The component planning package includes a component plan for each component, and the component plan includes the gross requirement quantity of the component, the net requirement quantity of the component, the expected production date of the component, and the expected output date of the component. Obtain process route information, and generate a process plan package for components based on the process route information. The process plan package contains the process plan for each component. The process plan includes the operation steps, and also includes the operation equipment group, the time before processing, the processing time, the time after processing, and the transfer time. Traverse the process plan package to pre-place each job operation, which includes: determining the maximum number of bits for the operation based on the number of job operations in the process plan package; Determining the occupancy of each work process based on its energy consumption includes: an occupancy step, which involves selecting the first work process with the lowest energy consumption from the set of first work processes for all final-level parts to occupy the first position, wherein the energy consumption of the equipment group for the first work process of all final-level parts is calculated; it is determined whether the first work process requires cross-plant processing; if the first work process requires cross-plant processing, the shortest supply path for the first work process is found based on the Dijkstra algorithm and the path energy consumption is calculated, and the energy consumption of the first work process is obtained based on the path energy consumption and the equipment group energy consumption; If the first operation process does not require cross-plant processing, the energy consumption of the first operation process is obtained based on the energy consumption of the equipment group of the first operation process; the first operation process with the lowest energy consumption is selected to occupy the first position; the occupancy step is repeated until the occupancy of all operation processes is determined; In response to the completion of the traversal, output the sequence of work processes for the product to be processed; In response to the completion of the traversal, calculate the maximum energy consumption of the factory, as well as the total energy consumption of all operational processes; Compare the maximum energy consumption with the total energy consumption; In response to the total energy consumption exceeding the maximum energy consumption, an early warning message is output.

2. The method according to claim 1, characterized in that, Also includes: When outputting the sequence of work processes for the product to be processed, the system also outputs the energy consumption of the equipment group for each work process and / or the shortest supply path and path consumption.

3. A production scheduling system, characterized in that, include: A first generation module is configured to obtain bill of materials information and generate a component planning package based on the bill of materials information. The second generation module is configured to acquire process route information and generate a process plan package for components based on the process route information. The process plan package contains a process plan for each component, and the process plan includes work operations. A traversal placeholder module is configured to traverse the process plan package to perform pre-placement processing for each work process; An output module is configured to output the sequence of work processes for the product to be processed in response to the completion of the traversal. The component planning package includes a component plan for each component, and the component plan includes the gross demand quantity of the component, the net demand quantity of the component, the expected production start date of the component, and the expected output date of the component; The process plan also includes the equipment group, pre-processing time, processing time, post-processing time, and transfer time; The traversal placeholder module is further configured to determine the maximum number of bits for calculation based on the number of operation steps in the operation plan package; and to determine the placeholder for each operation step based on the energy consumption of the operation step, which includes: a placeholder step, wherein the placeholder step includes selecting the first operation step with the least energy consumption from the set of first operation steps of all final-level parts to occupy the first position, wherein the energy consumption of the equipment group for the first operation step of all final-level parts is calculated; it is determined whether the first operation step requires cross-plant processing; if the first operation step requires cross-plant processing, the shortest supply path for the first operation step is found based on the Dijkstra algorithm and the path energy consumption is calculated, and the energy consumption of the first operation step is obtained based on the path energy consumption and the equipment group energy consumption; If the first operation process does not require cross-plant processing, the energy consumption of the first operation process is obtained based on the energy consumption of the equipment group of the first operation process; the first operation process with the lowest energy consumption is selected to occupy the first position; the occupancy step is repeated until the occupancy of all operation processes is determined; And modules for the following functions: In response to the completion of the traversal, output the sequence of work processes for the product to be processed; In response to the completion of the traversal, calculate the maximum energy consumption of the factory, as well as the total energy consumption of all operational processes; Compare the maximum energy consumption with the total energy consumption; In response to the total energy consumption exceeding the maximum energy consumption, an early warning message is output.

4. A computer device, comprising: At least one processor; as well as A memory storing a computer program executable on the processor, characterized in that the processor executes the steps of the method as described in any one of claims 1 to 2 when executing the program.

5. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by a processor, it performs the steps of the method as described in any one of claims 1 to 2.

Images