Method and apparatus for production task scheduling, and computer device
By receiving and evaluating configuration, machine and task status information in manufacturing production, and generating initial and new production plans, the problem of production plan deviation caused by emergencies in manufacturing is solved, rapid response and resource optimization are achieved, and the Productivity and resource utilization.
Patent Information
- Application Number
- PCT/CN2023/096891
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2023-05-29
- Publication Date
- 2024-12-05
AI Technical Summary
Production scheduling in the manufacturing industry faces dynamics and randomness. Emergencies often lead to deviations in production plans. It is difficult for existing technologies to adjust quickly and effectively to reduce interference and improve production efficiency.
By receiving configuration information, machine status information, task status information and target information, we generate an initial production plan, and conduct impact assessments when emergencies occur, update machine and task status information, generate new production plans, and optimize resource allocation and scheduling when emergencies occur, and , to deal with different production emergencies.
It has achieved rapid generation of targeted and flexible production plans in a short period of time, reducing the impact of emergencies on production, improving the utilization rate of production resources, and reducing the cost of planning adjustments.
Smart Images

Figure CN2023096891_05122024_PF_FP_ABST
Abstract
Description
Production task scheduling method, device, and computer equipment Technical Field
[0001] The present application relates to the field of production scheduling, and in particular, to a method, apparatus, computer equipment, and storage medium for production task scheduling. Background Art
[0002] Resource and task allocation and scheduling are crucial issues in manufacturing, determining the effectiveness and efficiency of advanced manufacturing systems. Examples include production planning, job shop scheduling, automated guided vehicle (AGV) scheduling, and crane scheduling. However, manufacturing systems are dynamic and stochastic. Unexpected events frequently occur during the manufacturing process. Therefore, how to quickly respond to unexpected events and modify plans in a cost-effective manner—for example, minimizing the impact of disruptions at a given time—is more important and complex than simply generating high-quality plans under all known assumptions.
[0003] Summary of the Invention
[0004] This summary is provided to introduce some selected concepts in a simplified form, which will be further described in the detailed description below. This summary is not intended to identify any key features or essential features of the claimed subject matter, nor is it intended to be used to help determine the scope of the claimed subject matter.
[0005] Based on this, the present application provides a method for production task scheduling, which includes: receiving first configuration information, first machine status information, first task status information and first target information; generating a first production plan based on the first configuration information, first machine status information, first task status information and first target information.
[0006] In the above manner, a predetermined production plan can be generated based on the information.
[0007] Furthermore, the method further includes receiving a production emergency, performing an impact assessment on the production emergency, and generating second machine status information and second task status information.
[0008] In the above manner, emergency events can be received, then evaluated, and then the machine status information and task status information can be updated accordingly to prepare for the generation of a subsequent new generation plan.
[0009] Furthermore, the method also includes generating second target information based on the first production plan; and generating a second production plan based on the first configuration information, the second machine status information, the second task status information and the second target information.
[0010] Through the above methods, a new production plan that is targeted, flexible, reconsidered and evaluated can be generated according to the impact of unexpected events.
[0011] Furthermore, the production emergencies include machine downtime, production delays, expedited orders and rework.
[0012] In this way, different assessments can be performed under different production emergencies, thereby having different impacts on machine status information and task status information, and subsequently generating different production plans.
[0013] Furthermore, generating the first production plan or the second production plan includes: dividing the production tasks into batches according to the first configuration information; arranging the production resources of the batches according to the constraints; wherein the production resources include production machines, production time periods and production sequences.
[0014] Through the above method, production tasks and corresponding resources can be arranged effectively and accurately, so that the production time of production tasks can be shortened and accelerated, and the purpose of fully utilizing production resources can be achieved. In addition, tasks can be arranged in sequence and orderly while minimizing the total task completion time, and then the corresponding production resources can be matched accurately, so as to meet the orderly execution of the overall production plan.
[0015] Furthermore, the constraints include: the production task belongs to the initial task or the successor task of the production machine; the production task is the successor task of a single predecessor task; the production machine has only one initial task; the start time of the successor task is later than the sum of the end time and preparation time of the predecessor task; the end time of the production task is equal to the start time of the production task and the processing time of the production task; the processing time of the total production task is later than the end time of each production task.
[0016] Through the above methods, production plans can be effectively planned through different constraints, so that there are no conflicts between production tasks, production resources can be effectively utilized and scheduled, and production can be completed as quickly as possible.
[0017] Furthermore, the present application also provides a device for scheduling production tasks, wherein a first information receiving module is used to receive first configuration information, first machine status information, first task status information and first target information; and a first plan generating module is used to generate a first production plan based on the first configuration information, first machine status information, first task status information and first target information.
[0018] Furthermore, the device further includes an emergency event module, which is used to receive a production emergency event, perform an impact assessment on the production emergency event, and generate second machine status information and second task status information.
[0019] Furthermore, the device also includes a second target generation module for generating second target information based on the first production plan; and a second plan generation module for generating a second production plan based on the first configuration information, second machine status information, second task status information and second target information.
[0020] The present application also provides a computer device, comprising a memory and a processor, wherein the memory stores a computer program, and wherein the processor implements the above method when executing the computer program.
[0021] The present application also provides a computer-readable storage medium having a computer program stored thereon, and the computer program implements the above method when executed by a processor.
[0022] The present application also provides a computer program product, which is tangibly stored on a computer-readable medium and includes computer-executable instructions. When the computer-executable instructions are executed, the computer-executable instructions cause at least one processor to perform the method described above. BRIEF DESCRIPTION OF THE DRAWINGS
[0023] Implementations of the present disclosure are illustrated by way of example and not limitation in the figures of the accompanying drawings in which like references indicate the same or similar parts.
[0024] FIG1 is a schematic diagram of a process of a method for scheduling production tasks according to an embodiment of the present application.
[0025] FIG2 is a schematic diagram of a device for scheduling production tasks according to an embodiment of the present application.
[0026] FIG3 is a schematic diagram of a computer device for scheduling production tasks according to an embodiment of the present application.
[0027] The reference numerals are as follows: S101-S102 Step 200: Apparatus 201: Module 202: Module 203: Module 204: Module 205: Module 300: Computer device 302: Processor 304: Memory DETAILED DESCRIPTION
[0028] In the following description, for the purpose of explanation, a large number of specific details are set forth. However, it is understood that the present invention can be implemented without these specific details. In other examples, well-known circuits, structures, and technologies are not shown in detail so as not to affect the understanding of the description.
[0029] References throughout this specification to "an implementation," "an implementation," "an exemplary implementation," "some implementations," "various implementations," etc., indicate that the implementations of the invention being described may include particular features, structures, or characteristics. However, it does not imply that every implementation must include those particular features, structures, or characteristics. Furthermore, some implementations may have some, all, or none of the features described for other implementations.
[0030] In the following description, the terms "coupled" and "connected" and their derivatives may be used. It should be understood that these terms are not intended as synonyms for each other. Rather, in certain implementations, "connected" is used to indicate that two or more components are in direct physical or electrical contact with each other, while "coupled" is used to indicate that two or more components cooperate or interact with each other, but they may or may not be in direct physical or electrical contact. Figure 1 is a flow chart of a method for generating a signal according to one embodiment of the present application.
[0031] It should be understood that although the various steps in the flowchart of FIG1 are shown in sequence as indicated by the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order restriction on the execution of these steps, and these steps can be executed in other orders. Moreover, at least a portion of the steps in FIG1 may 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. 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 portion of steps or stages in other steps.
[0032] The implementation scenario of the present application can be a method, model, software or device coupled with a manufacturing execution system (MES) to work in conjunction with each other. Taking a device as an example, the device obtains the input information and key information of the production plan from the MES system, then uses the model algorithm to generate a first production plan, and sends the first production plan to the MES system so that the MES can monitor and execute the real-time production situation. When an unexpected event occurs in subsequent production and the original plan cannot be executed or deviates, so adjustments have to be made, the unexpected event, influencing factors and the original production plan are input into the model again. The device thus generates a second production plan and transmits it back to the MES system, further reducing the impact of the unexpected event on normal production. The present application uses target optimization, limiting conditions and calculation process design to allow the device to quickly generate a second production plan in a short period of time, respond to unexpected events in a timely manner, and reduce the additional production costs caused by plan adjustments, such as additional material distribution costs, production line setup time costs, etc. Therefore, the method, model, software or device is coupled with the MES system and works in a collaborative manner. It can be part of the MES system or a single-end software program or device. This application is not limited in specific form. Furthermore, scheduling and rescheduling problems are usually studied separately, for example, some studies focus on scheduling problems and other studies focus on rescheduling problems. Few studies study scheduling and rescheduling problems together. Compared with general scheduling problems, rescheduling problems are more complicated because there are various uncertain times and possible events. And higher time efficiency and feasibility are required. Generally speaking, a very fast and effective decision is necessary to reduce the impact of unexpected events.
[0033] Based on this, the present application provides a method for scheduling production tasks, which includes:
[0034] S101, receiving first configuration information, first machine status information, first task status information, and first target information.
[0035] The first configuration information, the first machine status information, the first task status information and the first target information may be provided by the MES, or may be manually set or input. The MES sends the above information to the execution entity responsible for production task scheduling.
[0036] In some embodiments, the first configuration information may be referred to as configuration information, including information such as production process steps, run time limit, task priority, special constraints, etc. In some specific embodiments, the configuration information may be specifically as follows: Configuration{ process_name:[Process_1, Process_2, Process_3, Process_4, Process_5, Process_6, Process_7, Process_8, Process_9, Process_10], process_rank:[1, 2, 3, 4, 5, 6, 7, 8, 9, 10], machine_name:[Machine_1, Machine_2, Machine_3, Machine_4, Machine_5, Machine_6, Machine_7, Machine_8, Machine_9, Machine_10], column_header:[machine_name, task_id, process_name, process_rank, start, end], limit_run_time: 30, batching: random}
[0037] The configuration information can be summarized as follows:
[0038] 1) Production name (process_name);
[0039] 2) Process rank: indicates the sequence of processes.
[0040] 3) Each machine available for production name, e.g. Machine_1 for Process_1;
[0041] 4) Other configurations, such as run time limit, output title, how to select each batch of tasks, etc. The corresponding names and numbers are just examples.
[0042] In some implementations, the first machine status information may also be referred to as machine status, including information such as machine availability and scheduled tasks on each machine.
[0043] In some implementations, the availability of the machine in the machine state may be expressed as follows:
[0044] Among them, the 0th row can indicate that machine_1 made a reservation for job_5 between time 0 and time 27. The subsequent information is similar.
[0045] In some implementations, the first task status information, which may be referred to as task status information, indicates tasks to be scheduled, and specifically includes: task ID, priority, and the like.
[0046] In some specific implementations, the tasks to be scheduled can be represented as follows, Tasks to be scheduled { Job_1, [Process_5], [5], [93.0], Job_2, [Process_1, Process_2, Process_3, Process_4, Process_5], [1, 2, 3, 4, 5], [89.0, 30.0, 91.0, 17.0, 36.0], Job_3, [Process_2, Process_3, Process_4, Process_5], [2, 3, 4, 5], [93.0, 44.0, 38.0, 19.0], Job_9, [Process_1, Process_2, Process_3, Process_4, Process_5], [1, 2, 3, 4, 5], [72, 69, 90, 30, 69],}.
[0047] The above content can be understood as follows:
[0048] (1) One task of Job_1: Process_5 needs to be completed, and the process takes 93 time units;
[0049] (2) Job_2 has five tasks: five process steps need to be completed, and the process of each step is 89, 30, 91, 17, and 46 time units;
[0050] (3) The situations of Job_3, Job_9 and Job_2 are similar and will not be described in detail.
[0051] In some embodiments, the first target information, also referred to as objectives, may include, for example, total production task duration (or makespan), machine utilization, etc. If there are multiple objectives, the priority of each objective needs to be configured.
[0052] In summary, by receiving the above information, we can further prepare for the generation of subsequent production plans.
[0053] S102: Generate a first production plan based on the first configuration information, first machine status information, first task status information, and first target information.
[0054] Specifically, based on the above-mentioned received information, this application can generate a first production plan.
[0055] The first production plan is the original production plan generated before the production emergency. This application can use the algorithm model to obtain configured, static production resource and production task data to generate a production plan. The production plan can be referred to as the first production plan. The production plan is planned in advance, has been generated when the production emergency is received, and has been executed on the manufacturing execution system when the production scheduling emergency is received.
[0056] In some embodiments, the first production plan may include the following elements:
[0057] The above formula indicates that the i-th task of the j-th job is assigned to machine m, and from time Start and end respectively. Among them, job represents a larger concept. A job includes multiple tasks, or in other words, a job consists of multiple tasks.
[0058] In some embodiments, the first machine status information and the first task status information are used as examples. Specifically, taking the implementation of scheduled tasks and tasks to be scheduled as an example, a hypothetical implementation scenario of the above method can be assumed, where the scheduled tasks are production tasks that were previously scheduled or planned the day before, and the tasks to be scheduled are production tasks that need to be scheduled today or immediately. Therefore, the scheduled tasks and tasks to be scheduled are input into the algorithm model together, thereby allocating corresponding production resources and production time periods for the tasks to be scheduled. Furthermore, the scheduled tasks are ensured to be unaffected and executed as usual, achieving the target requirements and priorities specified in the first target information, thereby generating a first production plan. The first production plan includes both the scheduled tasks and the tasks to be scheduled. In some embodiments, the task arrangement requires the setting of specific logic, parameters, and constraints, so that the device can calculate according to the settings and generate a first production plan that meets the requirements. Specific implementation steps are described below. In some embodiments, the device that generates the first production plan can also be used to generate the second production plan.
[0059] Furthermore, the method further includes receiving a production emergency, performing an impact assessment on the production emergency, and generating second machine status information and second task status information.
[0060] Specifically, the emergencies are real-time information that can be obtained from production equipment, running machines, or production lines. They can be related to production resources such as equipment, materials, and production task events, for example: rush orders, rework orders, machine failures, process delays, and other related data and information.
[0061] In some embodiments, the production emergency can be obtained from the manufacturing execution system (MES) or manually entered by on-site staff. The MES can monitor production equipment, running machines or production lines and obtain production data in real time, so as to observe emergencies such as machine downtime or production delays. In addition, the MES can also receive information such as new additional order requirements or rework orders for production line production. The MES receives and feeds back current and future production-related information to the execution object of the method (such as the device described above), thereby providing data support for the generation of a production plan.
[0062] In some embodiments, production emergencies are usually sudden, urgent, and urgent events. The events are influencing factors or influencing factors that affect or require enterprises or factories to respond, thereby adjusting the original production plan and generating a new plan as soon as possible.
[0063] Specifically, the production emergency may cause some tasks to need to be readjusted, assigned, and rescheduled. Therefore, the affected tasks are referred to as tasks related to the production emergency. These tasks may include, for example, a machine downtime on a production line, which forces tasks originally scheduled for that line to be produced on other production lines or machines; tasks requiring the rescheduling of production resources due to production delays; new tasks that need to be inserted temporarily within a certain timeframe; and related production tasks that require rework after quality inspection.
[0064] Specifically, because different production emergencies have different impacts on production or the objects they affect, it is necessary to evaluate each individual production emergency, omitting unaffected tasks and equipment. This minimizes the impact on the original plan and reduces computational complexity.
[0065] In some embodiments, the production emergency event can be represented as follows: Event representation Event = [h.MB, Machine_4, Machine_6] Event = [h.RO, Job_8, Job_9] Event = [h.PD, Machine_4, Job_7, 100]
[0066] Among them, it can be expressed as:
[0067] Event: Machine 4 crashed, and was replaced by machine 6. MB stands for Machine Breakdown.
[0068] Event: Job_8 and Job_9 need to be inserted into the queue (RO stands for Rush Order).
[0069] Event: Job_7 on machine 4 was delayed by 100 units (e.g., seconds); where PD stands for Process Delay.
[0070] Where h is related configuration parameters such as event type and name, including the above-mentioned MB, RO and PD and others.
[0071] In some embodiments, by evaluating the aforementioned emergency event, the impact of the emergency event on the machine state information and the task state information can be evaluated. In other words, in some embodiments, the impact on the scheduled tasks (Tasks that have been scheduled) and the tasks to be scheduled (Tasks to be scheduled) can be evaluated, thereby generating new example information such as the previously shown scheduled tasks (Tasks that have been scheduled) and tasks to be scheduled (Tasks to be scheduled), that is, generating new second machine state information and second task state information. In some embodiments, the second machine state information and the second task state information are substantially the same in format as the first machine state information and the first task state information, respectively, except that the content thereof may differ due to the emergency event.
[0072] In one embodiment, when an emergency occurs, at the time of the emergency, the status of the machine and the task are checked to obtain information such as the following:
[0073] Then further get the updated machine and task status, for example:
[0074] Furthermore, the method also includes generating second target information based on the first production plan; and generating a second production plan based on the first configuration information, the second machine status information, the second task status information and the second target information.
[0075] After the above-mentioned emergency occurs, the generation or update of the second machine status information and the second task status information is completed. At this time, the target information needs to be updated to cope with the new total production task time target, or the new production machine utilization rate target, etc. Since the first production plan has been generated before, the new second target information can be generated with reference to the first production plan. Then, based on the first configuration information, the second machine status information, the second task status information and the second target information, the second production plan is generated. In some embodiments, the generation of the second production plan requires the design of specific logic, parameters, and constraints so that the above-mentioned device can calculate according to the settings to generate a second production plan that meets the requirements. The details are described later.
[0076] The device for generating the second production plan may be the device for generating the first production plan previously. That is, the device may generate a scheduled production plan based on predetermined input information, such as first configuration information, first machine status information, first task status information, and first target information; or it may obtain, for example, second machine status information, second task status information, and second target information based on received emergency events, corresponding evaluation results, and updated information of the above-mentioned input information, and then generate a rescheduling second production plan, which is flexible and adaptable to multiple scenarios.
[0077] Furthermore, the generation of the aforementioned first and second production plans, i.e., scheduling and rescheduling, can refer to the following logic or constraints. Specifically, production tasks are divided into batches based on the first configuration information; production resources for the batches are arranged based on the constraints; wherein the production resources include production machines, production time periods, and production sequences.
[0078] In some embodiments, related tasks are batched. Whether to batch, how to batch, and the number of tasks in each batch can be specifically configured or set. The purpose of batching is to effectively adjust the order of tasks within each batch, as well as the order between batches and the allocation of production resources. This allows for more rational and refined allocation of production resources, such as scheduling production machines and adapting to previously planned idle periods of production machines.
[0079] Specifically, the constraints may be some processes, sequences, steps, time limits and other constraints that must be followed in production. This is because the production arrangements of some tasks must be based on the completion of the previous task, and some tasks can be produced as the initial task or the first process, while some tasks cannot be performed as the first process or the initial task. In addition, some tasks must be produced on certain machines or production lines, while other production lines may not be able to produce or cannot be replaced. There may also be production time requirements, such as the next task can only be executed after the previous task is completed, and there may even need to be some gaps in between two different tasks to prepare for the execution of the next task.
[0080] Specifically, arranging the production resources in batches further includes:
[0081] The optimal scheduling plan is found through Mixed Integer Programming (MIP), which specifically includes: scheduling tasks to corresponding machines; and determining the order between different tasks in a batch of tasks.
[0082] Find the earliest available time slot for this batch of tasks on the configured machines. Specifically, the occupied time slots must remain unchanged, and the order of tasks within the batch must remain unchanged. The production resources may include production time and information such as production machines or production lines.
[0083] Then, by using the core algorithm to schedule and reschedule within the specified response time, the core algorithm design can be as follows: the production task belongs to the initial task or the subsequent task of the production machine; the production task is only the subsequent task of one or a single predecessor task; the production machine has only one initial task; the start time of the successor task is later than the sum of the end time and preparation time of the predecessor task; the end time of the production task is equal to the start time of the production task and the processing time of the production task; the processing time of the total production task is later than the end time of each production task. The specific expression is as follows:
[0084] Minimize makespan
[0085] Given,
[0086] makespan≥0
[0087] ·
[0088] ·
[0089] · start and end time of j1
[0090] ·
[0091] Subject to,
[0092] · each task is the first task on a machine or the successor of one other task on a machine
[0093] · each task can only be predecessor of at most one task
[0094] · at most one first task on a machine
[0095] · on a machine next task starts after prior task and setup finish
[0096] · end time of each task equals start time plus processing time
[0097] · if j1needs to be finished before j2starts,ierespect sequence of tasks
[0098] · makespan larger than finishing time of all tasks
[0099] After multiple iterations and calculations within a limited time, the final first or second production plan that satisfies the constraints and meets the target information (such as minimizing total task processing time or maximizing machine utilization efficiency) is output as the production plan. This output can include output to the MES or simply output in a file format.
[0100] In some specific implementations, rescheduling policies can be evaluated and tested in terms of: 1) time-based efficiency, such as total work time (makespan), average resource utilization, etc.; 2) stability, such as the start time deviation between the new and original schedules; 3) cost, such as computational cost, reset cost, etc.
[0101] In some specific embodiments, the existing rescheduling algorithms may mainly include: (1) genetic algorithms, (2) construction heuristic algorithms, (3) strategy learning methods, etc. On the one hand, genetic algorithms and heuristic methods rely on predefined heuristic methods, such as chromosome representation, mutation, search methods, etc., and lack the flexibility to adapt to new situations. At the same time, iterations need time to converge to get a solution, which may not be fast enough for dynamic manufacturing system control (for example, giving a solution within 1 minute). On the other hand, strategy learning methods may be expensive in terms of time and cost because they are heavily dependent on samples collected offline or online to explore strategies.
[0102] To overcome these limitations, in this work, we propose a fully automatic and flexible framework for task scheduling and rescheduling problems that can: 1) handle any type of unexpected disturbances; 2) find feasible solutions within a time constraint; and 3) be data efficient.
[0103] Key technical features include:
[0104] 1. General problem representation: event, task, and machine availability. 2. A unified framework to handle both task scheduling and rescheduling problems given the real-time status of machines and tasks. 3. A method to provide solutions within the required response time.
[0105] step:
[0106] 1. Input data from the Manufacturing Execution System (MES), including:
[0107] a. Configuration: bill of process information, running time limit, task priority, special constraints, etc.
[0108] b. Machine status: machine availability, scheduled tasks on each machine, etc.
[0109] c. Tasks to be scheduled: task ID, priority, etc.
[0110] d. Objectives: If there are multiple objectives, the priority of each objective needs to be configured.
[0111] 2. Generate a schedule based on the above data.
[0112] 3. Return the above schedule to the manufacturing execution system.
[0113] 4. Monitor the real-time manufacturing process and the return status of machines and tasks.
[0114] 5. Update the model device input with real-time information about machines, tasks, and events.
[0115] 6. Perform rescheduling and updating schedules.
[0116] Here is an example:
[0117] 1. For large-scale complex problems, a balance needs to be struck between reaction time (or computing time) and the quality of the optimized solution. The longer the calculation time is allowed and the higher the computing power is, the more likely it is to find the optimal solution. Conversely, given limited computing time and computing power, it is possible to find a suboptimal solution rather than an optimal solution. Within a limited running time (within 1 to 5 minutes), the method of the present application can find a solution close to the limit or benchmark, or the best known solution. It can be seen that the longer the running time, the better the solution. The benchmark data comes from a definition of the flow shop problem in a document.
[0118] Notes: 1) ID_60s: the proposed method runs in 60 seconds; 2) ID_300s: the proposed method runs in 300 seconds.
[0119] 2. This framework and method can handle three typical events (machine failure, rush order, and process delay) and find low-cost (rescheduling within an acceptable response time, for example, within 1 minute) and low-impact (rescheduling only the affected tasks, minimizing the impact on the makespan and maintaining machine utilization) solutions. This framework and method can be extended to handle other abnormal events.
[0120] For example, in some embodiments, an example of a machine failure is as follows: Machine_4 fails, and Job_4 / Job_6 / Job_2 needs to be rescheduled on Machine_6 (replacing Machine_4) and Machine_5 (the next process after Machine_4). They are then rescheduled on Machine_6, and the total makespan of the tasks remains unchanged. An example of a rush order is: Job_8 and Job_9 need to be inserted at a certain time. Some tasks are unaffected, while others are rescheduled. After the rescheduling, machine utilization increases. An example of a process delay is: Job_7 on Machine_4 is delayed by 100 units. After the rescheduling, the total makespan of the tasks is only affected by 69 units.
[0121] The technical effects of the above embodiments can be as follows: (1) The proposed framework and method can handle scheduling and rescheduling problems simultaneously; (2) The proposed framework and method are flexible to any type of unexpected events, that is, only data and configuration need to be updated. The core algorithm can be reused. Combined with real-time data, the scheduling and rescheduling process can be fully automated without human intervention. (3) A feasible solution can always be found within an acceptable response time. The longer the acceptable response time, the better the solution effect or solution.
[0122] FIG2 provides a device (200) for production task scheduling. The device (200) includes: a first information receiving module (201) for receiving first configuration information, first machine status information, first task status information, and first target information; and a first plan generating module (202) for generating a first production plan based on the first configuration information, first machine status information, first task status information, and first target information.
[0123] Furthermore, the device (200) further includes: an emergency event module (203) for receiving a production emergency event, performing an impact assessment on the production emergency event, and generating second machine status information and second task status information.
[0124] Furthermore, the device (200) also includes a second target generation module (204) for generating second target information based on the first production plan; and a second plan generation module (205) for generating a second production plan based on the first configuration information, the second machine status information, the second task status information and the second target information.
[0125] Furthermore, the first plan generation module 202 or the second plan generation module 205 is further configured to divide the production tasks into batches according to the first configuration information; and arrange the production resources of the batches according to the constraints; wherein the production resources include production machines, production time periods and production sequences.
[0126] Furthermore, the constraints include: the production task belongs to the initial task or the successor task of the production machine; the production task is the successor task of a single predecessor task; the production machine has only one initial task; the start time of the successor task is later than the sum of the end time and preparation time of the predecessor task; the end time of the production task is equal to the start time of the production task and the processing time of the production task; the processing time of the total production task is later than the end time of each production task.
[0127] It should be noted that the apparatus may include more or fewer modules to implement the described functionality. For example, at least one module in FIG. 2 may be further divided into a plurality of different submodules, each of which is configured to perform at least a portion of the operations described herein in conjunction with the corresponding module. Furthermore, in some examples, the apparatus 200 may further include additional modules for performing other operations already described in the specification. Furthermore, those skilled in the art will appreciate that the exemplary apparatus 200 may be implemented using software, hardware, firmware, or any combination thereof.
[0128] Figure 3 provides a computer device. According to one embodiment, the computer device 300 may include a processor 302, which executes a computer program stored in a memory 304. When the computer program is executed by the processor, the above method is implemented.
[0129] Those skilled in the art will understand that the structure shown in Figure 3 is merely a block diagram of a portion of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which 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 component arrangement.
[0130] Those skilled in the art will appreciate that all or part of the processes in the methods for implementing the above-mentioned embodiments can be accomplished 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 processes for the implementation of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the various embodiments provided in this application may include at least one of non-volatile and volatile memory. Non-volatile memory may include read-only memory (ROM), magnetic tape, floppy disk, flash memory or optical memory, etc. Volatile memory may include random access memory (RAM) or external cache memory. 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).
[0131] The present application also provides a computer-readable storage medium having a computer program stored thereon, which implements the above steps when the computer program is executed by a processor.
[0132] The present application also provides a computer program product, which is tangibly stored on a computer-readable medium and includes computer-executable instructions. When the computer-executable instructions are executed, the computer-executable instructions cause at least one processor to perform the above method.
[0133] Furthermore, the computer program can be stored and run in the cloud to perform the method. Furthermore, the components of the program can be deployed on multiple devices and the cloud. For example, the corresponding steps can be deployed and run on a local or local computer, or run on different cloud devices, transmitting signals via a communication connection, or can also be deployed and run on a local or local computer. This application does not limit the described methods or approaches, and corresponding technologies can be flexibly deployed and deployed to fully utilize equipment and technologies such as the cloud, big data, and supercomputing capabilities to execute and complete the method.
[0134] Some implementations of the present disclosure may include articles of manufacture. Articles of manufacture may include storage media for storing logic. Examples of storage media may include one or more types of computer-readable storage media capable of storing electronic data, including volatile or non-volatile memory, removable or non-removable memory, erasable or non-erasable memory, writable or rewritable memory, and the like. Examples of logic may include various software units, such as software components, programs, applications, computer programs, application programs, system programs, machine programs, operating system software, middleware, firmware, software modules, routines, subroutines, functions, methods, processes, software interfaces, application program interfaces (APIs), instruction sets, computing codes, computer codes, code segments, computer code segments, words, values, symbols, or any combination thereof. In some implementations, for example, articles of manufacture may store executable computer program instructions that, when executed by a processor, cause the processor to perform the methods and / or operations described herein. Executable computer program instructions may include any suitable type of code, such as source code, compiled code, interpreted code, executable code, static code, dynamic code, and the like. Executable computer program instructions can be implemented according to a predefined computer language, method or syntax for commanding a computer to perform a specific function. The instructions can be implemented using any appropriate high-level, low-level, object-oriented, visual, compiled and / or interpreted programming language.
[0135] What has been described above includes examples of the disclosed architecture. It is, of course, not possible to describe every conceivable combination of components and / or methodologies, but those skilled in the art will appreciate that many other combinations and permutations are possible. Therefore, the novel architecture is intended to embrace all such alternatives, modifications, and variations that fall within the spirit and scope of the appended claims.
Claims
1. A method (100) for scheduling production tasks, wherein: include: receiving first configuration information, first machine status information, first task status information, and first target information; A first production plan is generated according to the first configuration information, the first machine status information, the first task status information and the first target information.
2. The method (100) according to claim 1, wherein: Also includes: A production emergency event is received, an impact assessment is performed on the production emergency event, and second machine status information and second task status information are generated.
3. The method (100) according to claim 2, wherein: Also includes: generating second target information according to the first production plan; A second production plan is generated according to the first configuration information, the second machine status information, the second task status information and the second target information.
4. The method (100) according to claim 1 or 3, wherein: Generating the first production plan or the second production plan includes: Divide the production tasks into batches according to the first configuration information; Arrange the production resources of the batch according to the constraint conditions; wherein the production resources include production machines, production time periods and production sequences.
5. The method (100) according to claim 4, wherein: The constraints include: The production task belongs to the initial task or subsequent task of the production machine; A production task is a successor to a single predecessor task; The production machine has only one initial task; The start time of the successor task is later than the sum of the end time and preparation time of the predecessor task; The end time of a production task is equal to the start time of the production task and the processing time of the production task; The processing time of the total production task is later than the end time of each production task.
6. A device (200) for scheduling production tasks, wherein: include: The first information receiving module (201) is used to receive first configuration information, first machine status information, first task status information, state information and first target information; The first plan generating module (202) is used to generate a first production plan according to the first configuration information, the first machine status information, the first task status information and the first target information.
7. The device (200) according to claim 6, wherein: Also includes: The emergency module (203) is used to receive a production emergency, perform an impact assessment on the production emergency, and generate second machine status information and second task status information.
8. The device (200) according to claim 7, wherein: Also includes, A second target generating module (204), configured to generate second target information according to the first production plan; The second plan generating module (205) is used to generate a second production plan according to the first configuration information, the second machine status information, the second task status information and the second target information.
9. The device (200) according to claim 6 or 8, wherein: The first plan generating module (202) or the second plan generating module (205) is further configured to: Divide the production tasks into batches according to the first configuration information; and Arrange the production resources of the batch according to the constraint conditions; wherein the production resources include production machines, production time periods and production sequences.
10. The device (200) according to claim 9, wherein: The constraints include: The production task belongs to the initial task or subsequent task of the production machine; A production task is only a successor to a predecessor task; The production machine has only one initial task; The start time of the successor task is later than the sum of the end time and preparation time of the predecessor task; The end time of a production task is equal to the start time of the production task and the processing time of the production task; The processing time of the total production task is later than the end time of each production task.
11. 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 5 are implemented.
12. A computer-readable storage medium having a computer program stored thereon, wherein: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 5 are implemented.
13. A computer program product tangibly stored on a computer readable medium and comprising computer executable instructions which, when executed, cause at least one processor to perform the method according to any one of claims 1 to 5.
Citation Information
Patent Citations
Complex structural member processing workshop prediction-reaction scheduling method
CN112904818A
Task allocation method and system based on adaptive ant colony algorithm
CN115689252A
Production schedule preparation method and system therefor
JP2009075631A
Device, method, and system for business plan management
US20230011954A1
Cited By
Production scheduling optimization method and system based on genetic algorithm
CN121836235A
