scientific article
From MaRDI portal
Publication:3859552
zbMath0424.90035MaRDI QIDQ3859552
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
project managementcomputational experienceimplicit enumeration algorithmproject network analysistime/cost tradeoff problem
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)
Related Items (16)
A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling ⋮ The discrete time/cost trade-off problem: Extensions and heuristic procedures ⋮ A float-path theory and its application to the time-cost tradeoff problem ⋮ A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search ⋮ On the discrete time, cost and quality trade-off problem ⋮ The discrete time-cost tradeoff problem revisited ⋮ Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement ⋮ Robust proactive project scheduling model for the stochastic discrete time/cost trade-off problem ⋮ Using a risk-based approach to project scheduling: a case illustration from semiconductor manufacturing ⋮ A heuristic procedure for solving the dynamic probabilistic project expediting problem ⋮ Project scheduling with irregular costs: complexity, approximability, and algorithms ⋮ 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 ⋮ A new path-based cutting plane approach for the discrete time-cost tradeoff problem ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ Simulated annealing and tabu search for multi-mode project payment scheduling
This page was built for publication:
