Production scheduling method and device suitable for fine chemical enterprises and computer equipment

Abstract

The invention relates to a production scheduling method and device suitable for fine chemical enterprises and computer equipment. The method comprises the following steps: obtaining weight information and material information of a plurality of orders; generating an order sequence according to the weight information; generating a taboo table according to the order sequence and the material information; and generating a production scheduling plan according to the order sequence and the taboo table. By the adoption of the method, the order sequence can be optimized in the sequencing process, meanwhile, it is avoided that a large amount of time is spent on violent solution in the production scheduling process, the solution time is greatly shortened, a reasonable optimal solution is rapidly obtained, the material sequence of multiple production line reaction kettles is switched, and frequent kettle washing operation is avoided.

Description

Technical Field

[0001] The present application relates to the technical field of production planning and scheduling, and in particular to a production scheduling method, device and computer equipment suitable for fine chemical enterprises. Background Art

[0002] The fine chemical industry has the characteristics of many product specifications, small batches, and frequent switching. This characteristic makes it difficult to schedule production in the fine chemical industry. There are situations where the same material cannot be switched in the same reactor, and the front and back of the same reactor can be switched, but the order cannot be switched after changing. For planners, this situation requires continuous deduction and regression to come up with a feasible production plan. At the same time, once sales need to advance the delivery date of the order, changing the order of the order is even more troublesome. It is impossible to evaluate the impact of the change in a short time, and to come up with a reasonable plan, let alone optimize production scheduling.

[0003] Production planning is an indispensable part of the company's production plan. A reasonable production plan can effectively improve the order delivery rate, increase the utilization rate of production capacity, reduce the switching in production, reduce the number of cleaning and shutdown times, and improve economic benefits. At the same time, it can quickly respond to the demand for inserting orders, quickly give delivery dates for urgent orders, and improve the company's market response speed.

[0004] The traditional approach is to model the scheduling of robot production workshops, model materials and workshop plans at the same time, and schedule production based on the constraints of the model; or to model the scheduling of production workshops and use legacy algorithms to optimize by setting different weights; or to abstract the order dispatching process as a transformation from an idle state to a working state to meet the simulation requirements of the scheduling process.

[0005] The above solutions all add some heuristic rules and constraints to the simple production scheduling problem. Since there are multiple production lines in the fine chemical industry and the switching rules are extremely complex, there are situations where the system itself cannot be switched, and the front and rear materials can be switched but the exchange order cannot be switched. Therefore, the problem of material switching on multiple production lines cannot be solved. Summary of the invention

[0006] Based on this, it is necessary to provide a production scheduling method, device, computer equipment, computer-readable storage medium and computer program product suitable for fine chemical enterprises that can switch materials on multiple production lines in response to the above-mentioned technical problems.

[0007] In a first aspect, the present application provides a production scheduling method applicable to a fine chemical enterprise. The method comprises:

[0008] Get weight information and material information of multiple orders;

[0009] Generate an order sequence according to the weight information;

[0010] Generate a taboo table according to the order sequence and the material information;

[0011] A production schedule is generated according to the order sequence and the taboo table.

[0012] In one embodiment, generating a taboo table according to the order sequence and the material information includes:

[0013] Generate a switching rule table according to the material information;

[0014] A taboo table is generated according to the order sequence and the switching rule table.

[0015] In one embodiment, generating a switching rule table according to the material information includes:

[0016] Among them, the material information includes multiple materials;

[0017] Obtain the reaction conflict relationship between various materials;

[0018] A switching rule table is generated according to the reaction conflict relationship.

[0019] In one embodiment, generating a production schedule according to the order sequence and the taboo table includes:

[0020] Calculate the completion time of multiple orders according to the production scheduling plan;

[0021] Adjust the production schedule based on the completion time and the preset delivery deadline.

[0022] In one embodiment, the method further comprises:

[0023] Get new order information;

[0024] Adjust the production schedule according to the newly added order information and the taboo table.

[0025] In one embodiment, adjusting the production schedule according to the newly added order information and the taboo table includes:

[0026] Wherein, the newly added order information includes newly added materials;

[0027] Detect whether the newly added material is in the switching rule table;

[0028] If the newly added material is not in the switching rule table, updating the switching rule table according to the material;

[0029] The taboo table is updated according to the updated switching rule table and the order sequence.

[0030] In a second aspect, the present application also provides a production scheduling device suitable for fine chemical enterprises. The device comprises:

[0031] Information acquisition module, used to obtain weight information and material information of multiple orders;

[0032] A sequence generation module, used to generate an order sequence according to the weight information;

[0033] A taboo analysis module, used for generating a taboo table according to the order sequence and the material information;

[0034] The production scheduling module is used to generate a production scheduling plan according to the order sequence and the taboo table.

[0035] In a third aspect, the present application further provides a computer device. The computer device includes a memory and a processor, the memory stores a computer program, and the processor implements the following steps when executing the computer program:

[0036] Get weight information and material information of multiple orders;

[0037] Generate an order sequence according to the weight information;

[0038] Generate a taboo table according to the order sequence and the material information;

[0039] A production schedule is generated according to the order sequence and the taboo table.

[0040] In a fourth aspect, the present application further provides a computer-readable storage medium. The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the following steps are implemented:

[0041] Get weight information and material information of multiple orders;

[0042] Generate an order sequence according to the weight information;

[0043] Generate a taboo table according to the order sequence and the material information;

[0044] A production schedule is generated according to the order sequence and the taboo table.

[0045] In a fifth aspect, the present application further provides a computer program product. The computer program product includes a computer program, and when the computer program is executed by a processor, the following steps are implemented:

[0046] Get weight information and material information of multiple orders;

[0047] Generate an order sequence according to the weight information;

[0048] Generate a taboo table according to the order sequence and the material information;

[0049] A production schedule is generated according to the order sequence and the taboo table.

[0050] The above method, device and computer equipment for scheduling production in fine chemical enterprises obtain the weight information and material information of multiple orders; generate an order sequence according to the weight information; generate a taboo table according to the order sequence and the material information; and generate a production plan according to the order sequence and the taboo table. Through this method, not only the order sequence is optimized during the sorting process, but also the production scheduling process avoids spending a lot of time on brute force solutions, greatly reduces the solution time, and quickly obtains a reasonable optimization solution, so that the material sequence of the reactors of multiple production lines can be switched, and frequent reactor washing operations can be avoided. BRIEF DESCRIPTION OF THE DRAWINGS

[0051] Figure 1 An application environment diagram of a production scheduling method for a fine chemical enterprise in one embodiment;

[0052] Figure 2 It is a flow chart of a production scheduling method applicable to a fine chemical enterprise in one embodiment;

[0053] Figure 3 It is a flow chart of a production scheduling method applicable to a fine chemical enterprise in another embodiment;

[0054] Figure 4 It is a structural block diagram of a production scheduling device applicable to a fine chemical enterprise in one embodiment;

[0055] Figure 5 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0056] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0057] The production scheduling method for fine chemical enterprises provided in the embodiments of the present application can be applied to Figure 1In the application environment shown. Among them, the terminal 102 communicates with the server 104 through the network. The data storage system can store the data that the server 104 needs to process. The data storage system can be integrated on the server 104, or it can be placed on the cloud or other network servers. By calculating the weight information and material information, a production schedule is generated, so that the material sequence of the multi-production line reactor can be switched to avoid frequent reactor washing operations. Among them, the terminal 102 can be but is not limited to various personal computers, laptops, smart phones, tablets, Internet of Things devices and portable wearable devices. The Internet of Things devices can be instruments, sensor devices, etc. Portable wearable devices can be smart watches, smart bracelets, head-mounted devices, etc. The server 104 can be implemented with an independent server or a server cluster consisting of multiple servers.

[0058] In one embodiment, Figure 2 As shown, a production scheduling method suitable for fine chemical enterprises is provided. Figure 1 Taking the server 104 in the example as an example, the following steps are included:

[0059] Step 202, obtaining weight information and material information of multiple orders.

[0060] The weight information includes the weight of the delivery date, the weight of the order quantity, and the weight of the order type.

[0061] Specifically, for multiple orders, according to their delivery date, order quantity, order type and other information, weights corresponding to weights are assigned, and the weights are summed up to obtain the corresponding weight total score and weight information. For multiple orders, the required materials are obtained to obtain material information. As the production line orders continue to increase, the newly added order content is collected to generate an order sequence.

[0062] Step 204: Generate an order sequence according to the weight information.

[0063] Specifically, a genetic algorithm is applied to calculate according to the weight information to generate an order sequence.

[0064] More specifically, according to the scheduling rules and constraints of the process chemical industry, the scheduling plans of the individuals in the population meet two special scheduling constraints, namely classification by brand and aggregation by color; in the selection, crossover and mutation process of the genetic algorithm, only the first-level individual codes are operated to calculate the order sequence of each order, which will not destroy the scheduling constraints in the scheduling plan.

[0065] In one embodiment, orders are dispatched to corresponding reactors according to the order sequence, and the start and end times of the dispatch are calculated. If there are reactors among all dispatchable reactors that meet the switching conditions, the reactor with the shortest completion time is selected as the dispatch resource, and the order quantity of the corresponding order is reduced by one reactor quantity, and production scheduling continues.

[0066] Step 206: Generate a taboo table according to the order sequence and the material information.

[0067] Specifically, a taboo table is established, and subsequent orders in the order sequence are traversed. If the traversed switchable order can be produced on the reactor that the current order can arrange, meets the switching condition of the current reactor, and can be switched to the current order, the switchable order will be selected to be produced on this reactor, and the order quantity of the order will be reduced by one reactor quantity, and then the current order will be dispatched after the switchable order. If the traversed subsequent order cannot meet the switching condition, the order is added to the taboo table, and the subsequent order is searched until the condition is met.

[0068] Further, the order dispatch information in the production schedule is obtained; and the taboo table is updated according to the order dispatch information. The order dispatch status is detected; if the order dispatch is completed, the order in the taboo table is cleared. In one embodiment, if all materials in an order are dispatched to the reactor production, the order in the taboo table is cleared.

[0069] The generating a taboo table according to the order sequence and the material information includes: generating a switching rule table according to the material information; generating a taboo table according to the order sequence and the switching rule table.

[0070] Among them, the material information includes multiple materials.

[0071] Specifically, the reaction conflict relationship between various materials is obtained; and a switching rule table is generated according to the reaction conflict relationship.

[0072] In one embodiment, the material information includes material A, material B, material C, material D, material F, and material A. After the reactor produces material C, it will produce material B, material D, and material F, which will cause a conflict and require the reactor to be cleaned; after the reactor produces material A, it will produce material D and material F, which will cause a conflict and require the reactor to be cleaned; after the reactor produces material A, it will produce material B, which will cause a conflict and require the reactor to be cleaned. According to the above reaction conflict relationship, a switching rule table is generated.

[0073] Step 208: Generate a production schedule based on the order sequence and the taboo table.

[0074] Specifically, according to the production schedule, the completion time of multiple orders is calculated; according to the completion time and the preset delivery deadline, the production schedule is adjusted.

[0075] More specifically, it is calculated whether the delivery time of each order in the order sequence is overdue. If the delivery time is overdue, the specific time of the overtime and the capacity of all production lines are calculated. The delivery time, delivery overtime time, and production line capacity are weighted and summed to obtain the fitness. At the same time, the fitness is optimized and iterated using a genetic algorithm. The number of iterations is set. When the number of iterations is reached, the optimized solution is obtained and the production schedule is adjusted.

[0076] The method also includes: obtaining new order information; and adjusting the production schedule according to the new order information and the taboo table.

[0077] The newly added order information includes newly added materials.

[0078] Specifically, it is detected whether the newly added material is in the switching rule table; if the newly added material is not in the switching rule table, the switching rule table is updated according to the material; according to the updated switching rule table and the order sequence, the taboo table is updated. If the newly added material is in the switching rule table, the switching rule table is not updated.

[0079] More specifically, a taboo table is established to traverse the subsequent orders and newly added order information in the order sequence. If the traversed switchable order can be produced on the reactor that can be scheduled for the current order, meets the switching conditions of the current reactor, and can be switched to the current order, the switchable order will be selected to be produced on this reactor, and the order quantity of the order will be reduced by one reactor quantity, and then the current order will be assigned after the switchable order. If the traversed subsequent order cannot meet the switching conditions, the order will be added to the taboo table, and the subsequent order will continue to be searched until the conditions are met. By traversing all the orders in the system, the taboo table is updated in real time and the production schedule is adjusted.

[0080] The above method is applicable to the production scheduling method of fine chemical enterprises, by obtaining the weight information and material information of multiple orders; generating an order sequence according to the weight information; generating a taboo table according to the order sequence and the material information; generating a production schedule according to the order sequence and the taboo table. Through this method, not only the order sequence is optimized in the sorting process, but also the production scheduling process avoids spending a lot of time on brute force solutions, greatly reduces the solution time, and quickly obtains a reasonable optimization solution, so that the material sequence of the reactors of multiple production lines can be switched, avoiding frequent reactor washing operations.

[0081] In another embodiment, Figure 3 As shown, Figure 3The flowchart of another embodiment of a production scheduling method applicable to a fine chemical enterprise includes the following steps:

[0082] Step 302, orders to be arranged.

[0083] Step 304, traverse the schedulable production lines.

[0084] Step 306: Place the product on the production line to see if it meets the switching requirements.

[0085] Step 308, scheduling production on the production line.

[0086] Step 310, traverse other switchable orders.

[0087] Step 312, arrange a batch of switchable materials.

[0088] In this embodiment, a fine chemical enterprise has pending orders as shown in Table 1, where each order produces different materials and has different delivery dates. Orders are sorted according to the order quantity, order type, delivery date, and whether to switch materials. The order sequence after sorting is shown in Table 2, the resource parameter table is shown in Table 3, and the switching rule table is shown in Table 4. All materials can be produced on production line 1, and the processing time for a batch is 12 hours.

[0089] Table 1 Orders to be arranged for a fine chemical plant

[0090]

[0091]

[0092] Table 2 Orders to be arranged by a fine chemical factory (after sorting)

[0093] Order Number Order quantity / t Material Name Order Type Delivery Whether to switch material Setting weights M003 14 C foreign trade 24-09-23 no 0.33 M002 10.5 B foreign trade 24-09-25 no 0.27 M001 7 A foreign trade 24-09-28 no 0.20 M006 7 F Domestic sales 24-09-20 no 0.13 M004 14 D Domestic sales 24-09-26 no 0.07 M005 21 E Domestic sales 24-08-30 yes 0

[0094] Table 3 Resource parameter table

[0095] Production line name Reactor capacity / t Batch processing time Dispatch start time Production Line 1 3.5 12h 2024-09-20 00:00:00

[0096] Table 4 Switching rules table

[0097] Previous material After material Switching time Can it be cut? C B 240h no C F 240h no C D 240h no A F 240h no A D 240h no B A 240h no

[0098] Now according to the order sequence of the initial individual generation, there are a total of six materials [C, B, A, F, D, E] to be dispatched. First, the M003 order is dispatched to produce material C on production line 1. Since material C and material C do not violate the switching rules, 4 kettles of material C are dispatched first, followed by the M002 order to produce material B. Since material C cannot be switched to material B, the M001 order is traversed to produce material A. It is judged that material C can be switched to material A, so 1 kettle of material A is dispatched, and at the same time, the order quantity of 3.5t of one kettle in the M001 order is deducted from material A. At this time, the work order of production line 1 is: [CCCCA], and there is [A] in the taboo table.

[0099] Continue to judge the M002 order. It is found that material A can be switched to material B, so the M002 order is assigned and the taboo table is cleared. It is further judged that material B cannot be switched to material A, so the M001 order is not assigned first. The M006 order is judged to produce material F. Material B can be switched to material F, so one kettle is assigned to produce material F first. At this time, the production line 1 has a work order of [CCCCABBBF], and there is [F] in the taboo table. Later, return to order M001. Since material F can be switched to material A, one kettle is scheduled to produce material A. Next is the M006 order. Since material A cannot be switched to material F, it is necessary to judge backwards. Since material A cannot be switched to material D, one kettle needs to be assigned to produce material E. At this time, the production line 1 has a work order of [CCCCABBBFAE], and the taboo table is [E]. Since material E can be switched to material F, it is scheduled to M006 order according to the order sequence, and then one batch of material F is scheduled to be produced, and the taboo table is cleared. Next, the M004 order is judged. Since material F can be switched to material D, 4 batches of material D are scheduled to be produced, and finally the remaining material E is scheduled. The final production schedule is [CCCCABBBFAEDDDDEEEE].

[0100] It should be understood that, although the various steps in the flowcharts involved in the above-mentioned embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above-mentioned embodiments can include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.

[0101] Based on the same inventive concept, the embodiment of the present application also provides a production scheduling device for fine chemical enterprises for implementing the above-mentioned production scheduling method for fine chemical enterprises. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above-mentioned method, so the specific limitations in one or more embodiments of the production scheduling device for fine chemical enterprises provided below can refer to the limitations of the production scheduling method for fine chemical enterprises above, and will not be repeated here.

[0102] In one embodiment, Figure 4 As shown, a production scheduling device suitable for fine chemical enterprises is provided, including: an information acquisition module 410, a sequence generation module 420, a taboo analysis module 430 and a production scheduling module 440, wherein:

[0103] The information acquisition module 410 is used to acquire weight information and material information of multiple orders.

[0104] The sequence generation module 420 is used to generate an order sequence according to the weight information.

[0105] The taboo analysis module 430 is used to generate a taboo table according to the order sequence and the material information.

[0106] The production scheduling module 440 is used to generate a production scheduling plan according to the order sequence and the taboo table.

[0107] The taboo analysis module 430 is further configured to generate a switching rule table according to the material information; and generate a taboo table according to the order sequence and the switching rule table.

[0108] The taboo analysis module 430 is also used to obtain the reaction conflict relationship between various materials; and generate a switching rule table according to the reaction conflict relationship.

[0109] The production scheduling module 440 is also used to calculate the completion time of multiple orders according to the production scheduling; and adjust the production scheduling according to the completion time and the preset delivery deadline.

[0110] The production scheduling module 440 is also used to obtain new order information; and adjust the production scheduling plan according to the new order information and the taboo table.

[0111] The production scheduling module 440 is also used to detect whether the newly added material is in the switching rule table; if the newly added material is not in the switching rule table, the switching rule table is updated according to the material; and the taboo table is updated according to the updated switching rule table and the order sequence.

[0112] The above modules applicable to the production scheduling device of fine chemical enterprises can be implemented in whole or in part by software, hardware and their combination. The above modules can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory of the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules.

[0113] In one embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as follows: Figure 5 As shown. The computer device includes a processor, a memory and a network interface connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store production scheduling data. The network interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a production scheduling method suitable for a fine chemical enterprise is implemented.

[0114] Those skilled in the art will understand that Figure 5 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0115] In one embodiment, a computer device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the computer program, any one of the production scheduling methods applicable to fine chemical enterprises in the above embodiments is implemented.

[0116] Get weight information and material information of multiple orders;

[0117] Generate an order sequence according to the weight information;

[0118] Generate a taboo table according to the order sequence and the material information;

[0119] A production schedule is generated according to the order sequence and the taboo table.

[0120] In one embodiment, when the processor executes the computer program, the following steps are also implemented: generating a switching rule table according to the material information; generating a taboo table according to the order sequence and the switching rule table.

[0121] In one embodiment, when the processor executes the computer program, the following steps are also implemented: detecting whether the newly added material is in the switching rule table; if the newly added material is not in the switching rule table, updating the switching rule table according to the material; and updating the taboo table according to the updated switching rule table and the order sequence.

[0122] In one embodiment, when the processor executes the computer program, the following steps are also implemented: obtaining the reaction conflict relationship between the various materials; and generating a switching rule table according to the reaction conflict relationship.

[0123] In one embodiment, when the processor executes the computer program, the following steps are also implemented: calculating the completion time of multiple orders according to the production schedule; and adjusting the production schedule according to the completion time and the preset delivery deadline.

[0124] In one embodiment, when the processor executes the computer program, the following steps are also implemented: obtaining new order information; and adjusting the production schedule according to the new order information and the taboo table.

[0125] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, any one of the production scheduling methods applicable to fine chemical enterprises in the above embodiments is implemented.

[0126] Get weight information and material information of multiple orders;

[0127] Generate an order sequence according to the weight information;

[0128] Generate a taboo table according to the order sequence and the material information;

[0129] A production schedule is generated according to the order sequence and the taboo table.

[0130] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: generating a switching rule table according to the material information; generating a taboo table according to the order sequence and the switching rule table.

[0131] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: detecting whether the newly added material is in the switching rule table; if the newly added material is not in the switching rule table, updating the switching rule table according to the material; and updating the taboo table according to the updated switching rule table and the order sequence.

[0132] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: obtaining the reaction conflict relationship between the various materials; and generating a switching rule table according to the reaction conflict relationship.

[0133] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: calculating the completion time of multiple orders according to the production schedule; and adjusting the production schedule according to the completion time and the preset delivery deadline.

[0134] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: obtaining new order information; and adjusting the production schedule according to the new order information and the taboo table.

[0135] In one embodiment, a computer program product is provided, comprising a computer program, which, when executed by a processor, implements the following steps:

[0136] Get weight information and material information of multiple orders;

[0137] Generate an order sequence according to the weight information;

[0138] Generate a taboo table according to the order sequence and the material information;

[0139] A production schedule is generated according to the order sequence and the taboo table.

[0140] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: generating a switching rule table according to the material information; generating a taboo table according to the order sequence and the switching rule table.

[0141] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: detecting whether the newly added material is in the switching rule table; if the newly added material is not in the switching rule table, updating the switching rule table according to the material; and updating the taboo table according to the updated switching rule table and the order sequence.

[0142] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: obtaining the reaction conflict relationship between the various materials; and generating a switching rule table according to the reaction conflict relationship.

[0143] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: calculating the completion time of multiple orders according to the production schedule; and adjusting the production schedule according to the completion time and the preset delivery deadline.

[0144] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: obtaining new order information; and adjusting the production schedule according to the new order information and the taboo table.

[0145] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties.

[0146] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetoresistive random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, etc., but are not limited to this.

[0147] The technical features of the above embodiments may be arbitrarily combined. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0148] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A production scheduling method applicable to fine chemical enterprises, characterized in that: The method comprises: Get weight information and material information of multiple orders; Generate an order sequence according to the weight information; Generate a taboo table according to the order sequence and the material information; A production schedule is generated according to the order sequence and the taboo table.

2. The method according to claim 1, characterized in that The generating a taboo table according to the order sequence and the material information comprises: Generate a switching rule table according to the material information; A taboo table is generated according to the order sequence and the switching rule table.

3. The method according to claim 2, characterized in that According to the material information, a switching rule table is generated. include: Among them, the material information includes multiple materials; Obtain the reaction conflict relationship between various materials; A switching rule table is generated according to the reaction conflict relationship.

4. The method according to claim 3, characterized in that The generating of the production schedule according to the order sequence and the taboo table comprises: Calculate the completion time of multiple orders according to the production scheduling plan; Adjust the production schedule based on the completion time and the preset delivery deadline.

5. The method according to claim 2, characterized in that: The method further comprises: Get new order information; Adjust the production schedule according to the newly added order information and the taboo table.

6. The method according to claim 5, characterized in that According to the newly added order information and the taboo table, the production schedule is adjusted include: Wherein, the newly added order information includes newly added materials; Detect whether the newly added material is in the switching rule table; If the newly added material is not in the switching rule table, updating the switching rule table according to the material; The taboo table is updated according to the updated switching rule table and the order sequence.

7. A production scheduling device suitable for fine chemical enterprises, characterized in that: The device comprises: Information acquisition module, used to obtain weight information and material information of multiple orders; A sequence generation module, used to generate an order sequence according to the weight information; A taboo analysis module, used for generating a taboo table according to the order sequence and the material information; The production scheduling module is used to generate a production scheduling plan according to the order sequence and the taboo table.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 6 are implemented.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the 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 method according to any one of claims 1 to 6 are implemented.

Images