Sequence planning method for sample automation run

Abstract

The present application provides a sequence planning method for sample automatic operation, comprising the following steps: (A1) obtaining a processing method with the longest occupation time according to each sample; (A2) obtaining the remaining amount of the sample corresponding to each processing method according to batch processing capacity; (A3) establishing a primary matching between the samples corresponding to the processing method with the longest occupation time and other processing methods according to batch processing capacity; (A4) in the primary matching result, the sub-processes of the processing method with the longest occupation time are matched with the sub-processes of other processing methods again to obtain the saved time of the parallel processing sub-processes corresponding to other processing methods, and the final matching of the samples corresponding to the processing method with the longest occupation time and the processing method with the longest saved time; (A5) obtaining the sequence planning of pre-treatment according to the final matching result, and the same sub-processes are processed in parallel and different sub-processes are processed in series. The present application has the advantages of saving time for a long time and the like.

Description

Technical Field

[0001] This invention relates to automated pretreatment, and more particularly to a sequence planning method for automated sample processing. Background Technology

[0002] The existing fully automated sample pretreatment has the following characteristics:

[0003] 1. Only samples of the same method are allowed to run under the same operation: The runtime uses a serial + parallel approach for processing. The disadvantage is that samples of different processing methods cannot be built and run simultaneously.

[0004] 2. The same operation allows samples to be processed using different methods: Processing is done serially. The disadvantage is that the serial processing method results in more idle time for the equipment, which is unsuitable for scenarios requiring high sample processing speed. Summary of the Invention

[0005] To address the shortcomings of the existing technical solutions, this invention provides a sequence planning method for automated sample processing.

[0006] The objective of this invention is achieved through the following technical solution:

[0007] A sequence planning method for automated sample execution, comprising the following steps:

[0008] (A1) Based on each sample, determine the processing method that takes the longest time. The sample corresponds to the processing method, and the processing method includes sub-processes.

[0009] (A2) Based on the batch processing capacity, determine the remaining amount of samples corresponding to each processing method;

[0010] (A3) Based on the batch processing capacity, the remaining amount of the sample corresponding to the processing method with the longest processing time is matched with the remaining amount of the sample corresponding to other processing methods, and the initial matching is established between the sample corresponding to the processing method with the longest processing time and the sample corresponding to other processing methods.

[0011] (A4) In the initial matching results, the sub-process of the processing method that takes the longest time is matched again with the sub-process of other processing methods. Based on the results of the second matching, the time saved by the parallel processing sub-processes corresponding to other processing methods is obtained. The sample corresponding to the processing method that takes the longest time and the sample corresponding to the processing method that saves the most time are finally matched.

[0012] (A5) Based on the final matching results, the preprocessing sequence planning is derived. The remaining amount of samples corresponding to the processing method that takes the most time and the remaining amount of samples corresponding to the processing method that saves the most time are combined for processing. The same sub-processes are processed in parallel, and different sub-processes are processed in serially.

[0013] Compared with the prior art, the beneficial effects of the present invention are as follows:

[0014] 1. High efficiency;

[0015] Based on the order of occupied time, saved time, and matching of remaining quantity, some identical sub-processes of the sample pretreatment (detection) method are processed in parallel, which improves the speed of sample pretreatment (detection), increases equipment utilization, saves consumables, and significantly reduces pretreatment (detection) time.

[0016] By matching the sample corresponding to the processing method that saves the most time with the sample corresponding to the processing method that takes the longest time (final matching result), the speed of sample pretreatment (detection) is maximized.

[0017] 2. Supports different sample pretreatment (detection) methods to meet user needs; all samples can be processed after editing once. Attached Figure Description

[0018] The disclosure of this invention will become more readily understood with reference to the accompanying drawings. It will be readily understood by those skilled in the art that these drawings are merely illustrative of the technical solutions of this invention and are not intended to limit the scope of protection of this invention. In the drawings:

[0019] Figure 1 This is a schematic diagram of a sequence planning method for automated sample processing according to an embodiment of the present invention. Detailed Implementation

[0020] Figure 1 The following description illustrates optional embodiments of the invention to teach those skilled in the art how to implement and reproduce the invention. Some conventional aspects have been simplified or omitted for the purpose of teaching the invention. Those skilled in the art should understand that variations or substitutions derived from these embodiments will be within the scope of the invention. Those skilled in the art should understand that the following features can be combined in various ways to form multiple variations of the invention. Therefore, the invention is not limited to the following optional embodiments, but is defined only by the claims and their equivalents.

[0021] Example 1:

[0022] Figure 1 A schematic diagram of a sequence planning method for automated sample processing according to an embodiment of the present invention is provided, as follows: Figure 1As shown, the sequence planning method for automated sample execution includes the following steps:

[0023] (A1) Based on each sample, determine the processing method that takes the longest time. For example, sort the processing methods by time and find the one that takes the longest time. The time taken is only related to the processing method and is not related to the number of samples. The samples correspond to the processing methods, and the processing methods include sub-processes.

[0024] (A2) Based on the batch processing capacity, determine the remaining amount of samples corresponding to each processing method, such as the remainder when the number of samples is divided by the batch processing capacity;

[0025] (A3) Based on the batch processing capacity, the remaining amount of the sample corresponding to the processing method with the longest processing time is matched with the remaining amount of the sample corresponding to other processing methods. Initial matching is established between the samples corresponding to the processing method with the longest processing time and other processing methods. If the sum of the remaining amounts of the samples corresponding to the two processing methods (including the processing method with the longest processing time) is required not to be greater than the batch processing capacity, otherwise it cannot be completed in the same batch processing.

[0026] (A4) In the initial matching results, the sub-processes of the processing method that takes the longest time are matched again with the sub-processes of other processing methods. Based on the results of the second matching, the time saved by the parallel processing sub-processes corresponding to other processing methods (i.e. the time occupied by the parallel processing sub-processes in other processing methods) is obtained. The sample corresponding to the processing method that takes the longest time and the sample corresponding to the processing method that saves the most time are finally matched.

[0027] (A5) Based on the final matching results, the preprocessing sequence planning is derived. The remaining amount of samples corresponding to the processing method that takes the most time and the remaining amount of samples corresponding to the processing method that saves the most time are combined for processing. The same sub-processes are processed in parallel, and different sub-processes are processed in serially.

[0028] To save time, the combined processing sequence is further optimized by first running the batch processing of samples corresponding to the processing method that takes the longest time, then running the combined processing, and finally running the batch processing of samples corresponding to the processing method that saves the most time.

[0029] To save time, further, a serial processing method is adopted:

[0030] Before running the same subprocess in parallel processing, the subprocesses preceding the same subprocess in the processing method that takes the longest time and the subprocesses preceding the same subprocess in the processing method that saves the most time are run in sequence.

[0031] To improve the accuracy of matching, in step (A4), the matching method is as follows: in each processing method, the sub-processes with the same running parameters are treated as the same sub-processes in parallel processing.

[0032] To further save running time, non-finally matched samples are processed according to steps (A1)-(A5) to derive a sequence plan for preprocessing all samples.

[0033] To further save operating time, the processing method is further described as a sample pretreatment method or a detection method.

[0034] Example 2:

[0035] An example of the application of the sequence planning method for automatic sample processing according to Embodiment 1 of the present invention in water quality testing.

[0036] In this application example, such as Figure 1 As shown, the sequence planning method for automated sample processing in this embodiment includes the following steps:

[0037] (A1) Multiple groups of samples, each with different detection indicators, have different processing methods (including pretreatment methods and detection methods) and different detection methods. However, the sub-processes (such as derivatization reaction, nitrogen blowing concentration, centrifugation and shaking) contained in different pretreatment methods are the same, and the sub-processes (such as liquid chromatography-tandem mass spectrometry detection) contained in different detection methods are the same. Each sub-process is automated, which is the prior art in this field.

[0038] The processing time of various processing methods is compared or ranked to find the processing method with the longest processing time. The processing time is only related to the processing method itself and is not related to the number of samples in each group.

[0039] (A2) Based on the batch processing capacity, such as processing 8 samples per batch, obtain the remaining amount of samples corresponding to each processing method, that is, the remainder of the number of samples in each group divided by the batch processing quantity (e.g., 8), such as 1, 2, 3, 4, 5, 6 or 7.

[0040] (A3) Based on the batch processing capacity, the remaining amount of the sample corresponding to the processing method with the longest processing time is matched with the remaining amount of the sample corresponding to other processing methods, and the initial matching is established between the sample corresponding to the processing method with the longest processing time and the sample corresponding to other processing methods.

[0041] If the remaining amount of samples corresponding to the processing method that takes the longest time is 20 ÷ 8 = 2…4, then the remaining amount of samples corresponding to other processing methods can be matched if it is no greater than 4, so that the sum of the remaining amounts of samples corresponding to the two processing methods (including the processing method that takes the longest time) is no greater than the batch processing capacity, and can be combined for parallel processing in the same batch.

[0042] (A4) In the initial matching results, there are one or more sets of matching. The sub-processes of the processing method that takes the longest time are matched again with the sub-processes of other processing methods. Find the sub-processes with the same running parameters in the two processing methods in each set of matching - the same sub-processes, such as one or more sub-processes, so as to obtain the time taken by the same sub-processes in each set of matching in other processing methods (the processing methods that do not take the longest time in each set of matching) (i.e. time saved). This time is related to the sub-processes and is not related to the number of samples.

[0043] For each matching set, the time saved in the same sub-processes is compared or sorted to find the matching set with the greatest time saving. That is, the sample corresponding to the processing method that takes the most time is finally matched with the sample corresponding to the processing method with the greatest time saving.

[0044] (A5) Based on the final matching results, the preprocessing sequence planning is derived:

[0045] First, batch processing of samples corresponding to the processing method that takes the longest to run, such as 2 batches of 16 samples in total.

[0046] Next, a combined processing is performed, which means that the remaining amount of samples corresponding to the processing method that takes the most time and the remaining amount of samples corresponding to the processing method that saves the most time are combined together as the same batch of parallel processing. Specifically, before the same sub-process of parallel processing is run, the sub-process before the same sub-process of the processing method that takes the most time and the sub-process before the same sub-process of the processing method that saves the most time are run sequentially, which is serial processing. It can be seen that the remaining amounts are combined together, and the same sub-process is actually processed in batch parallel processing.

[0047] If the sub-processes of the processing method that takes the most time are B1, B2, B3, B4, B5, and the sub-processes of the processing method that saves the most time are C1, C2, C3, C4, and sub-processes B3 and C2 are the same, and sub-processes B4 and C4 are the same, the sequence planning is B1-B2-C1-B3(C2)-C3-B4(C4)-B5;

[0048] Finally, the batch processing of samples corresponding to the processing method that saves the most time is performed, such as 8 samples.

[0049] The above processing is only applied to the two groups of samples that are finally matched. The remaining groups of samples are processed according to steps (A1)-(A5). Each processing completes the matching of the two groups of samples and the sequence planning of the operation until the processing methods can no longer match or only one processing method remains. These processing methods need to be run individually and cannot be combined for parallel processing.

Claims

1. A sequence planning method for automated sample execution, the sequence planning method for automated sample execution comprising the following steps: (A1) Based on each sample, determine the processing method that takes the longest time. The sample corresponds to the processing method, and the processing method includes sub-processes. (A2) Based on the batch processing capacity, determine the remaining amount of samples corresponding to each processing method; the remaining amount is the remainder when the number of samples is divided by the batch processing capacity; (A3) Based on the batch processing capacity, the remaining amount of the sample corresponding to the processing method with the longest processing time is matched with the remaining amount of the sample corresponding to other processing methods, and the initial matching is established between the sample corresponding to the processing method with the longest processing time and the sample corresponding to other processing methods. (A4) In the initial matching results, the sub-processes of the processing method that takes the longest time are matched again with the sub-processes of other processing methods. Based on the results of the second matching, the time saved by the parallel processing sub-processes corresponding to other processing methods is obtained. The sample corresponding to the processing method that takes the longest time and the sample corresponding to the processing method that saves the longest time are finally matched. The time saved is: the time taken by the same sub-process in other processing methods in the results of the second matching. (A5) Based on the final matching results, the preprocessing sequence planning is derived. The remaining amount of samples corresponding to the processing method that takes the most time and the remaining amount of samples corresponding to the processing method that saves the most time are combined for processing. The same sub-processes are processed in parallel, and different sub-processes are processed in serially.

2. The sequence planning method for automated sample handling according to claim 1, characterized in that, In the sequence planning, the batch processing of samples corresponding to the processing method that takes the most time is run first, followed by the combined processing, and finally the batch processing of samples corresponding to the processing method that saves the most time.

3. The sequence planning method for automated sample handling according to claim 1 or 2, characterized in that, Serial processing method: Before running the same subprocess in parallel processing, the subprocesses preceding the same subprocess in the processing method that takes the longest time and the subprocesses preceding the same subprocess in the processing method that saves the most time are run in sequence.

4. The sequence planning method for automated sample processing according to claim 1, characterized in that, In step (A4), the matching method is as follows: in each processing method, the sub-processes with the same running parameters are treated as the same sub-processes in parallel processing.

5. The sequence planning method for automated sample handling according to claim 1, characterized in that, In step (A3), the initial matching method is: the sum of the remaining amounts of the samples corresponding to the two processing methods is not greater than the batch processing capacity.

6. The sequence planning method for automated sample handling according to claim 1, characterized in that, Process the non-finally matched samples according to steps (A1)-(A5) to obtain the sequence plan for preprocessing all samples.

7. The sequence planning method for automated sample handling according to claim 1, characterized in that, The processing method is a sample testing method.

Images