2022
DOI: 10.1109/tsmc.2022.3161643
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Control-Theory-Based Approach to Scheduling of High-Throughput Screening System for Enzymatic Assay

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
18
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(19 citation statements)
references
References 38 publications
1
18
0
Order By: Relevance
“…Although the scheduling problem under consideration is complex and NP-hard, we solve it efficiently using the proposed method if the number of screening operations is limited, which is a condition usually encountered in practice [11,12]. This result complements the original studies of Oke et al [11,13] and Wu et al [12,14], who used mixed integer programming and resource-oriented Petri nets, respectively, to model, analyze, and solve the HTS scheduling problem for enzymatic assays. The proposed PERT/CPM method works in conjunction with the prohibited intervals subalgorithm [15], which weeds out unfeasible solutions and finds the optimal schedule in strongly polynomial time (in the number of operations m), O(m 3 log m), which, as far as we know, cannot be achieved using existing algorithms.…”
Section: Introductionmentioning
confidence: 65%
See 4 more Smart Citations
“…Although the scheduling problem under consideration is complex and NP-hard, we solve it efficiently using the proposed method if the number of screening operations is limited, which is a condition usually encountered in practice [11,12]. This result complements the original studies of Oke et al [11,13] and Wu et al [12,14], who used mixed integer programming and resource-oriented Petri nets, respectively, to model, analyze, and solve the HTS scheduling problem for enzymatic assays. The proposed PERT/CPM method works in conjunction with the prohibited intervals subalgorithm [15], which weeds out unfeasible solutions and finds the optimal schedule in strongly polynomial time (in the number of operations m), O(m 3 log m), which, as far as we know, cannot be achieved using existing algorithms.…”
Section: Introductionmentioning
confidence: 65%
“…These techniques are widely used in many industries, sectors, and services [18,19]. The PERT/CPM method is successfully used in this study to solve the practical problem considered in [11,14], and, as we will show below, this mathematical model has significant computational and practical advantages over existing MIP and Petri net methods.…”
Section: R Peer Review 4 Of 18mentioning
confidence: 96%
See 3 more Smart Citations