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

DOI10.1080/03155986.1977.11731665zbMATH Open0363.90055OpenAlexW160833953MaRDI QIDQ4138461FDOQ4138461

Authors: 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)

Cited In (9)

• 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
• A new approach based on the surrogating method in the project time compression problems
• The discrete time-cost tradeoff problem revisited
• A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem
• A heuristic procedure for solving the dynamic probabilistic project expediting problem
• Simplifying the nonlinear continuous time-cost tradeoff problem
• Enriched workflow modelling and stochastic branch-and-bound
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4138461)