A CPM Time-Cost Computational Algorithm for Arbitrary Activity Cost Functions

DOI10.1080/03155986.1977.11731665zbMath0363.90055OpenAlexW160833953MaRDI QIDQ4138461

D. Panagiotakopoulos

Publication date: 1977

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1977.11731665

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Production models (90B30)

Related Items (9)

A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem ⋮ A float-path theory and its application to the time-cost tradeoff problem ⋮ Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach ⋮ The discrete time-cost tradeoff problem revisited ⋮ Simplifying the nonlinear continuous time-cost tradeoff problem ⋮ Enriched workflow modelling and stochastic branch-and-bound ⋮ A heuristic procedure for solving the dynamic probabilistic project expediting problem ⋮ Unnamed Item ⋮ A new approach based on the surrogating method in the project time compression problems

This page was built for publication: A CPM Time-Cost Computational Algorithm for Arbitrary Activity Cost Functions