2,025 research outputs found
The Project Scheduling Problem with Non-Deterministic Activities Duration: A Literature Review
Purpose: The goal of this article is to provide an extensive literature review of the models and solution procedures proposed by many researchers interested on the Project Scheduling Problem with nondeterministic activities duration. Design/methodology/approach: This paper presents an exhaustive literature review, identifying the existing models where the activities duration were taken as uncertain or random parameters. In order to get published articles since 1996, was employed the Scopus database. The articles were selected on the basis of reviews of abstracts, methodologies, and conclusions. The results were classified according to following characteristics: year of publication, mathematical representation of the activities duration, solution techniques applied, and type of problem solved. Findings: Genetic Algorithms (GA) was pointed out as the main solution technique employed by researchers, and the Resource-Constrained Project Scheduling Problem (RCPSP) as the most studied type of problem. On the other hand, the application of new solution techniques, and the possibility of incorporating traditional methods into new PSP variants was presented as research trends. Originality/value: This literature review contents not only a descriptive analysis of the published articles but also a statistical information section in order to examine the state of the research activity carried out in relation to the Project Scheduling Problem with non-deterministic activities duration.Peer Reviewe
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;
Selected reliability studies for the NERVA program
An investigation was made into certain methods of reliability analysis that are particularly suitable for complex mechanisms or systems in which there are many interactions. The methods developed were intended to assist in the design of such mechanisms, especially for analysis of failure sensitivity to parameter variations and for estimating reliability where extensive and meaningful life testing is not feasible. The system is modeled by a network of interconnected nodes. Each node is a state or mode of operation, or is an input or output node, and the branches are interactions. The network, with its probabilistic and time-dependent paths is also analyzed for reliability and failure modes by a Monte Carlo, computerized simulation of system performance
Integration of demand management and production planning in a batch process manufacturing system: Case study
Production Planning;Batch Production;production
An investigation of resource-allocation decisions by means of project networks.
This paper investigates the relationship between resource allocation and ES-policies, which are a type of scheduling policies introduced for stochastic scheduling and which can be represented by a directed acyclic graph. We present a formal treatment of resource flows as are presentation of resource-allocation decisions, extending the existing literature. A number of complexity results are established, showing that a number of recently proposed objective functions for evaluating the quality of ES-policies lead to difficult problems. Finally, some reflections are provided on possible effciency enhancements to enumeration algorithms for ES-policies.Complexity; Project scheduling; Resource allocation; Resource constraints;
Definitions and procedures employed in the GERT simulation program
Variables and techniques of computer program for simulating GERT networks on a digital compute
Software development management using metamodels and activity networks
This thesis develops the concept, management and control of metamodels for the
management of software development projects. Metamodels provide a more flexible
approach for managing and controlling the software engineering process and are based
on the integration of several software development paradigms. Generalised Activity
Networks are used to provide the more powerful planning techniques required for
managing metamodels. In this thesis, both new node logics, that clarify previous work
in this field, and Generalised Activity-on-the-Arrow and Generalised Activity-on-the-Node
representations are developed and defined. Activity-on-the-Node representations
reflect the current mood of the project management industry and allow constraints to be
applied directly to logical dependencies between activities. The Generalised Activity
Networks defined within this thesis can be used as tools to manage risks and
uncertainties in both software developments and general engineering projects. They
reflect the variation and uncertainties in projects more realistically and improve the
planning and scheduling of such projects. [Continues.
GERT - Graphical Evaluation and Review Technique
Graphical evaluation and review technique to analyze networks with stochastic and logical propertie
- …