Projects are rarely executed exactly as planned. Often, the actual durations of a project’s activities differ from the planned ones, resulting in costs stemming from the inaccurate estimation of the activities’ completion dates. While monitoring the project at various inspection points is pricy, it can lead to better estimation of the project completion time, hence saving on costs. Nonetheless, identifying the optimal inspection points is a difficult task, as it requires evaluating a large number of the project’s path options, even for small-scale projects. This paper proposes an analytical method for identifying the optimal project inspection points by using Information Theory measures. We search for monitoring (inspection) points that can maximize the information about the estimated project’s duration or completion time. The proposed methodology is based on a simulation-optimization scheme using a Monte Carlo engine that simulates potential activities’ durations. An exhaustive search is performed of all possible control points to find those with the highest expected information gain on the project duration. The proposed algorithm’s complexity is not affected the number of activities, and can address large projects with hundreds or thousands of activities. Numerical experimentation and analysis of various parameters are presented.

Abstract: Wireless body area networks (WBANs) have strong potential in the field of health monitoring. However, the energy consumption required for accurate monitoring limits the time between battery charges of the wearable sensors, which is a key performance factor (and can be critical in the case of implantable devices). In this paper, we study the inherent trade-off between the power consumption of the sensors and the probability of misclassifying a patient’s health state. We formulate this trade-off as a dynamic problem, in which at each step we can choose to activate a subset of sensors that provide noisy measurements of the patient’s health state. We assume that the (unknown) health state follows a Markov chain, so our problem is formulated as a partially observable Markov decision problem (POMDP). We show that all the past measurements can be summarized as a belief state on the true health state of the patient, which allows tackling the POMDP problem as an MDP on the belief state. We then empirically study the performance of a greedy one-step look-ahead policy compared to the optimal policy obtained by solving the dynamic program. For that purpose, we use an open-source Continuous Glucose Monitoring (CGM) data set of 232 patients over six months and extract the transition matrix and sensor accuracies from the data. We find that the greedy policy saves ~50% of the energy costs while reducing the misclassification costs by less than 2% compared to the most accurate policy possible that always activates all sensors. Our sensitivity analysis reveals that the greedy policy remains nearly optimal across different cost parameters and a varying number of sensors. The results also have practical importance, because while the optimal policy is too complicated, a greedy one-step look-ahead policy can be easily implemented in WBAN systems.