Activity nets: A guided tour through some recent developments
From MaRDI portal
Publication:1388902
DOI10.1016/0377-2217(94)00184-EzbMath0910.90175MaRDI QIDQ1388902
Publication date: 11 June 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (21)
An exact algorithm for an integrated project staffing problem with a homogeneous workforce ⋮ A float-path theory and its application to the time-cost tradeoff problem ⋮ Integration of equipment planning and project scheduling ⋮ Evolutionary algorithms for multi-objective stochastic resource availability cost problem ⋮ Going to the core of hard resource-constrained project scheduling instances ⋮ Project scheduling and equipment planning with random breakdowns ⋮ An analysis of network and resource indicators for resource-constrained project scheduling problem instances ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Resource-constrained project scheduling: A survey of recent developments. ⋮ Theory and application of reciprocal transformation of “path problem” and “time float problem” ⋮ A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags ⋮ Discrete-continuous project scheduling with discounted cash flows - a tabu search approach ⋮ Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models ⋮ A review of the contribution of operational research to project management ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results ⋮ A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations ⋮ Project network models with discounted cash flows a guided tour through recent developments ⋮ A priority rule-based heuristic for resource investment project scheduling problem with discounted cash flows and tardiness penalties ⋮ Finding the critical path in an activity network with time-switch constraints ⋮ On the optimal management of project risk
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Project bidding under deterministic and probabilistic activity durations
- The scheduling of activities to maximize the net present value of projects
- Optimal constructions of reversible digraphs
- A decomposition approach to multi-project scheduling
- Scheduling subject to resource constraints: Classification and complexity
- On the measurement of complexity in activity networks
- Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects
- DAGEN: A generator of testsets for project activity nets
- On the use of the complexity index as a measure of complexity in activity networks
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- A Network Flow Computation for Project Cost Curves
- Complexity of the minimum-dummy-activities problem in a pert network
- On a routing problem
- Critical-Path Planning and Scheduling: Mathematical Basis
- Letter to the Editor—Bibliography on Project Planning and Control by Network Analysis: 1959–1961
- On the computational complexity of the minimum-dummy-activities problem in a pert network
- A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Comment construire un graphe PERT minimal
- The Recognition of Series Parallel Digraphs
- The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
- Optimal project compression with due-dated events
- On the minimum dummy-arc problem
- On modelling payments in projects
- A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem
- Unbalanced Highway Contract Tendering
- On direction-preserving maps of graphs
- Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- Project Scheduling with Discounted Cash Flows and Progress Payments
This page was built for publication: Activity nets: A guided tour through some recent developments
