A float-path theory and its application to the time-cost tradeoff problem
From MaRDI portal
Publication:305477
DOI10.1155/2015/539374zbMath1346.90390OpenAlexW1975768844WikidataQ59111875 ScholiaQ59111875MaRDI QIDQ305477
Zhi-xiong Su, Jian-xun Qi, Han-ying Wei
Publication date: 30 August 2016
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/539374
Cites Work
- Unnamed Item
- Unnamed Item
- Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem
- Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
- A note on time/cost tradeoff curve generation for project scheduling with multi-mode resource availability costs
- Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach
- Robust scheduling and robustness measures for the discrete time/cost trade-off problem
- The discrete time-cost tradeoff problem revisited
- Activity nets: A guided tour through some recent developments
- Project scheduling. A research handbook.
- An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs
- 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
- Comparison of a fuzzy genetic and simulated annealing algorithm approach for project time-cost tradeoff
- The resource constrained project scheduling problem with multiple crashable modes: An exact solution method
- Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
- A Network Flow Computation for Project Cost Curves
- Critical-Path Planning and Scheduling: Mathematical Basis
- The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
- A CPM Time-Cost Computational Algorithm for Arbitrary Activity Cost Functions
- Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
- Optimum Time Compression in Project Scheduling
- Critical Path Problems with Concave Cost-Time Curves
This page was built for publication: A float-path theory and its application to the time-cost tradeoff problem
