Scheduling of biological samples for DNA sequencing
Author(s)
Hu, Yuwei, S.M. Massachusetts Institute of Technology; Lim, Chin Soon
DownloadFull printable version (697.1Kb)
Other Contributors
Massachusetts Institute of Technology. Computation for Design and Optimization Program.
Advisor
Stephen Graves.
Terms of use
Metadata
Show full item recordAbstract
In a DNA sequencing workflow, a biological sample has to pass through multiple process steps. Two consecutive steps are hydroshearing and library construction. Samples arrive randomly into the inventory and are to complete both processes before their due dates. The research project is to decide the optimal sequence of samples to go through these two processes subject to operational constraints. Two approaches, namely, heuristic and integer programming have been pursued in this thesis. A heuristic algorithm is proposed to solve the scheduling problem. A variant of the problem involving deterministic arrivals of samples is also considered for comparison purposes. Comparison tests between the two approaches are carried out to investigate the performance of the proposed heuristic for the original problem and its variant. Sensitivity analysis of the schedule to parameters of the problem is also conducted when using both approaches.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2009. This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. Cataloged from student submitted PDF version of thesis. Includes bibliographical references (p. 95-97).
Date issued
2009Department
Massachusetts Institute of Technology. Computation for Design and Optimization ProgramPublisher
Massachusetts Institute of Technology
Keywords
Computation for Design and Optimization Program.