A Dynamic Programming Algorithm for Decision CPM Networks
From MaRDI portal
Publication:4180167
DOI10.1287/OPRE.27.2.225zbMATH Open0396.90097OpenAlexW2165118931MaRDI QIDQ4180167FDOQ4180167
Authors: Thomas J. Hindelang, John F. Muth 
Publication date: 1979
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.27.2.225
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39)
Cited In (23)
- Project scheduling with irregular costs: complexity, approximability, and algorithms
- Simulated annealing and tabu search for multi-mode project payment scheduling
- A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling
- Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations
- Improving electromagnetism algorithm for solving resource allocation problem in stochastic networks
- Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
- Resource-constrained project scheduling: Notation, classification, models, and methods
- The discrete time-cost tradeoff problem revisited
- A multi-objective imperialist competitive algorithm for solving discrete time, cost and quality trade-off problems with mode-identity and resource-constrained situations
- Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
- A new path-based cutting plane approach for the discrete time-cost tradeoff problem
- Robust proactive project scheduling model for the stochastic discrete time/cost trade-off problem
- Using a risk-based approach to project scheduling: a case illustration from semiconductor manufacturing
- Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
- New computational results for the discrete time/cost trade-off problem with time-switch constraints
- The discrete time/cost trade-off problem: Extensions and heuristic procedures
- On the discrete time, cost and quality trade-off problem
- Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
- A heuristic procedure for solving the dynamic probabilistic project expediting problem
- Enriched workflow modelling and stochastic branch-and-bound
- A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search
- Title not available (Why is that?)
- Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement
This page was built for publication: A Dynamic Programming Algorithm for Decision CPM Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4180167)
