Production scheduling method, system, electronic device, and storage medium

By generating data snapshots and managing task version information, the problem of low efficiency in production scheduling data collection and processing was solved, enabling efficient and accurate execution of scheduling tasks.

CN117480511BActive Publication Date: 2026-11-10BOE TECHNOLOGY GROUP CO LTD +1
View PDF 1 Cites 0 Cited by

Patent Information

Application Number
CN202280000618.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-03-31
Publication Date
2026-11-10
Estimated Expiration
2042-03-31

AI Technical Summary

Technical Problem

The existing production scheduling data collection and processing process is cumbersome and inefficient, and is prone to inaccurate and missing data.

Method used

By generating data snapshots with data version information, data models are built and scheduling tasks are executed using these snapshots. By combining task version information comparison and mutual exclusion flag management, the accuracy and efficiency of scheduling tasks are ensured.

Benefits of technology

It improves the execution efficiency of scheduled tasks, reduces data processing time, ensures data accuracy and convenient version management, and avoids the possibility of multiple users executing the same task simultaneously.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117480511B_ABST
    Figure CN117480511B_ABST
Patent Text Reader

Abstract

A production scheduling method, system, electronic device, storage medium and computer program product are provided. The method comprises: in response to creating a first scheduling task, obtaining scheduling data (S110); receiving configuration information for the first scheduling task (S120); establishing a data snapshot with data version information based on the obtained scheduling data (S130); and generating a data model for the first scheduling task using the established data snapshot, wherein the data model for the first scheduling task and the configuration information are used for execution of the first scheduling task (S140).
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This disclosure relates to the field of production scheduling technology, specifically to a production scheduling method, a production scheduling system, electronic equipment, storage media, and computer program products. Background Technology

[0002] In the field of production scheduling, collecting and processing scheduling data is a crucial part of the process. However, the current process for collecting and processing scheduling data is cumbersome and inefficient, and prone to problems such as inaccurate data and omissions. Summary of the Invention

[0003] This disclosure provides a production scheduling method, system, electronic device, storage medium, and computer program product.

[0004] According to one aspect of this disclosure, a production scheduling method is provided, comprising: in response to creating a first scheduling task, acquiring scheduling data; receiving configuration information for the first scheduling task; and establishing a data snapshot with data version information based on the acquired scheduling data, wherein the data model and configuration information for the first scheduling task are used for the execution of the first scheduling task.

[0005] According to embodiments of this disclosure, the method further includes: using the established data snapshot to generate a data model for a first scheduling task; and using the data model for the first scheduling task and configuration information to execute the first scheduling task.

[0006] According to embodiments of this disclosure, establishing a data snapshot with data version information based on the acquired scheduling data includes: generating data version information for the acquired scheduling data; and combining the data version information with the acquired scheduling data to form a data snapshot.

[0007] According to an embodiment of this disclosure, the first scheduled task has task version information, and the method further includes: before establishing a data snapshot with data version information based on the acquired scheduling data, determining whether the first scheduled task is executable by comparing the task version information of the first scheduled task with currently stored task version information, wherein the operation of establishing a data snapshot with data version information based on the acquired scheduling data is performed in response to determining that the first scheduled task is executable.

[0008] According to embodiments of this disclosure, determining whether a first scheduled task is executable by comparing its task version information with currently stored task version information includes: if the task version information currently stored in the mutex flag is consistent with the task version information of the first scheduled task, then the first scheduled task is determined to be executable; if the task version information currently stored in the mutex flag is inconsistent with the task version information of the first scheduled task, then the first scheduled task is determined to be unexecutable.

[0009] According to embodiments of this disclosure, determining whether a first scheduled task is executable by comparing the task version information of the first scheduled task with the currently stored task version information further includes: if the mutex flag is empty, then storing the task version information of the first scheduled task in the flag.

[0010] According to an embodiment of this disclosure, the method further includes: after determining that the first scheduling task is executable and before establishing a data snapshot with data version information, clearing the log information of the scheduling task associated with the currently stored task version information.

[0011] According to embodiments of this disclosure, the method further includes: storing task version information for the first scheduled task, configuration information for the first scheduled task, and data version information for the first scheduled task in association.

[0012] According to embodiments of this disclosure, the method further includes: in response to creating a second scheduling task, receiving data version information for the second scheduling task and configuration information for the second scheduling task; extracting a data snapshot matching the received data version information from a previously established data snapshot; and generating a data model for the second scheduling task based on the extracted data snapshot, wherein the data model for the second scheduling task and the configuration information are used for the execution of the second scheduling task.

[0013] According to embodiments of this disclosure, the method further includes: executing the second scheduling task using a data model for the second scheduling task and configuration information for the second scheduling task.

[0014] According to an embodiment of this disclosure, the second scheduling task has task version information, and the method further includes: determining whether the second scheduling task is executable by comparing the task version information of the second scheduling task with currently stored task version information before extracting a data snapshot that matches the received data version information, wherein the operation of extracting a data snapshot that matches the received data version information is performed in response to determining that the second scheduling task is executable.

[0015] According to embodiments of this disclosure, determining whether a second scheduled task is executable by comparing its task version information with the currently stored task version information includes: if the currently stored task version information in the mutex flag is consistent with the task version information of the second scheduled task, then the second scheduled task is determined to be executable; if the currently stored task version information in the mutex flag is inconsistent with the task version information of the second scheduled task, then the second scheduled task is determined to be unexecutable.

[0016] According to embodiments of this disclosure, determining whether a second scheduled task is executable by comparing the task version information of the second scheduled task with the currently stored task version information further includes: if the mutex flag is empty, storing the task version information of the second scheduled task in the flag.

[0017] According to an embodiment of this disclosure, the method further includes: after determining that the second scheduling task is executable and before extracting a data snapshot that matches the received data version information, clearing the log information of the scheduling task associated with the currently stored task version information.

[0018] According to embodiments of this disclosure, the method further includes: storing task version information for the second scheduled task, configuration information for the second scheduled task, and data version information for the second scheduled task in association.

[0019] According to another aspect of this disclosure, a production scheduling system is provided for executing a production scheduling method according to embodiments of this disclosure. The production scheduling system includes: a stored procedure engine for acquiring scheduling data in response to creating a first scheduling task; receiving configuration information for the first scheduling task; establishing a data snapshot with data version information based on the acquired scheduling data; and using the established data snapshot to generate a data model for the first scheduling task, wherein the data model for the first scheduling task and the configuration information are used for the execution of the first scheduling task; a temporary storage database for storing the acquired scheduling data; a base database communicatively connected to the temporary storage database for storing the data snapshot; and a modeling and transformation database communicatively connected to the base database for storing the data model.

[0020] According to embodiments of this disclosure, the system further includes: a scheduling engine for executing the first scheduling task using a data model and configuration information for the first scheduling task.

[0021] According to embodiments of this disclosure, the stored procedure engine is further configured to receive data version information for the second scheduling task and configuration information for the second scheduling task in response to the creation of a second scheduling task, extract a data snapshot matching the received data version information from a previously established data snapshot, and generate a data model for the second scheduling task based on the extracted data snapshot.

[0022] According to embodiments of this disclosure, the scheduling engine is also used to execute the second scheduling task using a data model for the second scheduling task and configuration information for the second scheduling task.

[0023] According to embodiments of this disclosure, the system further includes: a scheduling database, communicatively connected to a modeling transformation database, for storing data for use by the scheduling engine.

[0024] According to embodiments of this disclosure, the system further includes an optimizer database and an optimizer engine, wherein the optimizer database is communicatively connected to a modeling transformation database and is used to store data for use by the optimizer engine.

[0025] According to embodiments of this disclosure, the system further includes: a user interaction engine for receiving configuration information and / or data version information input by the user; a user database, communicatively connected to the user interaction engine and the basic database, for storing user information and user permissions; and a manager for performing highest-level operations in the scheduling system.

[0026] According to another aspect of this disclosure, an electronic device is provided, comprising:

[0027] A memory and a processor, wherein the memory stores instructions executable by the processor, which, when executed by the processor, cause the processor to perform the method described above.

[0028] According to another aspect of this disclosure, a non-transitory computer-readable storage medium is provided storing computer instructions, wherein the computer instructions are used to cause the computer to perform the method described above.

[0029] According to another aspect of this disclosure, a computer program product is provided, including a computer program that, when executed by a processor, implements the method described above.

[0030] It should be understood that the description in this section is not intended to identify key or essential features of the embodiments of this disclosure, nor is it intended to limit the scope of this disclosure. Other features of this disclosure will become readily apparent from the following description. Attached Figure Description

[0031] The accompanying drawings are provided to better understand this solution and do not constitute a limitation of this disclosure. Wherein:

[0032] Figure 1 This is a flowchart of a production scheduling method according to an embodiment of the present disclosure;

[0033] Figure 2 This is a schematic diagram of a method for determining whether a first scheduled task is executable according to an embodiment of the present disclosure;

[0034] Figure 3A This is a flowchart of a method for creating a data snapshot with data version information according to an embodiment of the present disclosure;

[0035] Figure 3B This is a schematic diagram illustrating the process of establishing a data snapshot with data version information according to an embodiment of this disclosure;

[0036] Figure 4 This is a flowchart of a production scheduling method according to another embodiment of the present disclosure;

[0037] Figure 5 This is a block diagram of a production scheduling system according to an embodiment of the present disclosure;

[0038] Figure 6 This is a block diagram of an electronic device used to implement the production scheduling method of the embodiments of this disclosure. Detailed Implementation

[0039] The exemplary embodiments of this disclosure are described below with reference to the accompanying drawings, including various details of the embodiments to aid understanding, and should be considered merely exemplary. Therefore, those skilled in the art will recognize that various changes and modifications can be made to the embodiments described herein without departing from the scope and spirit of this disclosure. Similarly, for clarity and brevity, descriptions of well-known functions and structures are omitted in the following description.

[0040] It should be noted that the sequence numbers of the operations in the following methods are for descriptive purposes only and should not be considered as indicating the execution order of the operations. Unless explicitly stated otherwise, the method does not need to be executed in the exact order shown.

[0041] Figure 1 This is a flowchart of a production scheduling method according to an embodiment of the present disclosure.

[0042] like Figure 1 As shown, the production scheduling method includes operations S110 to S140. The method in this embodiment can be a computer-implemented method.

[0043] In operation S110, in response to the creation of the first scheduled task, scheduling data is obtained.

[0044] According to embodiments of this disclosure, in response to a user creating a first scheduled task, a task version information can be set for the created first scheduled task. This task version information is used to indicate the creation order of the first scheduled task. In embodiments of this disclosure, different first scheduled tasks have corresponding task version information. By setting the task version information of the first scheduled task, versioned data management can be supported, which facilitates subsequent management and querying of scheduled tasks.

[0045] According to embodiments of this disclosure, after a user creates a first scheduled task and its version information, scheduling data can be obtained from an external data source using a program (e.g., a stored procedure) configured in a database (e.g., an Oracle database). This scheduling data includes, but is not limited to, product production paths, raw materials, semi-finished / finished products, production capacity, and inventory information. In one example, various scheduling data can be obtained from an external data source using a corresponding program in the database. This scheduling data can be used to create a data snapshot with version information. For example, the Oracle database's SCMAPP.IF_BZ.export_cell_pi_bor stored procedure can be used to obtain its associated scheduling data. The SCMAPP.IF_BZ.export_cell_pi_bor stored procedure is a program development environment provided by the Oracle database; a computer can execute program instructions developed based on the SCMAPP.IF_BZ.export_cell_pi_bor stored procedure to obtain scheduling data. Similarly, other Oracle database stored procedures can be used to obtain other scheduling data, which will not be elaborated here.

[0046] In operation S120, configuration information for the first scheduled task is received.

[0047] According to embodiments of this disclosure, configuration information is used to define scheduling tasks, including but not limited to configuration parameters for indicators such as limited or unlimited capacity, materials, order delivery dates, and inventory. These configuration parameters include, but are not limited to, priority, demand parameters, and process parameters. The configuration information will influence the scheduling logic in subsequent production scheduling, thereby enabling scheduling that meets different needs based on different configuration information. For example, each piece of configuration information may include: material capacity strategy, demand parameters, virtual line switch, optimizer suggestions, and order cycle strategy. Material capacity strategy includes, but is not limited to, capacity limit parameters and material limit parameters, such as a capacity limit parameter of "limited capacity" and a material limit parameter of "limited materials." Demand parameters include, but are not limited to, total demand months and plan offset days. Virtual line switch includes, but is not limited to, indications regarding whether to use virtual lines and indications regarding whether to enable all resources for overcapacity orders. Optimizer suggestions include, but are not limited to, available strategies for each plant: line type and plant type. Order cycle strategy includes the cycle value for each plant. Once a user has completed the configuration settings for the above parameters for a scheduled task, a configuration record is generated. This record can be identified and stored in the database for later selection and use.

[0048] In one example, the configuration information for the first scheduled task could be set by the user through a user interface, or it could be the configuration information that matches the first scheduled task selected by the user from multiple pre-set configuration information; there are no limitations on this. After obtaining the configuration information for the first scheduled task, this configuration information can be saved to the database.

[0049] Suppose the user has previously set multiple configuration information entries, as shown in Table 1, which are identified as CFG_MP_20211231_001, CFG_MP_20211101_002, and CFG_MP_20211103_003, respectively. Those skilled in the art should understand that these identifiers are only used to distinguish different configuration information entries and do not represent the content of the configuration information. These identifiers can be set in any other way as needed. Each configuration information entry may include at least some of the configuration parameters described above. A configuration information entry matching the first scheduled task MP_20211103_001 can be selected from the multiple configuration information entries shown in Table 1 as the configuration information for the first scheduled task MP_20211103_001. For example, configuration information CFG_MP_20211231_001 can be selected as the configuration information for the first scheduled task. Then save the configuration information CFG_MP_20211231_001 to the Oracle database so that the first scheduled task can be executed based on this configuration information later.

[0050] Configuration information CFG_MP_20211231_001 CFG_MP_20211101_002 CFG_MP_20211103_003

[0051] Table 1

[0052] In operation S130, a data snapshot with data version information is created based on the acquired scheduling data.

[0053] For example, data version information can be generated based on the acquired scheduling data, and the data version information can be combined with the acquired scheduling data to form a data snapshot. A data snapshot can be a fully usable copy of a specified data set, including an image of the corresponding data at a certain point in time. The data snapshot can be stored in a snapshot table, distinguished from the source data table, thereby enabling simultaneous access to both the snapshot table and the source data table without affecting the continuous updating of business data in the source data. In embodiments of this disclosure, a data snapshot with data version information can be one in which a corresponding data version number is added for data differentiation. In operation S140, the established data snapshot is used to generate a data model for a first scheduling task, wherein the data model and configuration information for the first scheduling task are used for the execution of the first scheduling task.

[0054] According to embodiments of this disclosure, since the data snapshot stores the most original data, the original data can be modeled and transformed to facilitate scheduling logic processing, so as to be processed into a data structure that the backend engine can recognize. User scheduling requirements, such as production constraints and order priority ranking, can be reflected in the constructed data model. In some embodiments, unnecessary scheduling data can be filtered out during the modeling process, such as unnecessary factory data (e.g., color filter substrate factory data) and non-critical material data. In some embodiments, the bill of materials (BOM) can also be simplified. In this way, the model size can be reduced, thereby improving modeling efficiency and shortening modeling time. After data modeling is completed, the data model can be temporarily stored in a modeling table and transferred to the corresponding target table when needed. At this point, the data preparation work is complete. The first scheduling task described above can be executed based on the established data model.

[0055] In some embodiments, the method may further include operation S150. In operation S150, the first scheduling task is executed using a data model and configuration information for the first scheduling task. Operation S150 may be executed after operation S140.

[0056] For example, the established data model may include the relationship between semi-finished products and the production resources, materials and processes used to produce semi-finished products, the relationship between finished products and the production resources, materials and processes used to produce finished products, and the relationship between finished products and semi-finished products.

[0057] Based on the data model and configuration information, various methods can be used to execute the first scheduling task. For example, production scheduling can be performed on products using a linear programming model, resulting in multiple first entries. Each first entry includes the product's production date, production quantity, and corresponding production resources, etc. The constraints and objective function for bottleneck processes in the linear programming model can be determined based on the configuration information. Then, multiple first entries corresponding to the same product with production dates falling within the same time range can be merged into a second entry. The second entry includes the production quantity of the same product within a time range. For each product in the second entry, the corresponding orders are obtained and sorted according to at least one of the order delivery date and order priority, resulting in an order ranking result. The production requirements for each process can be extracted from each order, including the quantity of finished or semi-finished products planned to be produced through that process. Based on the data model and order ranking result, the production requirements of each order can be allocated to the corresponding production resources and production time periods, thereby determining the production requirements of each production resource in each production time period.

[0058] According to embodiments of this disclosure, a data snapshot with data version information is generated by creating a scheduling task. This data snapshot with version information facilitates data version management at the database level and makes it easier to compare different versions of data. Furthermore, the data snapshot with version information can be used for other scheduling tasks without having to re-fetch data for each scheduling session, thus improving scheduling efficiency. The configurable approach makes the system more user-friendly and can significantly reduce time. In some embodiments, the actual running time of the computer executing the above method can not exceed 10 minutes, effectively improving work efficiency compared to existing scheduling methods.

[0059] In some embodiments, prior to step 130 above, the user's scheduling execution permission (also known as executability) can be verified to prevent multiple users from executing the same schedule simultaneously. According to embodiments of this disclosure, the executability of the first scheduled task can be determined by comparing the task version information of the first scheduled task with the currently stored task version information. If the first scheduled task is executable, it means that the user has permission to execute the first scheduled task, and the user can continue to perform the operation of creating a data snapshot with data version information based on the acquired scheduling data; otherwise, it means that another user is already executing the first scheduled task, and the user does not have permission to continue executing the first scheduled task, i.e., the first scheduled task is not executable. According to embodiments of this disclosure, the executability of the first scheduled task can be determined by checking the mutex flag in the Oracle database. For example, the executability of the first scheduled task can be determined by judging whether the currently stored task version information in the mutex flag is consistent with the task version information of the first scheduled task.

[0060] The following will refer to Figure 2 The process of determining whether the first scheduled task is executable is explained.

[0061] Figure 2 This is a schematic diagram of a method for determining whether a first scheduling task is executable according to an embodiment of the present disclosure.

[0062] like Figure 2 As shown, the method for determining whether the first scheduled task is executable includes operations S210 to S260.

[0063] In operation S210, determine whether the mutex flag is empty. If it is, then execute operation S220; otherwise, execute operation S230.

[0064] In operation S220, the task version information of the first scheduled task is stored in the mutex flag.

[0065] If the mutex flag is empty, it means that no other user is currently executing a scheduling task. In other words, the user has scheduling execution privileges and can continue to perform the operation of creating a data snapshot with data version information based on the acquired scheduling data.

[0066] Once a user obtains scheduling execution permission, they can store the task version information of the current scheduled task (the first scheduled task in this embodiment) in the mutex flag to update the state of the mutex flag. The task version information stored in the mutex flag can be used to verify the user's scheduling execution permission, thereby preventing other users from executing the same scheduled task simultaneously.

[0067] In operation S230, it is determined whether the task version information currently stored in the mutex flag is consistent with the task version information of the first scheduled task. If yes, operation S240 is executed; otherwise, operation S250 is executed.

[0068] According to embodiments of this disclosure, it can be determined whether the first scheduled task is executable based on whether the task version information currently stored in the mutex flag is consistent with the task version information of the first scheduled task. If yes, operation S240 is executed; if no, operation S250 is executed.

[0069] In operation S240, it was determined that the first scheduled task is executable.

[0070] After determining that the first scheduled task is executable, the above operation S130 can be performed to create a data snapshot with data version information based on the acquired scheduling data.

[0071] In some embodiments, after determining that the first scheduling task is executable and before establishing a data snapshot with data version information, the log information of the scheduling task associated with the currently stored task version information can be cleared. Scheduling tasks generate log information during execution, which is used to analyze system operating status and bottlenecks, facilitating program diagnosis and improvement. However, after a scheduling task completes, this log information is useless for new scheduling tasks. Embodiments of this disclosure can avoid the log information of previous scheduling tasks occupying storage space or causing unnecessary inconvenience to users by clearing this log information.

[0072] When operating S250, it was determined that the first scheduled task was not executable.

[0073] After determining that the first scheduled task is not executable, a verification failure message can be returned and the process terminated. In some embodiments, after determining that the first scheduled task is not executable, operation S210 can be returned to continue waiting until execution permission is obtained.

[0074] Figure 3A This is a flowchart of a method for creating a data snapshot with data version information according to an embodiment of the present disclosure; Figure 3B This is a schematic diagram illustrating the process of establishing a data snapshot with data version information according to an embodiment of this disclosure.

[0075] like Figure 3A As shown, the method for creating a data snapshot with data version information includes operations S331 to S332.

[0076] In operation S331, data version information is generated based on the acquired scheduling data.

[0077] For example, a data version number MST_001 can be generated as the data version information for the scheduling data. The data version information is used to distinguish different versions of the scheduling data and can be set to any other form as needed; the embodiments of this disclosure do not limit this.

[0078] In operation S332, the data version information is combined with the acquired scheduling data to form a data snapshot.

[0079] In the embodiments of this disclosure, combining the data version information with the acquired scheduling data to form a data snapshot can be achieved by writing the data version information at the same time as generating the data snapshot. The data snapshot can be implemented by copy on write (COW), input / output redirection (I / ORedirect), or other methods, which are not limited in this disclosure.

[0080] The data snapshot generation method of this disclosure embodiment will be described below. The acquired scheduling data may include multiple data tables, each data table includes multiple data entries, and each data entry includes multiple data items. For example, each row in the data table can be considered as a data entry, and each column in a row can be considered as a data item of that entry. For example, a data entry may include at least some of the following data items: item_org_id, ITEM_ID, ITEM_NAME, UOM, ITEM_TYPE, ITEM_GR, ITEM_GR_NAME, etc. For example, item_org_id represents the data item source identifier, ITEM_ID represents the data item identifier, ITEM_NAME represents the data item name, UOM represents the unit of measurement, ITEM_TYPE represents the data item type, ITEM_GR represents the data item producer, etc., which will not be described in detail here.

[0081] After generating data version information for the scheduling data, this information can be added to each data entry in each table of the scheduling data, for example, by adding it before each data entry. In this way, multiple data snapshot tables with data version information are obtained. These data snapshot tables with version information can then be stored as data snapshots in the database.

[0082] For example, such as Figure 3BAs shown, a data entry in one of the multiple data tables storing scheduling data in temporary database 301 may include data items DATA1, DATA2, and DATA3. The data version number MST 001 can be combined with the data items DATA1, DATA2, and DATA3 of this data entry to obtain a data entry with a data version number. By performing the above operation on each data entry in each data table, a data snapshot with a data version number can be obtained. This data snapshot with a data version number can be stored in the base database 302 (also called the data snapshot area) so that a data model can be generated subsequently based on the established data snapshot.

[0083] In some embodiments, after obtaining a data snapshot with data version information, the task version information and configuration information of the first scheduled task obtained above can be associated and stored with the data snapshot with data version information.

[0084] The above describes the data processing and execution of the first scheduling task. During this process, the latest scheduling data is fetched from an external data source for the first scheduling task, and a data snapshot with version information is created. In this way, multiple versions of data snapshots can be generated during the execution of multiple first scheduling tasks. In some embodiments, previously generated data snapshots can be used for other subsequently created scheduling tasks (also called second scheduling tasks) without having to fetch new scheduling data from an external data source, thereby improving work efficiency. The following will refer to... Figure 4 To describe the process.

[0085] Figure 4 This is a flowchart of a production scheduling method according to another embodiment of the present disclosure.

[0086] like Figure 4 As shown, the production scheduling method includes operations S400 to S430.

[0087] When operating S400, the production scheduling described above can be executed for the first scheduled task, generating a data snapshot with data version information during execution. For example, the above reference can be executed for multiple first scheduled tasks separately. Figures 1 to 3B The described method and steps result in multiple data snapshots with data version information.

[0088] When operating S410, in response to the creation of a second scheduled task, it receives data version information and configuration information for the second scheduled task.

[0089] After a user creates a second scheduled task, they can set a task version information for that task. The method for setting the task version information for the second scheduled task is the same as or similar to the process for setting the task version information for the first scheduled task, and will not be repeated here.

[0090] According to embodiments of this disclosure, the so-called second scheduling task can be, for example, a task that has already undergone scheduling operations. After the user creates the second scheduling task, the user can select data version information and configuration information for the second scheduling task through a user interface. This user interface displays multiple data version information as shown in Table 2, such as data version numbers DS_MP_20221103_001, DS_MP_20221203_001, and DS_MP_20221003_001. The user can select one data version information, for example, data version number DS_MP_20221103_001, as the data version information for the second scheduling task. In a similar manner, users can also select the configuration information for the second scheduled task from the multiple configuration information CFG_MP_20211101_001, CFG_MP_20211201_002 and CFG_MP_20211203_003 shown in Table 3. For example, users can select CFG_MP_20211101_001 as the configuration information to be used by the second scheduled task.

[0091] Data version information DS_MP_20221103_001 DS_MP_20221203_001 DS_MP_20221003_001

[0092] Table 2

[0093] Configuration information CFG_MP_20211101_001 CFG_MP_20211201_002 CFG_MP_20211203_003

[0094] Table 3

[0095] In operation S420, a data snapshot matching the received data version information is extracted from the previously established data snapshot. For example, assuming that the user-selected data version number DS_MP_20221103_001 is received in step S410, then in this step, a data snapshot with the data version number DS_MP_20221103_001 can be extracted from one or more data snapshots stored in the base database.

[0096] To prevent multiple users from executing the same schedule simultaneously, the user's schedule execution permission can be verified before step S420. According to embodiments of this disclosure, the executable nature of the second scheduled task can be determined by comparing its version information with the currently stored version information. If the second scheduled task is determined to be executable, an operation to extract a data snapshot matching the received version information is performed; otherwise, the second scheduled task is determined to be non-executable. For example, this can be done according to the above reference... Figure 2 The execution permission of the second scheduled task is verified in a similar manner. If the task version information currently stored in the mutex flag matches the task version information of the second scheduled task, the second scheduled task is determined to be executable; if the task version information currently stored in the mutex flag does not match the task version information of the second scheduled task, the second scheduled task is determined to be inexecutable. In some embodiments, if the mutex flag is empty, it indicates that the user has scheduling execution permission and can continue to perform the operation of creating a data snapshot with data version information based on the acquired scheduling data. After the user obtains scheduling execution permission, the task version information of the first scheduled task can be stored in the mutex flag to update the status of the mutex flag. The task version information of the first scheduled task stored in the mutex flag can be used to verify the scheduling execution permissions of other users, thereby preventing the possibility of other users executing the same scheduled task simultaneously.

[0097] According to embodiments of this disclosure, after determining that the second scheduling task is executable and before extracting a data snapshot that matches the received data version information, the log information of the scheduling task associated with the currently stored task version information can be cleared to avoid the log information of previous scheduling tasks occupying storage space.

[0098] According to embodiments of this disclosure, the task version information of the second scheduled task, the configuration information for the second scheduled task, and the data version information for the second scheduled task can be stored together.

[0099] In operation S430, a data model for the second scheduling task is generated based on the extracted data snapshot. This step can be implemented in the same way as operation S140 described above, and will not be repeated here.

[0100] In some embodiments, the method may further include operation S440. In operation S440, the second scheduling task is executed using a data model for the second scheduling task and configuration information for the second scheduling task. Operation S440 may be executed after operation S430. Operation S440 may be implemented in the same manner as operation S150 described above, and will not be repeated here.

[0101] According to embodiments of this disclosure, based on data version information management and querying, the efficiency of processing scheduling data is further improved by using previously established data snapshots with different data version information for other future production plans.

[0102] Embodiments of this disclosure also provide a production scheduling system. Reference will be made below. Figure 5 Explain the production scheduling system.

[0103] Figure 5 This is a block diagram of a production scheduling system according to an embodiment of the present disclosure.

[0104] like Figure 5 As shown, the production scheduling system includes a stored procedure engine 501, a temporary database 503, a basic database 504, and a modeling and transformation database 505.

[0105] The stored procedure engine 501 can obtain scheduling data in response to the creation of the first scheduled task, receive configuration information for the first scheduled task, build a data snapshot with data version information based on the obtained scheduling data, and use the built data snapshot to generate a data model for the first scheduled task.

[0106] The temporary storage database 503 can acquire and temporarily store data from data sources such as legacy systems. For example, it can be used to store acquired scheduling data. The scheduling data in the temporary storage database 503 does not have data version information. The base database 504 communicates with the temporary storage database 503 and is used to store data snapshots. The modeling transformation database 505 communicates with the base database 504 and is used to store data models.

[0107] According to embodiments of this disclosure, the production scheduling system may further include a scheduling engine 502. The scheduling engine 502 is communicatively connected to the stored procedure engine 501 via a gateway 508. The scheduling engine 502 can use a data model and configuration information for the first scheduling task to execute the first scheduling task. The scheduling engine 502 may be a T3SupplyNet scheduling engine, which is a background program for production scheduling and can be used for, but is not limited to, basic data verification, production plan simulation, plan report analysis, factory capacity utilization analysis, etc.

[0108] According to embodiments of this disclosure, the stored procedure engine 501 can also receive data version information and configuration information for the second scheduled task in response to the creation of a second scheduled task, extract a data snapshot matching the received data version information from a previously established data snapshot, and generate a data model for the second scheduled task based on the extracted data snapshot. The scheduling engine 502 can also use the data model and configuration information for the second scheduled task to execute the second scheduled task.

[0109] According to embodiments of this disclosure, the production scheduling system described above may further include a scheduling database 506. The scheduling database 506 is communicatively connected to the modeling transformation database 505 and is used to store data for use by the scheduling engine 502. In some embodiments, the scheduling database 506 may also be used to store data from the scheduling engine 502, such as various data generated by the scheduling engine 502 during processing.

[0110] According to embodiments of this disclosure, the production scheduling system described above may further include an optimizer engine 509 and an optimizer database 510. The optimizer database 510 is communicatively connected to the modeling transformation database 505 and is used to store data for use by the optimizer engine 509. In some embodiments, the optimizer database 510 may also be used to store data from the optimizer engine 509, such as various data generated by the optimizer engine 509 during processing.

[0111] According to embodiments of this disclosure, the production scheduling system described above may further include a manager 507, a user database 511, and a user interaction engine 512. The user interaction engine 512 is used to implement human-computer interaction and, in some embodiments, may be implemented as a user interface (UI) or a terminal device with a user interface display function, such as a client. For example, the user interaction engine 512 is used to receive configuration information and / or data version information input by the user. The user database 511 is communicatively connected to the user interaction engine 512 and the basic database 504, and is used to store user information and user permissions. The manager 507 is used to perform highest-level operations in the production scheduling system.

[0112] For example, when a user creates the first scheduled task, the stored procedure engine 501 can retrieve scheduling data from the temporary database 503, receive configuration information input by the user through the user interaction engine 512, create a data snapshot with data version information based on the scheduling data, and store it in the base database 504. The data snapshot is then used to generate a data model, which is stored in the modeling transformation database 505. The data model in the modeling transformation database 505 can be transformed into data suitable for the optimizer engine 509 and stored in the optimizer database 510, and can also be transformed into data suitable for the scheduling engine 502 and stored in the scheduling database 506. The scheduling engine 502 can retrieve the data model and configuration information for the first scheduled task from the scheduling database 506 to execute the first scheduled task. This completes the execution of the first scheduled task. During this process, a data snapshot with a data version number is created and stored in the base database 504 for subsequent use.

[0113] When a user creates a second scheduled task, the stored procedure engine 501 can receive data version information and configuration information for the second scheduled task from the user interaction engine 512. The stored procedure engine 501 can extract a data snapshot matching the received data version information from the base database 504, generate a data model for the second scheduled task based on the extracted data snapshot, and store it in the modeling transformation database 505. Similarly, the scheduling engine 502 can use the data model and configuration information for the second scheduled task to execute the second scheduled task.

[0114] In some embodiments, when a user creates a first scheduled task and a second scheduled task simultaneously, the stored procedure engine 501 can interact with the user regarding the first and second scheduled tasks to obtain configuration information and / or data version information input by the user for the first and second scheduled tasks respectively. Then, the stored procedure engine 501 generates a data model for the first scheduled task in a manner similar to that described above, and the scheduling engine 502 executes the first scheduled task based on the data model and configuration information. After completing the execution of the first scheduled task, the stored procedure engine 501 generates a data model for the second scheduled task in a manner similar to that described above, and the scheduling engine 502 executes the second scheduled task based on the data model and configuration information. The scheduling data obtained in the above process is stored in a temporary database 503, the generated data snapshot is stored in a base database 504, and the generated data model is stored in a modeling and transformation database 505.

[0115] In some embodiments, during the execution of scheduling tasks (including first and second scheduling tasks), the optimizer engine 509 and the scheduling engine 502 can work together. For example, the optimizer engine 509 can be used for preliminary scheduling, and then the scheduling engine 502 can be used for fine-grained scheduling to improve the accuracy of the scheduling results. Taking the above scheduling method as an example, the optimizer engine 509 can be used to perform preliminary scheduling of products based on a linear programming solution model to obtain multiple first entries. Each first entry includes the product's production date, production quantity, and corresponding production resources, etc. The constraints and objective function for bottleneck processes in the linear programming solution model can be determined based on configuration information. Then, the multiple first entries can be merged into a second entry to achieve product sorting, and the orders for the product can be sorted according to at least one of the order delivery date and order priority. Subsequently, the scheduling engine 502 can be used to perform fine-grained scheduling on the order sorting results. For example, the production requirements of each process can be extracted from each order, and the production requirements of each order can be allocated to the corresponding production resources and production time periods based on the data model and order sorting results, thereby determining the production requirements corresponding to each production resource in each production time period.

[0116] It should be noted that the implementation methods, technical problems solved, functions achieved, and technical effects of each module / unit / subunit in the device embodiments are the same as or similar to the implementation methods, technical problems solved, functions achieved, and technical effects of each corresponding step in the method embodiments, and will not be repeated here.

[0117] The collection, storage, use, processing, transmission, provision, and disclosure of user personal information in this technical solution comply with relevant laws and regulations and do not violate public order and good morals. Furthermore, in this technical solution, user authorization or consent is obtained before acquiring or collecting user personal information.

[0118] According to embodiments of this disclosure, this disclosure also provides an electronic device, a readable storage medium, and a computer program product.

[0119] Figure 6 A block diagram schematically illustrates an electronic device suitable for implementing an information identification method according to an embodiment of the present disclosure.

[0120] like Figure 6As shown, an electronic device 600 according to an embodiment of this disclosure includes a processor 601, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 602 or a program loaded from a storage portion 608 into a random access memory (RAM) 603. The processor 601 may include, for example, a general-purpose microprocessor (e.g., a CPU), an instruction set processor and / or an associated chipset and / or a special-purpose microprocessor (e.g., an application-specific integrated circuit (ASIC)), etc. The processor 601 may also include onboard memory for caching purposes. The processor 601 may include a single processing unit or multiple processing units for performing different actions of the method flow according to an embodiment of this disclosure.

[0121] RAM 603 stores various programs and data required for the operation of electronic device 600. Processor 601, ROM 602, and RAM 603 are interconnected via bus 604. Processor 601 performs various operations of the method flow according to embodiments of the present disclosure by executing programs in ROM 602 and / or RAM 603. It should be noted that the programs may also be stored in one or more memories other than ROM 602 and RAM 603. Processor 601 may also perform various operations of the method flow according to embodiments of the present disclosure by executing programs stored in said one or more memories.

[0122] According to embodiments of this disclosure, the electronic device 600 may further include an input / output (I / O) interface 605, which is also connected to a bus 604. The electronic device 600 may also include one or more of the following components connected to the I / O interface 605: an input section 606 including a keyboard, mouse, etc.; an output section 607 including a cathode ray tube (CRT), liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 608 including a hard disk, etc.; and a communication section 609 including a network interface card such as a LAN card, modem, etc. The communication section 609 performs communication processing via a network such as the Internet. A drive 610 is also connected to the I / O interface 605 as needed. A removable medium 611, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., is installed on the drive 610 as needed so that computer programs read from it can be installed into the storage section 608 as needed.

[0123] This disclosure also provides a computer-readable storage medium, which may be included in the device / apparatus / system described in the above embodiments; or it may exist independently and not assembled into the device / apparatus / system. The computer-readable storage medium carries one or more programs that, when executed, implement the method according to the embodiments of this disclosure.

[0124] According to embodiments of this disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, such as including, but not limited to: portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof. In this disclosure, the computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. For example, according to embodiments of this disclosure, the computer-readable storage medium may include ROM 602 and / or RAM 603 and / or one or more memories other than ROM 602 and RAM 603 described above.

[0125] Embodiments of this disclosure also include a computer program product comprising a computer program containing program code for performing the methods shown in the flowchart. When the computer program product is run on a computer system, the program code is used to cause the computer system to implement the production scheduling method provided in the embodiments of this disclosure.

[0126] When the computer program is executed by the processor 601, it performs the functions defined in the system / apparatus of this disclosure embodiments. According to embodiments of this disclosure, the systems, apparatuses, modules, units, etc., described above can be implemented by computer program modules.

[0127] In one embodiment, the computer program may rely on a tangible storage medium such as an optical storage device or a magnetic storage device. In another embodiment, the computer program may also be transmitted and distributed in the form of signals over a network medium, and downloaded and installed via the communication section 609, and / or installed from the removable medium 611. The program code contained in the computer program can be transmitted using any suitable network medium, including but not limited to: wireless, wired, etc., or any suitable combination thereof.

[0128] In such an embodiment, the computer program can be downloaded and installed from a network via the communication section 609, and / or installed from the removable medium 611. When the computer program is executed by the processor 601, it performs the functions defined in the system of this disclosure embodiment. According to embodiments of this disclosure, the systems, devices, apparatuses, modules, units, etc., described above can be implemented by computer program modules.

[0129] According to embodiments of this disclosure, program code for executing the computer programs provided in embodiments of this disclosure can be written in any combination of one or more programming languages. Specifically, these computational programs can be implemented using high-level procedural and / or object-oriented programming languages, and / or assembly / machine languages. Programming languages ​​include, but are not limited to, languages ​​such as Java, C++, Python, "C", or similar programming languages. The program code can execute entirely on the user's computing device, partially on the user's device, partially on a remote computing device, or entirely on a remote computing device or server. In cases involving remote computing devices, the remote computing device can be connected to the user's computing device via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0130] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this disclosure. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in a block diagram or flowchart, and combinations of blocks in a block diagram or flowchart, may be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0131] Those skilled in the art will understand that the features described in the various embodiments and / or claims of this disclosure can be combined or combined in various ways, even if such combinations or combinations are not explicitly described in this disclosure. In particular, the features described in the various embodiments and / or claims of this disclosure can be combined or combined in various ways without departing from the spirit and teachings of this disclosure. All such combinations and / or combinations fall within the scope of this disclosure.

[0132] The embodiments of this disclosure have been described above. However, these embodiments are for illustrative purposes only and are not intended to limit the scope of this disclosure. Although various embodiments have been described above, this does not mean that the measures in the various embodiments cannot be used advantageously in combination. The scope of this disclosure is defined by the appended claims and their equivalents. Various substitutions and modifications can be made by those skilled in the art without departing from the scope of this disclosure, and all such substitutions and modifications should fall within the scope of this disclosure.

Claims

1. A production scheduling method, comprising: In response to the creation of the first scheduled task, retrieve the scheduling data; Receive configuration information for the first scheduled task; Create a data snapshot with data version information based on the acquired scheduling data; as well as Use the created data snapshot to generate a data model for the first scheduled task; Based on the data model and the configuration information, the first scheduled task is executed, including: Based on the linear programming solution model, the production schedule of the products indicated by the scheduling data is performed to obtain multiple first entries. The constraints and objective function for the bottleneck process in the linear programming solution model are determined according to the configuration information. The first entries include at least the production date, production quantity and corresponding production resources of the product. Multiple first entries corresponding to the same product with the same production date in the same production period are merged into a second entry, wherein the second entry includes the production quantity of the same product in one production period; For each product in the second entry, obtain the order corresponding to the product and sort the orders of the product according to at least one of the order delivery date and order priority to obtain the order sorting result; Based on the data model and the order sorting results, the production requirements of each order are allocated to the corresponding production resources and production time periods to determine the production requirements of each production resource in each production time period.

2. The method according to claim 1, further comprising: The first scheduled task is executed using the data model and configuration information specific to the first scheduled task.

3. The method according to claim 1, wherein, The process of creating a data snapshot with data version information based on the acquired scheduling data includes: The data version information is generated based on the acquired scheduling data; The data version information is combined with the acquired scheduling data to form a data snapshot.

4. The method according to any one of claims 1 to 3, wherein, The first scheduled task has task version information, and the method further includes: before establishing a data snapshot with data version information based on the acquired scheduling data, determining whether the first scheduled task is executable by comparing the task version information of the first scheduled task with the currently stored task version information, wherein the operation of establishing a data snapshot with data version information based on the acquired scheduling data is performed in response to determining that the first scheduled task is executable.

5. The method according to claim 4, wherein, The step of determining whether the first scheduled task is executable by comparing the task version information of the first scheduled task with the currently stored task version information includes: If the task version information currently stored in the mutex flag is consistent with the task version information of the first scheduled task, then the first scheduled task is determined to be executable. If the task version information currently stored in the mutex flag is inconsistent with the task version information of the first scheduled task, then the first scheduled task is determined to be unexecutable.

6. The method according to claim 5, wherein, The step of determining whether the first scheduled task is executable by comparing the task version information of the first scheduled task with the currently stored task version information further includes: If the mutex flag is empty, the task version information of the first scheduled task is stored in the flag.

7. The method according to claim 4, further comprising: After determining that the first scheduling task is executable and before creating a data snapshot with data version information, clear the log information of the scheduling task associated with the currently stored task version information.

8. The method according to claim 1, further comprising: The task version information, configuration information, and data version information for the first scheduled task are stored together.

9. The method according to claim 1, further comprising: In response to the creation of a second scheduled task, receive data version information and configuration information for the second scheduled task; Extract the data snapshot that matches the received data version information from the previously created data snapshot; and A data model for the second scheduling task is generated based on the extracted data snapshot, wherein the data model for the second scheduling task and the configuration information are used for the execution of the second scheduling task.

10. The method of claim 9, further comprising: The second scheduling task is executed using the data model and configuration information for the second scheduling task.

11. The method according to claim 9, wherein, The second scheduled task has task version information, and the method further includes: before extracting a data snapshot that matches the received data version information, determining whether the second scheduled task is executable by comparing the task version information of the second scheduled task with the currently stored task version information, wherein the operation of extracting the data snapshot that matches the received data version information is performed in response to determining that the second scheduled task is executable.

12. The method according to claim 11, wherein, The step of determining whether the second scheduled task is executable by comparing its version information with the currently stored version information includes: If the task version information currently stored in the mutex flag is consistent with the task version information of the second scheduled task, then the second scheduled task is determined to be executable. If the task version information currently stored in the mutex flag is inconsistent with the task version information of the second scheduled task, then the second scheduled task is determined to be unexecutable.

13. The method according to claim 12, wherein, The step of determining whether the second scheduled task is executable by comparing the task version information of the second scheduled task with the currently stored task version information further includes: If the mutex flag is empty, the task version information of the second scheduled task is stored in the flag.

14. The method according to any one of claims 11 to 13, further comprising: After determining that the second scheduling task is executable and before extracting a data snapshot that matches the received data version information, clear the log information of the scheduling task associated with the currently stored task version information.

15. The method of claim 9, further comprising: The task version information, configuration information, and data version information for the second scheduled task are stored together.

16. A production scheduling system for performing the method as described in any one of claims 1 to 15, said production scheduling system comprising: The stored procedure engine is used to retrieve scheduling data in response to the creation of the first scheduled task; Receive configuration information for the first scheduled task; Create a data snapshot with data version information based on the acquired scheduling data; Use the created data snapshot to generate a data model for the first scheduled task; Based on the data model and the configuration information, the first scheduled task is executed, including: Based on the linear programming solution model, the production schedule of the products indicated by the scheduling data is performed to obtain multiple first entries. The constraints and objective function for the bottleneck process in the linear programming solution model are determined according to the configuration information. The first entries include at least the production date, production quantity and corresponding production resources of the product. Multiple first entries corresponding to the same product with the same production date in the same production period are merged into a second entry, wherein the second entry includes the production quantity of the same product in one production period; For each product in the second entry, obtain the order corresponding to the product and sort the orders of the product according to at least one of the order delivery date and order priority to obtain the order sorting result; Based on the data model and the order sorting results, the production requirements of each order are allocated to the corresponding production resources and production time periods to determine the production requirements of each production resource in each production time period. A temporary database is used to store the acquired scheduling data; A base database, which is communicatively connected to the temporary storage database, is used to store the data snapshots; The modeling and transformation database is connected to the base database and is used to store the data model.

17. The production scheduling system according to claim 16, further comprising: A scheduling engine is used to execute the first scheduled task using a data model and configuration information specific to the first scheduled task.

18. The production scheduling system according to claim 17, wherein, The stored procedure engine is also configured to receive data version information and configuration information for the second scheduled task in response to the creation of the second scheduled task, extract a data snapshot matching the received data version information from a previously established data snapshot, and generate a data model for the second scheduled task based on the extracted data snapshot, wherein the data model and configuration information for the second scheduled task are used for the execution of the second scheduled task.

19. The production scheduling system according to claim 18, wherein, The scheduling engine is also used to execute the second scheduling task using a data model for the second scheduling task and configuration information for the second scheduling task.

20. The production scheduling system according to claim 17, further comprising: The scheduling database, which is communicatively connected to the modeling and transformation database, is used to store data for use by the scheduling engine.

21. The production scheduling system according to claim 16, further comprising: An optimizer database and an optimizer engine, wherein the optimizer database is communicatively connected to the modeling transformation database and is used to store data for use by the optimizer engine.

22. The scheduling system according to claim 16, further comprising: The user interaction engine is used to receive configuration information and / or data version information input by the user. The user database is communicatively connected to the user interaction engine and the basic database, and is used to store user information and user permissions. as well as The manager is used to perform highest-privilege operations in the scheduling system.

23. An electronic device comprising a memory and a processor, the memory storing instructions executable by the processor, the instructions, when executed by the processor, causing the processor to perform the method as described in any one of claims 1 to 15.

24. A non-transitory computer-readable storage medium storing computer instructions, wherein, The computer instructions are used to cause the computer to perform the method according to any one of claims 1 to 15.

25. A computer program product comprising a computer program that, when executed by a processor, implements the method according to any one of claims 1 to 15.

Citation Information

Patent Citations

  • Data acquisition and processing method and system suitable for factory automatic production scheduling

    CN111913943A