Timeslack-based techniques for generating robust projectschedules subject to resource uncertainty.

The classical, deterministic resource-constrained project scheduling problem has been the subject of a great deal of research during the previous decades. This is not surprising given the high practical relevance of this scheduling problem. Nevertheless, extensions are needed to be better able to cope with situations arising in practice such as multiple activity execution modes, activity duration changes and resource breakdowns. In this paper we analytically determine the impact of unexpected resource breakdowns on activity durations. Furthermore, using this information we develop an approach for inserting explicit idle time into the project schedule in order to protect it as well as possible from disruptions caused by resource unavailabilities. This strategy will be compared to a traditional simulation-based procedure and to a heuristic developed for the case of stochastic activity durations.Uncertainty; Project scheduling; Scheduling; Research; Impact; Information; Time; Order; IT; Strategy; Heuristic;

A modied branch and cut procedure for resource portfolio problem under relaxed resource dedication policy

Multi-project scheduling problems are characterized by the way resources are managed in the problem environment. The general approach in multi-project scheduling literature is to consider resource capacities as a common pool that can be shared among all projects without any restrictions or costs. The way the resources are used in a multi-project environment is called resource management policy and the aforementioned assumption is called Resource Sharing Policy in this study. The resource sharing policy is not a generalization for multi-project scheduling environments and different resource management policies maybe defined to identify characteristics of different problem environments. In this study, we present a resource management policy which prevents sharing of resources among projects but allows resource transfers when a project starts after the completion of another one. This policy is called the Relaxed Resource Dedication (RRD) Policy in this study. The general resource capacities might or might not be decision variables. We will treat here the case where the general available amounts of resources are decision variables to be determined subject to a limited budget. We call this problem as the Resource Portfolio Problem (RPP). In this study, RPP is investigated under RRD policy and a modified Branch and Cut (B&C)procedure based on CPLEX is proposed. The B&C procedure of CPLEX is modified with different branching strategies, heuristic solution approaches and valid inequalities. The computational studies presented demonstrate the effectiveness of the proposed solution approaches

Phase transitions in project scheduling.

The analysis of the complexity of combinatorial optimization problems has led to the distinction between problems which are solvable in a polynomially bounded amount of time (classified in P) and problems which are not (classified in NP). This implies that the problems in NP are hard to solve whereas the problems in P are not. However, this analysis is based on worst-case scenarios. The fact that a decision problem is shown to be NP-complete or the fact that an optimization problem is shown to be NP-hard implies that, in the worst case, solving it is very hard. Recent computational results obtained with a well known NP-hard problem, namely the resource-constrained project scheduling problem, indicate that many instances are actually easy to solve. These results are in line with those recently obtained by researchers in the area of artificial intelligence, which show that many NP-complete problemsexhibit so-called phase transitions, resulting in a sudden and dramatic change of computational complexity based on one or more order parameters that are characteristic of the system as a whole. In this paper we provide evidence for the existence of phase transitions in various resource-constrained project scheduling problems. We discuss the use of network complexity measures and resource parameters as potential order parameters. We show that while the network complexity measures seem to reveal continuous easy-hard or hard-easy phase-transitions, the resource parameters exhibit an easy-hard-easy transition behaviour.Networks; Problems; Scheduling; Algorithms;

How would you like it: cheaper or shorter

least cost scheduling techniques were accomPanying the history of modern Project management, however they have never gained much importance in the practice. Even in our days only a few computer application provide this kind of feature to the users. In this paper a generalized PDM least cost scheduling problem will be introduced, and a case study will be presented to demonstrate the effectiveness of the model. The case study is based on a highway construction project, where the least cost scheduling technique developed by the authors was used in applied in order to calculate the minimum direct cost solution to a given project duration. The authors came to a conclusion that least cost scheduling can be a useful tool in the cost planning of the projects, however further research are necessary (e.g. handle of the activity calendars) to make the model suitable for everyday use

Heuristic algorithm for single resource constrained project scheduling problem based on the dynamic programming

We introduce a heuristic method for the single resource constrained project scheduling problem, based on the dynamic programming solution of the knapsack problem. This method schedules projects with one type of resources, in the non-preemptive case: once started an activity is not interrupted and runs to completion. We compare the implementation of this method with well-known heuristic scheduling method, called Minimum Slack First (known also as Gray-Kidd algorithm), as well as with Microsoft Project

Restless bandit marginal productivity indices II: multiproject case and scheduling a multiclass make-to-order/-stock M/G/1 queue

This paper develops a framework based on convex optimization and economic ideas to formulate and solve approximately a rich class of dynamic and stochastic resource allocation problems, fitting in a generic discrete-state multi-project restless bandit problem (RBP). It draws on the single-project framework in the author's companion paper "Restless bandit marginal productivity indices I: Single-project case and optimal control of a make-to-stock M/G/1 queue", based on characterization of a project's marginal productivity index (MPI). Our framework significantly expands the scope of Whittle (1988)'s seminal approach to the RBP. Contributions include: (i) Formulation of a generic multi-project RBP, and algorithmic solution via single-project MPIs of a relaxed problem, giving a lower bound on optimal cost performance; (ii) a heuristic MPI-based hedging point and index policy; (iii) application of the MPI policy and bound to the problem of dynamic scheduling for a multiclass combined MTO/MTS M/G/1 queue with convex backorder and stock holding cost rates, under the LRA criterion; and (iv) results of a computational study on the MPI bound and policy, showing the latter's near-optimality across the cases investigated

A methodology for prospective operational design co-ordination

Engineering companies are continually faced with the challenge of how best to utilise their design team given some design project. Decisions regarding how to distribute the project workload amongst the members of the design team are the responsibility of a project manager who, in order to do this, often relies upon previous experience and/or the support of some planning tool. Furthermore, a project manager rarely has the opportunity to assess the capability of the design team against the current work load in order to determine what, if any, alterations couldbe made to the team to facilitate appropriate reductions in project time and cost.This paper proposes a mathematical-based methodology aimed at identifying shortfalls in design teams, which if remedied would result in a more efficient project in terms of time and cost. The methodology provides a means of identifying those skills within the design team,with respect to the outstanding work load, in which improvements would have the greatest influence on reducing time and cost. In addition, the methodology employs a genetic algorithm for the purpose of scheduling tasks to be undertaken by potential design teams. The methodology is applied to two practical case studies provided by engineering industry.The first case study involves the assessment of a multi-disciplined design team consisting of single-skilled engineers. In contrast, the second case study entails the assessment of multiskilled engineers within a multi-disciplined design team. As a result of applying the methodology to the case studies, potential improvement to the design teams are identified and, subsequently, evaluated by observing their effects

Probabilistic Scheduling Based On Hybrid Bayesian Network–Program Evaluation Review Technique,

Project scheduling based on probabilistic methods commonly uses the Program Evaluation Review Technique (PERT). However, practitioners do not widely utilize PERT-based scheduling due to the difficulty in obtaining historical data for similar projects. PERT has several drawbacks, such as the inability to update activity dura- tions in real time. In reality, changes in project conditions related to resources have a highly dynamic nature. The availability of materials, fluctuating labor productiv- ity, and equipment significantly determine the project completion time. This research aims to propose a probabilistic scheduling model based on the Hybrid Bayesian Network-PERT. This model combines PERT with Bayesian Network (BN). BN is used to accommodate real-time changes in resource conditions. The modeling of BN diagrams and variables is obtained through an in-depth literature review, direct field observations, and distributing questionnaires to experts in project scheduling. The model is validated by applying the proposed model to a 60 m concrete bridge construction project in Indonesia. The simulation results of the proposed model are then compared with the case study project to assess the model’s accuracy. The result of the study shows that the proposed hybrid Bayesian-PERT model is accurate and can eliminate the weaknesses of the PERT method. Besides being able to provide an accurate prediction of project completion time (93.4%), this model can also be updated in real-time according to the actual condition of the projec

RESTLESS BANDIT MARGINAL PRODUCTIVITY INDICES II: MULTIPROJECT CASE AND SCHEDULING A MULTICLASS MAKE-TO-ORDER/-STOCK M/G/1 QUEUE

This paper develops a framework based on convex optimization and economic ideas to formulate and solve approximately a rich class of dynamic and stochastic resource allocation problems, fitting in a generic discrete-state multi-project restless bandit problem (RBP). It draws on the single-project framework in the author´s companion paper “Restless bandit marginal productivity indices I: Single-project case and optimal control of a make-to-stock M/G/1 queue”, based on characterization of a project´s marginal productivity index (MPI). Our framework significantly expands the scope of Whittle (1988)´s seminal approach to the RBP. Contributions include: (i) Formulation of a generic multi-project RBP, and algorithmic solution via single-project MPIs of a relaxed problem, giving a lower bound on optimal cost performance; (ii) a heuristic MPI-based hedging point and index policy; (iii) application of the MPI policy and bound to the problem of dynamic scheduling for a multiclass combined MTO/MTS M/G/1 queue with convex backorder and stock holding cost rates, under the LRA criterion; and (iv) results of a computational study on the MPI bound and policy, showing the latter´s near-optimality across the cases investigated.