Solution and quality robust project scheduling: a methodological framework.

The vast majority of the research efforts in project scheduling over the past several years has concentrated on the development of exact and suboptimal procedures for the generation of a baseline schedule assuming complete information and a deterministic environment. During execution, however, projects may be the subject of considerable uncertainty, which may lead to numerous schedule disruptions. Predictive-reactive scheduling refers to the process where a baseline schedule is developed prior to the start of the project and updated if necessary during project execution. It is the objective of this paper to review possible procedures for the generation of proactive (robust) schedules, which are as well as possible protected against schedule disruptions, and for the deployment of reactive scheduling procedures that may be used to revise or re-optimize the baseline schedule when unexpected events occur. We also offer a methodological framework that should allow project management to identify the proper scheduling methodology for different project scheduling environments. Finally, we survey the basics of Critical Chain scheduling and indicate in which environments it is useful.Framework; Information; Management; Processes; Project management; Project scheduling; Project scheduling under uncertainty; Stability; Robust scheduling; Quality; Scheduling; Stability; Uncertainty;

Project scheduling under undertainty – survey and research potentials.

The vast majority of the research efforts in project scheduling assume complete information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed baseline schedule will be executed. However, in the real world, project activities are subject to considerable uncertainty, that is gradually resolved during project execution. In this survey we review the fundamental approaches for scheduling under uncertainty: reactive scheduling, stochastic project scheduling, stochastic GERT network scheduling, fuzzy project scheduling, robust (proactive) scheduling and sensitivity analysis. We discuss the potentials of these approaches for scheduling projects under uncertainty.Management; Project management; Robustness; Scheduling; Stability;

Modeling and Solving Project Portfolio and Contractor Selection Problem Based on Project Scheduling under Uncertainty

AbstractIn this paper a new formulation of the project portfolio selection problem based on the project schedules in uncertain circumstances have been proposed. The project portfolio selection models usually disregard the project scheduling, whereas is an element of the project selection process. We investigate a project portfolio selection problem based on the schedule of the projects, so that the minimum expected profit would be met in the shortest possible time period. Also due to uncertain nature of durations of the activities, this duration considered as the semi-trapezoidal fuzzy numbers. Finally, a fuzzy linear programming model is developed for the problem, where the results indicated the validity of the presented model

A genetic algorithm-based method for solving multi-mode resource-constrained project scheduling problem in uncertain environment

Project scheduling models with resource constraints and multi-mode activities aims to create a schedule for carrying out activities considering precedence constraints and available resources in order to minimize the project duration. In the real world, we face uncertainty related to projects, where there are no historical data, hence, we should rely on the experts' judgements to estimate activity durations. For this purpose, in this paper, the 99-simulation method is used to deal with uncertainty. The exact mathematical programming model is presented in this paper and the hybrid algorithm based on Genetic Algorithm is used to solve this type of project scheduling problem which finds the near-optimal solution in a short computational time. Finally, the effectiveness of the proposed model is examined with a numerical example.Peer reviewedFinal article published.MRCPSPSimulationUncertaintyGenetic algorith

Multiobjective strategies for New Product Development in the pharmaceutical industry

New Product Development (NPD) constitutes a challenging problem in the pharmaceutical industry, due to the characteristics of the development pipeline. Formally, the NPD problem can be stated as follows: select a set of R&D projects from a pool of candidate projects in order to satisfy several criteria (economic profitability, time to market) while coping with the uncertain nature of the projects. More precisely, the recurrent key issues are to determine the projects to develop once target molecules have been identified, their order and the level of resources to assign. In this context, the proposed approach combines discrete event stochastic simulation (Monte Carlo approach) with multiobjective genetic algorithms (NSGAII type, Non-Sorted Genetic Algorithm II) to optimize the highly combinatorial portfolio management problem. In that context, Genetic Algorithms (GAs) are particularly attractive for treating this kind of problem, due to their ability to directly lead to the so-called Pareto front and to account for the combinatorial aspect. This work is illustrated with a study case involving nine interdependent new product candidates targeting three diseases. An analysis is performed for this test bench on the different pairs of criteria both for the bi- and tricriteria optimization: large portfolios cause resource queues and delays time to launch and are eliminated by the bi- and tricriteria optimization strategy. The optimization strategy is thus interesting to detect the sequence candidates. Time is an important criterion to consider simultaneously with NPV and risk criteria. The order in which drugs are released in the pipeline is of great importance as with scheduling problems

Multiobjective strategies for New Product Development in the pharmaceutical industry

New Product Development (NPD) constitutes a challenging problem in the pharmaceutical industry, due to the characteristics of the development pipeline. Formally, the NPD problem can be stated as follows: select a set of R&D projects from a pool of candidate projects in order to satisfy several criteria (economic profitability, time to market) while coping with the uncertain nature of the projects. More precisely, the recurrent key issues are to determine the projects to develop once target molecules have been identified, their order and the level of resources to assign. In this context, the proposed approach combines discrete event stochastic simulation (Monte Carlo approach) with multiobjective genetic algorithms (NSGAII type, Non-Sorted Genetic Algorithm II) to optimize the highly combinatorial portfolio management problem. In that context, Genetic Algorithms (GAs) are particularly attractive for treating this kind of problem, due to their ability to directly lead to the so-called Pareto front and to account for the combinatorial aspect. This work is illustrated with a study case involving nine interdependent new product candidates targeting three diseases. An analysis is performed for this test bench on the different pairs of criteria both for the bi- and tricriteria optimization: large portfolios cause resource queues and delays time to launch and are eliminated by the bi- and tricriteria optimization strategy. The optimization strategy is thus interesting to detect the sequence candidates. Time is an important criterion to consider simultaneously with NPV and risk criteria. The order in which drugs are released in the pipeline is of great importance as with scheduling problems

Spitzer Warm Mission Transition and Operations

Following the successful dynamic planning and implementation of IRAC Warm Instrument Characterization activities, transition to Spitzer Warm Mission operations has gone smoothly. Operation teams procedures and processes required minimal adaptation and the overall composition of the Mission Operation System retained the same functionality it had during the Cryogenic Mission. While the warm mission scheduling has been simplified because all observations are now being made with a single instrument, several other differences have increased the complexity. The bulk of the observations executed to date have been from ten large Exploration Science programs that, combined, have more complex constraints, more observing requests, and more exo-planet observations with durations of up to 145 hours. Communication with the observatory is also becoming more challenging as the Spitzer DSN antenna allocations have been reduced from two tracking passes per day to a single pass impacting both uplink and downlink activities. While IRAC is now operating with only two channels, the data collection rate is roughly 60% of the four-channel rate leaving a somewhat higher average volume collected between the less frequent passes. Also, the maximum downlink data rate is decreasing as the distance to Spitzer increases requiring longer passes. Nevertheless, with well over 90% of the time spent on science observations, efficiency has equaled or exceeded that achieved during the cryogenic mission

Optimization Algorithms in Project Scheduling

Scheduling, or planning in a general perspective, is the backbone of project management; thus, the successful implementation of project scheduling is a key factor to projects’ success. Due to its complexity and challenging nature, scheduling has become one of the most famous research topics within the operational research context, and it has been widely researched in practical applications within various industries, especially manufacturing, construction, and computer engineering. Accordingly, the literature is rich with many implementations of different optimization algorithms and their extensions within the project scheduling problem (PSP) analysis field. This study is intended to exhibit the general modelling of the PSP, and to survey the implementations of various optimization algorithms adopted for solving the different types of the PSP