CN111180058B

CN111180058B - Automatic urinary cell staining efficiency optimization method

Info

Publication number: CN111180058B
Application number: CN202010012174.5A
Authority: CN
Inventors: 张冬冬; 徐振垒; 王力生
Original assignee: Tongji University
Current assignee: Tongji University
Priority date: 2020-01-07
Filing date: 2020-01-07
Publication date: 2023-05-12
Anticipated expiration: 2040-01-07
Also published as: CN111180058A

Abstract

An efficiency optimization algorithm for automatic dyeing of urine cells is characterized in that through research on an automatic dyeing scheduling process of urine cells, the effective utilization rate of a dye vat is maximized by distributing dye vat dye solutions, then different dyeing schemes are designed for the same dyeing method according to the distributed dye vat dye solutions, and finally a dyeing time registry is distributed and calculated for each dyeing scheme. The method can dye a plurality of tasks in the same dyeing mode, and remarkably improves the dyeing efficiency.

Description

Automatic urinary cell staining efficiency optimization method

Technical field:

the invention relates to the fields of task scheduling, medical cell staining and servo control, in particular to a multi-task scheduling optimization technology.

The background technology is as follows:

in recent years, the number of diabetics in China is increasing year by year. In early diagnosis of diabetes mellitus, staining and analysis of urine cells in urine sediment is a very effective method. Traditional cell staining methods are typically performed manually, and are inefficient and have poor consistency. Some hospitals in china have also begun to use automated cell staining machines gradually to replace traditional manual staining. Compared with manual staining, the automatic cell staining machine has high and stable performance. The automatic dyeing equipment is simple to operate, is suitable for batch dyeing, and is particularly suitable for large-scale hospitals in China, and the dyeing result is highly standardized. The use of automatic cell staining machines instead of artificial staining has become an important trend in the development of current medical technology.

The appearance time of the full-automatic cell staining machine in China is relatively late, and the corresponding technical research and development investment is also inferior to a plurality of foreign factories. Some well-known companies such as Japanese cherry blossom (SAKURA), american Qianson (Johnson), german Siemens (SIMNES) and Leica (Leica), philips (PHILIPS) in the Netherlands have long been involved in the field of automation of medical devices, and the technology of the production automation equipment of these companies is quite mature, and the degree of automation of the produced products is high. At present, most of the hospitals in China use full-automatic cell staining machines for imported products. But these devices are generally expensive, ranging from hundreds of thousands to millions. These devices are generally more demanding in terms of operating environment and use of these devices typically requires the use of dye reagents sold in bundles at work, which are also generally more expensive and can be contaminated and volatilized with use times and durations, requiring frequent replacement. These devices are currently commonly used in some large trimethylhospitals in China. Such great expense is difficult for some local hospitals and third-party medical testing facilities, and because the number of samples processed is not large, they still rely on traditional manual completion of the corresponding experiments. Therefore, some hospitals and scientific research institutions in China begin to develop related researches on the full-automatic dyeing machine in recent years. Compared with the foreign full-automatic dyeing machine, the full-automatic dyeing machine developed by some hospitals and scientific research institutions in China is mostly special in use, has lower dyeing efficiency, and generally adopts a serial mode for dyeing, namely, one dyeing task is started after being completely ended, so that the continuity of the dyeing steps of the same dyeing task can be better ensured. For the optimization problem of the dyeing efficiency, document 1 (L.S.Wang, Z.M.Yu, D.D.Zhang, guofeng Qin, zhenlei Xu, A Scheduling Algorithm for Urine Cell Dyeing Machine, ICCSE 2019, august 19-21,2019.) proposes a precision-first dyeing scheduling algorithm (Accuracy-First Scheduling Algorithm, AFS) which is a dynamic scheduling algorithm that starts the dyeing process but adds a new dyed slide, and the algorithm performs dyeing after waiting for the delay time length by calculating the time length for which the slide can be put into a slot, and does not affect the slide put in before. Compared with a serial dyeing method, the algorithm has greatly improved dyeing efficiency, but the competition of the algorithm dyeing process for the same dyeing resource (dye vat) is obvious, namely, the same dyeing resource can only serve one dyeing task at the same time, and particularly, a plurality of dyeing tasks of the same dyeing method compete for each dyeing resource.

The invention comprises the following steps:

the invention aims to provide a method for improving the parallel dyeing efficiency of the same dyeing method.

The idea of the invention is mainly to allocate a plurality of dyeing resources with the strongest competition among the parallel dyeing tasks, reduce the competition among the dyeing tasks and further improve the dyeing efficiency. The staining of biological cells can be analogically performed as a computer task scheduling system, each staining group being treated as a different process, and the staining tank being treated as a computer external resource, the different staining groups being capable of competing with the staining tank during the staining process. As shown in the schematic diagram of the dyeing task scheduling scenario in fig. 1, different dyeing tasks compete for the dyeing tank, and the dyeing steps are not necessarily identical for different dyeing schemes. From the dyeing process and the dyeing machine composition we can find that the whole dyeing process must follow the following principles: namely a continuous and exclusive mechanical arm of the dyeing progress of the same dyeing task, wherein the dyeing progress of the dyeing tank is distributed and fixed in advance, the resources are exclusive and can not be deprived.

Technical proposal

The method comprises the steps of firstly distributing dye vat dye liquor based on an EA36 Papanicolaou dyeing method to achieve the maximum effective utilization rate, then designing different dyeing schemes for the dyeing method according to the distributed dye vat dye liquor, and finally distributing and calculating a dyeing time registry for each dyeing scheme so as to determine the dyeing start time and the dyeing end time for each dyeing step.

Fig. 2 is a flowchart of a dyeing efficiency optimizing method, and main steps of the method will be described next.

1) Initializing. The process is completed for recording each dyeing step and dyeing time of the dyeing method, and recording the number and distribution of dyeing tanks of the target dyeing machine.

2) Counting and calculating the number n of idle dyeing tanks _idle . The process is mainly used for recording idle dyeing tanks except for a piece taking, drying and washing tank of the dyeing machine.

3) Counting the dyeing time t ₁ ～t _k . The process comprises counting the dyeing time of each dyeing step, excluding time data with the same time, and then sorting from large to small, and putting it to t ₁ ～t _k Is a kind of medium.

4) Calculating the dyeing time of the unit to be t _i Number of independent dye solutions n _i . This stepThe work done is in fact that the dyeing time exceeds t _i A plurality of dyeing tanks are allocated in the dyeing step of (1), namely the dyeing time is t ₁ To t _i Distribution of dyeing step (except for washing with water)

The number of the dyeing tanks is equal to or less than 1 and x<i; for dyeing time not exceeding t _i Each step is allocated with 1 dye vat; then the total independent dye liquor number n is calculated _i 。

5) According to the unit dyeing time t _i The dye liquor is dispensed. The process sequentially distributes the dye solutions of the dye tanks according to the dyeing steps, and multiple dye solutions of the same dyeing step are distributed adjacently.

6) And designing a dyeing scheme according to the dye liquor of the dye vat. Because the dyeing step with long dyeing time has independent multiple dyeing tanks, when the dyeing tanks are distributed for parallel tasks, the steps with multiple dyeing tanks are distributed in turn according to the task queues, so that the same dyeing is ensured not to have competition among multiple tasks.

7) Dyeing time registration algorithm. The algorithm uses the concept of backtracking to calculate the slide entry time. And recording and storing the time registration condition of each dye vat through a global time registry. The time registry is a two-dimensional array of int types, n x m in size. Wherein, the row represents n dyeing tanks, the column represents that each dyeing tank can record m/2 time periods, and one time period occupies two element spaces (dyeing start time and dyeing end time). A dye vat table is provided in the system, which stores the occupancy of each dye vat. If the staining bath table data are all 0, it indicates that there is no slide in the staining bath. Fig. 3 is a flowchart of a staining time registration algorithm.

By adopting the scheme, the invention has the following beneficial effects:

according to the invention, through researching the relation between dyeing resources and dyeing tasks in the dyeing dispatching process, a plurality of dyeing tanks are reasonably distributed to a plurality of dye solutions with the strongest competition among the dyeing steps of each dyeing task, so that the dyeing efficiency can be greatly improved.

The attached table illustrates:

table 1 shows EA36 Papanicolaou staining method

Table 2 shows the distribution of dyeing tanks of the dyeing machine used

Table 3 shows the initial distribution scheme of the dye liquor in the dye vat

Table 4 shows the final distribution scheme of the dye liquor in the dye vat

Table 5 is a dyeing time registry of the final dyeing scheme

Description of the drawings:

FIG. 1 is a schematic diagram of a dye task scheduling scenario

FIG. 2 is a flow chart of a method for optimizing dye dispatch efficiency

FIG. 3 is a flowchart of a staining time registration algorithm

FIG. 4 is a test result of EA36 Papanicolaou staining method

The specific embodiment is as follows:

based on the existing dyeing device and EA36 Papanicolaou dyeing method, the specific embodiments of the present invention are described as follows:

step (1) the initial distribution scheme of the dye bath dye liquor is designed according to the dye bath distribution of the existing dyeing device (see table 2) and the EA36 pasteurization method (see table 3).

And (2) solving the unit dyeing time to be 60s according to the number of the idle dyeing tanks and the time used in the dyeing step.

And (3) determining that 3 dye vats are required to be distributed for hematoxylin and orange liquid and 2 dye vats are required to be distributed for the 95% alcohol in the step 11 according to the unit dyeing time.

Step (4) the final tank liquor distribution scheme is determined according to the tank distribution mode (see table 4).

Step (5) designing a dyeing scheme according to the dyeing step and the final distribution scheme of the dye vat dye liquor, wherein the dyeing scheme is as follows:

Q ₁ :C1->C2->C3->C19->C4->C20->C7->C8->C21->C3->C2->C9->C11->C12

->C14->C15->C18->C23->C24->C25

Q ₂ :C1->C2->C3->C19->C5->C20->C7->C8->C21->C3->C2->C10->C11->C1

2->C14->C16->C18->C23->C24->C25

Q ₃ :C1->C2->C3->C19->C6->C20->C7->C8->C21->C3->C2->C9->C11->C12

->C14->C17->C18->C23->C24->C25

queue Q

_3k+ 1 is identical to Q ₁ Queue Q _3k+2 Same Q ₂ Queue Q _3k Same Q ₃ 。

Step (6) the staining time registry (see table 5) can be calculated from the staining protocol.

The EA36 dyeing method is respectively carried out according to a serial dyeing method, an AFS dyeing method and an optimized method according to the invention, and the dyeing time length and the dyeing task group number form a positive linear positive correlation relationship, as shown in figure 4. Setting the dyeing time lengths of the three test modes as t respectively ₁ 、t ₂ 、t ₃ If the number of the dyeing task groups is k, the following functions can be respectively obtained for three test modes:

1) The relation between the dyeing time length and the dyeing task group number in the serial dyeing test mode is shown in a formula 1.

t ₁ ＝950×k (1)

2) The relation between the dyeing time length and the dyeing task group number in the parallel dyeing test mode is shown in a formula 2.

t ₂ ＝180×k+770 (2)

3) The relation between the dyeing time length and the dyeing task group number of the optimized parallel dyeing test mode is shown in a formula 3.

t ₃ ＝60×h+890 (3)

The dyeing efficiency improvement value v of the parallel dyeing mode relative to the serial dyeing mode can be obtained according to the formula 1 and the formula 2 ₂₁ As in equation 4.

According to the formula 4, when the number k of the dyeing groups is infinite, the efficiency of the parallel dyeing method is expected to be improved by 5.2 times compared with that of the serial dyeing method.

The dyeing efficiency improvement value v of the parallel dyeing mode after the dispatching algorithm optimization relative to the serial dyeing mode can be obtained according to the formula 1 and the formula 3 ₃₁ As in equation 5.

According to the formula 5, when the number k of the dyeing groups is infinite, the efficiency of the dispatching algorithm optimized parallel dyeing method is expected to be improved by 15.8 times compared with that of the serial dyeing method.

The dyeing efficiency improvement value v of the optimized parallel dyeing efficiency relative to the dyeing efficiency of the parallel dyeing mode before optimization can be obtained according to the formula 2 and the formula 3 ₃₂ As in equation 6.

According to the formula 6, when the number k of the dyeing groups is infinite, the efficiency of the scheduling algorithm optimized parallel dyeing method can be expected to be improved by 3 times compared with that of the scheduling algorithm optimized parallel dyeing method before optimization.

The dyeing mode is totally used for 19 dyeing tanks before optimization, and the utilization rate of the dyeing tanks before optimization is 19/26 approximately 73 percent. The optimized dyeing mode uses 24 dye vats, so that the optimized dye vat use ratio is improved to 24/26 approximately 92 percent.

TABLE 1EA36 Papanicolaou staining method

TABLE 2 dyeing machine vat distribution

TABLE 3 initial distribution scheme for dye baths

TABLE 4 final distribution scheme of dye baths

TABLE 5 dyeing time registry for final dyeing protocol

Claims

1. An efficiency optimization method for automatic staining of urine cells is characterized in that,

firstly, distributing dye vat dye liquor based on an EA36 Papanicolaou dyeing method, designing different dyeing schemes for the dyeing method according to the distributed dye vat dye liquor, and finally distributing and calculating a dyeing time registry for each dyeing scheme so as to determine the dyeing starting time and the dyeing ending time for each dyeing step; the method specifically comprises the following steps:

1) Initialization of

Recording the dyeing steps and the dyeing time of the EA36 Papanicolaou dyeing method, and recording the number and the distribution of dyeing tanks of a target dyeing machine;

2) Counting and calculating the number n of idle dyeing tanks _idle

Recording the idle dyeing tanks except for the slice taking, drying and washing tanks of the dyeing machine;

3) Counting the dyeing time t ₁ ～t _k

Counting the dyeing time of each dyeing step, excluding time data with the same time, and then placing the time data in t according to the sequence from big to small ₁ ～t _k In (a) and (b);

4) Calculating the dyeing time of the unit to be t _i Number of independent dye solutions n _i

Dyeing time exceeds t _i A plurality of dyeing tanks are allocated in the dyeing step of (1), and the washing step is not included, namely the dyeing time is t ₁ To t _i Is assigned to the dyeing step of (a)

The number of the dyeing tanks is equal to or less than 1 and x<i；

Dyeing time is not more than t _i Each step is allocated with 1 dye vat;

then the total independent dye liquor number n is calculated _i ；

5) According to the unit dyeing time t _i Dispensing dye liquor

Sequentially distributing the dye solutions of the dye tanks according to the dyeing steps, and adjacently distributing multiple dye solutions of the same dyeing step;

6) Designing a dyeing scheme according to the dye liquor of the dye vat

Because the dyeing step with long dyeing time is independent of a plurality of dyeing tanks, when the dyeing tanks are distributed for parallel tasks, the steps with the plurality of dyeing tanks are distributed in turn according to the task queues, so that the same dyeing is not competing among the plurality of tasks;

7) Dyeing time registration algorithm

Calculating the entry time of the slide by using the concept of a backtracking method;

recording and storing the time registration condition of each dye vat through a global time registry; the time registry is a two-dimensional array of int types, the size of which is n x m; wherein, the row represents n dyeing tanks, the column represents that each dyeing tank can record m/2 time periods, one time period occupies two element spaces, and the two element spaces are dyeing start time and dyeing end time;

setting a dye vat table in the system, wherein the table stores the occupation condition of each dye vat; if the staining bath table data are all 0, it indicates that there is no slide in the staining bath.