A float-path theory and its application to the time-cost tradeoff problem

DOI10.1155/2015/539374MaRDI QIDQ305477zbMATHOpenAlexWikidataFDO

Authors 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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Publication:3197607
• Simplifying the nonlinear continuous time-cost tradeoff problem
• Publication:3404764
• Finding the critical path in an activity network with time-switch constraints
• Cost/time trade-off analysis for the critical path method: a derivation of the network flow approach

Cites work

• scientific article; zbMATH DE number 4172725 (Why is no real title available?)
• scientific article; zbMATH DE number 3661085 (Why is no real title available?)
• A CPM Time-Cost Computational Algorithm for Arbitrary Activity Cost Functions
• A network flow computation for project cost curves
• A note on time/cost tradeoff curve generation for project scheduling with multi-mode resource availability costs
• Activity nets: A guided tour through some recent developments
• An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs
• Approximation algorithms for the discrete time-cost tradeoff problem
• Comparison of a fuzzy genetic and simulated annealing algorithm approach for project time-cost tradeoff
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• Critical Path Problems with Concave Cost-Time Curves
• Critical-Path Planning and Scheduling: Mathematical Basis
• 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
• Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach
• 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
• Optimum Time Compression in Project Scheduling
• Project scheduling. A research handbook.
• Robust scheduling and robustness measures for the discrete time/cost trade-off problem
• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
• The discrete time-cost tradeoff problem revisited
• The resource constrained project scheduling problem with multiple crashable modes: An exact solution method

Cited in

(4)

• Theory and application of reciprocal transformation of “path problem” and “time float problem”
• Simplifying the nonlinear continuous time-cost tradeoff problem
• scientific article; zbMATH DE number 4172725 (Why is no real title available?)
• A note on activity floats in activity-on-arrow networks

This page was built for publication: A float-path theory and its application to the time-cost tradeoff problem

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