Decision CPM: Network Reduction and Solution

DOI10.1057/JORS.1970.93zbMath0304.90042OpenAlexW4230047073MaRDI QIDQ4060686

Wallace B. Crowston

Publication date: 1970

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/47233

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic network models in operations research (90B10)

Related Items (8)

The discrete time/cost trade-off problem: Extensions and heuristic procedures ⋮ Controlled alternative activity networks for project management ⋮ A graph-based constraint programming approach for the integrated process planning and scheduling problem ⋮ The discrete time-cost tradeoff problem revisited ⋮ A new approach for solving the network problems ⋮ New computational results for the discrete time/cost trade-off problem with time-switch constraints ⋮ A new path-based cutting plane approach for the discrete time-cost tradeoff problem ⋮ Simulated annealing and tabu search for multi-mode project payment scheduling

This page was built for publication: Decision CPM: Network Reduction and Solution