2,733 research outputs found

    On the optimal resource allocation in projects considering the time value of money

    Get PDF
    The optimal resource allocation in stochastic activity networks had been previously developed by applying three different approaches: Dynamic Programming (DP), an Electromagnetism Algorithm (EMA) and an Evolutionary Algorithm (EVA). This paper presents an extension to the initial problem considering the value of money over time. This extended problem was implemented using the Java programming language, an Object Oriented Language, following the approaches previously used (DP, EMA and EVA).Fundação para a Ciência e a Tecnologia (FCT

    A Proactive Project Progress Management Scheme in the E-Business Environment

    Get PDF
    This paper discusses about a management tool for effective project progress. Considered issue in this paper is a problem to estimate rational duration of each elementary operation for meeting final due completion time of a project. An effective procedure is proposed for this purpose that includes decision tree analysis, Bayes formula and particular iterative probability calculation. Three cases were examined to analyse the characteristics of the proposed procedure and it was clarified that this procedure provide a powerful support function for project planning and progress activities in the era of IT-oriented business environment, where the right timely decisions are critical

    Basic approximations to an adaptive resource allocation technique to stochastic multimodal projects

    Get PDF
    This paper presents three basic approximations developed to solve the Adaptive Stochastic Multimodal Resource Allocation Problem. Two of them are based on the DP model introduced in earlier papers ([23], [24]). The other one uses NLP to solve this problem. The approximations developed consist in considering the Work Content of some or all the activities of the project as represented by their mean values. These approximations were applied to a set of examples, and results were obtained and commented. As expected, running times were reduced, compared to the original model, but the total cost was underestimated, due to the use of means instead of the complete distribution

    Development of a resource allocation technique based on resource-time units

    Get PDF
    M.S.J. Gordon Davi

    Optimization and Allocation in Some Decision Problems with Several Agents or with Stochastic Elements

    Get PDF
    Programa Oficial de Doutoramento en Estatística e Investigación Operativa. 5017V01[Abstract] This dissertation addresses sorne decision problems that arise in project management, cooperative game theory and vehicle route optimization. We start with the problem of allocating the delay costs of a project. In a stochastic context in which we assume that activity durations are random variables, we propose and study an allocation rule based on the Shapley value. In addition, we present an R package that allows a comprehensive control of the project, including the new rule. We propose and characterize new egalitarian solutions in the context of cooperative games with a coalitional structure. Also, using a necessary player property we introduce a new value for cooperative games, which we later extend and characterize within the framework of cooperative games with a coalitional structure. Finally, we present a two-step algorithm for solving multi-compartment vehicle route problems with stochastic demands. This algorithm obtains an initial solution through a constructive heuristic and then uses a tabu search to improve the solution. Using real data, we evaluate the performance of the algorithm.[Resumo] Nesta memoria abórdanse diversos problemas de decisión que xorden na xestión de proxectos, na teoría de xogos cooperativos e na optimización de rutas de vehículos. Empezamos estudando o problema da repartición dos custos de demora nun proxecto. Nun contexto estocástico no que supoñemos que as duracións das actividades son variables aleatorias, propoñemos e estudamos unha regra de repartición baseada no valor de Shapley. Ademais, presentamos un paquete de R que permite un control integral do proxecto, incluíndo a nova regra de repartición. A continuación, propoñemos e caracterizamos axiomaticamente novas solucións igualitarias no contexto dos xogos cooperativos cunha estrutura coalicional. E introducimos un novo valor, utilizando unha propiedade de xogadores necesarios, para xogos cooperativos, que posteriormente estendemos e caracterizamos dentro do marco dos xogos cooperativos cunha estrutura coalicional. Por último, presentamos un algoritmo en dous pasos para resolver problemas de rutas de vehículos con multi-compartimentos e demandas estocásticas. Este algoritmo obtén unha solución inicial mediante unha heurística construtiva e, a continuación, utiliza unha búsqueda tabú para mellorar a solución. Utilizando datos reais, levamos a cabo unha análise do comportamento do algoritmo.[Resumen] En esta memoria se abordan diversos problemas de decisión que surgen en la gestión de proyectos, en la teoría de juegos cooperativos y en la optimización de rutas de vehículos. Empezamos estudiando el problema del reparto de los costes de demora en un proyecto. En un contexto estocástico en el que suponemos que las duraciones de las actividades son variables aleatorias, proponemos y estudiamos una regla de reparto basada en el valor de Shapley. Además, presentamos un paquete de R que permite un control integral del proyecto, incluyendo la nueva regla de reparto. A continuación, proponemos y caracterizamos axiomáticamente nuevas soluciones igualitarias en el contexto de los juegos cooperativos con una estructura coalicional. E introducimos un nuevo valor, utilizando una propiedad de jugadores necesarios, para juegos cooperativos, que posteriormente extendemos y caracterizamos dentro del marco de los juegos cooperativos con una estructura coalicional. Por último, presentamos un algoritmo en dos pasos para resolver problemas de rutas de vehículos con multi-compartimentos y demandas estocásticas. Este algoritmo obtiene una solución inicial mediante una heurística constructiva y, a continuación, utiliza una búsqueda tabú para mejorar la solución. Utilizando datos reales, llevamos a cabo un análisis del comportamiento del algoritmo

    Designing Risk Qualitative Assessment on Fiber Optic Instalation Project in Indonesia

    Get PDF
    A project always has risks that can lead to project failure. In the project, a risk analysis is required to provide an evaluation for the project to proceed as planned. In the event of inadequate planning and ineffective control, it will result in irregularities identified as a risk to the project. This study aims to analyze the qualitative risk on Fiber Optic Installaion project in Sukabumi, West Java, Indonesia. In addition, risk assessment is undertaken on project implementation. Assessment of risk using the impact and probability to measure the impact of risk occurrence. The impacts are more detailed by classified by time impact, cost impact, quality impact, safety and security impact, proximity. The result is there are 36 risk that may occur and mostly risks are associaated by quality and safety&security impact. Keywords—  risk assessment, qualitative analysis, Project, fiber optic

    Taming Numbers and Durations in the Model Checking Integrated Planning System

    Full text link
    The Model Checking Integrated Planning System (MIPS) is a temporal least commitment heuristic search planner based on a flexible object-oriented workbench architecture. Its design clearly separates explicit and symbolic directed exploration algorithms from the set of on-line and off-line computed estimates and associated data structures. MIPS has shown distinguished performance in the last two international planning competitions. In the last event the description language was extended from pure propositional planning to include numerical state variables, action durations, and plan quality objective functions. Plans were no longer sequences of actions but time-stamped schedules. As a participant of the fully automated track of the competition, MIPS has proven to be a general system; in each track and every benchmark domain it efficiently computed plans of remarkable quality. This article introduces and analyzes the most important algorithmic novelties that were necessary to tackle the new layers of expressiveness in the benchmark problems and to achieve a high level of performance. The extensions include critical path analysis of sequentially generated plans to generate corresponding optimal parallel plans. The linear time algorithm to compute the parallel plan bypasses known NP hardness results for partial ordering by scheduling plans with respect to the set of actions and the imposed precedence relations. The efficiency of this algorithm also allows us to improve the exploration guidance: for each encountered planning state the corresponding approximate sequential plan is scheduled. One major strength of MIPS is its static analysis phase that grounds and simplifies parameterized predicates, functions and operators, that infers knowledge to minimize the state description length, and that detects domain object symmetries. The latter aspect is analyzed in detail. MIPS has been developed to serve as a complete and optimal state space planner, with admissible estimates, exploration engines and branching cuts. In the competition version, however, certain performance compromises had to be made, including floating point arithmetic, weighted heuristic search exploration according to an inadmissible estimate and parameterized optimization

    Examining user acceptance and effectiveness of critical chain project management : a longitudinal case study

    Get PDF
    Bibliography: leaves 84-90

    A Decision Support System for Dynamic Integrated Project Scheduling and Equipment Operation Planning

    Get PDF
    Common practice in scheduling under limited resource availability is to first schedule activities with the assumption of unlimited resources, and then assign required resources to activities until available resources are exhausted. The process of matching a feasible resource plan with a feasible schedule is called resource allocation. Then, to avoid sharp fluctuations in the resource profile, further adjustments are applied to both schedule and resource allocation plan within the limits of feasibility constraints. This process is referred to as resource leveling in the literature. Combination of these three stages constitutes the standard approach of top-down scheduling. In contrast, when scarce and/or expensive resource is to be scheduled, first a feasible and economical resource usage plan is established and then activities are scheduled accordingly. This practice is referred to as bottom-up scheduling in the literature. Several algorithms are developed and implemented in various commercial scheduling software packages to schedule based on either of these approaches. However, in reality resource loaded scheduling problems are somewhere in between these two ends of the spectrum. Additionally, application of either of these conventional approaches results in just a feasible resource loaded schedule which is not necessarily the cost optimal solution. In order to find the cost optimal solution, activity scheduling and resource allocation problems should be considered jointly. In other words, these two individual problems should be formulated and solved as an integrated optimization problem. In this research, a novel integrated optimization model is proposed for solving the resource loaded scheduling problems with concentration on construction heavy equipment being the targeted resource type. Assumptions regarding this particular type of resource along with other practical assumptions are provided for the model through inputs and constraints. The objective function is to minimize the fraction of the execution cost of resource loaded schedule which varies based on the selected solution and thus, considered to be the model's decision making criterion. This fraction of cost which hereafter is referred to as operation cost, encompasses four components namely schedule delay cost, shipping, rental and ownership costs for equipment
    corecore