Sequential testing with precedence constraints

In this project, the student is expected to develop algorithms to solve the sequential testing problem for a series system under general precedence constraints. The student is expected to develop exact and heuristic algorithms for the problem. One particular emphasis will be on approximating the nonlinear objective function by a surrogate linear function. Another will be greedy based search algorithms.
The project will require developing and coding algorithms as well as modeling.