A Path-Driven Fluid Routing and Scheduling Method for Continuous-Flow Microfluidic Biochips with Delay Time Optimization

. 2025 May 26;16(6):625. doi: 10.3390/mi16060625

Algorithm 1 Path-driven application mapping iteration algorithm

1:
flag ← true, $T_{m i n} \leftarrow \infty$ , $Q \leftarrow \emptyset$ , $Q^{'} \leftarrow \emptyset$ ;
2:
while flag do
3:
Add operations without parent operations to ready queue Q;
4:
while $Q \neq \emptyset$ or $Q^{'} \neq \emptyset$ do
5:
if $Q^{'} \neq \emptyset$ then
6:
Call operation sorting algorithm to sort operations in Q, and add them to $Q^{'}$ ;
7:
end if
8:
Retrieve an operation $o_{i}$ from the front of $Q^{'}$ ;
9:
if there are other fluid in the target component m then
10:
Transport the fluid to the next component or a dedicated storage unit;
11:
end if
12:
Calculate the contaminated channel segments in the current flow path;
13:
if there is a path that needs to be cleaned then
14:
Perform globally aware wash operation;
15:
end if
16:
Execute transportation task and update component and channel information;
17:
Execute $o_{i}$ , add $o_{i}$ ’s child operations to queue Q, update component information;
18:
end while
19:
if completion time remains unchanged for three consecutive iterations then
20:
flag ← false;
21:
end if
22:
$T_{m i n} \leftarrow min (T_{m i n}, T)$ ;
23:
end while