Issue No. 09 - September (1985 vol. 34)
H. Krawczyk , Institute of Informatics, Technical University of Gdansk
The problem of diagnostic test scheduling (DTS) is to assign to each edge e of a diagnostic graph G a time interval of length l(e) so that intervals corresponding to edges at any given vertex do not overlap and the overall finishing time is minimum. In this correspondence we show that the DTS problem is NP-complete. Then we present a longest, first sequential scheduling algorithm which runs in worst case time O(dm log n) and uses O(m) space to produce a solution of length less than four times optimal. Then we show that the general performance bound can be strengthened to 3 * OPT(G) for low-degree graphs and to 2 ?OPT(G) in some special cases of binomial diagnostic graphs.
NP-completeness, Approximation algorithm, computational complexity, diagnostic graph, diagnostic test scheduling, multicomputer system
M. Kubale and H. Krawczyk, "An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems," in IEEE Transactions on Computers, vol. 34, no. , pp. 869-872, 1985.