2026-09-19T05:24:20Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/542142022-01-13T07:54:53Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Stephen Graves.
Hu, Yuwei, S.M. Massachusetts Institute of Technology
Lim, Chin Soon
Massachusetts Institute of Technology. Computation for Design and Optimization Program.
Massachusetts Institute of Technology. Computation for Design and Optimization Program
2010-04-26T19:19:20Z
2010-04-26T19:19:20Z
2009
2009
http://hdl.handle.net/1721.1/54214
587418369
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).
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.
by Yuwei Hu and Chin Soon Lim.
S.M.
107 p.
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Computation for Design and Optimization Program.
Scheduling of biological samples for DNA sequencing
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="c70a9511-fb40-4fd9-a3f3-9d9e40d9e266">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Scheduling of biological samples for DNA sequencing</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2009</PublicationDate>
<Authors>
<Author>
<DisplayName>Hu, Yuwei, S.M. Massachusetts Institute of Technology</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
<Author>
<DisplayName>Lim, Chin Soon</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Computation for Design and Optimization Program.</Keyword>
<Abstract>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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>