Production scheduling method, system and equipment, storage medium and product
By calculating and arranging the production task with the largest number of Z in the production scheduling method, the problem of not having the full set of parts stored in the buffer area is solved, and production efficiency and planning stability are improved.
Patent Information
- Application Number
- CN202411746378.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-02
- Publication Date
- 2025-04-25
AI Technical Summary
In the automated production process of multiple processes, parts that are not fully equipped are likely to fill the buffer area, resulting in production suspension and affecting production efficiency.
A production scheduling method is proposed, by obtaining production tasks, analyzing tasks, calculating the quantity Z of the set, and scheduling the production task with the largest quantity Z of the set in the next batch of processing sequences to reduce the probability that the parts not set are filled with the buffer area.
By arranging the production task with the largest number of sets Z in the next batch of processing sequences, the number of parts staying in the buffer area is reduced, the probability of not sets of sets filling the buffer area is reduced, and production efficiency is improved.
Smart Images
Figure CN119886616A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of intelligent manufacturing technology, and in particular to a production scheduling method, system, device, storage medium and product. Background Art
[0002] Production scheduling is a concept in production planning management. It refers to the pre-arrangement of production plans based on orders, inventory and other information before the production order is officially issued, and the corresponding arrangements in workshop resources, manpower, materials and other aspects are made to meet the needs of the order in a timely manner. Production scheduling can help enterprises better plan production plans, improve production efficiency and reduce production costs. It can also reduce the number of production plan adjustments and improve the stability and reliability of production plans.
[0003] Complete set means that products usually include multiple parts, and various parts must reach at least a certain number to form at least one product. If the quantity of one or more parts is insufficient, a product cannot be assembled, and the remaining parts are called incomplete parts.
[0004] In the process of multi-step automated production, if a certain process requires all parts to be complete before production can proceed, then the buffer area between this process and the previous process will retain incomplete parts. In the related art, incomplete parts are likely to fill up the buffer area, causing production to be suspended, affecting production efficiency. Summary of the invention
[0005] To this end, the present application proposes a production scheduling method that can effectively reduce the probability of filling up the buffer area with incomplete parts.
[0006] The application also proposes a production scheduling system.
[0007] The application also proposes a processing device.
[0008] The present application also proposes a computer-readable storage medium.
[0009] The present application also proposes a computer program product.
[0010] According to the first aspect of the present application, the production scheduling method includes the following steps:
[0011] Get production tasks;
[0012] Parse the production task to obtain the number of parts to be processed in the production task and obtain the bill of materials for the corresponding product;
[0013] Get the processed quantity of each part in the bill of materials;
[0014] Calculate the complete set quantity Z of the production task according to the number of parts to be processed and the number of parts processed;
[0015] Arrange the production task with the largest set quantity Z in the next batch of processing sequence.
[0016] The production scheduling method according to the embodiment of the present application has at least the following beneficial effects: the production task with the largest number of complete sets Z is arranged in the next batch of processing sequence, so there is a greater probability that the parts processed in the next batch can be directly used in the next process, the number of processed parts staying in the buffer area is smaller, and the probability of filling the buffer area with incomplete parts is lower.
[0017] According to some embodiments of the present application, the step of “arranging the production task with the largest set quantity Z in the next batch of processing sequences” includes the following steps:
[0018] Arrange the processing order of production tasks according to the complete set quantity Z from large to small.
[0019] According to some embodiments of the present application, the step of “arranging the production task with the largest set quantity Z in the next batch of processing sequences” includes the following steps:
[0020] If there are two or more production tasks with the largest set quantity Z, then further calculate the balance degree L of each production task with the largest set quantity Z, and arrange the production task with the smallest balance degree L in the next batch of processing sequence;
[0021] Among them, let k i Part A in the product's bill of materials i The number of i For part A i The processed quantity, let y i is the number of parts to be processed, then i and n are both positive integers, and the calculation formula of the balance degree L is:
[0022] According to some embodiments of the present application, the step of “arranging the production task with the largest set quantity Z in the next batch of processing sequences” includes the following steps:
[0023] If there are two or more production tasks with the largest number of identical sets Z, then further calculate the balance degree L of each production task with the largest number of identical sets Z, calculate the uniformity rate Y of the production tasks based on the number of identical sets Z and the balance degree L, and arrange the production task with the largest uniformity rate Y in the next batch of processing sequence;
[0024] Among them, let k i Part A in the product's bill of materials i The number of i For part A i The processed quantity, let y i is the number of parts to be processed, then i and n are both positive integers, and the calculation formula of the balance degree L is: The calculation formula of the uniformity rate Y is: Among them, M≥2.
[0025] According to some embodiments of the present application, the value of M is one of 2, 3 and 4.
[0026] According to some embodiments of the present application, the “calculating the complete set quantity Z of the product according to the number of parts to be processed and the number of parts processed” includes the following steps:
[0027] Assume that the bill of materials includes k1 A1 parts, k2 A2 parts, and so on. n A n Parts, assuming that the number of parts processed includes x1 A1 parts, x2 A2 parts, and so on. n A n Parts, suppose the number of parts to be processed includes y1 A1 parts, y2 A2 parts, and so on. n A n Parts, the calculation formula for the complete set quantity Z is:
[0028]
[0029] According to the second aspect of the present application, the production scheduling system includes:
[0030] A first acquisition module is used to acquire production tasks;
[0031] The parsing module is used to parse the production task, so as to obtain the number of parts to be processed in the production task and the bill of materials of the corresponding product;
[0032] The second acquisition module is used to obtain the processed quantity of each part in the bill of materials;
[0033] A calculation module is used to calculate the complete set quantity Z of the product according to the number of parts to be processed and the number of parts processed;
[0034] The scheduling module is used to schedule the production task with the largest set quantity Z in the next batch of processing sequences.
[0035] The production scheduling system according to the embodiment of the present application has at least the following beneficial effects: the production task with the largest number of complete sets Z is arranged in the next batch of processing sequence, so there is a greater probability that the parts processed in the next batch can be directly used in the next process, the number of processed parts staying in the buffer area is smaller, and the probability of filling the buffer area with incomplete parts is lower.
[0036] A processing device according to a third aspect of the present application includes:
[0037] a memory storing a computer program;
[0038] A processor, wherein the processor can implement the steps of the above-mentioned production scheduling method when executing the computer program.
[0039] The processing equipment according to the embodiment of the present application has at least the following beneficial effects: by implementing the above-mentioned production scheduling method, the number of processed parts remaining in the buffer area is smaller, and the probability of filling the buffer area with incomplete parts is lower.
[0040] According to a computer-readable storage medium of the fourth aspect of the present application, a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the steps of the above-mentioned production scheduling method are implemented.
[0041] The computer-readable storage medium according to the embodiment of the present application has at least the following beneficial effects: by implementing the above-mentioned production scheduling method, the number of processed parts remaining in the buffer area is smaller, and the probability of filling the buffer area with incomplete parts is lower.
[0042] A computer program product according to the fifth aspect of the present application includes a computer program, which implements the steps of the above-mentioned production scheduling method when executed by a processor.
[0043] The computer program product according to the embodiment of the present application has at least the following beneficial effects: by implementing the above-mentioned production scheduling method, the number of processed parts remaining in the buffer area is smaller, and the probability of filling the buffer area with incomplete parts is lower.
[0044] Additional aspects and advantages of the present application will be given in part in the description below, and in part will become apparent from the description below, or will be learned through the practice of the present application. BRIEF DESCRIPTION OF THE DRAWINGS
[0045] The present application is further described below with reference to the accompanying drawings and embodiments, wherein:
[0046] Figure 1 This is a flow chart of the production scheduling method of the first embodiment of the present application;
[0047] Figure 2 This is a flow chart of a production scheduling method according to a second embodiment of the present application;
[0048] Figure 3 A software control interface for a plate cutting device before applying the production scheduling method of an embodiment of the present application;
[0049] Figure 4 A software control interface for a plate cutting device after applying the production scheduling method of an embodiment of the present application;
[0050] Figure 5A schematic diagram of a production scheduling system according to an embodiment of the present application;
[0051] Figure 6 A schematic diagram of a processing device according to an embodiment of the present application.
[0052] Reference numerals: production scheduling system 100, first acquisition module 110, parsing module 120, second acquisition module 130, calculation module 140, arrangement module 150;
[0053] Processing equipment 200 , memory 210 , and processor 220 . DETAILED DESCRIPTION
[0054] The embodiments of the present application are described in detail below, and examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present application, and cannot be understood as limiting the present application.
[0055] In the description of the present application, it should be understood that descriptions involving orientation, such as up, down, front, back, left, right, etc., indicating orientations or positional relationships, are based on the orientations or positional relationships shown in the accompanying drawings, and are only for the convenience of describing the present application and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore should not be understood as a limitation on the present application.
[0056] In the description of this application, "several" means one or more than one, "more" means two or more than two, "greater than", "less than", "exceed", etc. are understood to exclude the number itself, and "above", "below", "within", etc. are understood to include the number itself. If there is a description of "first" or "second", it is only used for the purpose of distinguishing technical features, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features or implicitly indicating the order of the indicated technical features.
[0057] In the description of this application, unless otherwise clearly defined, terms such as setting, installing, connecting, etc. should be understood in a broad sense, and technicians in the relevant technical field can reasonably determine the specific meanings of the above terms in this application based on the specific content of the technical solution.
[0058] In the description of the present application, the description with reference to the terms "one embodiment", "some embodiments", "illustrative embodiments", "examples", "specific examples", or "some examples" means that the specific features, structures, materials, or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present application. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials, or characteristics described may be combined in any one or more embodiments or examples in a suitable manner.
[0059] Reference Figure 1 According to the first aspect of the present application, the production scheduling method includes the following steps:
[0060] S100, obtaining production tasks;
[0061] S200, parsing the production task, thereby obtaining the quantity of each part to be processed in the production task, and obtaining the bill of materials of the corresponding product;
[0062] S300, obtaining the processed quantity of each part in the bill of materials;
[0063] S400, calculating the complete set quantity Z of the production task according to the quantity to be processed and the processed quantity of each part;
[0064] S500, arrange the production task with the largest set quantity Z in the next batch of processing sequence.
[0065] The production scheduling method according to the embodiment of the present application has at least the following beneficial effects: the production task with the largest number of complete sets Z is arranged in the next batch of processing sequence, so there is a greater probability that the parts processed in the next batch can be directly used in the next process, the number of processed parts staying in the buffer area is smaller, and the probability of filling the buffer area with incomplete parts is lower.
[0066] It should be noted that when production tasks of several parts in the bill of materials are in the processing state, the quantity of each part of the production tasks in the processing state can be included in the processed quantity.
[0067] Appropriate reference Figure 1 In some embodiments of the present application, "arranging the production task with the largest set quantity Z in the next batch of processing sequence" includes the steps of: arranging the processing sequence of the production tasks in order of the set quantity Z from large to small.
[0068] Arranging the processing sequence of production tasks according to the complete set quantity Z from large to small will help to quickly achieve complete sets of parts and improve product production efficiency.
[0069] Appropriate reference Figure 1In some embodiments of the present application, "arranging the production task with the largest set quantity Z in the next batch of processing sequence" includes the steps of:
[0070] If there are two or more production tasks with the largest set quantity Z, then further calculate the balance degree L of each production task with the largest set quantity Z, and arrange the production task with the smallest balance degree L in the next batch of processing sequence;
[0071] Among them, let k i Part A in the product's bill of materials i The number of i For part A i The processed quantity, let y i The number of parts to be processed, i and n are both positive integers, and the calculation formula of the balance degree L is:
[0072] Balance degree L, that is, the number of sets of each part z i The variance is used to measure the number of uncompleted parts after a production task is completed. The smaller the balance L, the smaller the number of sets of parts z of the production task. i The closer they are, the fewer parts will be left.
[0073] By arranging the production tasks with the smallest balance degree L in the next batch of processing sequences, the number of processed parts remaining in the buffer area is reduced, and the probability of filling the buffer area with incomplete parts is lower.
[0074] Appropriate reference Figure 1 In some embodiments of the present application, "arranging the production task with the largest set quantity Z in the next batch of processing sequence" includes the steps of:
[0075] If there are two or more production tasks with the largest number of identical sets Z, then further calculate the balance degree L of each production task with the largest number of identical sets Z, calculate the uniformity rate Y of the production tasks based on the number of identical sets Z and the balance degree L, and arrange the production task with the largest uniformity rate Y in the next batch of processing sequence;
[0076] Among them, let k i Part A in the product's bill of materials i The number of i For part A i The processed quantity, let y i The number of parts to be processed, i and n are both positive integers, and the calculation formula of the balance degree L is: The calculation formula of the uniformity rate Y is: Among them, M≥2.
[0077] The matching rate Y takes into account the matching number Z and the balance L, making it easier and more intuitive to select the appropriate production task. By arranging the production task with the largest matching rate Y in the next batch of processing sequences, fewer processed parts stay in the buffer area, and the probability of filling the buffer area with incomplete parts is lower.
[0078] In an improved solution of the above embodiment, the value of M is one of 2, 3 and 4.
[0079] Appropriate reference Figure 1 In some embodiments of the present application, "calculating the complete set quantity Z of the product according to the number of parts to be processed and the number of parts processed" includes the following steps:
[0080] Assume that the bill of materials includes k1 A1 parts, k2 A2 parts, and so on. n A n Parts, assuming that the number of parts processed includes x1 A1 parts, x2 A2 parts, and so on. n A n Parts, suppose the number of parts to be processed includes y1 A1 parts, y2 A2 parts, and so on. n A n Parts, the calculation formula for the complete set quantity Z is:
[0081]
[0082] Through the calculation formula of the complete set quantity Z, the complete set quantity Z of the production task can be quickly calculated, and the calculation is simple and convenient.
[0083] It should be noted that in the calculation formula of the complete set quantity Z, express The calculation result is rounded down.
[0084] Reference Figure 2 , shows a flowchart of a production scheduling method according to an embodiment of the present application. In this embodiment, the uniformity rate Y of each production task is calculated one by one. m , and continuously screen and retain the maximum value of the uniform rate Y, so as to select the uniform rate Y m The largest production order. In addition, the number of parts of the production order being processed is taken into account when calculating the number of parts.
[0085] Reference Figure 3 and Figure 4 , Figure 3 and Figure 4 All of them show the software control interface of the plate cutting equipment. Figure 3 To apply the production sequence before the production scheduling method of the embodiment of the present application, Figure 4It is the production sequence after using the production scheduling method of an embodiment of the present application. As can be seen from the figure, after using the production scheduling method of the embodiment of the present application, the production task with the largest matching rate Y is arranged in the next batch of processing sequence, so that the number of processed parts staying in the buffer area is reduced, and the probability of filling the buffer area with incomplete parts is lower.
[0086] The following uses a specific scenario to illustrate the production scheduling method of an embodiment of the present application.
[0087] Company A is a company that produces bicycles. The parts needed to produce a bicycle include: 2 wheels, 1 pedal, 1 frame and 1 trunk. After all the parts needed to produce at least one bicycle are complete, these parts will be put into the next assembly stage. Before entering the assembly stage, these parts need to be temporarily stored. In order to improve the utilization rate of raw materials, these parts are not produced strictly according to 2:1:1:1 in the production process (that is, in order to improve the utilization rate of materials, some parts may be redundant).
[0088] At present, let's assume that 10 wheels, 7 pedals, 7 frames and 7 trunks have been produced. It is required to select the production task with the highest matching rate from the next set of production tasks.
[0089] The first step is to calculate the complete set quantity Z of the next production task. The higher the complete set quantity Z, the greater the complete set rate Y.
[0090] Assume that the next production task includes y1 wheels, y2 pedals, y3 frames and y4 trunks.
[0091] Step 2: If there are production tasks with the same number of complete sets Z, continue to calculate the balance L of the production tasks with the same number of complete sets Z. The lower the balance L, the higher the complete set rate Y. (The balance L represents the degree of discreteness of the data. The variance of the quotient of the number of each part divided by the proportion is the balance L.)
[0092] For the above situation, the balance in,
[0093] Step 3: To further simplify the calculation, the uniformity rate Y can be used to comprehensively express the uniformity quantity Z and the balance degree L. That is, the calculation formula of the uniformity rate Y is: Among them, M≥2.
[0094] It should be noted that the value of M can be 2, 3, 4 or other values.
[0095] Reference Figure 5According to the production scheduling system 100 of the second aspect embodiment of the present application, it includes a first acquisition module 110, a parsing module 120, a second acquisition module 130, a calculation module 140 and an arrangement module 150. The first acquisition module 110 is used to acquire production tasks. The parsing module 120 is used to parse production tasks, thereby acquiring the number of parts to be processed in the production tasks, and acquiring the bill of materials of the corresponding products. The second acquisition module 130 is used to acquire the number of processed parts in the bill of materials. The calculation module 140 is used to calculate the complete set quantity Z of the product based on the number of parts to be processed and the number of parts processed. The arrangement module 150 is used to arrange the production task with the largest complete set quantity Z in the next batch of processing sequences.
[0096] The production scheduling system 100 according to the embodiment of the present application has at least the following beneficial effects: the production task with the largest number of complete sets Z is arranged in the next batch of processing sequences, so that the parts processed in the next batch have a greater probability of being directly used in the next process, the number of processed parts staying in the buffer area is smaller, and the probability of filling the buffer area with incomplete parts is lower.
[0097] Reference Figure 6 According to a third aspect of the present application, a processing device 200 includes a memory 210 and a processor 220. The memory 210 stores a computer program. When the processor 220 executes the computer program, the steps of the production scheduling method described above can be implemented.
[0098] The processing equipment according to the embodiment of the present application has at least the following beneficial effects: by implementing the above-mentioned production scheduling method, the number of processed parts remaining in the buffer area is smaller, and the probability of filling the buffer area with incomplete parts is lower.
[0099] The memory 210 includes at least one type of readable storage medium, and the readable storage medium includes flash memory, hard disk, multimedia card, card-type memory (such as SD or DX memory, etc.), random access memory (RAM), static random access memory (SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), programmable read-only memory (PROM), magnetic memory, magnetic disk, optical disk, etc. In some embodiments, the memory 210 can be an internal storage unit of the processing equipment 200, such as a hard disk or memory of the processing equipment 200. In other embodiments, the memory 210 can also be an external storage device of the processing equipment 200, such as a plug-in hard disk equipped on the processing equipment 200, a smart memory card (SmartMedia Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), etc. Of course, the memory 210 can also include both the internal storage unit of the processing equipment 200 and its external storage device. In this embodiment, the memory 210 is generally used to store the operating system and various application software installed on the processing equipment 200, such as the program code of the production scheduling method, etc. In addition, the memory 210 can also be used to temporarily store various types of data that have been output or are to be output.
[0100] The processor 220 may be a central processing unit (CPU), a controller, a microcontroller, a microprocessor, or other data processing chips in some embodiments. The processor 220 is generally used to control the overall operation of the processing equipment 200. In this embodiment, the processor 220 is used to run the program code stored in the memory 210 or process data, such as running the program code of the production scheduling method.
[0101] In addition, the processing equipment 200 generally includes a display, a communication interface and a bus. The memory 210, the processor 220, the display and the communication interface can communicate with each other through the bus. The display screen is configured to display the user operation interface preset in the initial setting mode, and the display screen can also display the process control window. The communication interface may include a wireless network interface or a wired network interface.
[0102] According to a computer-readable storage medium of the fourth aspect of the present application, a computer program is stored on the computer-readable storage medium, and when the computer program is executed by the processor 220, the steps of the production scheduling method as described above are implemented.
[0103] The computer-readable storage medium according to the embodiment of the present application has at least the following beneficial effects: by implementing the above-mentioned production scheduling method, the number of processed parts remaining in the buffer area is smaller, and the probability of filling the buffer area with incomplete parts is lower.
[0104] The computer-readable storage medium provided in the embodiments of the present application may be a USB flash drive, but is not limited to electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, systems or devices, or any combination thereof. More specific embodiments of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device or a magnetic storage device, or any suitable combination thereof.
[0105] In this embodiment, the computer readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, system, or device. The program code contained on the computer readable storage medium can be transmitted using any appropriate medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.
[0106] The computer-readable storage medium may be included in the electronic device, or may exist independently without being loaded into the electronic device.
[0107] The computer program for executing the present application can be written in one or more programming languages or a combination thereof, including object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (e.g., using an Internet service provider to connect through the Internet).
[0108] A computer program product according to the fifth aspect of the present application includes a computer program, which implements the steps of the above-mentioned production scheduling method when executed by a processor.
[0109] The computer program product according to the embodiment of the present application has at least the following beneficial effects: by implementing the above-mentioned production scheduling method, the number of processed parts remaining in the buffer area is smaller, and the probability of filling the buffer area with incomplete parts is lower.
[0110] The embodiments of the present application are described in detail above in conjunction with the accompanying drawings, but the present application is not limited to the above embodiments. Various changes can be made within the knowledge of ordinary technicians in the relevant technical field without departing from the purpose of the present application. In addition, the embodiments of the present application and the features in the embodiments can be combined with each other without conflict.
Claims
1. A production scheduling method, characterized in that: The following steps are involved: Get production tasks; Parse the production task to obtain the number of parts to be processed in the production task and obtain the bill of materials for the corresponding product; Get the processed quantity of each part in the bill of materials; Calculate the complete set quantity Z of the production task according to the number of parts to be processed and the number of parts processed; Arrange the production task with the largest set quantity Z in the next batch of processing sequence.
2. The production scheduling method according to claim 1, characterized in that: The step of "arranging the production task with the largest set quantity Z in the next batch of processing sequences" includes the following steps: Arrange the processing order of production tasks according to the complete set quantity Z from large to small.
3. The production scheduling method according to claim 1, characterized in that: The step of "arranging the production task with the largest set quantity Z in the next batch of processing sequences" includes the following steps: If there are two or more production tasks with the largest set quantity Z, then further calculate the balance degree L of each production task with the largest set quantity Z, and arrange the production task with the smallest balance degree L in the next batch of processing sequence; Among them, let k i Part A in the product's bill of materials i The number of i For part A i The processed quantity, let y i is the number of parts to be processed, then i and n are both positive integers, and the calculation formula of the balance degree L is:
4. The production scheduling method according to claim 1, characterized in that: The step of "arranging the production task with the largest set quantity Z in the next batch of processing sequences" includes the following steps: If there are two or more production tasks with the largest number of identical sets Z, then further calculate the balance degree L of each production task with the largest number of identical sets Z, calculate the uniformity rate Y of the production tasks based on the number of identical sets Z and the balance degree L, and arrange the production task with the largest uniformity rate Y in the next batch of processing sequence; Among them, let k i Part A in the product's bill of materials i The number of i For part A i The processed quantity, let y i is the number of parts to be processed, then i and n are both positive integers, and the calculation formula of the balance degree L is: The calculation formula of the uniformity rate Y is: Among them, M≥2.
5. The production scheduling method according to claim 4, characterized in that: The value of M is one of 2, 3 and 4.
6. The production scheduling method according to any one of claims 1 to 5, characterized in that: The "calculating the complete set quantity Z of the product according to the quantity to be processed and the processed quantity of each part" includes the following steps: Assume that the bill of materials includes k1 A1 parts, k2 A2 parts, and so on. n A n Parts, assuming that the number of parts processed includes x1 A1 parts, x2 A2 parts, and so on. n A n Parts, assuming that the number of parts to be processed includes y1 A1 parts, y1 A2 parts, and so on. n A n Parts, the calculation formula for the complete set quantity Z is:
7. The production scheduling system is characterized by: include: A first acquisition module is used to acquire production tasks; The parsing module is used to parse the production task, so as to obtain the number of parts to be processed in the production task and the bill of materials of the corresponding product; The second acquisition module is used to obtain the processed quantity of each part in the bill of materials; A calculation module is used to calculate the complete set quantity Z of the product according to the number of parts to be processed and the number of parts processed; The scheduling module is used to schedule the production task with the largest set quantity Z in the next batch of processing sequences.
8. A processing equipment, characterized in that: include: a memory storing a computer program; A processor, wherein when executing the computer program, the processor can implement the steps of the production scheduling method according to any one of claims 1 to 6.
9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the production scheduling method according to any one of claims 1 to 6 are implemented.
10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the production scheduling method according to any one of claims 1 to 6 are implemented.