Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms

https://doi.org/10.1016/j.cor.2010.10.006Get rights and content

Abstract

We consider a micro/nano fluidic toolbit that consists of a set of identical testing units, each of which contains a microchannel that has an array of equally spaced nanopores opened along it. In each microchannel, same equally spaced chemical liquid plugs shift back and forth under pneumatic pressure. Below each nanopore is a testing tube that accepts appropriate nanoscale chemical droplets from the microchannel above to perform biochemical tests. Each tube may require several different chemicals in sequence to get proper results. Liquid chemicals required in different tubes may be dropped simultaneously in a round if the liquid plug sequence in the microchannel above matches the chemical requirements in these tubes. The sizes of testing problems in terms of the numbers of tubes, liquid chemicals required in each tube and liquid plugs in the microchannel are large, efficient testing procedure requires careful “round” scheduling in order to shorten the testing time span. In this research, we model the biochemical test scheduling as the fixed plug sequence problem (FPSP), where the liquid plug layout in the microchannel is given. We show that the FPSP is NP-hard in general, and then develop both exact and heuristic algorithms. The computational performances of the proposed algorithms are provided and contrasted.

Introduction

The fears about another potential round of terrorist attacks by biological weapons have motivated researchers to find better ways to handle large-scale biochemical screening. Such efforts involve designing and implementing microfluidic devices, such as laboratory-on-a-chip devices. Besides deterring biological attacks, the technology of large-scale biochemical testing also facilitates rapid advances in gene discovery, genetic mapping and gene expression with broader applications ranging from infectious diseases, drug screening and cancer diagnostics to food quality and environmental evaluation.

In this work, we consider a micro/nano fluidic toolbit, which is conceptually illustrated in Fig. 1, which contains a large set of identical testing units. Each testing unit has a microchannel with an array of equally spaced nanopores opened along it. In the microchannel, equally spaced chemical liquid plugs shift back and forth under pneumatic pressure. Below each nanopore is a testing tube that accepts appropriate nanoscale chemical droplets from the microchannel above to perform biochemical tests. Each tube may require several different chemicals in sequence to get proper results. Liquid chemicals required in several different tubes may be dropped simultaneously in a round if the liquid plug sequence in the microchannel above matches the chemical requirements in these tubes.

In each testing unit, chemical liquid plugs are introduced to the microchannel in such a way that the center distance between any two adjacent liquid plugs equals the distance between any two adjacent nanopores. The train of equal-length chemical liquid plugs in the microchannel shifts back and forth under pneumatic pressure. When the liquid plug train comes to a proper alignment with the underlying testing tubes, the corresponding nanopores are opened and the required nanoscale chemical droplets are deposited into the corresponding tubes to finish a round of biochemical tests. In each test round, the liquid plug train needs to be precisely sensed and positioned by sensor arrays arranged near the nanopores [1]. Since the liquid plugs in the microchannel are at a micro scale and the droplets are at a much smaller nano scale, we assume that the size of each liquid plug remains unchanged after each test round. Another concern is the potential liquid contamination due to the direct contact of different liquid plugs in the microchannel. In the micro scale, there is no turbulent mixing but only slow diffusions at the direct liquid-liquid interface at a very low Reynold number [2], [3]. Ismagilov et al. [4] developed a technique that allows direct fluid–fluid contacts for combinatorial experiments and detection purposes. Every nano droplet comes out from the center of a liquid plug and therefore the impact of diffusion is negligible.

The numbers of tubes, liquid chemicals required in each tube and liquid plugs in the microchannel are large, and for the system to run efficiently and to achieve high testing throughput requires careful scheduling. This research is devoted to exploring good scheduling methods to shorten the total biochemical testing time span. Each testing unit in the studied micro/nano fluidic toolbit can be considered independently, so we focus on a single testing unit in the following discussion. Assuming each testing task takes the same amount of time to complete, our objective of minimizing the testing time span is equivalent to scheduling the test sequence in such a way that the number of test rounds is minimized.

In this work, we consider that the liquid plug layout in the microchannel is given, and so model the micro/nano biochemical test scheduling problem as the fixed plug sequence problem (FPSP). In Section 2, we establish the criteria for a scheduling solution to be feasible. Then the complexity of the FPSP is explored in Section 3. Mathematical programming models and exact algorithms are developed in Section 4. Several heuristics are provided and analyzed in Section 5. Solution qualities and performances of the proposed algorithms are computationally studied in Section 6. Section 7 concludes.

Section snippets

Notations and criteria for feasible scheduling

Without loss of generality, we assume that the total number of testing tubes is n, each tube has m testing tasks and the microchannel contains q liquid plugs of p different chemicals. We index the tubes from left to right by 1, 2, 3, …, n, and the testing tasks in a tube by 1, 2, 3, …, m. A task with smaller index should be finished before a task with larger index in the same tube. For simplicity, we identify a testing task j in tube i as T(i, j) or simply (i, j), where 1≤in and 1≤jm. When it

Complexity of fixed plug sequence problem

Given the liquid plug layout in the microchannel, it is clear that the FPSP with only one tube is trivial. When two tubes, namely 1 and 2, are involved, we build a bipartite graph G to represent these two tubes as shown in Fig. 3. In graph G, we connect tasks T(1, i) and T(2, j) by an arc if these two tasks can be done in a round, allowed by the liquid plug layout in the microchannel (this can be checked in O(q) steps). Denote by U the task set in tube 1 and by V the task set in tube 2. In

Mathematical programming models and exact algorithms

This section considers solving the FPSP by exact algorithms based on mathematical programming models. Two different models are discussed and an exact solution is developed using the second model.

Heuristic algorithms

The exact algorithms presented in Section 4 can only solve small FPSPs to optimality. For practical applications, heuristics are needed to solve large size problems. We know that in the best case, every round finishes one task of each testing tube, and the number of rounds is m. In the worst case each task has to be done in an individual round, and the number of rounds is n·m. Thus the worst-case performance of any heuristic is bounded by ρ=(n·m)/m=n.

Computational studies

The proposed exact algorithm and heuristics are implemented, and their computational performances are tested out on a computer with a Pentium 4 1.82 GHz processor and 512 MB RAM. Test cases are randomly generated according to the following parameters:

  • i.

    number of chemicals—p

  • ii.

    number of liquid plugs in the microchannel—q

  • iii.

    number of testing tubes—n

  • iv.

    number of testing tasks in each tube—m

with constraint q>p to guarantee that each chemical has at least one liquid plug in the microchannel. For each set of

Conclusions

Efficient operation of micro/nano fluidic devices to perform large-scale biochemical testing requires careful test-task scheduling. Given the liquid plug layout in the microchannel, we modeled this scheduling problem as the fixed plug sequence problem (FPSP) and then showed that FPSPs are NP-hard in general. Since the minimum set cover problem is polynomially reducible to a special case of the FPSP, this problem is inapproximable in terms of constant approximate ratio. Mathematical programming

Acknowledgement

The authors wish to thank the editor and two anonymous referees for their helpful suggestions that greatly improved the presentation in this paper.

References (19)

  • J.K. Lenstra et al.

    Computational complexity of discrete optimization problems

    Annals of Discrete Mathematics

    (1979)
  • Y.N. Sotskov et al.

    NP-hardness of shop-scheduling problems with three jobs

    Discrete Applied Mathematics

    (1995)
  • G. Cornuéjols et al.

    On the uncapacitated Location problem

    Annals of Discrete Mathematics

    (1977)
  • D.S. Johnson

    Approximation algorithms for combinatorial problems

    Journal of Computer and System Sciences

    (1974)
  • Cole MC, Kenis PJA. Integrated sensor arrays in microfluidic networks. Presentation in 2005 AIChe National Conference...
  • O. Reynolds

    An experimental investigation of the circumstances which determine whether the motion of water shall be direct or sinuous, and of the law of resistance in parallel channels

    Philosophical Transactions of the Royal Society

    (1883)
  • P.J.A. Kenis et al.

    Microfabrication inside capillaries using multiphase laminar flow patterning

    Science

    (1999)
  • R.F. Ismagilov et al.

    Microfluidic arrays of fluid-fluid diffusional contacts as detection elements and combinatorial tools

    Analytical chemistry

    (2001)
  • R.K. Ahuja et al.

    Network flows: theory, algorithms, and applications

    (1993)
There are more references available in the full text version of this article.
1

Tel.: +1 217 333 1665

View full text