Activity nets: A guided tour through some recent developments
From MaRDI portal
(Redirected from Publication:1388902)
Recommendations
Cites work
- scientific article; zbMATH DE number 4172725 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3965788 (Why is no real title available?)
- scientific article; zbMATH DE number 3481857 (Why is no real title available?)
- scientific article; zbMATH DE number 3534262 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 3580248 (Why is no real title available?)
- scientific article; zbMATH DE number 3599820 (Why is no real title available?)
- A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987
- A decomposition approach to multi-project scheduling
- A network flow computation for project cost curves
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- Comment construire un graphe PERT minimal
- Complexity of the minimum-dummy-activities problem in a pert network
- Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects
- Critical-Path Planning and Scheduling: Mathematical Basis
- DAGEN: A generator of testsets for project activity nets
- Letter to the Editor—Bibliography on Project Planning and Control by Network Analysis: 1959–1961
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- On a routing problem
- On direction-preserving maps of graphs
- On modelling payments in projects
- On the computational complexity of the minimum-dummy-activities problem in a pert network
- On the measurement of complexity in activity networks
- On the minimum dummy-arc problem
- On the use of the complexity index as a measure of complexity in activity networks
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- Optimal constructions of reversible digraphs
- Optimal project compression with due-dated events
- Project Scheduling with Discounted Cash Flows and Progress Payments
- Project bidding under deterministic and probabilistic activity durations
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Scheduling subject to resource constraints: Classification and complexity
- Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
- The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
- The Recognition of Series Parallel Digraphs
- The scheduling of activities to maximize the net present value of projects
- Unbalanced Highway Contract Tendering
Cited in
(22)- An analysis of network and resource indicators for resource-constrained project scheduling problem instances
- Theory and application of reciprocal transformation of “path problem” and “time float problem”
- A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations
- A priority rule-based heuristic for resource investment project scheduling problem with discounted cash flows and tardiness penalties
- Project network models with discounted cash flows a guided tour through recent developments
- A review of the contribution of operational research to project management
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- An exact algorithm for an integrated project staffing problem with a homogeneous workforce
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Project scheduling and equipment planning with random breakdowns
- Going to the core of hard resource-constrained project scheduling instances
- A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags
- Finding the critical path in an activity network with time-switch constraints
- Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models
- Discrete-continuous project scheduling with discounted cash flows - a tabu search approach
- A float-path theory and its application to the time-cost tradeoff problem
- On the optimal management of project risk
- Gantt charts: A centenary appreciation.
- Integration of equipment planning and project scheduling
- Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results
- Resource-constrained project scheduling: A survey of recent developments.
- Evolutionary algorithms for multi-objective stochastic resource availability cost problem
This page was built for publication: Activity nets: A guided tour through some recent developments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388902)
