By Topic

Scheduling a Life Science High-Throughput Platform under Starvation Constraints Using Timed Transition Petri Nets and Heuristic Search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Tao Hong ; North Carolina State Univ., Raleigh ; Mo-Yuen Chow ; Haaland, P. ; Wilson, D.
more authors

High-throughput (HT) platforms have been increasingly used in the life science area for diverse bio-chemical experiments. This paper addresses the scheduling of HT platform based experiments under multiple constraints, such as operation constraints, resource constraints and starvation constraints. We use timed transition Petri nets (PN) to model the experimental process with constraints. We first propose the transition variant property of the PN model. We then propose the HCH (Hong-Chow-Haaland) algorithm, which is customized from A* algorithm, to find a feasible solution. HCH algorithm is more efficient than L1 algorithm and most other A* extended algorithms in identification of new markings when applied to the transition variant PN. We then applied HCH algorithm to two typical HT processes. The results show that HCH algorithm can be used to find optimal solutions with the time complexity of identifying new markings less than 2% of the L1 algorithm.

Published in:

Industrial Electronics, 2007. ISIE 2007. IEEE International Symposium on

Date of Conference:

4-7 June 2007