Criticality Analysis of Activity Networks under Interval Uncertainty

Dedicated to the memory of Professor Stefan Chanas - The extended abstract version of this paper has appeared in Proceedings of 11th International Conference on Principles and Practice of Constraint Programming (CP2005) ("Interval Analysis in Scheduling", Fortin et al. 2005)International audienceThis paper reconsiders the Project Evaluation and Review Technique (PERT) scheduling problem when information about task duration is incomplete. We model uncertainty on task durations by intervals. With this problem formulation, our goal is to assert possible and necessary criticality of the different tasks and to compute their possible earliest starting dates, latest starting dates, and floats. This paper combines various results and provides a complete solution to the problem. We present the complexity results of all considered subproblems and efficient algorithms to solve them

Project scheduling under uncertainty using fuzzy modelling and solving techniques

In the real world, projects are subject to numerous uncertainties at different levels of planning. Fuzzy project scheduling is one of the approaches that deal with uncertainties in project scheduling problem. In this paper, we provide a new technique that keeps uncertainty at all steps of the modelling and solving procedure by considering a fuzzy modelling of the workload inspired from the fuzzy/possibilistic approach. Based on this modelling, two project scheduling techniques, Resource Constrained Scheduling and Resource Leveling, are considered and generalized to handle fuzzy parameters. We refer to these problems as the Fuzzy Resource Constrained Project Scheduling Problem (FRCPSP) and the Fuzzy Resource Leveling Problem (FRLP). A Greedy Algorithm and a Genetic Algorithm are provided to solve FRCPSP and FRLP respectively, and are applied to civil helicopter maintenance within the framework of a French industrial project called Helimaintenance

Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks

This paper deals with the evaluation of quantile-based risk measures for the makespan in scheduling problems represented as temporal networks with uncer tainties on the activity durations. More specifically, for each activity only the interval for its possible duration values is known in advance to both the sched uler and the risk analyst. Given a feasible schedule, we calculate the quantiles and the superquantiles of the makespan which are of interest as risk indicators in various applications. To this aim we propose and test a set of novel algorithms to determine rapid and accurate numerical estimations based on the calculation of theoretically proven lower and upper bounds. An extensive experimental campaign compu tationally shows the validity of the proposed methods, and allows to highlight their performances through the comparison with respect to the state-of-the-art algorithms

A general framework integrating techniques for scheduling under uncertainty

Ces dernières années, de nombreux travaux de recherche ont porté sur la planification de tâches et l'ordonnancement sous incertitudes. Ce domaine de recherche comprend un large choix de modèles, techniques de résolution et systèmes, et il est difficile de les comparer car les terminologies existantes sont incomplètes. Nous avons cependant identifié des familles d'approches générales qui peuvent être utilisées pour structurer la littérature suivant trois axes perpendiculaires. Cette nouvelle structuration de l'état de l'art est basée sur la façon dont les décisions sont prises. De plus, nous proposons un modèle de génération et d'exécution pour ordonnancer sous incertitudes qui met en oeuvre ces trois familles d'approches. Ce modèle est un automate qui se développe lorsque l'ordonnancement courant n'est plus exécutable ou lorsque des conditions particulières sont vérifiées. Le troisième volet de cette thèse concerne l'étude expérimentale que nous avons menée. Au-dessus de ILOG Solver et Scheduler nous avons implémenté un prototype logiciel en C++, directement instancié de notre modèle de génération et d'exécution. Nous présentons de nouveaux problèmes d'ordonnancement probabilistes et une approche par satisfaction de contraintes combinée avec de la simulation pour les résoudre. ABSTRACT : For last years, a number of research investigations on task planning and scheduling under uncertainty have been conducted. This research domain comprises a large number of models, resolution techniques, and systems, and it is difficult to compare them since the existing terminologies are incomplete. However, we identified general families of approaches that can be used to structure the literature given three perpendicular axes. This new classification of the state of the art is based on the way decisions are taken. In addition, we propose a generation and execution model for scheduling under uncertainty that combines these three families of approaches. This model is an automaton that develops when the current schedule is no longer executable or when some particular conditions are met. The third part of this thesis concerns our experimental study. On top of ILOG Solver and Scheduler, we implemented a software prototype in C++ directly instantiated from our generation and execution model. We present new probabilistic scheduling problems and a constraintbased approach combined with simulation to solve some instances thereof

Applying Bayesian networks to model uncertainty in project scheduling

PhDRisk Management has become an important part of Project Management. In spite of numerous advances in the field of Project Risk Management (PRM), handling uncertainty in complex projects still remains a challenge. An important component of Project Risk Management (PRM) is risk analysis, which attempts to measure risk and its impact on different project parameters such as time, cost and quality. By highlighting the trade-off between project parameters, the thesis concentrates on project time management under uncertainty. The earliest research incorporating uncertainty/risk in projects started in the late 1950’s. Since then, several techniques and tools have been introduced, and many of them are widely used and applied throughout different industries. However, they often fail to capture uncertainty properly and produce inaccurate, inconsistent and unreliable results. This is evident from consistent problems of cost and schedule overrun. The thesis will argue that the simulation-based techniques, as the dominant and state-of-the-art approach for modelling uncertainty in projects, suffers from serious shortcomings. More advanced techniques are required. Bayesian Networks (BNs), are a powerful technique for decision support under uncertainty that have attracted a lot of attention in different fields. However, applying BNs in project risk management is novel. The thesis aims to show that BN modelling can improve project risk assessment. A literature review explores the important limitations of the current practice of project scheduling under uncertainty. A new model is proposed which applies BNs for performing the famous Critical Path Method (CPM) calculation. The model subsumes the benefits of CPM while adding BN capability to properly capture different aspects of uncertainty in project scheduling

Modeling and Analysis of Mixed Synchronous/Asynchronous Systems

Practical safety-critical distributed systems must integrate safety critical and non-critical data in a common platform. Safety critical systems almost always consist of isochronous components that have synchronous or asynchronous interface with other components. Many of these systems also support a mix of synchronous and asynchronous interfaces. This report presents a study on the modeling and analysis of asynchronous, synchronous, and mixed synchronous/asynchronous systems. We build on the SAE Architecture Analysis and Design Language (AADL) to capture architectures for analysis. We present preliminary work targeted to capture mixed low- and high-criticality data, as well as real-time properties in a common Model of Computation (MoC). An abstract, but representative, test specimen system was created as the system to be modeled