CN111933229A - Scheduling method of sample operation, sample operation device and storage medium - Google Patents
Scheduling method of sample operation, sample operation device and storage medium Download PDFInfo
- Publication number
- CN111933229A CN111933229A CN201910395257.4A CN201910395257A CN111933229A CN 111933229 A CN111933229 A CN 111933229A CN 201910395257 A CN201910395257 A CN 201910395257A CN 111933229 A CN111933229 A CN 111933229A
- Authority
- CN
- China
- Prior art keywords
- target operation
- target
- item
- period
- sample
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 55
- 238000010586 diagram Methods 0.000 description 15
- 238000003780 insertion Methods 0.000 description 8
- 230000037431 insertion Effects 0.000 description 8
- 238000001514 detection method Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 1
- 238000003018 immunoassay Methods 0.000 description 1
- 238000010339 medical test Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16H—HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA
- G16H10/00—ICT specially adapted for the handling or processing of patient-related medical or healthcare data
- G16H10/40—ICT specially adapted for the handling or processing of patient-related medical or healthcare data for data related to laboratory analysis, e.g. patient specimen analysis
Landscapes
- Health & Medical Sciences (AREA)
- Engineering & Computer Science (AREA)
- Epidemiology (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Primary Health Care (AREA)
- Public Health (AREA)
- Automatic Analysis And Handling Materials Therefor (AREA)
- Measuring Or Testing Involving Enzymes Or Micro-Organisms (AREA)
Abstract
The application discloses a scheduling method of sample operation, a sample operation device and a storage medium, wherein the scheduling method of the sample operation comprises the following steps: reading a target operation step from a target operation item; judging whether the resource of the target operation period is allowed to be inserted into the target operation step; if yes, inserting the target operation step into the target operation period; and if not, moving the target operation step back by one operation period. By the method, the steps of the project can be reasonably scheduled and arranged according to the resource occupation condition, and the operation efficiency of the project is improved.
Description
Technical Field
The present application relates to the field of sample manipulation technologies, and in particular, to a method for scheduling sample manipulation, a sample manipulation apparatus, and a storage medium.
Background
In the field of medical testing, there are a variety of manipulation devices for manipulating a sample. In the operation process, as the sample feeding mode adopts a flow line type, the pretreatment flows of the samples are required to be the same, so that the occupation of the components of the adjacent samples can be avoided without conflict during the sample feeding. If the pretreatment flows of different samples are different, the process of some samples inevitably has hysteresis influence when the steps conflict, so that the stability and reliability of the sample results and the repeatability of the results are influenced.
Disclosure of Invention
In order to solve the above problems, the present application provides a scheduling method of sample operation, a sample operation apparatus, and a storage medium, which can perform reasonable scheduling and arrangement on the steps of a project according to the resource occupation situation, and improve the operation efficiency of the project.
The technical scheme adopted by the application is as follows: a method for scheduling sample operations is provided, the method comprising: reading a target operation step from a target operation item; judging whether the resource of the target operation period is allowed to be inserted into the target operation step; if yes, inserting the target operation step into the target operation period; and if not, moving the target operation step back by one operation period.
Wherein, judging whether the resource of the target operation period is allowed to be inserted into the target operation step comprises: judging whether the number of target operation steps inserted in the target operation period is smaller than a set threshold value associated with the target operation steps; if yes, determining to allow the target operation step to be inserted; if not, determining that the target operation step is not allowed to be inserted.
Wherein, the method also comprises: the maximum number of times that a target operation step is allowed to be executed in one operation cycle is previously specified as a set threshold value associated with the target operation step.
Wherein the maximum number of times that the target operation step is allowed to be executed in one operation cycle matches the number of times that the target operation step is executed in the target operation item.
Wherein inserting the target operation step into the target operation cycle comprises: pre-inserting the target operation step into the operation of the target operation period; judging whether the target operation step is the last operation step in the target operation item; if not, reading the next operation step after the target operation step as a new target operation step, taking the next operation period as a new target operation period, and executing the step of judging whether the resource of the target operation period allows the target operation step to be inserted again.
Wherein, moving the target operation step back by one operation cycle comprises: all the operation steps pre-inserted in the target operation item are moved backwards by one operation period; starting from the first step in the target operation item, the step of judging whether the resource of the target operation period allows the target operation step to be inserted is executed again.
Wherein, judging whether the resource of the target operation period is allowed to be inserted into the target operation step comprises: judging whether the target operation step is the first step of the target operation item; if yes, determining the operation cycle of the second operation step of the previous operation item as a target operation cycle; and judging whether the resource of the target operation period allows the target operation step to be inserted.
Wherein, the method also comprises: and after all steps in the target operation item are inserted, determining the next operation item after the target operation item as a new target operation item, and executing the step of reading the target operation from the target operation item again.
Another technical scheme adopted by the application is as follows: there is provided a sample manipulation device comprising a processor and a memory electrically connected to the processor, the memory for storing program data and the processor for executing the program data to perform a method as described above.
Another technical scheme adopted by the application is as follows: a computer storage medium is provided for storing program data for implementing the method as described above when executed by a processor.
The scheduling method for the sample operation provided by the application comprises the following steps: reading a target operation step from a target operation item; judging whether the resource of the target operation period is allowed to be inserted into the target operation step; if yes, inserting the target operation step into the target operation period; and if not, moving the target operation step back by one operation period. By the method, the resource utilization in one operation period can be reasonably controlled by setting the upper limit of the resource occupation in one operation period, the steps of the project are reasonably scheduled and arranged according to the resource occupation condition, and the operation efficiency of the project is improved on the premise of supporting various project operations.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts. Wherein:
fig. 1 is a first flowchart of a scheduling method of a sample operation according to an embodiment of the present disclosure;
FIG. 2 is a first timing diagram provided by an embodiment of the present application;
FIG. 3 is a second flowchart of a scheduling method for sample operations according to an embodiment of the present disclosure;
FIG. 4 is a second timing diagram provided by an embodiment of the present application;
FIG. 5 is a third timing diagram provided by an embodiment of the present application;
FIG. 6 is a fourth timing diagram provided by an embodiment of the present application;
FIG. 7 is a fifth timing diagram provided by an embodiment of the present application;
FIG. 8 is a schematic structural diagram of a sample manipulation device provided in an embodiment of the present application;
fig. 9 is a schematic structural diagram of a computer storage medium provided in an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application. It is to be understood that the specific embodiments described herein are merely illustrative of the application and are not limiting of the application. It should be further noted that, for the convenience of description, only some of the structures related to the present application are shown in the drawings, not all of the structures. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The terms "first", "second", etc. in this application are used to distinguish between different objects and not to describe a particular order. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.
Referring to fig. 1, fig. 1 is a first flowchart of a scheduling method of a sample operation according to an embodiment of the present application, where the method includes:
s11: and reading the target operation step from the target operation item.
Wherein, the target operation item can be a sample detection item. Understandably, a general operation item may include a plurality of operation steps, each of which is performed in turn in a set order.
As shown in fig. 2, fig. 2 is a first timing diagram provided in the embodiment of the present application. In the present embodiment, it is assumed that sample a and sample B are the same, and each includes step 1, step 2, step 3, and step 4.
When the time sequence of the sample a is determined, the step 1, the step 2, the step 3 and the step 4 are sequentially inserted into four adjacent operation cycles, that is, the step 1, the step 2, the step 3 and the step 4 respectively correspond to the cycle 1, the cycle 2, the cycle 3 and the cycle 4, which is the same as the existing operation mode and is not described herein again.
S12: and judging whether the resource of the target operation period allows the target operation step to be inserted.
If yes, then execute S13, otherwise execute S14.
In general, the first step of sample B insertion corresponds to the second step of sample A. Specifically, step 12 may be: judging whether the target operation step is the first step of the target operation item; if yes, determining the operation cycle of the second operation step of the previous operation item as a target operation cycle; and judging whether the resource of the target operation period allows the target operation step to be inserted.
In the operation step of inserting the sample B, it is necessary to determine whether or not the target operation period to be inserted satisfies the insertion condition. Generally, the determination is made based on the resource occupation status of the inserted operation steps in the target operation cycle.
For example, in one embodiment, the determination may be based on the number of operation steps that have been inserted in the target operation cycle. A number threshold (e.g. 5) is set, that is, the maximum number of operation steps allowed to be inserted in one operation cycle is 5, and when the number of operation steps inserted in one operation cycle reaches 5, it is considered that the resource of the target operation cycle does not allow any operation step to be inserted.
For example, in another embodiment, the determination may be made based on that two steps cannot be performed simultaneously, e.g., step 2 and step 3 use the same resources in the execution process and thus cannot be performed in the same operation cycle.
S13: and inserting the target operation step into the target operation period.
S14: and moving the target operation step back by one operation period.
As shown in fig. 2, in the operation step of inserting the sample B, if the sample B step 1 meets the insertion requirement of the resource in the period 2, the sample B step 1 is inserted into the period 2. When inserting the sample B step 2, if the step 3 should be inserted according to the prior art, but the operation of the step is affected due to the conflict between the sample B step 2 and the sample a step 3 (or other resource occupation problems), the sample B step 2 is shifted backward by one cycle, and if the sample B step 2 meets the insertion requirement of the resource in the cycle 4, the sample B step 2 is inserted into the cycle 4.
Referring to fig. 3, fig. 3 is a second flowchart of a scheduling method of a sample operation according to an embodiment of the present application, where the method includes:
s31: and reading the target operation step from the target operation item.
S32: it is determined whether the number of target operation steps that have been inserted in the target operation cycle is less than a set threshold associated with the target operation step.
In the present embodiment, the maximum number of executions within one cycle is set for each operation step. For example, the same step of different operation items can only be executed at most N times in the same operation cycle.
For example: the operation sequence of one operation item is as follows: step 1 → step 2 → step 3 → step 2 → step 4 → step 5.
Then, a maximum number of executions may be set according to the actual operation of each step. Optionally, the maximum number of times the target operation step is allowed to be executed in one operation cycle matches the number of times the target operation step is executed in the target operation item. For example:
| type of step | Maximum number of executions in the same |
| Step | |
| 1 | 1 |
| |
3 |
| |
2 |
| Step 4 | 1 |
| Step 5 | 1 |
For example, step 2 needs to be inserted into the target operation cycle, and after detection, if the number of step 2 in the target operation cycle is found to be 2 and the upper limit of 3 has not been reached, step 2 may be inserted into the target operation cycle, and if the number of step 2 in the target operation cycle is found to be 3 and the upper limit of 3 has been reached, step 2 is shifted backward by one cycle, and the same determination is performed.
S33: and inserting the target operation step into the target operation period.
Referring to fig. 4, fig. 4 is a second timing diagram provided in the present embodiment. The upper part of fig. 4 shows the time sequence of sample a, sample B, sample C, sample D, sample E, sample F, sample G, and sample H, and the lower part shows the statistics of the number of times of step 1, step 2, step 3, step 4, and step 5 in each operation cycle.
As can be seen from fig. 4, the number of operation steps in each operation cycle meets the preset requirement.
S34: and moving the target operation step back by one operation period.
Referring to fig. 5, fig. 5 is a third timing diagram provided in the present embodiment. The upper part of fig. 5 shows the time sequence of sample a, sample B, sample C, sample D, sample E, and sample F, and the lower part is the frequency statistics of step 1, step 2, step 3, step 4, and step 5 in each operation cycle.
As can be seen from fig. 5, step 3 is executed 3 times in one operation cycle, and the maximum execution time of step 3 in one operation cycle is 2 times according to the preset resource requirement. Thus, the timing diagram of fig. 5 is unsatisfactory.
With reference to fig. 6, fig. 6 is a fourth timing diagram provided in the embodiments of the present application. The timing settings of sample a, sample B, sample C, sample D, and sample E are the same as described above. In the sample F, if the sample F step 3 is set in one operation cycle after the sample F step 2, the maximum number of times of the step 3 is greater than the set number of times, so that the step 3 is shifted backward by one operation cycle, but it is found that after the step 3 is shifted backward by one operation cycle, the number of times of the step 3 in the next operation cycle is greater than the set number of times, so that the step 3 is shifted backward again, and the requirement is met. And sequentially judging the subsequent steps.
It can be understood that, by the scheduling manner of fig. 6, an interval occurs in the step of the sample F, that is, two operation periods occur between the step 2 of the sample F and the step 3 of the sample F, which may affect the operation of the sample F.
In another embodiment, the target operation step is pre-inserted into the operation of the target operation cycle when the step insertion is performed in sequence; after the target step is pre-inserted, judging whether the target operation step is the last operation step in the target operation item; if not, the next operation step after the target operation step is read as a new target operation step, the next operation cycle is set as a new target operation cycle, and S32 is executed again.
Optionally, when the step is moved backward, all the operation steps pre-inserted in the target operation item are moved backward by one operation period; starting from the first step in the target operation item, the step of judging whether the resource of the target operation period allows the target operation step to be inserted is executed again.
As shown in fig. 7, fig. 7 is a fifth timing diagram provided in the embodiment of the present application. In the present embodiment, at the time of the timing setting of the sample F, three processes of the sample F1 → the sample F2 → the sample F3 are performed:
sample F1: pre-insertion step 1 → step 1 meets the requirement → pre-insertion step 2 → step 2 meets the requirement → pre-insertion step 3 → step 3 does not meet the requirement.
Sample F2: step 1 is shifted backward by one operation cycle and the reinsertion step 1 → step 1 meets the requirement → reinsertion step 2 → step 2 meets the requirement → reinsertion step 3 → step 3 does not meet the requirement.
Sample F3: step 1 is shifted backward by one operation cycle and reinserting step 1 → step 1 meets the requirement → reinsertion step 2 → step 2 meets the requirement → reinsertion step 3 → step 3 meets the requirement → reinsertion step 2 → step 2 meets the requirement → reinsertion step 4 → step 4 meets the requirement → step 5 satisfies the requirement.
It can be understood that, in the above process, when each step meets the requirement, it needs to be determined whether the step is the final step of the item, and if not, the next step is pre-inserted.
When step 5 of sample F3 satisfies the requirement, it is confirmed that this step is the final step of the item, and all operation steps inserted into the operation item are determined.
In this way, all steps of one operation item are inserted, then the next operation item after the target operation item is determined as a new target operation item, and the above operation steps are executed again to insert the next operation item.
Different from the prior art, the scheduling method for sample operation provided by the embodiment includes: reading a target operation step from a target operation item; judging whether the resource of the target operation period is allowed to be inserted into the target operation step; if yes, inserting the target operation step into the target operation period; and if not, moving the target operation step back by one operation period. The resource utilization in one operation period can be reasonably controlled by setting the upper limit of the resource occupation in one operation period, the steps of the project are reasonably scheduled and arranged according to the resource occupation condition, and the operation efficiency of the project is improved on the premise of supporting various project operations.
Referring to fig. 8, fig. 8 is a schematic structural diagram of a sample manipulation device according to an embodiment of the present application, where the sample manipulation device 80 includes a processor 81 and a memory 82 electrically connected to the processor 81, the memory 82 is used for storing program data, and the processor 81 is used for executing the program data to implement the following method:
reading a target operation step from a target operation item; judging whether the resource of the target operation period is allowed to be inserted into the target operation step; if yes, inserting the target operation step into the target operation period; and if not, moving the target operation step back by one operation period.
The sample manipulation device 80 may be a manipulation device used in the medical field, such as an immunoassay analyzer.
Optionally, the processor 81 executing the program data is further for implementing the method of: judging whether the number of target operation steps inserted in the target operation period is smaller than a set threshold value associated with the target operation steps; if yes, determining to allow the target operation step to be inserted; if not, determining that the target operation step is not allowed to be inserted.
Optionally, the processor 81 executing the program data is further for implementing the method of: the maximum number of times that a target operation step is allowed to be executed in one operation cycle is previously specified as a set threshold value associated with the target operation step.
Optionally, the processor 81 executing the program data is further for implementing the method of: the maximum number of times the target operation step is allowed to be executed in one operation cycle is matched with the number of times the target operation step is executed in the target operation item.
Optionally, the processor 81 executing the program data is further for implementing the method of: pre-inserting the target operation step into the operation of the target operation period; judging whether the target operation step is the last operation step in the target operation item; if not, reading the next operation step after the target operation step as a new target operation step, taking the next operation period as a new target operation period, and executing the step of judging whether the resource of the target operation period allows the target operation step to be inserted again.
Optionally, the processor 81 executing the program data is further for implementing the method of: all the operation steps pre-inserted in the target operation item are moved backwards by one operation period; starting from the first step in the target operation item, the step of judging whether the resource of the target operation period allows the target operation step to be inserted is executed again.
Optionally, the processor 81 executing the program data is further for implementing the method of: judging whether the target operation step is the first step of the target operation item; if yes, determining the operation cycle of the second operation step of the previous operation item as a target operation cycle; and judging whether the resource of the target operation period allows the target operation step to be inserted.
Optionally, the processor 81 executing the program data is further for implementing the method of: and after all steps in the target operation item are inserted, determining the next operation item after the target operation item as a new target operation item, and executing the step of reading the target operation from the target operation item again.
Referring to fig. 9, fig. 9 is a schematic structural diagram of a computer storage medium 90 provided in an embodiment of the present application, where the computer storage medium 90 is used to store program data 91, and the program data 91 is executed by a processor to implement the following method:
reading a target operation step from a target operation item; judging whether the resource of the target operation period is allowed to be inserted into the target operation step; if yes, inserting the target operation step into the target operation period; and if not, moving the target operation step back by one operation period.
In the several embodiments provided in the present application, it should be understood that the disclosed method and apparatus may be implemented in other manners. For example, the above-described device embodiments are merely illustrative, and for example, the division of the modules or units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated units in the other embodiments described above may be stored in a computer-readable storage medium if they are implemented in the form of software functional units and sold or used as separate products. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, a network device, or the like) or a processor (processor) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above description is only for the purpose of illustrating embodiments of the present application and is not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes, which are made according to the content of the present specification and the accompanying drawings, or which are directly or indirectly applied to other related technical fields, are also included in the scope of the present application.
Claims (10)
1. A method for scheduling sample operations, comprising:
reading a target operation step from a target operation item;
judging whether the resource of the target operation period is allowed to be inserted into the target operation step;
if yes, inserting the target operation step into the target operation period;
and if not, moving the target operation step back by one operation period.
2. The method of claim 1,
the step of judging whether the resource of the target operation period is allowed to be inserted into the target operation period comprises the following steps:
determining whether the number of the target operation steps inserted in a target operation cycle is less than a set threshold associated with the target operation steps;
if yes, determining to allow the target operation step to be inserted;
if not, determining that the target operation step is not allowed to be inserted.
3. The method of claim 2,
the method further comprises the following steps:
the maximum number of times the target operation step is allowed to be executed in one operation cycle is previously specified as a set threshold value associated with the target operation step.
4. The method of claim 3,
the maximum number of times that the target operation step is allowed to be executed in one operation cycle is matched with the number of times that the target operation step is executed in the target operation item.
5. The method of claim 1,
the inserting the target operation step into the target operation cycle comprises:
pre-inserting the target operation step into the operation of the target operation period;
judging whether the target operation step is the last operation step in the target operation item;
if not, reading the next operation step after the target operation step as a new target operation step, taking the next operation period as a new target operation period, and executing the step of judging whether the resource of the target operation period is allowed to be inserted into the target operation step again.
6. The method of claim 5,
the step of moving the target operation backward by one operation cycle includes:
all the operation steps pre-inserted in the target operation item are moved backwards by one operation period;
and starting from the first step in the target operation item, re-executing the step of judging whether the resource of the target operation period allows the target operation step to be inserted or not.
7. The method of claim 1,
the step of judging whether the resource of the target operation period is allowed to be inserted into the target operation period comprises the following steps:
judging whether the target operation step is the first step of the target operation item;
if yes, determining the operation cycle of the second operation step of the previous operation item as the target operation cycle;
and judging whether the resource of the target operation period is allowed to be inserted into the target operation step.
8. The method of claim 1,
the method further comprises the following steps:
and after all steps in the target operation item are inserted, determining the next operation item after the target operation item as a new target operation item, and executing the step of reading the target operation from the target operation item again.
9. A sample manipulation device, wherein the sample manipulation device comprises a processor and a memory electrically connected to the processor, the memory being configured to store program data, and the processor being configured to execute the program data to perform the method of any one of claims 1 to 8.
10. A computer storage medium for storing program data, which when executed by a processor is adapted to carry out the method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910395257.4A CN111933229B (en) | 2019-05-13 | 2019-05-13 | Sample operation scheduling method, sample operation device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910395257.4A CN111933229B (en) | 2019-05-13 | 2019-05-13 | Sample operation scheduling method, sample operation device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111933229A true CN111933229A (en) | 2020-11-13 |
| CN111933229B CN111933229B (en) | 2024-04-19 |
Family
ID=73282688
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910395257.4A Active CN111933229B (en) | 2019-05-13 | 2019-05-13 | Sample operation scheduling method, sample operation device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111933229B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060178776A1 (en) * | 2003-12-15 | 2006-08-10 | Feingold Gordon A | Systems and methods for the automated pre-treatment and processing of biological samples |
| CN101216792A (en) * | 2008-01-14 | 2008-07-09 | 中兴通讯股份有限公司 | Real-time operating system tasks management process, device and real-time operating system |
| CN101852798A (en) * | 2009-03-30 | 2010-10-06 | 希森美康株式会社 | Sample testing apparatus and sample testing method |
| CN103366313A (en) * | 2013-07-16 | 2013-10-23 | 国家电网公司 | Method and device for processing operation data of operation order |
| CN104021044A (en) * | 2013-02-28 | 2014-09-03 | 中国移动通信集团浙江有限公司 | Job scheduling method and device |
| US20170220331A1 (en) * | 2016-02-02 | 2017-08-03 | Blackberry Limited | Application lifecycle operation queueing |
| US20180183588A1 (en) * | 2016-12-27 | 2018-06-28 | Fotonation Limited | Systems and methods for detecting data insertions in biometric authentication systems using encryption |
-
2019
- 2019-05-13 CN CN201910395257.4A patent/CN111933229B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060178776A1 (en) * | 2003-12-15 | 2006-08-10 | Feingold Gordon A | Systems and methods for the automated pre-treatment and processing of biological samples |
| CN101216792A (en) * | 2008-01-14 | 2008-07-09 | 中兴通讯股份有限公司 | Real-time operating system tasks management process, device and real-time operating system |
| CN101852798A (en) * | 2009-03-30 | 2010-10-06 | 希森美康株式会社 | Sample testing apparatus and sample testing method |
| CN104021044A (en) * | 2013-02-28 | 2014-09-03 | 中国移动通信集团浙江有限公司 | Job scheduling method and device |
| CN103366313A (en) * | 2013-07-16 | 2013-10-23 | 国家电网公司 | Method and device for processing operation data of operation order |
| US20170220331A1 (en) * | 2016-02-02 | 2017-08-03 | Blackberry Limited | Application lifecycle operation queueing |
| US20180183588A1 (en) * | 2016-12-27 | 2018-06-28 | Fotonation Limited | Systems and methods for detecting data insertions in biometric authentication systems using encryption |
Non-Patent Citations (3)
| Title |
|---|
| CLAUDE YUGMA 等: "A Smart Sampling Scheduling and Skipping Simulator and its evaluation on real data sets", IEEE, pages 1 - 10 * |
| 游佳: "基于Petri网的生化免疫检测设备调度问题的研究", CNKI优秀硕士学位论文全文库 * |
| 雒兴刚;汪定伟;唐加福;: "任务可拆分项目调度问题", 东北大学学报(自然科学版), no. 09 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111933229B (en) | 2024-04-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108108384B (en) | Data storage method and device | |
| CN106055464B (en) | Data buffer storage testing schooling pressure device and method | |
| US8151250B2 (en) | Program trace method using a relational database | |
| CN110718264A (en) | Method and device for testing information of solid state disk, computer equipment and storage medium | |
| CN107688488A (en) | A kind of optimization method and device of the task scheduling based on metadata | |
| CN110135967A (en) | The processing method and system of collection data | |
| CN111933229A (en) | Scheduling method of sample operation, sample operation device and storage medium | |
| CN103870563A (en) | Method and device for determining subject distribution of given text | |
| CN109800074A (en) | Task data concurrently executes method, apparatus and electronic equipment | |
| CN106201841A (en) | The statistical method of a kind of application program service data and device | |
| CN113486109A (en) | Data synchronization method and device of heterogeneous database and electronic equipment | |
| CN112527904A (en) | Automatic synchronization method and device for associated scripts, computer equipment and storage medium | |
| CN104298570A (en) | Data processing method and device | |
| CN111858466A (en) | Data storage method, device, equipment and storage medium | |
| CN106202374A (en) | A kind of data processing method and device | |
| CN111309475B (en) | Detection task execution method and equipment | |
| CN107329807B (en) | Data delay processing method and device, and computer readable storage medium | |
| CN115757165A (en) | Automatic testing method, device, equipment and storage medium | |
| CN108664550A (en) | It is a kind of that funnel analysis method and device are carried out to user behavior data | |
| CN115754413A (en) | Oscilloscope and data processing method | |
| CN106294104B (en) | Test case execution method and mobile terminal | |
| CN106446046B (en) | A method of quickly analysis records in time in relational database | |
| CN108156054A (en) | The test method and device of cloud desktop performance | |
| CN114647786A (en) | Book recommendation method, electronic device and storage medium | |
| CN110008291B (en) | Data early warning method and device, storage medium and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |