Simplifying the nonlinear continuous time-cost tradeoff problem

DOI10.1007/S11424-017-5175-ZMaRDI QIDQ1697748zbMATH OpenOpenAlexFDO

Authors Zhi-Xiong Su, Jian-Xun Qi, Han-ying Wei

Publication date 20 February 2018

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11424-017-5175-z

zbMATH Keywords

activity floatsCPM networksoperational researchsimplificationtime-cost tradeoff

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Large-scale systems (93A15) System structure simplification (93B11) Nonlinear systems in control theory (93C10)

Recommendations

• A float-path theory and its application to the time-cost tradeoff problem
• The discrete time-cost tradeoff problem revisited
• scientific article; zbMATH DE number 3993281
• The discrete time/cost trade-off problem: Extensions and heuristic procedures
• A new path-based cutting plane approach for the discrete time-cost tradeoff problem

Cites work

• A bilinear relaxation based algorithm for concave piecewise linear network flow problems
• A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs
• A CPM Time-Cost Computational Algorithm for Arbitrary Activity Cost Functions
• A dwindling filter line search algorithm for nonlinear equality constrained optimization
• A line search filter secant method for nonlinear equality constrained optimization
• A new path-based cutting plane approach for the discrete time-cost tradeoff problem
• A note on time/cost tradeoff curve generation for project scheduling with multi-mode resource availability costs
• An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
• Critical Path Problems with Concave Cost-Time Curves
• 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.
• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)

Cited in

(2)

• A float-path theory and its application to the time-cost tradeoff problem
• Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations

This page was built for publication: Simplifying the nonlinear continuous time-cost tradeoff problem

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