Solid-state brewing vinasse discarding task scheduling method and device based on interval coverage and medium

Abstract

The invention discloses a solid-state brewing vinasse discarding task scheduling method and equipment based on interval coverage and a medium, belongs to the field of food processing automation, and is used for scheduling vinasse discarding tasks of a vinasse discarding device of a solid-state brewing intelligent brewing factory, and the method comprises the following steps: 1, obtaining information of all vinasse discarding tasks from a production line of the solid-state brewing intelligent brewing factory; 2, according to the information of the vinasse discarding tasks, modeling all the vinasse discarding tasks as an interval coverage problem; step 3, according to the interval of the interval coverage problem, performing sorting from small to large by taking the interval left end point as a keyword, and obtaining a sorted task sequence as the optimal scheduling sequence of the vinasse discarding task; and step 4, performing optimal scheduling on the vinasse discarding tasks: executing the vinasse discarding tasks according to the obtained sorted task sequence. According to the method, the waiting time caused by blockage of a vinasse throwing task in solid-state fermentation production can be remarkably shortened, task conflicts are reduced, and the waiting time of each vinasse throwing port is shortened, so that the solid-state fermentation production efficiency is improved.

Description

Technical Field

[0001] This invention relates to the field of food processing automation technology, and in particular to a method, equipment and medium for scheduling solid-state brewing lees discarding tasks based on interval coverage. Background Technology

[0002] Solid-state brewing is a traditional production process that transforms grains and other raw materials into complex-flavored foods using microbial communities on a solid substrate with almost no free water. The overall process of solid-state brewing involves multiple steps, including raw material preparation, fermentation, distillation, aging, cooling, and lees disposal. Lees disposal is a crucial step in the solid-state brewing process, and its efficiency directly affects the smoothness of the production line and the stability of the equipment. After multiple uses, the lees need to be sent to the lees disposal point; failure to do so in a timely manner will cause the solid-state brewing production line to stagnate. Furthermore, prolonged lees storage will cause the lees temperature to drop, further extending the disposal time and reducing production efficiency. Therefore, accurately predicting lees disposal tasks and scheduling the lees disposal sequence online are of great significance for improving production efficiency and reducing worker working hours.

[0003] The task scheduling problem with missing tasks is a typical online scheduling problem. A common strategy for solving online scheduling problems is the First-In-First-Out (FIFO) algorithm. The FIFO algorithm always executes the first task to arrive, making it an effective method for solving online scheduling problems. However, the traditional FIFO algorithm has some drawbacks in solving the task scheduling problem with missing tasks. For example, missing tasks are diverse, and the time taken for tasks is uncertain. Although FIFO can guarantee that tasks are processed in order, it may sacrifice efficiency, as multiple short tasks may be delayed because they have to wait for longer tasks to complete. Therefore, the FIFO algorithm can lead to unnecessary blocking of tasks, thus failing to obtain the optimal task scheduling solution, increasing the average waiting time of tasks, and ultimately affecting production.

[0004] In summary, existing technologies face challenges in scheduling waste disposal tasks in solid-state brewing, including tasks arriving online, a large number of tasks, and difficulties in scheduling. Existing waste disposal task scheduling algorithms are not intelligent and have limited efficiency, thus restricting the production efficiency of solid-state brewing. A new scheduling scheme is urgently needed to address these issues.

[0005] In view of this, the present invention is hereby proposed. Summary of the Invention

[0006] The purpose of this invention is to provide a method, device and medium for scheduling solid-state brewing slag discarding tasks based on interval coverage. This method can obtain the theoretical optimal solution for scheduling solid-state brewing slag discarding tasks with relatively low time complexity, improve the production efficiency of solid-state fermentation, and facilitate the efficient production of solid-state brewing plants. It also solves the problems of low efficiency and unintelligent scheduling in solid-state brewing slag discarding systems.

[0007] The objective of this invention is achieved through the following technical solution: A method for scheduling waste discarding tasks in solid-state brewing based on interval coverage, used to schedule waste discarding tasks of the waste discarding device in a smart solid-state brewing plant, includes: Step 1: Obtain information on all waste disposal tasks from the waste disposal device. Obtain information on all waste disposal tasks from the production line of the solid-state brewing smart brewing plant; Step 2, model the waste disposal task as an interval covering problem: Based on the information of all lost tasks obtained in step 1, all lost tasks are modeled as an interval coverage problem. Step 3, sort the discarded tasks: Based on the interval coverage problem modeled in step 2, the intervals of the interval coverage problem are sorted in ascending order by using the left endpoint of the interval as the key. The sorted task sequence is then used as the optimal scheduling order for the lost tasks. Step 4: Perform optimal scheduling for discarded tasks: Execute each discarded task according to the sorted task sequence obtained in step 3.

[0008] A processing apparatus, comprising: At least one memory for storing one or more programs; At least one processor is capable of executing one or more programs stored in the memory, such that when the processor executes one or more programs, the processor can implement the method of the present invention.

[0009] A readable storage medium storing a computer program that, when executed by a processor, enables the implementation of the methods described in this invention.

[0010] Compared with the prior art, the advantages of the solid-state brewing lees discarding task scheduling method, device and medium based on interval coverage provided by the present invention include: Through mathematical modeling transformation, the originally complex scheduling problem was converted into a simple interval covering problem, which can obtain the theoretical optimal solution with very low time complexity. This solves the problems of low efficiency and unintelligent scheduling in the lees discarding system of solid-state brewing, and is of great significance for the high-efficiency production of solid-state brewing. It effectively solves the scheduling problem of lees discarding tasks in solid-state fermentation, significantly reduces the waiting time caused by lees discarding tasks blocking in solid-state fermentation production, reduces task conflicts, reduces waiting time at each lees discarding point, and thus increases the production efficiency of solid-state fermentation. Attached Figure Description

[0011] To more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings used in the following description of the embodiments will be briefly introduced. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0012] Figure 1 A flowchart of an offline scheduling method for solid-state brewing lees discarding tasks based on interval coverage, provided in an embodiment of the present invention.

[0013] Figure 2 This is a schematic diagram of the slag discarding device and the slag discarding task in the offline scheduling method for solid-state brewing slag discarding task based on interval coverage provided in an embodiment of the present invention.

[0014] Figure 3 The flowchart shows step 2 of the offline scheduling method for solid-state brewing lees dropping tasks based on interval coverage provided in an embodiment of the present invention.

[0015] Figure 4 This is a schematic diagram illustrating the solution of the transformed interval coverage problem in the offline scheduling method for solid-state brewing lees loss tasks based on interval coverage provided in this embodiment of the invention. Detailed Implementation

[0016] The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the specific content of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments, which do not constitute a limitation of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the protection scope of the present invention.

[0017] First, the following explanations are provided for the terms that may be used in this article: The term "and / or" means that either or both can be achieved simultaneously. For example, X and / or Y means that it includes both "X" or "Y" as well as the three cases of "X and Y".

[0018] The terms "comprising," "including," "containing," "having," or other similar semantic descriptions should be interpreted as non-exclusive inclusion. For example, including a technical feature element (such as raw material, component, ingredient, carrier, dosage form, material, size, part, component, mechanism, device, step, process, method, reaction conditions, processing conditions, parameter, algorithm, signal, data, product or article of manufacture, etc.) should be interpreted as including not only the expressly listed technical feature element, but also other technical feature elements that are not expressly listed and are well-known in the art.

[0019] The term "composed of" excludes any technical features not expressly listed. When used in a claim, it closes the claim to exclude all technical features other than those expressly listed, except for associated conventional impurities. If the term appears only in a clause of a claim, it limits the claim to the elements expressly listed in that clause; elements recited in other clauses are not excluded from the overall claim.

[0020] Unless otherwise explicitly specified or limited, the terms "installation," "connection," "linking," and "fixing," etc., should be interpreted broadly. For example, they can refer to fixed connections, detachable connections, or integral connections; they can refer to mechanical connections or electrical connections; they can refer to direct connections or indirect connections through an intermediate medium; and they can refer to the internal connection between two components. Those skilled in the art can understand the specific meaning of the above terms in this document according to the specific circumstances.

[0021] The terms “center,” “longitudinal,” “lateral,” “length,” “width,” “thickness,” “upper,” “lower,” “front,” “back,” “left,” “right,” “vertical,” “horizontal,” “top,” “bottom,” “inner,” “outer,” “clockwise,” and “counterclockwise” indicate the orientation or positional relationship based on the orientation or positional relationship shown in the accompanying drawings. They are used only for the convenience and simplification of description and do not imply that the device or component referred to must have a specific orientation, or be constructed and operated in a specific orientation. Therefore, they should not be construed as limitations on this document.

[0022] The solution provided by this invention will be described in detail below. Contents not described in detail in the embodiments of this invention are prior art known to those skilled in the art. Where specific conditions are not specified in the embodiments of this invention, they shall be performed according to conventional conditions in the art or conditions recommended by the manufacturer. Reagents or instruments used in the embodiments of this invention whose manufacturers are not specified are all conventional products that can be purchased commercially.

[0023] like Figure 1 , Figure 2 and Figure 3 As shown, this invention provides an offline scheduling method for solid-state brewing lees discarding tasks based on an interval covering algorithm, used to schedule lees discarding tasks of a lees discarding device in a solid-state brewing intelligent brewing plant, including: Step 1: Obtain information on all waste disposal tasks from the waste disposal device. Obtain information on all waste disposal tasks from the production line of the solid-state brewing smart brewing plant; Step 2, model the waste disposal task as an interval covering problem: Based on the information of all lost tasks obtained in step 1, all lost tasks are modeled as an interval coverage problem. Step 3, sort the discarded tasks: Based on the interval coverage problem modeled in step 2, the intervals of the interval coverage problem are sorted in ascending order by using the left endpoint of the interval as the key. The sorted task sequence is then used as the optimal scheduling order for the lost tasks. Step 4: Perform optimal scheduling for discarded tasks: Execute each discarded task according to the sorted task sequence obtained in step 3.

[0024] Preferably, in step 1 of the above method, the information for all lost tasks includes: The number of tasks, the arrival time of each task, the distance between the drop point of each task and the drop point end, and the duration of each task.

[0025] See Figure 2 In the above method, the slag-discarding belt, which serves as the slag-discarding device, is equipped with several slag-discarding openings and a slag-discarding endpoint at the end. The slag-discarding task is generated at a certain slag-discarding opening at time t, and the slag-discarding task hopes to open the slag-discarding opening at a certain time to discard the slag for a duration of t0.

[0026] See Figure 3 Preferably, in step 2 of the above method, all lost tasks are modeled as an interval covering problem based on the information of all lost tasks obtained in step 2, including: First, identify the original problem of the lost task: On the lees discarding belt, which is a lees discarding device, there are several lees discarding tasks with a length and a duration of t0. Some of these lees discarding tasks are extended for a period of time. The goal is to minimize the total delay time of the lees discarding tasks and ensure that the number of overlapping layers of lees length at any position of the lees discarding belt at any time does not exceed 3. The original problem of determining the loss task is transformed into an interval covering problem, as follows: There are several intervals for lees disposal tasks on the time axis. The interval of a lees disposal task refers to the duration of time that the lees disposal task occupies on the time axis without delay (e.g., if a lees disposal task produces lees that arrive at the lees disposal endpoint at time a and leave the lees disposal endpoint at time b without delay, then the duration of time it occupies on the lees disposal endpoint on the time axis is the interval [a, b)). Delay some of these intervals by a certain distance and find the interval with the shortest total delay distance.

[0027] The rationale for this transformation is as follows: Since the number of overlapping layers of lees length at any lees drop conveyor position at any given time is no more than 3, it is equivalent to the number of overlapping layers of lees length at the lees drop conveyor at any given time being no more than 3. Ignoring the lees overlap caused by the lees drop task in other places, we only consider the lees overlap at the lees drop conveyor at the lees drop endpoint. Therefore, we can consider the time occupied by each lees drop task at the lees drop endpoint on the time axis. That is, "the number of overlapping layers of lees length at the lees drop endpoint at any given time is no more than 3" is equivalent to "the number of overlapping layers of the time intervals corresponding to each task on the time axis is no more than 3", thus transforming the original problem into an interval covering problem.

[0028] Preferably, in step 3 of the above method, the interval covering problem modeled in step 2 is sorted in ascending order by using the left endpoint of the interval as the key, and the sorted task sequence is used as the optimal scheduling order for the lost tasks, including: Starting from the leftmost interval of the interval coverage problem obtained from step 2, the interval for the discarding task is executed. When the intervals of discarding tasks overlap, the interval of the discarding task to the right is delayed. By doing this, the optimal solution to the problem is to sort task i by the left endpoint of the interval to obtain a new task sequence. The new task sequence is the optimal scheduling order of the discarding tasks.

[0029] This invention also provides a processing apparatus, comprising: At least one memory for storing one or more programs; At least one processor is capable of executing one or more programs stored in the memory, such that when the processor executes one or more programs, the processor can implement the methods described above.

[0030] The present invention further provides a readable storage medium storing a computer program that, when executed by a processor, can implement the above-described method.

[0031] To more clearly demonstrate the technical solution and its effects provided by the present invention, the following detailed description of the solution provided by the embodiments of the present invention is provided with reference to specific examples.

[0032] Example 1 like Figures 1 to 4 As shown, this embodiment provides a method for scheduling solid-state brewing lees discarding tasks based on interval coverage, including the following steps: Step 1, enter the lost task information: First, all information regarding all spoilage tasks is obtained through the data reading interface provided by the solid-state brewing smart factory. Specifically: Current solid-state brewing intelligent brewing plants' lees disposal devices, such as Figure 2 As shown, the lees disposal device is a lees disposal belt with several lees disposal openings and a lees disposal endpoint at the end. A lees disposal task is generated at a specific lees disposal opening at a specific time. Each lees disposal task has the same importance and a disposal duration of t0. When a lees disposal task arrives, if the lees cannot be disposed of immediately, a waiting time will occur. Here, lees disposal refers to the act of discarding lees after multiple uses; lees disposal opening refers to the starting position of lees disposal; lees disposal belt refers to the device used to transport the lees from the lees disposal opening out of the factory; lees layer number refers to the number of layers of lees carried at a specific position on the lees disposal belt; lees disposal task refers to the lees disposal request generated at a specific lees disposal opening at a specific time; and waiting time refers to the waiting period after the lees disposal task is generated before disposal begins. Specifically, the lees discarding conveyor belt, acting as the lees discarding device, is represented by a bus segment. This conveyor belt has several lees discarding ports; here, we assume there are 15 fixed and known lees discarding ports, grouped into sets of 5 representing a production workshop in the solid-state brewing smart factory, represented by circles on the bus segment. The lees discarded from the lees discarding ports travel from right to left on the conveyor belt, eventually reaching the lees discarding endpoint, represented by a triangle. A lees discarding task is generated at a certain time (let's say time t) at a certain lees discarding port (let's say the distance from this lees discarding port to the lees discarding endpoint is det), represented by a square. The lees discarding task aims to open this lees discarding port at a certain time to discard the lees for a duration of t0 (each lees discarding task has the same importance, and t0 is also the same). The lees generated by the lees discarding task are represented by line segments on the circles.

[0033] The constraint of the lees dropping device is that if lees cannot be dropped immediately upon arrival of a lees dropping task, a waiting time will occur. For a certain lees dropping task, assuming it arrives at the lees dropping port k at time t and starts execution at time t', this lees dropping task will drop lees onto the lees dropping conveyor belt at the lees dropping port k from time t' to time t'+t0, incurring a waiting time of t'-t. Furthermore, the number of lees layers at any position on the lees dropping conveyor belt cannot exceed 3 layers (hereinafter referred to as the constraint). The optimization objective is to minimize the total waiting time of the lees dropping task.

[0034] In this step, the method of this embodiment reads information about all the waste disposal tasks. Specifically, it includes: (1) the number of tasks n; (2) the arrival time t of each task; (3) the distance det between the waste disposal point where each task is located and the waste disposal endpoint; and (4) the duration t0 of each task.

[0035] Step 2: Analyze the lost or damaged task information and transform the problem: After reading all the information for the lees discarding tasks, this method uses mathematical modeling to transform the originally complex industrial scenario problem into an equivalent interval covering problem, simplifying the problem-solving process and greatly facilitating the design of scheduling methods. Specifically, the constraint for the lees discarding task in solid-state brewing is that the number of lees layers at any position on the lees discarding conveyor belt cannot exceed 3 layers. Because the lees on the lees discarding conveyor belt move from right to left, "the number of lees layers at any position on the lees discarding conveyor belt at any time cannot exceed 3 layers" is equivalent to "the number of lees layers at the end point of the lees discarding process at any time cannot exceed 3 layers." For a certain lees disposal task i, assuming it arrives at the lees disposal port k at time t, and the time required for the lees discarded from port k to reach the disposal endpoint is det, and it starts execution at time t', then this lees disposal task, from time t' to time t'+t0, disposes of lees at port k onto the lees disposal conveyor belt, incurring a waiting time of t'-t. In other words, the lees from lees disposal task i occupy one layer at the disposal endpoint from time t'+det to time t'+det+t0. For simplicity, let the waiting time of lees disposal task i be tw, and l = t+det. Then, lees disposal task i transports one layer of lees at the disposal endpoint during the interval [l+tw, l+tw+t0]. The original problem is then transformed into: given several intervals of length t0, some intervals can be delayed by a certain distance; find the shortest total delay distance for the region, such that the number of overlapping layers of intervals at any time does not exceed 3. See [link to relevant documentation]. Figure 3 .

[0036] Step 3: Sort the tasks according to the task information: For the transformed problem, starting from the leftmost interval, execute the intervals for discarding tasks sequentially. When intervals for discarding tasks overlap, delay the rightmost interval; that is, when the segment segments of an interval overlap, delay the rightmost segment. Following this procedure, the result will not be worse. Therefore, the optimal solution to the transformed problem is to sort the discarding tasks i using l (hereinafter referred to as the left endpoint of the interval) as the key, and then execute them in ascending order. Formally speaking, for a task sequence of length n, 1, 2, 3, …, n, the left endpoints of the intervals for these tasks are l1, l2, l3, …, l n For these tasks, l i Sort the keywords in ascending order to obtain the new task sequence id1, id2, id3, …, id n These tasks are executed sequentially from beginning to end. For each task ID... i Find the shortest delay distance tw such that tasks id1, id2, id3, ..., id i-1 After execution begins [l idi +tw, l idi The +tw+t0] condition will not cause the constraint to be unmet, thus finding the earliest executable task ID. iThe moment t' i =t i +tw, the task ID to be executed at this time. i The waiting time for tw is the shortest waiting time. See [link / reference]. Figure 4 .

[0037] Therefore, in this step, the method of the present invention sorts the tasks read in step 1 in ascending order using t+det as the key, to obtain a new task sequence.

[0038] Step 4: Execute tasks according to the sorted task sequence: Based on the analysis in steps 1, 2, and 3, the new task sequence obtained after sorting in step 3 is the optimal scheduling order for the discarded tasks. Thus, the optimal offline scheduling strategy for the original problem is found. Executing the discarded tasks according to this optimal scheduling order achieves the optimal scheduling of the discarded tasks.

[0039] Meanwhile, obtaining the optimal scheduling strategy for offline problems can also help in finding better scheduling strategies for online problems, and can provide insights into the scheduling problem of lost or malfunctioning tasks in the online version.

[0040] The time complexity and performance analysis of the above method are as follows: The method in this embodiment only traverses the waste disposal task sequence once and sorts the task sequence once. Assuming the number of waste disposal tasks is n, the time complexity of traversal is O(n), and the expected time complexity based on quicksort is O(nlogn). Therefore, the expected time complexity of the method in this embodiment is O(n+nlogn) = O(nlogn). In real-world scenarios, the number of waste disposal tasks in a solid-state brewing factory is approximately 10^3 per day. Therefore, the method in this embodiment runs extremely fast and will not incur additional delays. In terms of performance, verified by real-time data generated in a solid-state brewing smart factory over a month, the method in this embodiment shows a performance improvement of over 40% compared to the classic FIFO algorithm. Therefore, the method in this embodiment can reduce the average waiting time of waste disposal tasks in the waste disposal process of a solid-state brewing smart factory by more than 40%, solving the problems of low efficiency and unintelligent scheduling in the waste disposal system of solid-state brewing, improving the production efficiency of solid-state fermentation, and contributing to the high-efficiency production of solid-state brewing factories.

[0041] By simulating a solid-state brewing waste disposal system that generates 600 waste disposal tasks within 24 hours, a comparison of the effects of the present invention and the original method can be obtained (total task waiting time, unit: seconds). The method of the present invention is OPT, with a total waiting time of 622,474 seconds, while the original method is FIFO, with a total waiting time of 1,028,923 seconds. It can be seen that the present invention can reduce the total task waiting time by 40% compared to the original method.

[0042] The waste disposal task scheduling method of this invention can solve the waste disposal task scheduling problem in solid-state fermentation, significantly reducing the waiting time caused by waste disposal task blockage in solid-state fermentation production, reducing task conflicts, reducing waiting time at each waste disposal point, and thus increasing the production efficiency of solid-state fermentation. This invention transforms the originally complex problem into a simple interval covering problem through mathematical modeling, achieving a theoretically optimal solution with very low time complexity. It solves the problems of low efficiency and unintelligent scheduling in solid-state brewing waste disposal systems, and is of great significance for the efficient production of solid-state brewing.

[0043] Example 2 This embodiment provides a method for scheduling waste disposal tasks in solid-state brewing based on interval coverage. Applied to waste disposal task scheduling scenarios in solid-state brewing production, it can solve the waste disposal task scheduling problem in solid-state fermentation, significantly reducing the waiting time caused by waste disposal task blockage, thereby increasing solid-state fermentation production efficiency. The process of this invention is as follows: First, information on waste disposal tasks is collected. Specifically, the arrival time and waste disposal location of the tasks are collected. Then, through mathematical modeling, the problem is transformed into solving an interval coverage problem. The interval coverage problem is solved by sorting, and finally, the sorting result is output as the waste disposal task scheduling result, thus obtaining the optimal scheduling for the waste disposal problem. Figure 3 This is a flowchart of the method of the present invention. Figure 4 This is a flowchart illustrating the task sorting process of this invention.

[0044] An example of solving the method in this embodiment is as follows: Figure 4 As shown, press l i The tasks are sorted and executed sequentially: tasks 1, 2, and 3. For task 4, the interval [l4, l4+t0] overlaps with the first three tasks by more than four layers, therefore it needs to be delayed. The shortest delay distance tw4 is found to execute task 4. This process is repeated until the shortest delay distance tw5 is found to execute task 5. At this point, the waiting times for the five tasks are 0, 0, 0, tw4, and tw5, respectively. The execution times in the original problem are t1, t2, t3, t4+tw4, and t5+tw5. The total waiting time for the tasks is tw4+tw5. This demonstrates the optimal offline scheduling strategy for the original problem.

[0045] Those skilled in the art will understand that all or part of the processes in the above embodiments can be implemented by a program instructing related hardware. The program can be stored in a computer-readable storage medium, and when executed, it can include the processes of the embodiments of the above methods. The storage medium can be a magnetic disk, optical disk, read-only memory (ROM), or random access memory (RAM), etc.

[0046] The above description is merely a preferred embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in the present invention should be included within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims. The information disclosed in the background section is intended only to enhance the understanding of the overall background technology of the present invention and should not be construed as an admission or implication in any way that such information constitutes prior art known to those skilled in the art.

Claims

1. A method for scheduling solid-state brewing lees discarding tasks based on interval coverage, characterized in that, The waste disposal tasks for scheduling the waste disposal unit in a solid-state brewing smart brewery include: Step 1: Obtain information on all waste disposal tasks from the waste disposal device. Obtain information on all waste disposal tasks from the production line of the solid-state brewing smart brewing plant; Step 2, model the waste disposal task as an interval covering problem: Based on the information of all lost tasks obtained in step 1, all lost tasks are modeled as an interval coverage problem. Step 3, sort the discarded tasks: Based on the interval coverage problem modeled in step 2, the intervals of the interval coverage problem are sorted in ascending order by using the left endpoint of the interval as the key. The sorted task sequence is then used as the optimal scheduling order for the lost tasks. Step 4: Perform optimal scheduling for discarded tasks: Execute each discarded task according to the sorted task sequence obtained in step 3.

2. The solid-state brewing lees discarding task scheduling method based on interval coverage according to claim 1, characterized in that, In step 1, the information for all lost tasks includes: The number of tasks, the arrival time of each task, the distance between the drop point and the drop end of each task, and the duration of each task.

3. The solid-state brewing lees discarding task scheduling method based on interval coverage according to claim 1 or 2, characterized in that, In step 2, based on the information of all lost tasks obtained in step 1, all lost tasks are modeled as an interval coverage problem in the following manner: First, identify the original problem of the lost task: On the lees discarding belt, which is a lees discarding device, there are several lees discarding tasks with a length and a duration of t0. Some of these lees discarding tasks are extended for a period of time. The goal is to minimize the total delay time of the lees discarding tasks and ensure that the number of overlapping layers of lees length at any position of the lees discarding belt at any time does not exceed 3. The original problem of determining the loss task is transformed into an interval covering problem, as follows: There are several intervals of discarded tasks on the timeline. The interval of a discarded task refers to the time that the discarded task occupies on the timeline to the discard endpoint without delay. Some intervals are delayed by a certain distance. Find the interval with the shortest total delay distance.

4. The solid-state brewing lees discarding task scheduling method based on interval coverage according to claim 3, characterized in that, In step 3, based on the interval coverage problem modeled in step 2, the intervals of the interval coverage problem are sorted in ascending order using the left endpoint of the interval as the key. The resulting sorted task sequence serves as the optimal scheduling order for the dropped tasks, including: Starting from the leftmost interval of the interval covering problem obtained from step 2, the interval for the discarding task is executed. When the intervals of the discarding tasks overlap, the interval of the discarding task to the right is delayed. By doing this, the optimal solution to the problem is to sort task i by the left endpoint of the interval to obtain a new task sequence. The new task sequence is the optimal scheduling order of the discarding tasks.

5. A processing device, characterized in that, include: At least one memory for storing one or more programs; At least one processor is capable of executing one or more programs stored in the memory, such that when the one or more programs are executed by the processor, the processor can perform the method according to any one of claims 1-4.

6. A readable storage medium storing a computer program, characterized in that, When the computer program is executed by a processor, it can implement the method described in any one of claims 1-4.

Images