Task scheduling method, device and equipment, readable storage medium and program product

Abstract

The invention relates to a task scheduling method and device, computer equipment, a computer readable storage medium and a computer program product. The method comprises the steps of obtaining a scheduling request, wherein the scheduling request comprises to-be-scheduled document information and component information related to a production mode and a process scene related to the scheduling request; acquiring a data preprocessing component and a scheduling component from a pre-configured component library according to the component information; determining process route information from a scheduling database on the basis of the data preprocessing component and the document information, respectively acquiring a main resource model and a production layout model related to the document information from a pre-configured main resource model library and a production layout model library on the basis of the process route information, and determining a task to be scheduled on the basis of the document information; and on the basis of the main resource model, the production layout model and the scheduling component, scheduling processing is performed on the to-be-scheduled task to obtain a scheduling result corresponding to the scheduling request, so that the scheduling efficiency is improved.

Description

Technical Field

[0001] The present application relates to the technical field of production scheduling, and in particular to a task scheduling method, apparatus, computer equipment, computer-readable storage medium, and computer program product. Background Art

[0002] With the rapid development of the Internet of Things and big data technologies, intelligent manufacturing has become an inevitable trend in the transformation and upgrading of the manufacturing industry. In this environment, when implementing APS (Advanced Planning Scheduling), discrete manufacturing usually needs to sort out the various aspects of the on-site business of people, machines, materials, methods, and environment to extract the various constraints and optimization goals involved in scheduling. Then, according to the constraints and optimization goals, accurate modeling and parameter setting of scheduling and dispatching algorithms can be achieved, thereby ensuring that the results are in line with production reality.

[0003] In related technologies, it is usually necessary for experts who are familiar with on-site business and scheduling algorithm experts to jointly modify the scheduling and dispatching algorithms, and schedule based on the modified algorithms. However, every time an expert arrives at a site, the algorithm needs to be manually adjusted by the experts, which is extremely dependent on the knowledge, ability and experience level of the implementers, and it is impossible to quickly schedule tasks, resulting in a decrease in task scheduling efficiency. Summary of the invention

[0004] Based on this, it is necessary to provide a task scheduling method, apparatus, computer equipment, computer-readable storage medium and computer program product that can improve task scheduling efficiency in response to the above technical problems.

[0005] In a first aspect, the present application provides a task scheduling method, comprising:

[0006] Obtaining a scheduling request, wherein the scheduling request includes document information to be scheduled and component information related to a production mode and a process scenario involved in the scheduling request;

[0007] According to the component information, a data preprocessing component and a scheduling component are obtained from a preconfigured component library;

[0008] Based on the data preprocessing component and the document information, process route information is determined from a scheduling database, and based on the process route information, a master resource model and a production layout model related to the document information are respectively obtained from a pre-configured master resource model library and a production layout model library, and a task to be scheduled is determined based on the document information;

[0009] Based on the main resource model, the production layout model, and the scheduling component, the to-be-scheduled task is scheduled to obtain a scheduling result corresponding to the scheduling request.

[0010] In a second aspect, the present application further provides a task scheduling device, comprising:

[0011] A request acquisition module, used to acquire a scheduling request, wherein the scheduling request includes document information to be scheduled and component information related to a production mode and a process scenario involved in the scheduling request;

[0012] A component determination module, used for acquiring a data preprocessing component and a scheduling component from a preconfigured component library according to the component information;

[0013] A model configuration module, configured to determine process route information from a scheduling database based on the data preprocessing component and the document information, and based on the process route information, obtain a master resource model and a production layout model related to the document information from a preconfigured master resource model library and a production layout model library, respectively, and determine a task to be scheduled based on the document information;

[0014] The task scheduling module is used to schedule the tasks to be scheduled based on the main resource model, the production layout model, and the scheduling component to obtain a scheduling result corresponding to the scheduling request.

[0015] In a third aspect, the present application further provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0016] Obtaining a scheduling request, wherein the scheduling request includes document information to be scheduled and component information related to a production mode and a process scenario involved in the scheduling request;

[0017] According to the component information, a data preprocessing component and a scheduling component are obtained from a preconfigured component library;

[0018] Based on the data preprocessing component and the document information, process route information is determined from a scheduling database, and based on the process route information, a master resource model and a production layout model related to the document information are respectively obtained from a pre-configured master resource model library and a production layout model library, and a task to be scheduled is determined based on the document information;

[0019] Based on the main resource model, the production layout model, and the scheduling component, the to-be-scheduled task is scheduled to obtain a scheduling result corresponding to the scheduling request.

[0020] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the following steps are implemented:

[0021] Obtaining a scheduling request, wherein the scheduling request includes document information to be scheduled and component information related to a production mode and a process scenario involved in the scheduling request;

[0022] According to the component information, a data preprocessing component and a scheduling component are obtained from a preconfigured component library;

[0023] Based on the data preprocessing component and the document information, process route information is determined from a scheduling database, and based on the process route information, a master resource model and a production layout model related to the document information are respectively obtained from a pre-configured master resource model library and a production layout model library, and a task to be scheduled is determined based on the document information;

[0024] Based on the main resource model, the production layout model, and the scheduling component, the to-be-scheduled task is scheduled to obtain a scheduling result corresponding to the scheduling request.

[0025] In a fifth aspect, the present application further provides a computer program product, including a computer program, which implements the following steps when executed by a processor:

[0026] Obtaining a scheduling request, wherein the scheduling request includes document information to be scheduled and component information related to a production mode and a process scenario involved in the scheduling request;

[0027] According to the component information, a data preprocessing component and a scheduling component are obtained from a preconfigured component library;

[0028] Based on the data preprocessing component and the document information, process route information is determined from a scheduling database, and based on the process route information, a master resource model and a production layout model related to the document information are respectively obtained from a pre-configured master resource model library and a production layout model library, and a task to be scheduled is determined based on the document information;

[0029] Based on the main resource model, the production layout model, and the scheduling component, the to-be-scheduled task is scheduled to obtain a scheduling result corresponding to the scheduling request.

[0030] The above-mentioned task scheduling method, apparatus, computer equipment, computer-readable storage medium and computer program product determine the document information to be scheduled and the component information related to the production mode and process scenario involved in the scheduling request by obtaining a scheduling request; thereby, the corresponding data preprocessing component and scheduling component can be quickly obtained from the component library based on the component information, so that the matching main resource model and production layout model can be directly obtained from the pre-configured main resource model database and production layout model database based on the data preprocessing component, the scheduling component and the single machine information, so as to realize automatic configuration in the scheduling process without the participation of experts, and the workshop production management personnel can directly obtain it, so that the scheduling task can be quickly and efficiently scheduled based on the main resource model, the production layout model and the scheduling component, and the scheduling result corresponding to the scheduling request can be obtained, thereby improving the task scheduling efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] In order to more clearly illustrate the technical solutions in the embodiments of the present application or related technologies, the drawings required for use in the embodiments of the present application or related technical descriptions will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0032] FIG1 is an application environment diagram of a task scheduling method in one embodiment;

[0033] Figure 2 is a flowchart of a task scheduling method in one embodiment;

[0034] Figure 3 A schematic diagram of the on-site layout in one embodiment;

[0035] Figure 4 Build schematics for an ongoing production layout model;

[0036] Figure 5 is a schematic diagram of a scheduling process in one embodiment;

[0037] Figure 6 A flowchart of a task scheduling step in one embodiment;

[0038] Figure 7 is a schematic diagram of a scheduling process in another embodiment;

[0039] Figure 8 A schematic diagram of specific scheduling steps in an embodiment;

[0040] Fig. 9 is a structural block diagram of a task scheduling device in one embodiment;

[0041] FIG. 10 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0042] 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.

[0043] The task scheduling method provided in the embodiment of the present application can be applied in the application environment shown in FIG1 . In which, the terminal 102 communicates with the server 104 through a network. The data storage system can store 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.

[0044] In some embodiments, the terminal 102 sends a scheduling request to the server 104, and the server 104 obtains the scheduling request, the scheduling request including the document information to be scheduled, and the component information related to the production mode and process scenario involved in the scheduling request; according to the component information, the data preprocessing component and the scheduling component are obtained from the preconfigured component library; based on the data preprocessing component and the document information, the process route information is determined from the scheduling database, and based on the process route information, the main resource model and the production layout model related to the document information are respectively obtained from the preconfigured main resource model library and the production layout model library, and the task to be scheduled is determined based on the document information; based on the main resource model, the production layout model, and the scheduling component, the task to be scheduled is scheduled to obtain a scheduling result corresponding to the scheduling request.

[0045] It should be noted that the basic information of the main resources, production layout, scheduling tasks, constraints, and optimization goals are modeled in advance to obtain basic information modeling. Therefore, flexible configuration is performed based on the basic information modeling in the future to perform scheduling that meets actual scheduling needs.

[0046] The terminal 102 may be, but is not limited to, various personal computers, laptops, smart phones, tablet computers, etc. The server 104 may be an independent physical server, a server cluster or a distributed system composed of multiple physical servers, or a cloud server providing cloud computing services.

[0047] In an exemplary embodiment, Figure 2 As shown, a task scheduling method is provided, and the method is applied to the server 104 in FIG. 1 as an example for description, including the following steps S202 to S208. Among them:

[0048] Step S202, obtaining a scheduling request, wherein the scheduling request includes document information to be scheduled and component information related to the production mode and process scenario involved in the scheduling request.

[0049] The scheduling request refers to a request for advanced planning and scheduling. The document information refers to relevant information of the document to be scheduled, for example, including the identification of the document. For example, the identification of the document refers to a batch of production order numbers to be scheduled.

[0050] Documents include but are not limited to production orders, work orders, and work orders. For example, in the vehicle production scenario, for a production order: produce a batch of vehicles. The production order is refined and decomposed to obtain multiple work orders. For example, in a stamping workshop, the work order is the type and quantity of parts that need to be stamped. Then, the tasks in the work order are specifically assigned to the work order executed by the production personnel. For example, on the assembly line of vehicle production, each workstation has clear assembly tasks and operating requirements. Production management personnel will generate work orders based on work orders and production plans and assign specific tasks to the corresponding production personnel. For example, at the engine assembly station, the work order specifies information such as the production personnel installing a certain component of the engine.

[0051] The component information related to the production mode and process scenario refers to the identification of the components required to complete the scheduling. The components can be understood as plug-ins or as codes that can realize specific functions.

[0052] Step S204: acquiring a data preprocessing component and a scheduling component from a preconfigured component library according to the component information.

[0053] Among them, the component library is pre-configured based on past scheduling experience. The component library contains different types of components, and each type of component is further subdivided according to actual scenarios.

[0054] The data preprocessing component is a component used to preprocess data, such as data cleaning. The scheduling plug-in is a plug-in used to complete the scheduling process.

[0055] Exemplarily, the component library stores component identifiers and components in correspondence, whereby the corresponding data preprocessing component and scheduling component are queried from the component library based on the component identifiers corresponding to the data preprocessing component and the scheduling component respectively included in the component information.

[0056] Step S206, based on the data preprocessing component and the document information, the process route information is determined from the scheduling database, and based on the process route information, the master resource model and production layout model related to the document information are respectively obtained from the pre-configured master resource model library and production layout model library, and the tasks to be scheduled are determined based on the document information.

[0057] The scheduling database stores scheduling data, and corresponding process route information is determined based on the scheduling data. The process route information is used to characterize the corresponding process route.

[0058] The main resource model library is pre-configured based on past scheduling experience and contains multiple main resource models corresponding to different scenarios. Each main resource model is obtained by modeling the production task execution entity subject to scheduling limited capacity constraints such as on-site production lines / work centers, workstations / work units, and equipment.

[0059] Exemplarily, the information contained in the main resource model is presented in the following form:

[0060] Class name: MainRes

[0061] - encoding: String

[0062] - Name: String

[0063] - Resource type: String

[0064] - Available secondary resources: String

[0065] -resourceAvailableOperator: String

[0066] -Resource production process indicator: String

[0067] -Actual production calendar: ResAllCalendar

[0068] - Production calendar: ResAllCalendar

[0069] -Resource internal production layout: Layout

[0070] -Resource capacity occupancy record: ResRecord

[0071] - Resource available task selection rule set: List <dispatchingfunction>

[0072] -Rule selection method: dispatchingSelect(List <dispatchingfunction>,PreparationContext): DispatchingFunction

[0073] -Opration selection method: oprSelect(List <oprationtask>,PreparationContext context, DispatchingFunction): List <oprationtask>

[0074] -Secondary resource selection method: SecondaryResSelect(List <secendaryres>,PreparationContext context): List <secendaryres>

[0075] + Forward mission execution simulation:

[0076] oprExecSimulationForward(List <oprationtask>, PreparationContextcontext): OprExecResult

[0077] +Reverse task execution simulation:

[0078] oprExecSimulationForward(List <oprationtask>, PreparationContextcontext): OprExecResult

[0079] +Task capacity occupancy:

[0080] resRecordRefresh(OprExecResult)

[0081] Among them, in addition to the common main resource attributes of MOM (production operation management system of discrete manufacturing industry), the above-mentioned main resource model (main resource class model) also includes: resource type, resource production calendar, resource internal production layout, resource capacity occupancy record, resource available task selection rule (Dispatching Rule) set, rule selection method, secondary resource selection method, task execution simulation (Operation Execution simulation), and task capacity occupancy method.

[0082] Among them, resource type refers to the type obtained by abstracting and classifying the actual logistics and production business logic of resources. Common resource types are shown in Table 1 below:

[0083] Table 1: List of resource types

[0084]

[0085] Among them, the resource production calendar refers to the daily shifts and specific working time periods of the main resource. The internal production layout of the resource refers to the sub-stations and material flow paths within the main resource. The resource capacity occupancy record refers to the record of the tasks that the resource has been assigned, the occupied working time periods, and the idle working time periods. The set of task selection rules available to the resource refers to the rules that the resource can adopt to select task execution; for example, first-arrived first-produced, first-completed first-produced, production according to the rule of reducing changeovers, fixed-quantity batch production, etc. The rule selection method refers to the logic of which task selection rule is adopted during the scheduling process. The secondary resource selection method refers to the rules for selecting secondary resources such as tools, tooling, and fixtures when executing production tasks. Task execution simulation refers to the simulation of the resource executing a certain / batch of production tasks to obtain the task start and completion time and various production indicators; task execution simulation can be divided into forward scheduling and reverse scheduling. The task capacity occupancy method refers to accepting the dispatch of planned tasks and updating the occupied processing time periods and remaining processing time periods in the resource capacity occupancy record.

[0086] Exemplarily, each production execution entity such as a workstation and equipment under the production, warehousing and logistics nodes at each level of the production organization is modeled with a main resource model to obtain multiple main resource models corresponding to the production type.

[0087] Exemplarily, the main bodies executing storage tasks, such as the buffer zone and inventory between workstations, are modeled with main resource models respectively to obtain multiple main resource models corresponding to the storage types.

[0088] Exemplarily, the execution entities of logistics tasks such as AGV, forklift, conveyor line, etc. are respectively modeled with main resource models to obtain multiple main resource models corresponding to the logistics types.

[0089] The production layout model library is pre-configured based on past scheduling experience, and includes production layout models corresponding to the sites involved in past scheduling. Exemplarily, the production layout model determination step includes: arranging the site layout according to the main resource model involved in the site, configuring the logistics path and logistics time, and obtaining the production layout model corresponding to the site. The production layout model is a model driven by real-time data of MOM (production operation management system for discrete manufacturing industry).

[0090] For example, Figure 3 As shown in FIG. 1 , it is a schematic diagram of the on-site layout in one embodiment. Figure 4 The figure shows a schematic diagram of a production layout model being implemented. Figure 3 The on-site layout, Figure 4 The generated layout model is constructed in the interface.

[0091] It can be understood that the production layout model is obtained based on the on-site layout arrangement. In this way, the digital twin process is subsequently realized through the production layout model to improve the reliability of the scheduling process.

[0092] In some embodiments, based on a data preprocessing component and document information, process route information is determined from a scheduling database, including: based on the document information and the data preprocessing component, obtaining scheduling basic data from the scheduling database and then performing data preprocessing to obtain a corresponding scheduling algorithm entity; obtaining process route information corresponding to the document information from the scheduling algorithm entity.

[0093] The scheduling database may be a MOM database or an APS database, and is not specifically limited. The scheduling database includes but is not limited to one or more of scheduling strategies, order plans, rough capacity, work centers, work center production calendars, work center production layouts, work order plans, work order plans, process routes, work stations, work station production calendars, and work station production layouts.

[0094] The scheduling algorithm entity can be understood as the target scheduling data obtained after preprocessing the scheduling data. The scheduling algorithm entity (Scheduling Algorithm Entities) includes various elements or objects involved in the scheduling process, for example, process route information, logistics path, logistics time constraints, etc.

[0095] Exemplarily, the server obtains the corresponding to-be-processed scheduling data from the scheduling database according to the document information, and uses the data preprocessing component to preprocess the to-be-processed scheduling data to obtain the corresponding scheduling algorithm entity. Then, the server queries and obtains the process route information corresponding to the document information from the scheduling algorithm entity.

[0096] In this embodiment, based on the data preprocessing component and the single machine information, the scheduling algorithm entity matching the current document to be processed can be accurately obtained, thereby quickly determining the corresponding process route information.

[0097] Among them, the task to be scheduled refers to the task of scheduling the document corresponding to the document information.

[0098] In some embodiments, tasks to be scheduled are determined based on document information, including: if the document information is order information or work order information, the process route information associated with the document information is decomposed to obtain tasks to be scheduled; if the document information is work order information, the document information is converted into tasks to be scheduled.

[0099] For example, if the document type corresponding to the document information is a production order type or a work order type, the document (production order or work order) corresponding to the document information needs to be decomposed to obtain the task to be scheduled. Specifically, in this case, the document information also includes a process route identifier, so after obtaining the scheduling algorithm entity, the server queries the corresponding process route information from the scheduling algorithm entity according to the process route identifier in the document information.

[0100] If the document type corresponding to the document information is a work order type, the document details (details of the work order) are directly obtained from the document information to obtain the tasks to be scheduled.

[0101] In this embodiment, the document information is processed accordingly according to the type of the document corresponding to the document information, so as to accurately extract the to-be-scheduled tasks that actually need to be scheduled.

[0102] Step S208, scheduling the task to be scheduled based on the main resource model, the production layout model, and the scheduling component, and obtaining a scheduling result corresponding to the scheduling request.

[0103] Exemplarily, a heuristic algorithm is constructed based on the main resource model, the production layout model, and the scheduling component, and based on the constructed heuristic algorithm, the scheduling task is scheduled to obtain a corresponding scheduling result.

[0104] Among them, the heuristic algorithm can be based on meta-heuristic algorithms such as GRASP (Greedy Randomized Adaptive Search Procedure), ant colony algorithm, particle swarm algorithm, etc., and has the expansion capability of adding optimization algorithms.

[0105] In the above-mentioned task scheduling method, by obtaining a scheduling request, the document information to be scheduled and the component information related to the production mode and process scenario involved in the scheduling request are determined; thus, based on the component information, the corresponding data preprocessing component and scheduling component can be quickly obtained from the component library, so that based on the data preprocessing component, the scheduling component and the single machine information, the matching main resource model and production layout model can be directly obtained from the pre-configured main resource model database and the production layout model database, so as to realize automatic configuration in the scheduling process without the participation of experts, and the workshop production management personnel can directly obtain it. In this way, based on the main resource model, the production layout model, and the scheduling component, the scheduling task can be quickly and efficiently scheduled to obtain the scheduling result corresponding to the scheduling request, thereby improving the task scheduling efficiency.

[0106] In some embodiments, based on the main resource model, the production layout model, and the scheduling component, the to-be-scheduled task is scheduled to obtain a scheduling result corresponding to the scheduling request, including: based on the main resource model, the production layout model, and the scheduling component, each task in the to-be-scheduled task is scheduled in turn through time window scheduling, and based on the scheduling results corresponding to each task, the scheduling result corresponding to the scheduling request is determined.

[0107] Among them, time window scheduling refers to the process of allocating or executing processes or tasks at specific time points in a time-stepping manner. Exemplarily, a time window scheduling algorithm can be used to implement time window scheduling.

[0108] For each task, scheduling each task means simulating the execution of each task. Therefore, it can be understood that the scheduling result corresponding to each task can be reflected as the execution result corresponding to each task, which includes the start time, completion time, and specific values ​​of related production indicators of the task.

[0109] Exemplarily, the constraints, optimization objectives, etc. involved in the time window scheduling algorithm are mapped to the modeling of the corresponding main resource model and production layout model. In this way, the behavior of the time window scheduling algorithm can be controlled through a flexible configuration process to achieve the expected optimization purpose.

[0110] It should be noted that based on the pre-configured master resource model, production layout model and scheduling components, a highly configurable APS algorithm framework can be realized. As can be seen from the modeling process of the master resource model mentioned above, the master resource model encapsulates abstract algorithm rules (such as resource available task selection rules) and scheduling related parameters (such as resource capacity occupancy records), that is, encapsulates difficult-to-understand information. In this way, only business data that is easy for business personnel to understand needs to be configured, and there is no need to rely on experts to modify the algorithm, which improves scheduling efficiency.

[0111] In some embodiments, Figure 5 The figure is a schematic diagram of the scheduling process in one embodiment. Based on the main resource model, the production layout model, and the scheduling component, each task in the scheduled task is scheduled in turn through time window scheduling, and the scheduling results corresponding to each task include:

[0112] Step S502, determine the idle main resource model queue at the current scheduling time point from the main resource model, and based on the production layout model and the scheduling component, schedule the tasks involved in each idle main resource model in the idle main resource model queue in turn to obtain the scheduling result corresponding to the task.

[0113] The current scheduling time point refers to the time point at which the current scheduling is started, that is, the time point at which the current main resource planning scheduling is started. Multiple scheduling is performed in time steps to ensure that all tasks in the tasks to be scheduled are scheduled (simulated execution) and completed.

[0114] The idle main resource model queue refers to a set of main resource models that are in an idle state at the current scheduling time point. The idle state is determined based on the capacity occupancy (resource capacity occupancy) of the main resource model. Exemplarily, the resource capacity occupancy record is obtained from the main resource model, and the current capacity occupancy is determined based on the resource capacity occupancy record.

[0115] When the capacity occupancy reaches a preset occupancy threshold, the state of the main resource model is determined to be a non-idle state. When the capacity occupancy does not reach the occupancy threshold, the state of the main resource model is determined to be an idle state.

[0116] Exemplarily, after determining the main resource model, the production layout model, and the scheduling component, the server starts scheduling and performs scheduling every preset time step. The steps of each scheduling are as follows:

[0117] At the current scheduling time point, the server queries the idle main resource model from the main resource model to obtain the idle main resource model queue. Based on the production layout model and the scheduling component, the server schedules the tasks involved in each idle main resource model in the idle main resource model queue in turn, obtains the scheduling result corresponding to the task, and updates the capacity occupancy record in each idle main resource model in the idle main resource model queue, as well as the idle time point of the main resource model.

[0118] In some embodiments, the scheduling component includes a primary resource selection component and a simulation evaluation component, wherein the primary resource selection component is a component for selecting a primary resource model, which can be understood as a code capable of realizing the selection of a primary resource model.

[0119] The simulation evaluation component is used to evaluate the simulation results obtained by simulating the execution of a task after scheduling it. It can be understood as code that can evaluate the execution results of a task.

[0120] The scheduling component also includes a main resource task selection component and a task execution simulation component. Among them, the main resource task selection component is a component used to select the task to be scheduled, which can be understood as the code for selecting the task to be scheduled. The task execution simulation component is a component used to simulate the execution of the task, which can be understood as the code for simulating the execution of the task.

[0121] It should be noted that since the main resource selection component and the task execution simulation component are both related to the execution business of the production line, workstation, and equipment corresponding to the main resource model, the main resource task selection component and the task execution simulation component can also be encapsulated in the corresponding main resource model. That is, for each main resource model, it contains the corresponding main resource task selection component and task execution simulation component. At this time, the main resource task selection component is the task selection rule set available for the resources in the main resource model mentioned above, and the task execution simulation component is the task execution simulation in the main resource model mentioned above.

[0122] In some embodiments, Figure 6 The figure is a flowchart of the task scheduling step in one embodiment. Based on the production layout model and the scheduling component, the tasks involved in each idle main resource model in the idle main resource model queue are scheduled in turn to obtain the scheduling results corresponding to the tasks, including:

[0123] Step S602: for the current iteration round, a primary resource selection component is used to select an idle primary resource model for the current iteration round from the current primary resource model selection set. The current primary resource model selection set for the first iteration round is an idle primary resource model queue.

[0124] Among them, at the current scheduling time point, multiple iterative rounds of sub-scheduling are started to ensure that each idle main resource model in the idle main resource model queue can be called. That is to say, when it is determined that there is no idle main resource model in the idle main resource model queue corresponding to the current scheduling time point, it is determined to end the iterative round of the current scheduling time point and enter the next scheduling (that is, scheduling after reaching the next scheduling time point).

[0125] Step S604, obtain the pre-configured main resource task selection component and task execution simulation component from the idle main resource model, determine the production layout model to which the idle main resource model belongs from the production layout model, determine the optimization target based on the idle main resource model and the production layout model to which it belongs, and determine the constraint rules based on the production layout model to which it belongs and at least one of the scheduling algorithm entities.

[0126] Among them, the constraint rules are a series of restrictions that the scheduling must follow. For example, they can be constraint rules about resource constraints, or constraint rules about logistics constraints, or constraint rules about time constraints, or constraint rules that determine the constraints of previous and subsequent processes, or constraint rules about capacity constraints, etc. For example, for each main resource model, at least one of the corresponding constraint rules and optimization objectives can be included.

[0127] The optimization goal refers to the use of a series of strategies and methods in the production planning and scheduling process to achieve the goals of improving production efficiency, reducing costs, and optimizing resource allocation.

[0128] Exemplarily, the server obtains the pre-configured primary resource task selection component and task execution simulation component from the idle primary resource model, and determines the production layout model to which the idle primary resource model belongs from the production layout model.

[0129] The server can obtain the corresponding optimization target from at least one of the idle main resource model and the corresponding production layout model. The server obtains the logistics path and logistics time constraints from the corresponding production layout model, and obtains other constraint rules from the scheduling algorithm entity.

[0130] Step S606 : Based on the constraint rules and the optimization target, the task corresponding to the idle main resource model is selected from the tasks to be scheduled through the main resource task selection component.

[0131] Step S608, based on the task identifier and constraint rules of the task, determine the simulation result of executing the task through the task execution simulation component, and evaluate the simulation result through the simulation evaluation component to obtain the scheduling result corresponding to the task, and based on the scheduling result, update the capacity occupancy of the idle main resource model to update the current main resource model selection set to obtain the updated main resource model selection set.

[0132] Exemplarily, the simulation results include the start time of the task, the completion time of the task, and production indicators, etc.

[0133] Exemplarily, the server evaluates the simulation result through the simulation evaluation component to obtain the evaluation result. When the evaluation result indicates the received simulation result, the capacity occupancy record of the idle main resource model is updated, and the scheduling result is determined based on the updated capacity occupancy record and the simulation result. That is, the scheduling result at least includes the resource capacity occupancy record of the idle main resource model corresponding to the task, and the simulation result. In some embodiments, the scheduling result may also include the idle time point of the idle main resource model (i.e., the main resource scheduling time point information is updated).

[0134] Exemplarily, if the evaluation result indicates that the simulation result is not received, time stepping is performed to determine the next process time point, and the next process time point is used as the new current process time point, and the idle main resource model queue determined from the main resource model at the current scheduling time point is returned to continue execution.

[0135] Exemplarily, if the evaluation result indicates that the simulation result is received, the capacity occupancy of the idle main resource model is updated. If the updated capacity occupancy reaches a preset occupancy threshold, the state of the main resource model is determined to be a non-idle state, and the current main resource model selection set is updated, and the updated main resource model selection set does not include the main resource model. If the capacity occupancy does not reach the occupancy threshold, the state of the main resource model is determined to be an idle state. If the evaluation result indicates that the simulation result is not received, the capacity occupancy of the idle main resource model is not updated, the current main resource model selection set is updated, and the updated main resource model selection set still includes the main resource model.

[0136] Step S610: If the updated main resource model selection set is empty, determine that the current scheduling time point meets the scheduling stop condition; if the updated main resource model selection set is not empty, use the updated main resource model selection set as the current main resource model selection set corresponding to the next iteration round, and return to the main resource selection component to select an idle main resource model for the current iteration round from the current main resource model selection set to continue execution.

[0137] In this embodiment, multiple iteration rounds of processing are used to ensure that all the main resource models in the idle main resource model queue at the current scheduling time point can be scheduled accordingly to perform corresponding task simulations, thereby ensuring the effectiveness of the scheduling process.

[0138] Step S504, if the current scheduling time point does not meet the scheduling stop condition, determine the next scheduling time point according to the preset time step, and use the next scheduling time point as the new current scheduling time point, return to the step of determining the idle main resource model queue at the current scheduling time point from the main resource model and continue to execute until the scheduling stop condition is met.

[0139] The scheduling stop condition refers to the scheduling stop condition at the current scheduling time point. Exemplarily, the scheduling stop condition may be that there is no idle main resource model in the idle main resource model queue at the current scheduling time point.

[0140] The following is an example to illustrate the scheduling process: Figure 7 FIG. 4 is a schematic diagram of a scheduling process in another embodiment.

[0141] Figure 7 The scheduling basic database in the scheduling basic modeling part is the scheduling database mentioned above. Production resources, production calendar, manufacturing BOM (Bill Of Materials), process route, etc. are included in the scheduling algorithm entity. Based on the scheduling algorithm entity and production layout model, the scheduling constraint rules and optimization goals can be determined.

[0142] Step 7.1: Start by using the process data preprocessing algorithm component (the preprocessing component mentioned above) to preprocess the data. Please refer to the previous article for details and will not be repeated here.

[0143] Step 7.2: Get the main resource to be queued (the main resource model to be queued mentioned above) from the idle main resource queue (idle main resource model queue).

[0144] Specifically, step 7.2.1: for the current scheduling time point, determine the idle main resource model queue at the current scheduling time point.

[0145] Step 7.2.2: Determine the idle main resource model queue at the current scheduling time point from the main resource model, and then select an idle main resource model from the idle main resource model queue through the main resource selection algorithm component (the main resource selection component mentioned above) as the main resource model to be scheduled.

[0146] Step 7.3: Call the task selection algorithm of the main resource (i.e., the main resource model) to select the task to be executed, that is, determine the constraint rules and optimization goals corresponding to the main resource model to be scheduled, and based on the constraint rules and optimization goals, call the main resource task selection algorithm component (the main resource task selection component mentioned above) to select at least one task (Operation) corresponding to the idle main resource model from the tasks to be scheduled. The following is an example of determining a task.

[0147] Step 7.4: Perform task execution simulation and calculate indicators. That is, based on the task identification and constraint rules of the task, run the task execution simulation algorithm component (the task execution simulation component mentioned above) to determine the corresponding simulation results (including the start and completion time of the Operation and other production indicators).

[0148] Specifically, the steps for resource task execution simulation process are as follows: first start the simulation, based on the task identification and constraint rules, through the task execution simulation algorithm component, generate task constraints in sequence, obtain resource capacity constraints and executable time period, limited capacity simulation to determine the start time and completion time, and resource production indicator calculation, get the simulation results and output them, and end the simulation.

[0149] Step 7.4: Estimate the simulation results based on the simulation evaluation algorithm component (the simulation evaluation component mentioned above) and determine whether to accept it.

[0150] Specifically, the simulation results are evaluated through the simulation evaluation algorithm component (the simulation evaluation component mentioned above) to determine the evaluation results. If the evaluation results represent the reception of the current simulation results, it is determined that the current task to be executed has been scheduled, and the capacity occupancy (corresponding to the updated capacity occupancy record in the previous article) and the idle time point of the idle main resource model are updated in the idle main resource model.

[0151] Step 7.5: Determine whether there is an idle main resource model at the current scheduling time point. If yes, return to the above step 7.2.2 to determine the next idle main resource model. If no, perform time stepping and return to the above step 7.2.1 to continue execution.

[0152] Step 7.6: After the scheduling of all tasks is completed, the scheduling result corresponding to the scheduling request is determined based on the updated capacity occupancy records of each main resource model, constraint rules, and the scheduling results corresponding to each task, and is output.

[0153] In this embodiment, it essentially combines list scheduling and time window scheduling to achieve scheduling, and loads different data preprocessing components, main resource selection components, simulation evaluation plug-ins, main resource task selection components, and task execution simulation components to support different scheduling scenarios. In addition, based on the main resource model and the generated layout model, it is possible to quickly obtain constraint rules and optimization goals, and schedule in combination with the obtained components. In other words, it will automatically obtain highly configurable main resource models, generate layout models, and components based on actual needs, and can easily and quickly complete the configuration of the scheduling algorithm, thereby quickly completing the scheduling. At the same time, it is easy to understand and convenient for production business personnel to configure by themselves.

[0154] In a specific embodiment, Figure 8 FIG. 1 is a schematic diagram of specific scheduling steps in an embodiment. Figure 8 It can be regarded as a highly configurable APS framework, which consists of a data preprocessing set, an in-memory database, an algorithm library, and a post-processing set.

[0155] After the server receives the scheduling request, it performs the corresponding scheduling. The specific steps are as follows:

[0156] First, after the scheduling starts, the data preprocessing process is carried out. Specifically, the data preprocessing component corresponding to the document information is used for processing. For example, if the document information is a master plan (production order), the data preprocessing component contained in the component information is a data preprocessing component for preprocessing the master plan scheduling. If the document information is a work order, the data preprocessing component contained in the component information is a data preprocessing component for preprocessing the work order scheduling. If the document information is a work order, the data preprocessing component contained in the component information is a data preprocessing component for preprocessing the work order scheduling.

[0157] Then, based on the data preprocessing components and document information, the corresponding scheduling algorithm entity is determined from the MOM / APS database and stored in the local memory database. The data stored in the MOM / APS database is as mentioned above and will not be repeated here. The memory database includes scheduling parameter configuration and scheduling data. The scheduling parameter configuration includes a data preprocessing component set, an indicator algorithm set, an optimization target algorithm set, a heuristic algorithm set, a meta-heuristic algorithm set, a scheduling strategy set, a resource model set, and a post-processing algorithm set. The scheduling data includes Order association, material set, Operation association, product BOM structure, reference Order set, production calendar, to-be-scheduled Order set, production main resource set, reference Operation set, production secondary resource set, to-be-scheduled Operation set, changeover time rules, process route set, and production layout. The included scheduling parameter configuration and scheduling data are obtained by storing the information involved in each scheduling request. The specific steps for determining the scheduling algorithm entity corresponding to the current scheduling request are as mentioned above.

[0158] Next, the process of scheduling and rescheduling the production plan is carried out based on the obtained scheduling algorithm entity. Specifically, the corresponding process route information is obtained from the scheduling algorithm entity, and based on the process route information, the master resource model and production layout model related to the document information are obtained from the pre-configured master resource model library and production layout model library, and the tasks to be scheduled are determined based on the document information. According to the component information, the data preprocessing component and the scheduling component are obtained from the pre-configured component library.

[0159] After that, based on the configuration of the main resource model, production layout model, and scheduling group, the algorithm is called from the APS algorithm library to determine the scheduling result corresponding to the scheduling request (this scheduling result). Among them, this scheduling result includes one or more of Order, Operation execution result set, resource capacity occupancy record result set, Order constraint set, Operation constraint set, and main resource task execution queue, and the specific details are not limited. The steps for determining the scheduling result can refer to the above steps S502 to S504.

[0160] In other embodiments, if the document corresponding to the document information involves an associated document, after the scheduling corresponding to the document is completed and the scheduling result is obtained, it is stored in the memory database as a historical scheduling result. Then, referring to the scheduling process of the document, when scheduling the associated document, it is also necessary to obtain parameters and constraints from the historical scheduling result to generate the scheduling result of the associated document.

[0161] Finally, after the scheduling result corresponding to the scheduling request is determined, it is output for corresponding post-processing. That is, after the scheduling is completed and the scheduling result is confirmed, the corresponding scheduling post-processing program is called. For example, if it is a main plan scheduling, the scheduling result is post-processed as the main plan scheduling result; if it is a work order scheduling, the scheduling result is post-processed as the work order scheduling result; if it is a work order, the scheduling result is post-processed as the work order scheduling result, and the post-processing result is sent to the MOM / APS database.

[0162] It should be noted that through this scheduling algorithm service framework, it is only necessary to provide the aforementioned production layout, production mode, process scenario and optimization target configuration items for different scheduling scenarios. That is, based on the scheduling request, the corresponding models and components are adaptively obtained for configuration to achieve compatibility with various scheduling scenarios.

[0163] In this embodiment, by obtaining a scheduling request, the document information to be scheduled and the component information related to the production mode and process scenario involved in the scheduling request are determined; thus, based on the component information, the corresponding data preprocessing component and scheduling component can be quickly obtained from the component library, so that based on the data preprocessing component, the scheduling component and the single machine information, the matching main resource model and production layout model can be directly obtained from the pre-configured main resource model database and the production layout model database, thereby realizing automatic configuration in the scheduling process without the participation of expert personnel, and the workshop production management personnel can directly obtain it. In this way, based on the main resource model, the production layout model, and the scheduling component, the scheduling task can be quickly and efficiently scheduled to obtain the scheduling result corresponding to the scheduling request, thereby improving the task scheduling efficiency. In addition, by encapsulating abstract algorithm rules and parameters in business models such as master resource models, production modes, and process scenarios, any non-expert personnel only needs to use the production master resource model provided by the system to build a production layout model, select the production mode and process scenario corresponding to the scheduling, and set the production indicators that the algorithm needs to optimize. The APS framework can complete the scheduling based on these inputs without the customer having to understand the algorithm configuration. This can greatly improve the implementation efficiency of APS, reduce the difficulty of APS application, and improve the configurability of APS.

[0164] 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.

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

[0166] In an exemplary embodiment, Fig. 9 As shown, a task scheduling device 900 is provided, comprising: a request acquisition module 902, a component determination module 904, a model configuration module 906 and a task scheduling module 908, wherein:

[0167] A request acquisition module 902 is used to acquire a scheduling request, where the scheduling request includes document information to be scheduled and component information related to the production mode and process scenario involved in the scheduling request;

[0168] The component determination module 904 is used to obtain a data preprocessing component and a scheduling component from a preconfigured component library according to the component information;

[0169] Model configuration module 906, used to determine process route information from the scheduling database based on the data preprocessing component and the document information, and based on the process route information, obtain the master resource model and production layout model related to the document information from the pre-configured master resource model library and production layout model library, respectively, and determine the task to be scheduled based on the document information;

[0170] The task scheduling module 908 is used to schedule the tasks to be scheduled based on the main resource model, the production layout model, and the scheduling component to obtain a scheduling result corresponding to the scheduling request.

[0171] In some embodiments, the model configuration module 906 is also used to obtain the scheduling basic data from the scheduling database based on the document information and the data preprocessing component, and then perform data preprocessing to obtain the corresponding scheduling algorithm entity; and obtain the process route information corresponding to the document information from the scheduling algorithm entity.

[0172] In some embodiments, the model configuration module 906 is also used to decompose the process route information associated with the document information to obtain tasks to be scheduled if the document information is order information or work order information; if the document information is work order information, the document information is converted into tasks to be scheduled.

[0173] In some embodiments, the task scheduling module 908 is also used to schedule each task in the scheduled task in turn through time window scheduling based on the main resource model, the production layout model, and the scheduling component, and determine the scheduling result corresponding to the scheduling request based on the scheduling results corresponding to each task.

[0174] In some embodiments, the task scheduling module 908 is also used to determine the idle main resource model queue at the current scheduling time point from the main resource model, and based on the production layout model and the scheduling component, schedule the tasks involved in each idle main resource model in the idle main resource model queue in turn to obtain the scheduling result corresponding to the task; if the current scheduling time point does not meet the scheduling stop condition, the next scheduling time point is determined according to the preset time step, and the next scheduling time point is used as the new current scheduling time point, and the step of determining the idle main resource model queue at the current scheduling time point from the main resource model is returned to continue execution until the scheduling stop condition is met.

[0175] In some embodiments, the scheduling component includes a main resource task component and a simulation evaluation component; the task scheduling module 908 is also used to select an idle main resource model for the current iteration round from the current main resource model selection set through the main resource selection component, and the current main resource model selection set of the first iteration round is the idle main resource model queue; obtain the pre-configured main resource task selection component and task execution simulation component from the idle main resource model, determine the production layout model to which the idle main resource model belongs from the production layout model, determine the optimization target based on the idle main resource model and the production layout model to which it belongs, and determine the constraint rules based on the production layout model to which it belongs and at least one of the scheduling algorithm entities; based on the constraint rules and the optimization target, select from the tasks to be scheduled through the main resource task selection component A task corresponding to an idle main resource model; based on the task identifier and constraint rules of the task, the simulation result of executing the task is determined through the task execution simulation component, and the simulation result is evaluated through the simulation evaluation component to obtain the scheduling result corresponding to the task, and based on the scheduling result, the capacity occupancy of the idle main resource model is updated to update the current main resource model selection set to obtain an updated main resource model selection set; if the updated main resource model selection set is empty, it is determined that the current scheduling time point meets the scheduling stop condition, and if the updated main resource model selection set is not empty, the updated main resource model selection set is used as the current main resource model selection set corresponding to the next iteration round, and the main resource selection component is returned to select an idle main resource model step for the current iteration round from the current main resource model selection set to continue execution.

[0176] Each module in the above task scheduling device can be implemented in whole or in part by software, hardware or a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute the operations corresponding to each module.

[0177] In an exemplary embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be shown in FIG10. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. The processor, the memory and the input / output interface are connected via a system bus, and the communication interface is connected to the system bus via the input / output interface. 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 input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal via a network connection. When the computer program is executed by the processor, a task scheduling method is implemented.

[0178] Those skilled in the art will understand that the structure shown in FIG. 10 is merely a block diagram of a partial 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 shown in the figure, or combine certain components, or have a different arrangement of components.

[0179] In one embodiment, a computer device is further provided, including a memory and a processor, wherein a computer program is stored in the memory, and the processor implements the steps in the above-mentioned method embodiments when executing the computer program.

[0180] 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, the steps in the above-mentioned method embodiments are implemented.

[0181] In one embodiment, a computer program product is provided, including a computer program, which implements the steps in the above method embodiments when executed by a processor.

[0182] 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, and the collection, use and processing of relevant data must comply with relevant regulations.

[0183] A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment method 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 memory 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), magnetic 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, an artificial intelligence (AI) processor, etc., but are not limited to this.

[0184] The technical features of the above embodiments may be combined arbitrarily. 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 application.

[0185] 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 construed as limiting the scope of the present application. It should be noted that, for a person of ordinary skill in the art, several modifications 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.< / oprationtask> < / oprationtask> < / secendaryres> < / secendaryres> < / oprationtask> < / oprationtask> < / dispatchingfunction> < / dispatchingfunction>

Claims

1. A task scheduling method, characterized in that: The method comprises: Obtaining a scheduling request, wherein the scheduling request includes document information to be scheduled and component information related to a production mode and a process scenario involved in the scheduling request; According to the component information, a data preprocessing component and a scheduling component are obtained from a preconfigured component library; Based on the data preprocessing component and the document information, process route information is determined from a scheduling database, and based on the process route information, a master resource model and a production layout model related to the document information are respectively obtained from a pre-configured master resource model library and a production layout model library, and a task to be scheduled is determined based on the document information; Based on the main resource model, the production layout model, and the scheduling component, the to-be-scheduled task is scheduled to obtain a scheduling result corresponding to the scheduling request.

2. The method according to claim 1, characterized in that The determining process route information from a scheduling database based on the data preprocessing component and the document information includes: Based on the document information and the data preprocessing component, the scheduling basic data is obtained from the scheduling database and then the data is preprocessed to obtain the corresponding scheduling algorithm entity; The process route information corresponding to the document information is obtained from the scheduling algorithm entity.

3. The method according to claim 1, characterized in that The determining of the task to be scheduled based on the document information includes: If the document information is order information or work order information, the process route information associated with the document information is decomposed to obtain the task to be scheduled; If the document information is work order information, the document information is converted into a task to be scheduled.

4. The method according to claim 1, characterized in that: The scheduling process is performed on the to-be-scheduled task based on the main resource model, the production layout model, and the scheduling component to obtain a scheduling result corresponding to the scheduling request, including: Based on the main resource model, the production layout model, and the scheduling component, each task in the to-be-scheduled tasks is scheduled in turn through time window scheduling, and based on the scheduling results corresponding to each task, the scheduling result corresponding to the scheduling request is determined.

5. The method according to claim 4, characterized in that Based on the main resource model, the production layout model, and the scheduling component, each task in the to-be-scheduled task is scheduled in turn through time window scheduling, and the scheduling results corresponding to each task include: Determine an idle main resource model queue at the current scheduling time point from the main resource model, and based on the production layout model and the scheduling component, sequentially schedule the tasks involved in each idle main resource model in the idle main resource model queue to obtain a scheduling result corresponding to the task; If the current scheduling time point does not meet the scheduling stop condition, the next scheduling time point is determined according to the preset time step, and the next scheduling time point is used as the new current scheduling time point, and the idle main resource model queue step determined at the current scheduling time point is returned to the main resource model to continue execution until the scheduling stop condition is met.

6. The method according to claim 5, characterized in that The scheduling component includes a main resource selection component and a simulation evaluation component; The step of sequentially scheduling tasks involved in each idle main resource model in the idle main resource model queue based on the production layout model and the scheduling component to obtain a scheduling result corresponding to the task includes: For the current iteration round, an idle primary resource model for the current iteration round is selected from the current primary resource model selection set by the primary resource selection component, and the current primary resource model selection set of the first iteration round is the idle primary resource model queue; Acquire a pre-configured primary resource task selection component and a task execution simulation component from the idle primary resource model, determine the production layout model to which the idle primary resource model belongs from the production layout model, determine an optimization target based on the idle primary resource model and the production layout model to which it belongs, and determine a constraint rule based on at least one of the production layout model to which it belongs and a scheduling algorithm entity; Based on the constraint rules and the optimization goal, selecting a task corresponding to the idle primary resource model from the tasks to be scheduled through the primary resource task selection component; Based on the task identifier of the task and the constraint rule, the task execution simulation component is used to determine a simulation result of executing the task, and the simulation evaluation component is used to evaluate the simulation result to obtain a scheduling result corresponding to the task, and based on the scheduling result, the capacity occupancy of the idle main resource model is updated to update the current main resource model selection set to obtain an updated main resource model selection set; If the updated main resource model selection set is empty, it is determined that the current scheduling time point meets the scheduling stop condition. If the updated main resource model selection set is not empty, the updated main resource model selection set is used as the current main resource model selection set corresponding to the next iteration round, and the main resource selection component is returned to select an idle main resource model step for the current iteration round from the current main resource model selection set to continue execution.

7. A task scheduling device, characterized in that: The device comprises: A request acquisition module, used to acquire a scheduling request, wherein the scheduling request includes document information to be scheduled and component information related to a production mode and a process scenario involved in the scheduling request; A component determination module, used for acquiring a data preprocessing component and a scheduling component from a preconfigured component library according to the component information; A model configuration module, configured to determine process route information from a scheduling database based on the data preprocessing component and the document information, and based on the process route information, obtain a master resource model and a production layout model related to the document information from a preconfigured master resource model library and a production layout model library, respectively, and determine a task to be scheduled based on the document information; The task scheduling module is used to schedule the tasks to be scheduled based on the main resource model, the production layout model, and the scheduling component to obtain a scheduling result corresponding to the scheduling request.

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