{'fraction_non_alphanumeric': 0.023636363636363636, 'fraction_numerical': 0.0027272727272727275, 'mean_word_length': 5.255681818181818, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Scheduling a Life Science High-Throughput Platform under Starvation Constraints Using Timed Transition Petri Nets and Heuristic Search

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.