A Dynamic Programming Algorithm for Decision CPM Networks
From MaRDI portal
Publication:4180167
DOI10.1287/opre.27.2.225zbMath0396.90097OpenAlexW2165118931MaRDI QIDQ4180167
John F. Muth, Thomas J. Hindelang
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
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Dynamic programming (90C39)
Related Items
Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks, A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling, The discrete time/cost trade-off problem: Extensions and heuristic procedures, A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search, On the discrete time, cost and quality trade-off problem, A multi-objective imperialist competitive algorithm for solving discrete time, cost and quality trade-off problems with mode-identity and resource-constrained situations, Improving electromagnetism algorithm for solving resource allocation problem in stochastic networks, The discrete time-cost tradeoff problem revisited, Enriched workflow modelling and stochastic branch-and-bound, Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement, 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, A heuristic procedure for solving the dynamic probabilistic project expediting problem, Unnamed Item, Project scheduling with irregular costs: complexity, approximability, and algorithms, 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, 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, Resource-constrained project scheduling: Notation, classification, models, and methods, Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version, Simulated annealing and tabu search for multi-mode project payment scheduling
