“…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.…”